Linear Data Structures Quiz

What is a linear data structure?

• A structure where elements are connected sequentially

• A structure where elements are connected hierarchically

• A structure where elements are connected randomly

• None of the above

What is a dangling pointer in the context of data structures?

• A pointer that points to a memory location which has already been deallocated

• A pointer that has not been initialized

• A pointer that points to the starting address of an array

• A pointer that points to a memory block managed by a garbage collector

What is the time complexity of accessing an element in an array by index?

• O(1)

• O(n)

• O(log n)

• O(n^2)

Which of the following operations is performed in O(1) time in a stack?

• Push

• Pop

• Both

• None

What is the rear end of a queue called?

• Front

• Rear

• Back

• Tail

Which data structure works on the principle of LIFO?

• Stack

• Queue

• Array

• Linked List

What is the time complexity of searching in a linked list?

• O(1)

• O(n)

• O(log n)

• O(n^2)

Which of the following is not a linear data structure?

• Array

• Stack

• Graph

• Queue

Which operation is not possible in a singly linked list?

• Traversing forward

• Traversing backward

• Insertion at the end

• Deletion from the start

In a stack, what happens when an attempt is made to pop an element from an empty stack?

• Overflow

• Underflow

• Garbage value is returned

• None of the above