GATE CSE 2013 | Complexity Analysis and Asymptotic Notations Question 12 | Algorithms

GATE CSE 2013

MCQ (Single Correct Answer)

-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?

O(log n)

O(n)

O(n log n)

O(n²)

GATE CSE 2013

MCQ (Single Correct Answer)

-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?

O(1)

O(log n)

O(n)

O(n log n)

GATE CSE 2013

MCQ (Single Correct Answer)

-0.3

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

$$\Theta ({n^2})$$

$$\Theta ({n^2}\log n)$$

$$\Theta ({n^3})$$

$$\Theta ({n^3}\log n)$$

GATE CSE 2012

MCQ (Single Correct Answer)

-0.3

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

$$\Theta (n\,\log \,n)$$

$$\Theta (n{2^n})$$

$$\Theta (n)$$

$$\Theta (\log \,n)$$

PREVIOUS NEXT

GATE CSE Subjects

Discrete Mathematics

Graph Theory Set Theory & Algebra Combinatorics Mathematical Logic Probability Linear Algebra Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Theory of Computation

Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine Undecidability

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency Deadlocks Memory Management File System IO and Protection

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Computer Organization

Computer Arithmetic Memory Interfacing Machine Instructions and Addressing Modes IO Interface Pipelining Alu Data Path and Control Unit Secondary Memory

Database Management System

Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

Concepts of Layering Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method Dynamic Programming P and NP Concepts

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Software Engineering

Web Technologies

General Aptitude

Verbal Ability Numerical Ability