1
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
Consider the following segment of C-code:
int j, n;
j=1;
while(j <= n)
j = j * 2;
The number of comparisons made in the execution of the loop for any n > 0 is:2
GATE CSE 2006
MCQ (Single Correct Answer)
+1
-0.3
Consider the following C-program fragment in which i, j and n are integer variables.
for (i = n, j = 0; i > 0; i /= 2, j += i);
let val (j) denote the value stored in the variable j after termination of the for loop. Which one of the following is true?
for (i = n, j = 0; i > 0; i /= 2, j += i);
let val (j) denote the value stored in the variable j after termination of the for loop. Which one of the following is true?
3
GATE CSE 2005
MCQ (Single Correct Answer)
+1
-0.3
The time complexity of computing the transitive closure of a binary relation on a set of elements is known to be:
4
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
Consider an array multiplier for multiplying two n bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is
Questions Asked from Complexity Analysis and Asymptotic Notations (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages