4 votes
761
1, 10, 33, 76, _____?
30 votes
762
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is:QueueStackHeapB-Tree
2 votes
768
A police man fires four bullet on a dacoit . The probability that dacoit will be killed by one bullet is 0.6 .what is prob that dacoit is still alive ?
0 votes
773
In each activation of a procedure , the local variables names in that procedure is bound to - storage location ?1) Diff2) same3) None
1 votes
774
0 votes
775
The bus which is used to transfer data from main memory to peripheral device isa) data busb) input busc) DMA busd) output bus
0 votes
776
#include<stdio.h #include<stdlib.h int main() { struct xx { int x; char s; }; struct xx *t; t->x=5; t->s='a'; printf("%d %c\n", t->x, t->s); }
12 votes
779
a relation R(A,B,C,D,E,F,G,H)and set of functional dependencies are {CH->G,A->BC,B->CFH,E->A,F->EG }then how many possible super keys are present ?
7 votes
780
0 votes
783
int main(){ int a; a = 1; while(a >= 1) while(a >= 0); printf("%d", a); }
0 votes
785
2n^2 +nlogn =theta(n^2) ,I have done the lower bound..Like finding out the n0 and the constant.. Help me with the upper bound constant and n0
1 votes
786
time complexity for merging m sorted lists, each with n/m elements
0 votes
787
Till now i have not got any exciting and detailed explanation of page tables and multi level page tables concept. if you have any resource on this please post the link .....
0 votes
788