Linked list is considered as an example of ___________ type of memory allocation. Data Structure
Answer: Dynamic
MCQ - Linked List in Data Structure11. Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Show i) Insertion at the front of the linked list View Answer Ans : B Explanation: None. 12. In linked list each node contain minimum of two fields. One field is data field to store the data second field is? A. Pointer to character View Answer Ans : C Explanation: None. 13. What would be the asymptotic time complexity to find an element in the linked list? A. O(1) View Answer Ans : B Explanation: None. 14. The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used? A. Singly linked list View Answer Ans : C Explanation: None. 15. Consider the following definition in c programming language.Which of the following c code is used to create new node? struct node { int data; struct node * next; } typedef struct node NODE; NODE *ptr;A. ptr = (NODE*)malloc(sizeof(NODE)); View Answer Ans :A Explanation: As it represents the right way to create a node. 16. What kind of linked list is best to answer question like "What is the item at position n"? A. Singly linked list View Answer Ans : D Explanation: None. 17. Linked lists are not suitable to for the implementation of? A. Insertion sort View Answer Ans : D Explanation: It cannot be implemented using linked lists. 18. Linked list is considered as an example of ___________ type of memory allocation. A. Dynamic View Answer Ans : A Explanation: As memory is allocated at the run time. 19. In Linked List implementation, a node carries information regarding A. Data View Answer Ans : B Explanation: None. 20. Linked list data structure offers considerable saving in A. Computational Time View Answer Ans : C Explanation: Linked lists saves both space and time. « Prev Next » Also check :
Discussion * You must be logged in to add comment. Linked List MCQ : General Questions (Multiple Choice Questions)admin2013-05-30T04:24:38+00:00 |