PROGRAMMING IN C AND DATA STRUCTURES - UNIT V

Which of the following best describes the relationship between stacks and queues?

• They are identical in all aspects

• They differ only in their implementation

• They have opposite data access patterns

• They can only be implemented using arrays

In a real-world scenario, which data structure would be most appropriate for modelling a call centre's customer service line?

• Stack

• Queue

• Binary tree

• Doubly linked list

What potential issue might arise when implementing a queue using a fixed-size array?

• Difficulty in reversing the queue

• Inability to perform dequeue operations

• Circular buffer overflow

• Increased time complexity for enqueue operations

How does a doubly linked list address a limitation of a singly linked list?

• It allows for constant-time insertion at both ends

• It reduces the overall memory usage

• It eliminates the need for a head pointer

• It enables bidirectional traversal

In the context of tree structures, what distinguishes a leaf node?

• It has the maximum number of children

• It has no children

• It is always the root node

• It has exactly one child

Which tree traversal method would you use if you needed to process nodes in ascending order in a binary search tree?

• Preorder

• Postorder

• Inorder

• Level-order

How might a stack be utilised in implementing an undo mechanism in a text editor?

• By storing each character typed

• By queueing user actions

• By maintaining a list of all possible actions

• By pushing each user action onto the stack

What is a potential drawback of using a singly linked list compared to an array?

• Higher memory usage

• Slower insertion at the beginning

• Inability to store heterogeneous data types

• Lack of random access to elements

In a binary search tree, where would you find the node with the maximum value?

• At the root

• At the leftmost leaf

• At the rightmost leaf

• At any leaf node

How does the choice between a stack and a queue affect the order in which elements are processed in depth-first search vs breadth-first search algorithms?

• It has no effect on the order

• Stack leads to depth-first, queue to breadth-first

• Queue leads to depth-first, stack to breadth-first

• Both structures can be used interchangeably for both searches