a) O(nlogn) b) O(logn) c) O(n) d) O(1) Answer: c Explanation: ...
View QuestionHow do you calculate the pointer difference in a memory efficient double linked list?
a) head xor tail b) pointer to previous node xor pointer to next node
View QuestionWhat is a memory efficient double linked list?
a) Each node has only one pointer to traverse the list back and forth b) The list has ...
View QuestionWhich of the following is false about a doubly linked list?
a) We can navigate in both the directions b) It requires more ...
View QuestionWhich of these is not an application of a linked list?
a) To implement file systems b) For separate chaining in hash-tables c) To implement non-binary trees d) ...
View QuestionWhat is the space complexity for deleting a linked list?
a) O(1) b) O(n) c) Either O(1) or O(n) d) O(logn) Answer: a Explanation: You need a ...
View QuestionWhat is the time complexity to count the number of elements in the linked list?
a) O(1) b) O(n) c) O(logn) d) O(n2) Answer: b Explanation: ...
View QuestionWhat is the time complexity of inserting at the end in dynamic arrays?
a) O(1) b) O(n) c) O(logn) d) Either O(1) or O(n) Answer: d
View QuestionWhich of the following is not a disadvantage to the usage of array?
a) Fixed size b) There are chances of wastage of memory space if elements inserted in ...
View QuestionWhat is the space complexity of a linear queue having n elements?
a) O(n) b) O(nlogn) c) O(logn) d) O(1) Answer: a Explanation: Because there are n elements.
View Question