GATE CSE 2012 | Complexity Analysis and Asymptotic Notations Question 22 | Algorithms

PREVIOUS NEXT

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)$$

GATE CSE 2012

MCQ (Single Correct Answer)

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

$$A(n) = \Omega (W(n))$$

$$A(n) = \Theta (W(n))$$

$$A(n) = O (W(n))$$

$$A(n) = 0 (W(n))$$

GATE CSE 2010

MCQ (Single Correct Answer)

-0.3

Two alternate packages A and B are available for processing a database having 10^k records. Package A requires 0.0001n² time units and package B requires $$10n.\log _{10}^n$$ time units to process n records. What is the smallest value of k for which package B will be preferred over A?

GATE CSE 2007

MCQ (Single Correct Answer)

-0.3

Consider the following segment of C-code:

int j, n;
j=1;
while(j <= n)
 j = j * 2;

The number of comparisons made in the execution of the loop for any n > 0 is:

$$\left\lceil {{{\log }_2}n} \right\rceil + 1$$

$$\left\lceil {{{\log }_2}n} \right\rceil $$

$$\left\lfloor {{{\log }_2}n} \right\rfloor + 1$$

PREVIOUS NEXT

GATE CSE Subjects

Theory of Computation

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

Operating Systems

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

Algorithms

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

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Database Management System

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

Data Structures

Trees Hashing Arrays Linked List Graphs Stacks and Queues

Computer Networks

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

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

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

Computer Organization

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