1

GATE CSE 2013

MCQ (Single Correct Answer)

+1

-0.3

Which one of the following is the tightest upper bound that represents the time complexity of inserting an object in to a binary search tree of n nodes?

2

GATE CSE 2013

MCQ (Single Correct Answer)

+1

-0.3

What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?

3

GATE CSE 2012

MCQ (Single Correct Answer)

+1

-0.3

The worst case running time to search for an element in a balanced binary search tree with n2

^{n}elements is4

GATE CSE 2012

MCQ (Single Correct Answer)

+1

-0.3

Let W(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. Which of the following is ALWAYS TRUE?

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 2022 (2)
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

Discrete Mathematics

Programming Languages

Theory of Computation

Operating Systems

Computer Organization

Database Management System

Data Structures

Computer Networks

Algorithms

Compiler Design

Software Engineering

Web Technologies

General Aptitude