NEW
Font size
WorksheetsDSA BCA
Total questions: 10
Worksheet time: 5mins
Which of the following data structures finds its use in recursion?
Link List
Stack
Queue
Array
Insertion of an element at the middle of a linked list requires the modification of how many pointers?
1
3
2
4
The type of pointer used to point to the address of the next element in a linked list?
char
int
node
none of the above
Which of the following data structures allow insertion and deletion from both ends?
Stack
Link List
Queue
Dequeue
Which of the following sorting algorithms provide the best time complexity in the worst-case scenario?
Merge Sort
quick sort
selection sort
bubble sort
What is the best case time complexity of the binary search algorithm?
1
log n
n2
nlogn
Which of the following algorithms is not a comparison-based sorting algorithm?
Heap Sort
Merge Sort
Quick Sort
Counting Sort
What is the space complexity of a recursive function that uses a stack?
O(1)
O(n)
O(log n)
O(n2)
Which data structure is used to implement a breadth-first search (BFS) algorithm?
Queue
Stack
Array
Linked List
Consider the following statements:
i. First-in-first out types of computations are efficiently supported by STACKS.
ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations.
iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices.
iv. Last-in-first-out type of computations are efficiently supported by QUEUES.
Which of the following is correct?
ii
i & iv
iii
iv
