NEW
New Website Launch
Experience the best way to solve previous year questions with mock tests (very detailed analysis), bookmark your favourite questions, practice etc...
1

### GATE CSE 2002

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
A
log n
B
n/2
C
Log2 n - 1
D
n
2

### GATE CSE 2001

Let f(n) = n2 log n and g(n) = n(log n)10 be two positive functions of n. Which of the following statements is correct?
A
f(n) = O(g(n)) and g(n) ≠ O(f(n))
B
g(n) = O(f(n)) and f(n) ≠ O(g(n))
C
f(n) ≠ O(g(n)) and g(n) ≠ O(f(n))
D
f(n) = O(g(n)) and g(n) = O(f(n))
3

### GATE CSE 1999

The maximum gate delay for any output to appear in an array multiplier for multiplying two n bit number is
A
O (n2)
B
O (n)
C
O (log n)
D
O (1)
4

### GATE CSE 1997

The concatenation of two lists is to be performed on 0(1) time. Which of the following implementations of a list should be used?
A
B
C
D
Array implementation of list

## Explanation

For Circular Doubly linked list there will be no traversal for concatenation.

Except for circular linked lists for all other lists we need to reach till end to attach the second list.
Write for Us

Do you want to write for us? Help us by contributing to our platform.

### Joint Entrance Examination

JEE Main JEE Advanced WB JEE

### Graduate Aptitude Test in Engineering

GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN

NEET

Class 12