ExamSIDE
Questions (Powered by ExamGOAL)
Algorithms
Complexity Analysis and Asymptotic Notations
Marks 1Marks 2
Searching and Sorting
Marks 1Marks 2
Divide and Conquer Method
Marks 1Marks 2
Greedy Method
Marks 1Marks 2
P and NP Concepts
Marks 1Marks 2
Dynamic Programming
Marks 1Marks 2
Previous
1
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
The maximum gate delay for any output to appear in an array multiplier for multiplying two n bit number is
A
O (n2)
B
O (n)
C
O (log n)
D
O (1)
2
GATE CSE 1997
MCQ (Single Correct Answer)
+1
-0.3
The concatenation of two lists is to be performed on 0(1) time. Which of the following implementations of a list should be used?
A
Singly linked list
B
Doubly linked list
C
Circular doubly linked list
D
Array implementation of list
3
GATE CSE 1996
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is false?
A
$$100\,n\,\log n = O\left( {{{n\,\log \,n} \over {100}}} \right)$$
B
$$\sqrt {\log \,n} = O(\log \,\log \,n)$$
C
if 0 < x < y then n x = O(ny)
D
$${2^n} \ne O({n^k})$$
Previous
Questions Asked from Marks 1
GATE CSE 2025 Set 2 (1) GATE CSE 2025 Set 1 (1) GATE CSE 2024 Set 2 (1) GATE CSE 2024 Set 1 (1) GATE CSE 2023 (1) GATE CSE 2022 (1) GATE CSE 2021 Set 1 (1) GATE CSE 2020 (1) GATE CSE 2017 Set 1 (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
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization