a) Singly linked list b) Doubly linked list c) Circular doubly linked list d) Array implementation of ...
View QuestionWhat 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(n2) d) O(n3) Answer: a Explanation: A new node ...
View QuestionWhat would be the asymptotic time complexity to find an element in the linked list?
a) O(1) b) O(n) c) O(n2) d) O(n4) Answer: b Explanation: If the required element is in the last ...
View QuestionWhat 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(n2) d) O(n3) Answer: ...
View QuestionWhat would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
a) O(1) b) O(n) c) θ(n) d) θ(1) Answer: c Explanation: In case of a linked list having n elements, we ...
View QuestionIn linked list each node contains a minimum of two fields. One field is data field to store the data second field is?
a) Pointer to character b) Pointer to integer c) Pointer to node d) Node Answer: c Explanation: Each ...
View Question
Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time?
i) Insertion at the front of the linked list
ii) Insertion at the end of the linked list
iii) Deletion of the front node of the linked list
iv) Deletion of the last node of the linked list
Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. ...
View QuestionA linear collection of data elements where the linear node is given by means of pointer is called?
a) Linked list b) Node list c) Primitive list d) Unordered list Answer: a ...
View QuestionWhich of the following is not the type of queue?
a) Ordinary queue b) Single ended queue c) Circular queue d) Priority queue Answer: b
View QuestionQueues serve major role in ______________
a) Simulation of recursion b) Simulation of arbitrary linked list c) Simulation of limited resource allocation d) ...
View Question