On This Page

This set of Data Structure DS Multiple Choice Questions & Answers (MCQs) focuses on Data Structure Set 3

Q1 | The disadvantage in using a circular linked list is …………………….
  • it is possible to get into infinite loop.
  • last node points to first node.
  • time consuming
  • requires more memory space
Q2 | A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
  • singly linked list
  • circular linked list
  • doubly linked list
  • linear linked list
Q3 | A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
  • circular queue
  • random of queue
  • priority
  • dequeue
Q4 | In a priority queue, insertion and deletion takes place at ………………
  • front, rear end
  • only at rear end
  • only at front end
  • any position
Q5 | The time complexity of quick sort is …………..
  • o(n)
  • o(n2)
  • o(n log n)
  • o(log n)
Q6 | Which of the following is an application of stack?
  • finding factorial
  • tower of hanoi
  • infix to postfix conversion
  • all of the above
Q7 | The data structure which is one ended is ………………
  • queue
  • stack
  • tree
  • graph
Q8 | A list which displays the relationship of adjacency between elements is said to be
  • linear
  • non linear
  • linked list
  • trees
Q9 | ……………….. level is where the model becomes compatible executable code
  • abstract level
  • application level
  • implementation level
  • all of the above
Q10 | Which of the following data structure is not linear data structure?
  • arrays
  • linked lists
  • both of the above
  • none of the above
Q11 | 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.
  • push, pop
  • pop, push
  • insert, delete
  • delete, insert
Q12 | Each array declaration need not give, implicitly or explicitly, the information about
  • the name of array
  • the data type of array
  • the first data from the set to be stored
  • the index set of the array
Q13 | The elements of an array are stored successively in memory cells because
  • by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
  • the architecture of computer memory does not allow arrays to store other than serially
  • both of above
  • none of above
Q14 | Linked lists are best suited
  • for relatively permanent collections of data
  • for the size of the structure and the data in the structure are constantly changing
  • for both of above situation
  • for none of above situation
Q15 | Finding the location of the element with a given value is:
  • traversal
  • search
  • sort
  • none of above
Q16 | The operation of processing each element in the list is known as
  • sorting
  • merging
  • inserting
  • traversal
Q17 | Arrays are best data structures
  • for relatively permanent collections of data
  • for the size of the structure and the data in the structure are constantly changing
  • for both of above situation
  • for none of above situatio
Q18 | 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.
  • i-only
  • ii-only
  • both i and ii
  • none of the above
Q19 | What will be the value of top, if there is a size of stack STACK_SIZE is 5
  • 5
  • 6
  • 4
  • none of the above
Q20 | ………… is not the operation that can be performed on queue.
  • insertion
  • deletion
  • retrieval
  • traversal
Q21 | A data structure where elements can be added or removed at either end but not in the middle is called …
  • linked lists
  • stacks
  • queue
  • dequeue
Q22 | Which of the following name does not relate to stacks?
  • fifo lists
  • lifo list
  • piles
  • push-down lists
Q23 | The term "push" and "pop" is related to the
  • array
  • lists
  • stacks
  • all of the above
Q24 | Which data structure allows deleting data elements from front and inserting at rear?
  • stacks
  • queue
  • dequeue
  • binary search tree
Q25 | node.next -> node.next.next; will make
  • node.next inaccessible
  • node.next.next inaccessible
  • this node inaccessible
  • none of the above