HP Previous Years Solved Sample Placement Papers
- What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?
a) O(1)
b) O(n)
c) O(n²)
d) O(n³)
Answer: a) O(1) - What would be the asymptotic time complexity to find an element in the linked list?
a) O(1)
b) O(n)
c) O(n²)
d) O(n⁴)
Answer: b) O(n) - What would be the asymptotic time complexity to insert an element at the second position in the linked list?
a) O(1)
b) O(n)
c) O(n²)
d) O(n³)
Answer: a) O(1) - The concatenation of two lists can be performed in O(1) time. Which of the following variation of the linked list can be used?
a) Singly linked list
b) Doubly linked list
c) Circular doubly linked list
d) Array implementation of list
Answer: c) Circular doubly linked list - Consider the following definition in C programming language:
struct node { int data; struct node * next; }; typedef struct node NODE; NODE *ptr;Which of the following C code is used to create a new node?
a) ptr = (NODE*)malloc(sizeof(NODE));
b) ptr = (NODE*)malloc(NODE);
c) ptr = (NODE*)malloc(sizeof(NODE*));
d) ptr = (NODE)malloc(sizeof(NODE));
Answer: a) ptr = (NODE*)malloc(sizeof(NODE)); - What kind of linked list is best to answer questions like “What is the item at position n?”
a) Singly linked list
b) Doubly linked list
c) Circular linked list
d) Array implementation of linked list
Answer: d) Array implementation of linked list - Linked lists are not suitable for the implementation of ___________
a) Insertion sort
b) Radix sort
c) Polynomial manipulation
d) Binary search
Answer: d) Binary search - Linked list is considered as an example of ___________ type of memory allocation.
a) Dynamic
b) Static
c) Compile time
d) Heap
Answer: a) Dynamic - In Linked List implementation, a node carries information regarding ___________
a) Data
b) Link
c) Data and Link
d) Node
Answer: c) Data and Link - Linked list data structure offers considerable saving in _____________
a) Computational Time
b) Space Utilization
c) Space Utilization and Computational Time
d) Speed Utilization
Answer: c) Space Utilization and Computational Time - Which of the following points is/are not true about Linked List data structure when it is compared with an array?
a) Arrays have better cache locality that can make them better in terms of performance
b) It is easy to insert and delete elements in Linked List
c) Random access is not allowed in a typical implementation of Linked Lists
d) Access of elements in linked list takes less time than compared to arrays
Answer: d) Access of elements in linked list takes less time than compared to arrays - What does the following function do for a given Linked List with first node as head?
void fun1(struct node* head) { if (head == NULL) return; fun1(head->next); printf("%d ", head->data); }a) Prints all nodes of linked lists
b) Prints all nodes of linked list in reverse order
c) Prints alternate nodes of Linked List
d) Prints alternate nodes in reverse order
Answer: b) Prints all nodes of linked list in reverse order - Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?
a) Insertion Sort
b) Quick Sort
c) Heap Sort
d) Merge Sort
Answer: d) Merge Sort