Quiz on Data Structures Unit I

What is an Abstract Data Type (ADT)?

• A programming language

• A data structure with no implementation

• A mathematical model with defined operations

• A type of array

Which of the following is a characteristic of ADT?

• Implementation is hidden from the user

• Focus is on what operations are to be performed

• Implementation can be changed without affecting the user

• All of the above

List ADT allows which of the following operations?

• Insertion

• Deletion

• Traversal

• All of the above

Which of the following is an advantage of array-based list implementation?

• Dynamic size

• Easy to insert elements in the middle

• Fast random access

• Efficient memory use

In an array-based implementation, what is the time complexity for inserting an element at the beginning?

• O(1)

• O(log n)

• O(n)

• O(n log n)

In a singly linked list, each node contains:

• Data only

• Data and pointer to previous node

• Data and pointer to next node

• Data and two pointers

The last node in a singly linked list points to:

• First node

• NULL

• Itself

• Head

Which of the following is true about circular linked list?

• Last node points to NULL

• Last node points to head

• Each node has two pointers

• It is not a type of linked list

What distinguishes a doubly linked list from other lists?

• It uses arrays

• Each node has a pointer to previous and next node

• It is circular

• It does not allow deletion

Insertion at the beginning of a singly linked list requires:

• O(1) time

• O(n) time

• O(log n) time

• O(n log n) time