1

GATE CSE 2013

MCQ (Single Correct Answer)

+1

-0.3

Which of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?

2

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?

3

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?

4

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 isQuestions Asked from Complexity Analysis and Asymptotic Notations (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

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