1
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:
2
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
3
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
Consider the following three claims
I. (n + k)m = $$\Theta \,({n^m})$$ where k and m are constants
II. 2n+1 = O(2n)
III. 22n = O(22n)
Which of those claims are correct?
I. (n + k)m = $$\Theta \,({n^m})$$ where k and m are constants
II. 2n+1 = O(2n)
III. 22n = O(22n)
Which of those claims are correct?
4
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
Questions Asked from Complexity Analysis and Asymptotic Notations (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (1)
GATE CSE 2023 (1)
GATE CSE 2022 (1)
GATE CSE 2020 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2013 (3)
GATE CSE 2012 (2)
GATE CSE 2010 (1)
GATE CSE 2007 (1)
GATE CSE 2006 (1)
GATE CSE 2005 (1)
GATE CSE 2003 (2)
GATE CSE 2002 (1)
GATE CSE 2001 (1)
GATE CSE 1999 (1)
GATE CSE 1997 (1)
GATE CSE 1996 (1)
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