BE23CS404 Data Structures and Algorithms Unit1_Quiz

Which of the following is a non-linear data structure?

• Stack

• Array

• Tree

• Queue

Which data structure supports fast random access?

• Linked List

• Array

• Queue

• Stack

What does ADT stand for?

• Abstract Data Type

• Advanced Data Tree

• Array Data Type

• Abstract Design Type

Which operation is NOT typically supported by the List ADT?

• Insertion

• Traversal

• Compilation

• Deletion

Which of the following is a drawback of arrays when used for List ADT implementation?

• Random access is slow

• Size is static/fixed

• Memory allocation is dynamic

• High overhead per node

In a singly linked list, what does each node contain?

• Data only

• Data and pointer to next node

• Data and pointer to previous node

• Only a pointer

In a doubly linked list, each node has:

• One pointer

• Two pointers

• Three pointers

• No pointer

What advantage does a linked list have over arrays?

• Cheaper to insert and delete elements

• Random access is faster

• Uses less memory always

• Easier to sort

A doubly linked list allows traversal in:

• One direction

• Both directions

• Three directions

• No direction

Which pointer in a doubly linked list node allows backward traversal?

• next

• prev (previous)

• back

• front