The worst case running time to search for an element in a balanced in a binary search tree with n2^n elements is (A) (B) (C)… Read More
Tag Archives: GATE-GATE CS 2012
Assuming P != NP, which of the following is true ? (A) NP-complete = NP (B) NP-complete P = (C) NP-hard = NP (D) P =… Read More
What will be the output of the following C program segment? char inchar = 'A'; switch (inchar) { case 'A' : printf ("choice A \n")… Read More
Which of the following is TRUE? (A) Every relation in 3NF is also in BCNF (B) A relation R is in 3NF if every non-prime attribute… Read More
Consider the following logical inferences. I1: If it rains then the cricket match will not be played. The cricket match was played. Inference: There was… Read More
