Top 150+ Solved Data Structure (DS) MCQ Questions Answer
Q. 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
Q. 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
Q. 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
Q. 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
Q. Finding the location of the element with a given value is:
a. traversal
b. search
c. sort
d. none of above
Q. The operation of processing each element in the list is known as
a. sorting
b. merging
c. inserting
d. traversal
Q. 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
Q. 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
Q. 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
Q. ………… is not the operation that can be performed on queue.
a. insertion
b. deletion
c. retrieval
d. traversal
Q. A data structure where elements can be added or removed at either end but not in the middle is called …
a. linked lists
b. stacks
c. queue
d. dequeue
Q. Which of the following name does not relate to stacks?
a. fifo lists
b. lifo list
c. piles
d. push-down lists
Q. Which data structure allows deleting data elements from front and inserting at rear?
a. stacks
b. queue
c. dequeue
d. binary search tree
Q. 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