1

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

2

GATE CSE 2001

MCQ (Single Correct Answer)

+1

-0.3

Let f(n) = n

^{2}log n and g(n) = n(log n)^{10}be two positive functions of n. Which of the following statements is correct?3

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

4

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?

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