GATE CSE 2003 | Complexity Analysis and Asymptotic Notations Question 49 | Algorithms

Algorithms

Complexity Analysis and Asymptotic Notations

Marks 1 Marks 2

Searching and Sorting

Marks 1 Marks 2

Divide and Conquer Method

Greedy Method

P and NP Concepts

Dynamic Programming

GATE CSE 2003

MCQ (Single Correct Answer)

-0.3

Consider an array multiplier for multiplying two n bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is

$$\Theta \,(1)$$

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

$$\Theta \,(n)$$

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

GATE CSE 2002

MCQ (Single Correct Answer)

-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

log n

n/2

Log₂ n - 1

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

Let f(n) = n² log n and g(n) = n(log n)¹⁰ be two positive functions of n. Which of the following statements is correct?

f(n) = O(g(n)) and g(n) ≠ O(f(n))

g(n) = O(f(n)) and f(n) ≠ O(g(n))

f(n) ≠ O(g(n)) and g(n) ≠ O(f(n))

f(n) = O(g(n)) and g(n) = O(f(n))

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

The maximum gate delay for any output to appear in an array multiplier for multiplying two n bit number is

O (n²)

O (n)

O (log n)

O (1)

Previous Next

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Digital Logic

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages

Computer Organization