# Data Structure (DS) Solved MCQs

51.

A. it is possible to get into infinite loop.
B. last node points to first node.
C. time consuming
D. requires more memory space
Answer» A. it is possible to get into infinite loop.
52.

53.

## A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.

A. circular queue
B. random of queue
C. priority
D. dequeue
54.

## In a priority queue, insertion and deletion takes place at ………………

A. front, rear end
B. only at rear end
C. only at front end
D. any position
55.

A. o(n)
B. o(n2)
C. o(n log n)
D. o(log n)
56.

## Which of the following is an application of stack?

A. finding factorial
B. tower of hanoi
C. infix to postfix conversion
D. all of the above
57.

A. queue
B. stack
C. tree
D. graph
58.

A. linear
B. non linear
D. trees
59.

## ……………….. level is where the model becomes compatible executable code

A. abstract level
B. application level
C. implementation level
D. all of the above
60.

## Which of the following data structure is not linear data structure?

A. arrays
C. both of the above
D. none of the above
Answer» D. none of the above
61.

## Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.

A. push, pop
B. pop, push
C. insert, delete
D. delete, insert
62.

## Each array declaration need not give, implicitly or explicitly, the information about

A. the name of array
B. the data type of array
C. the first data from the set to be stored
D. the index set of the array
Answer» C. the first data from the set to be stored
63.

## The elements of an array are stored successively in memory cells because

A. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
B. the architecture of computer memory does not allow arrays to store other than serially
C. both of above
D. none of above
Answer» A. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
64.

## Linked lists are best suited

A. for relatively permanent collections of data
B. for the size of the structure and the data in the structure are constantly changing
C. for both of above situation
D. for none of above situation
Answer» B. for the size of the structure and the data in the structure are constantly changing
65.

A. traversal
B. search
C. sort
D. none of above
66.

A. sorting
B. merging
C. inserting
D. traversal
67.

## Arrays are best data structures

A. for relatively permanent collections of data
B. for the size of the structure and the data in the structure are constantly changing
C. for both of above situation
D. for none of above situatio
Answer» A. for relatively permanent collections of data
68.

## Which of the following statement is true?i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

A. i-only
B. ii-only
C. both i and ii
D. none of the above
Answer» C. both i and ii
69.

## What will be the value of top, if there is a size of stack STACK_SIZE is 5

A. 5
B. 6
C. 4
D. none of the above
70.

A. insertion
B. deletion
C. retrieval
D. traversal
71.

B. stacks
C. queue
D. dequeue
72.

## Which of the following name does not relate to stacks?

A. fifo lists
B. lifo list
C. piles
D. push-down lists
73.

## The term "push" and "pop" is related to the

A. array
B. lists
C. stacks
D. all of the above
74.

## Which data structure allows deleting data elements from front and inserting at rear?

A. stacks
B. queue
C. dequeue
D. binary search tree
75.

## node.next -> node.next.next; will make

A. node.next inaccessible
B. node.next.next inaccessible
C. this node inaccessible
D. none of the above