Data Structure

Which of the following is a characteristic of a linked list?

• • Fixed size

• • Elements stored in contiguous memory

• • Dynamic size

• • All elements must be of the same type

What is the time complexity of inserting a node at the beginning of a singly linked list?

• O(1)

• O(n)

• O(log n)

• O(n^2)

Which of the following operations is not efficient in a singly linked list?

• Insertion

• Deletion

• Searching for an element

• Traversal

In a doubly linked list, each node contains:

• One pointer

• Two pointers

• Three pointers

• No pointers

What is the primary principle behind stack data structures?

• First In First Out (FIFO)

• Last In First Out (LIFO)

• Random Access

• Circular Access

Which operation is not performed in a stack?

• Push

• Pop

• Peek

• Enqueue

The time complexity for pushing and popping an element in a stack is:

• O(1)

• O(n)

• O(log n)

• O(n^2)

Which of the following best describes a queue?

• Last In First Out

• First In Last Out

• First In First Out

• Random Order

What is the time complexity of enqueue and dequeue operations in a queue?

• O(1)

• O(n)

• O(log n)

• O(n^2)

In a circular queue, the last element points back to:

• The first element

• The middle element

• The last element

• Null