29. When inserting a new data value into an Unsorted Linked List, where is the m
ID: 3701866 • Letter: 2
Question
29. When inserting a new data value into an Unsorted Linked List, where is the most efficient position to add the new data value? A) After the last element currently stored in the container B) Before the first element currently stored in the containeir C) In between two elements currently stored in the container D) None of the answers provided 30. What is the complexity of the inserting a data value into a Sorted Array-Based List? A) O(1) C) O(logN) E) None of the answers provided 31. What is the complexity of the constructor operation for a Sorted Array-Based List? A) B) O(N) C) O(log2N) D) O(NZ)E) None of the answers provided 32. What is the complexity of the destructor operation for an Unsorted Linked List? A) 0(1) B) O(N) C) O(log2 N) D) o(N2)E) None of the answers providedExplanation / Answer
Ques 29. Answer : (b) before the first element stored in the list
The time taken to add node to the head of the list is O(1) as we only need to manipulate the pointers.
The time taken to add node after the last node of the list is O(n) as we have to traverse the array to reach the end node and then add the node which takes O(n) time.
The time taken to add node between two node of the list is O(n) as we have to traverse the array to reach the desired node and then add the node which takes O(n) time.
Ques 30. Answer : (B) O(N)
The worst case is when we need to store the new element at the first position in the array. In this case we have to move each element one position right which takes O(N) time.
Ques 31. Asnwer : (A) O(1)
We just need to create an empty list, which takes O(1) time.
Ques 32. Answer : (B)
To remove the list entirely we have to traverse through the list and delete the menory of each node.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.