Answer:
There are two customers in the PostalCode.
SQL statement for select all the fields and the rows from the Customers table where PostalCode is 44000.
SELECT * FROM Customers WHERE PostalCode = "44000";
Explanation:
The SELECT statement retrieve zero or more than one row from 1 or more than one the database tables or the database views.
In most of the applications, the SELECT query is most commonly used for DQL(Data Query Language) command.
SQL is the declarative programming language and the SELECT statement specifies the result set, but they do not specifies how to calculate it.
Answer:
processing
Explanation:
The flow chart is a diagram that shows the activity of the program, peoples or things.
Flowchart symbol and meaning in the options:
1. Processing: it is a rectangular shape block which is used for variable declaration or assignment.
2. I/0: it is a parallelogram in shape which is used for input or output.
3. Parallelogram: it is used for input or output.
4. diamond: it is used for decisions or conditions.
Therefore, the correct option is a. Processing is the one that is used for the assignment statement.
Answer:
#include <iostream>
#include <cstdlib>
using namespace std;
int main() {
int[] array = new int[10];
int index = 0;
while(index < array.size()){
int number = (rand() % 100) + 1;
for (int i = 0; i < 1; i++) {
array[index] = number;
cout<< "Position "<< index << "of the array = "<< number << endl;
++index;
}
}
}
Explanation:
The while loop in the source code loops over a set of code ten times, The for loop only loops once to add the generated random number between 1 and 100 to the array of size 10. At the end of the for loop, the index location and the item of the array is printed out on the screen. The random number is generated from the 'rand()' function of the C++ standard library.
Answer:
see explaination
Explanation:
void insertion( int e,int *x, int start, int end)
{
if (e >= x[end])
x[end+1] = e;
else if (start < end)
{
x[end+1] = x[end];
insertion(e, x, start, end-1);
}
else
{
x[end+1] = x[end];
x[end] = e;
}
}
void insertion_recurssion(int *b, int start, int end)
{
if(start < end)
{
insertion_sort_recur(b, start, end-1);
insertion(b[end], b, start, end-1);
}
}
void main()
{
insertion_recurssion(x,0,5);
}
