MCQ of Data Structure and Algorithm with Answer set-5
1. 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 A Linked List data structure that starts with a head reference to the first node, and each node contains a 'next' field that points to the next node. The final node has a 'next' value of null. (Photo credit: Wikipedia ) D) for none of above situation 2. Which of the following data structure is not linear data structure? A) Arrays B) Linked lists C) Both of the above D) None of the above 3. The disadvantage in using a circular linked list is ......................... A) It is possible to get into infinite loop. B) Last node points to first node. C) Time consuming D) Requires more memory space 4. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as .. A) Singly Linked List B) Circular Linked List C) Doubly Linked List D...