Set 1

1. A stock trading platform requires fast search, insertion, and deletion of orders. Would you prefer
skip lists over balanced binary search trees? Justify.
2. Write an algorithm to search for an element in a skip list.

Set 2
1. Write an algorithm to simulate a stack using a linked list (push & pop operations).
2. A text editor implements an “undo” feature. Discuss the choice between array-based and linked
stacks for this case.

Set 3
1. Compare array-based and linked-list stack implementations in terms of memory usage and
performance.
2. Write an algorithm to insert at a given position in a singly linked list.

Set 4
1. A compiler checks for balanced brackets {}, [], and (). Explain how a stack is used here.
2. Write an algorithm to delete a node from the front of a queue implemented using a linked list.

Set 5
1. Explain types of data structures with examples.
2. Write an algorithm to search for an element in a sorted array using binary search.

Set 6
1. A CPU scheduling system always allocates the processor to the highest-priority job. Which data
structure would you use and why?
2. Write an algorithm to insert an element into a max heap and maintain the heap property.

Set 7
1. Write an algorithm to reverse a string using a stack.
2. A language compiler must track nested function calls and return correctly. Which data structure
fits and why?
Set 8
1. Write an algorithm to merge two sorted arrays into a single sorted array.
 2. A financial application needs to process millions of transactions daily. Discuss the impact of
choosing O(n) vs O(n log n) algorithms.

Set 9
1. A hospital patient queue must process patients in arrival order but allow doctors to call a specific
patient early. Suggest an approach.
2. Write an algorithm to perform linear search in an array and analyze best and worst-case
complexities.

Set 10
1. Write an algorithm to insert a new node in the middle of a doubly linked list.
2. Explain space complexity and how to calculate space requirements of a recursive function.

Set 11
1. A maze-solving program using recursion causes stack overflow. Explain how to replace recursion
with a manual stack.
2. Write an algorithm to count the number of recursive calls in calculating the nth Fibonacci
number.

Set 12
1. Write an algorithm to traverse a circular linked list and count the number of nodes.
2. A playlist app allows moving forward, backward, and looping to the start. Which linked list would
you choose? Explain.

Set 13
1. A banking system processes transactions in order but must occasionally prioritize fraud alerts.
Suggest a structure and justify.
2. Write an algorithm to insert a node at the rear end of a double-ended queue using an array.

Set 14
1. A gaming leaderboard uses an array to store player scores. Players join and leave frequently.
Which list type would you choose for optimal insertion and deletion performance? Justify.
2. Write an algorithm to insert a node at the end of a singly linked list.

Set 15
1. Write an algorithm to calculate the sum of digits of a number using recursion.
 2. A job scheduler must reuse queue slots after processing. Which queue type is most suitable and
why?

Set 16
1. Compare array-based and linked representations of binary trees in terms of memory usage and
flexibility.
2. Write an algorithm to insert nodes into a binary tree using a linked structure.

Set 17
1. Write an algorithm to delete a node with a specific value from a doubly linked list.
2. Explain the importance of data structures in real-time software applications with examples.

Set 18
1. Write an algorithm to calculate the sum of all even numbers from 1 to N using recursion.
2. In a multiplayer game server, players are matched in pairs immediately when available. Which
queue type fits? Explain.

Set 19
1. A restaurant manages two types of customers: regular and reservation holders. Suggest a suitable
queue type.
2. Write an algorithm to insert an element into a sorted array while maintaining order.

Set 20
1. Write an algorithm to delete an element at a specific position in a 1D array.
2. A ticket counter simulation processes customers in order but allows emergency passes. Which
queue type is best? Why?
Set 21
1. Write an algorithm to delete a specific element from a circular queue using an array.
2. An e-commerce order processor must manage orders efficiently. Which data structure would you
use for sequential processing and why?

Set 22
1. A ticket booking system processes normal requests in order, but VIP requests must be processed
immediately. Which queue type fits this requirement? Explain.
2. Write an algorithm to reverse a number using recursion and analyze its time complexity.
Set 23
1. Explain asymptotic notations: Big-O, Big-Ω, and Big-Θ with examples.
2. Write an algorithm to delete all nodes with a given value from a singly linked list.

Set 24
1. A music app must loop songs and allow both forward and backward navigation. Suggest a linked
list structure.
2. Write an algorithm to find the nth Fibonacci number using binary recursion. Show recursion tree
for n=5.

Set 25
1. Write an algorithm to insert a node at the rear end of a deque using an array.
2. Explain the relevance of asymptotic notations in comparing two algorithms with examples.

Set 26
1. An IoT system logs temperature readings using recursion but faces stack overflow errors for
large datasets. Suggest and justify a solution.
2. Write an algorithm to implement a circular queue using an array and perform enqueue and
dequeue operations.

Set 27
1. Write an algorithm to count even and odd elements in a singly linked list.
2. An AI task scheduler uses both linear and multiple recursion. Compare their impact on
performance.

Set 28
1. A ticket counter simulation processes customers in order but allows emergency passes. Which
queue type is best? Why?
2. Write an algorithm to delete a node from the front of a linked queue.

Set 29
1. A cloud service provider wants to handle multiple incoming jobs in the order they arrive but
allow high-priority jobs to jump ahead. Suggest a data structure.
2. Write an algorithm to implement enqueue and dequeue operations in a linked queue.
Set 30
1. A file directory system must allow hierarchical storage and traversal. Which tree traversal would
you choose to list files in order? Explain.
2. Write an algorithm to perform inorder, preorder, and postorder traversals of a binary tree using
recursion.

Set 31
1. Explain how complexity analysis helps select the best algorithm for a task with an example.
2. Analyze time and space complexity of a recursive prime-checking algorithm.

Set 32
1. Write an algorithm to insert a node at the beginning of a circular linked list.
2. Compare stack and queue in terms of operations and real-life applications.

Set 33
1. Write an algorithm to insert an element into a hash table using linear probing for collision
resolution.
2. An online dictionary application must quickly retrieve the meaning of words. Which data
structure is most appropriate and why?

Set 34
1. Write an algorithm to implement recursion using a stack.
2. Explain the principles and patterns used in designing efficient data structures.

Set 35
1. Explain the need and relevance of data structures in memory management and performance
optimization.
2. Write an algorithm to delete a node from the front of a linked queue.