1

GATE CSE 2003

MCQ (Single Correct Answer)

+1

-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

2

GATE CSE 2003

MCQ (Single Correct Answer)

+1

-0.3

Consider the following three claims

I. (n + k)

II. 2

III. 2

Which of those claims are correct?

I. (n + k)

^{m}= $$\Theta \,({n^m})$$ where k and m are constantsII. 2

^{n+1}= O(2^{n})III. 2

^{2n}= O(2^{2n})Which of those claims are correct?

3

GATE CSE 2002

MCQ (Single Correct Answer)

+1

-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

4

GATE CSE 2001

MCQ (Single Correct Answer)

+1

-0.3

Let f(n) = n

^{2}log n and g(n) = n(log n)^{10}be two positive functions of n. Which of the following statements is correct?Questions Asked from Complexity Analysis and Asymptotic Notations (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages