GATE CSE 1996 | GATE CSE Year Wise Previous Years Questions

GATE CSE 1996

MCQ (Single Correct Answer)

-0.3

Consider the following statements:
(i) First-in-first out types of computations are efficiently supported by STACKS.
(ii) Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations.
(iii) Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices.
(iv) Last-in-first-out type of computations are efficiently supported by QUEUES.

(ii) and (iii) are true

(i) and (ii) are true

(iii) and (iv) are true

(ii) and (iv) are true

GATE CSE 1996

MCQ (Single Correct Answer)

-0.3

In the balanced binary tree in Fig. given below, how many nodes will become unbalanced when a node is inserted as a child of the node “g”? GATE CSE 1996 Data Structures - Trees Question 89 English

GATE CSE 1996

MCQ (Single Correct Answer)

-0.3

An advantage of chained hash table (external hashing) over the open addressing scheme is

Worst case complexity of search operations is less

Space used is less

Deletion is easier

None of the above

GATE CSE 1996

MCQ (More than One Correct Answer)

-0

A binary search tree is used to locate the number 43. Which of the following probe sequences are not possible?

61 52 14 17 40 43

2 3 50 40 60 43

10 65 31 48 37 43

17 77 27 66 18 43

PREVIOUS NEXT

GATE CSE Papers

All year-wise previous year question papers

2026