Answer:
#include <iostream>
using namespace std;
void swap(int *a,int *b){ //function to interchange values of 2 variables
int temp=*a;
*a=*b;
*b=temp;
}
void sort(int queue[],int n)
{
int i,j;
for(i=0;i<n;i++) //to implement bubble sort
{
for(j=0;j<n-i-1;j++)
{
if(queue[j]>queue[j+1])
swap(queue[j],queue[j+1]); //to swap values of these 2 variables
}
}
}
int main()
{
int queue[]={6,4,2,9,5,1};
int n=sizeof(queue)/4; //to find length of array
sort(queue,n);
for(int i=0;i<n;i++)
cout<<queue[i]<<" ";
return 0;
}
OUTPUT :
1 2 4 5 6 9
Explanation:
In the above code, Queue is implemented using an array and then passed to a function sort, so that the queue can be sorted in ascending order. In the sort function, in each pass 2 adjacent values are compared and if lower index value is greater than the higher one they are swapped using a swap function that is created to interchange the values of 2 variables.
Answer:
C. Unclustered index has the same ordering of data records as that of the data entries in the database
Explanation:
Indexes are used to split up queries in an SQL server or database management system DBMS.
There are two types of indexes namely clustered indexed and unclustered indexes.
Clustered indexes define the order in which data is stored in a table while unclustered index does not sort the order in a table.
In an unclustered index, the data table and the index are stored in different places, they are easy to maintain and update since they do not follow a particular order and there can be several indexes in a data file since the data table is stored differently from the index file.
So, all the other options except C are features of unclustered indexes since unclustered index does not have the same ordering of data records as that of the data entries in the database.
So, C is the answer.
C, building design. Its the only visual one, the rest have to do with speaking/listening.