Datastructures Unit 1

What does ADT stand for in Data Structures?

• Advanced Data Type
• Abstract Data Type
• Algorithmic Data Table
• Array Defined Type

Which data structure uses nodes with data and a pointer to the next node?

• Array
• Queue
• Singly Linked List
• Stack

In a circular linked list, the last node points to:

• NULL
• Head node
• Middle node
• Previous node

Which of the following allows bidirectional traversal?

• Singly Linked List
• Circular Linked List
• Doubly Linked List
• Array

Which operation is not typically performed on a list?

• Insertion
• Traversal
• Formatting
• Deletion

Which is an advantage of linked lists over arrays?

• Constant time access
• Dynamic size
• Cache locality
• Low memory usage

Which ADT is best for representing a polynomial?

• Array
• Stack
• Linked List
• Queue

How do you merge two sorted linked lists?

• Concatenate and sort
• Iterative merge
• Binary search
• Use stack

What points to NULL in a singly linked list?

• First node
• Middle node
• Last node
• All nodes

Which list allows circular traversal without any NULL pointer?

• Singly Linked List
• Circular Linked List
• Doubly Linked List
• Array List