WorksheetsDSA Day 4
Total questions: 7
Worksheet time: 5mins
Which of these is not an application of a linked list?
To implement file systems
To implement file systems
To implement non-binary trees
Random Access of elements
Which of the following is not a disadvantage to the usage of array?
Fixed size
There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated size
Insertion based on position
Accessing elements at specified positions
What is the time complexity of inserting at the end in dynamic arrays?
O(1)
O(n)
O(logn)
Either O(1) or O(n)
Which of the following points is/are true about Linked List data structure when it is compared with array?
Arrays have better cache locality that can make them better in terms of performance.
It is easy to insert and delete elements in Linked List
Random access is not allowed in a typical implementation of Linked Lists
The size of array has to be pre-decided, linked lists can change their size any time.
All of the above
Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?
Insertion Sort
Quick Sort
Heap Sort
Merge Sort
What is the output of following function in which start is pointing to the first node of the following linked list 1->2->3->4->5->6 ?
1 4 6 6 4 1
1 3 5 1 3 5
1 2 3 5
1 3 5 5 3 1
A variant of the linked list in which none of the node contains NULL pointer is?
Singly linked list
Doubly linked list
Circular linked list
None
