DS Quiz 1

Which data structure is used for implementing recursion?

• Stack

• Queue

• List

• Array

Which data structure is based on the Last In First Out (LIFO) principle?

• Tree

• Linked List

• Stack

• Queue

A linear collection of data elements where the linear node is given by means of pointer is called?

• Linked list

• Node list

• Primitive list

• Unordered list

What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?

• O(1)

• O(n)

• O(n²)

• O(n³)

Which of the following is false about a doubly linked list?

• We can navigate in both the directions

• It requires more space than a singly linked list

• The insertion and deletion of a node take a bit longer

• Implementing a doubly linked list is easier than singly linked list

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

Assuming int is of 4bytes, what is the size of int arr[15];?

• 15

• 19

• 11

• 60

Elements in an array are accessed _____________

• randomly

• sequentially

• exponentially

• logarithmically

What is the worst case complexity of bubble sort?

• O(nlogn)

• O(logn)

• O(n)

• O(n²)

Where is linear searching used?

• Used all the time

• When the list has only a few elements

• When performing a single search in an unordered list

• When the list has only a few elements and When performing a single search in an unordered list