GATE CSE 2001 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort?

O(n)

O(n Log n)

O(n²)

O(n!)

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

The process of assigning load addresses to the various parts of the program and adjusting the code and date in the program to reflect the assigned addresses is called

Assembly

Parsing

Relocation

Symbol resolution

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

Which of the following statements is false?

An unambiguous grammar has same leftmost and rightmost derivation

An LL(1) parser is a top-down parser

LALR is more powerful than SLR

An ambiguous grammar can never be LR(k) for any k

GATE CSE 2001

MCQ (Single Correct Answer)

-0.3

More than one word are put in one cache block to

Exploit the temporal locality of reference in a program

Exploit the spatial locality of reference in a program

Reduce the miss penalty

None of the above

PREVIOUS NEXT

GATE CSE Papers

All year-wise previous year question papers

2026