51. Linked list is generally considered as an example of _________ type of memory allocation. a. Static b. Dynamic c. Compile Time d. None of these

 52. Each Node contain minimum two fields one field called data field to store data. Another field is of type _________. a. Pointer to Class b. Pointer to an Integer c. Pointer to Character d. Pointer to Node

 53. Consider the Singly linked list having n elements. What will be the time taken to add an node at the end of linked list if Pointer is initially pointing to first node of the list. a. O(1) b. O(n-1) c. O(n) d. O(n^2)

 54. Pointer is pointing to the first element of the Node then time require to Insert Element to second position is __________. a. O(n) b. O(1) c. O(n^2) d. O(n-1)

 55. Consider a linked list of n elements. What is the time taken to insert an element after element pointed by same pointer ? a. O(n) b. O(log n) c. O(n-1) d. O(1)

 56. The concatenation of two lists is to be performed in O(1) time. Which of the following implementations of a list could be used ? a. Array Implementation of List b. Singly Linked List c. Circular Doubly Linked List d. Doubly Linked List

 57. Time require to find any element of the linked list is _______. a. O(n) b. O(1) c. O(n^2) d. None of these
 58. Consider the following linked list representation. Which of the following statement is used to create a node ? struct node { int data; struct node *next; }start = NULL; struct node *new_node; a. new_node=(struct node *)malloc((struct node)); b. new_node=(struct *)malloc(sizeof(struct node)); c. new_node=(struct node)malloc(sizeof(struct node)); d. new_node=(struct node *)malloc(sizeof(struct node));
 59. Consider the below representation and predict what will be printed on the screen by following statement ?start->next->data struct node { int data; struct node *next; }*start = NULL; a. Access the “data” field of 3rd node b. Access the “data” field of 1st node c. Access the “data” field of 2nd node d. None of these