Data Structures and Algorithms | DSA | Question Bank

1. DSA question bank
1. Define Array (3 marks)
2. Define Linked List (3 marks)
3. Define Stack (3 marks)
4. Define Queue (3 marks)
5. Define Binary tree (3 marks)
6. Define Binary Search Tree (3 marks)
7. Define Singly Linked List (3 marks)
8. Define Doubly Linked List (3 marks)
9. Define Circular Linked List (3 marks)
10. Define ADT (Abstract Data Type) (3 marks)
11. Define Binary heap (3 marks)
12. Define Binomial heap (3 marks)
13. Define Priority Queue (3 marks)
14. Define Fibonacci heap (3 marks)
15. Define Leftist tree (3 marks)
16. Define data structures (3 marks)
17. What are some applications of Data structures? (3 marks)
18. Explain the process behind storing a variable in memory. (3 marks)
19. Give some applications of stack. (3 marks)
20. What are the different operations available in stack data structure? (3 marks)
21. Difference between Stack and Queue (3 marks)
22. Write the postfix form of the expression: (A + B) * (C - D). (3 marks)
23. Are linked lists considered linear or non-linear data structures? (3 marks)
24. Check if the given stack in empty. (3 marks)
25. Applications of array (3 marks)
26. Types of array (3 marks)
27. One dimensional array (3 marks)
28. Two dimensional array (3 marks)
29. Multi-dimensional array (3 marks)
30. Header Linked List (3 marks)
31. Array Vs Linked List (3 marks)

2. 32. What is FIFO? Which data structure follow this principle? (3 marks)
33. What is LIFO? Which data structure follow this principle? (3 marks)
34. What is an asymptotic analysis of an algorithm? (3 marks)
35. Which data structure is used to perform recursion? (3 marks)
36. Linear Vs Non-linear data structure (3 marks)
37. Write the syntax in C to create a node in the singly linked list (3 marks)
38. Write the syntax in C to create a node in the doubly linked list (3 marks)
39. What is the minimum number of queues that can be used to implement a priority
queue? (3 marks)
40. Write the C code to perform in-order traversal on a binary tree. (5 marks)
41. What is the maximum number of nodes in a binary tree of height k? (3 marks)
42. Which data structure suits the most in the tree construction? (3 marks)
43. Can we use unsorted array in Binary search? (3 marks)
44. How can AVL Tree be useful in all the operations as compared to Binary search
tree? (3 marks)
45. What are the advantages of Binary search over linear search? (3 marks)
46. What is the difference between NULL and VOID? (3 marks)
47. What are tree traversal? (3 marks)
48. Which sorting algorithm is considered the fastest? Why? (3 marks)
49. What are the resources of algorithm analysis? (3 marks)
50. Write an algorithm to swap two variables? (3 marks)
51. What is the computational complexity of linear search? (3 marks)
52. How to read array input from user? (3 marks)
53. Write a traversing algorithm for the linked list? (5 marks)
54. Static memory allocation (3 marks)
55. Dynamic memory allocation (3 marks)
56. Write an algorithm for push operation of stack data structure? (5 marks)
57. Write an algorithm for pop operation of stack data structure? (5 marks)
58. Write an algorithm for insertion in a queue? (5 marks)
59. Write an algorithm for insertion in a queue? (5 marks)
60. Write an algorithm for bubble sort? (5 marks)
61. Write down the complexity of various sorting algorithms? (5 marks)
62. What do you mean by hashing? (5 marks)
63. What do you mean by the hash table? (3 marks)

3. 64. Define recursion? (3 marks)
65. Which data structure is used to perform recursion? (3 marks)
66. Why Is Algorithm Analysis Important? (3 marks)
67. Define Postfix Expression. (3 marks)
68. Are Stack and Queue the Same Thing? If Not, Explain Why. (3 marks)
69. What Is the Process Behind Storing Variables in Memory? (3 marks)
70. Define an Asymptotic Analysis of an Algorithm. (3 marks)
71. Explain Asymptotic Notations. (3 marks)
72. Write a Recursive Function To Calculate the Height of a Binary Tree.(5 marks)
73. Is Binary Search Better Than Linear Search? (3 marks)
74. What Is a Heap Data Structure? (3 marks)
75. What Is the Advantage of a Heap Over a Stack? (3 marks)
76. Can Dynamic Memory Allocation Help in Managing Data? (3 marks)
77. Reverse a given String using recursion? (5 marks)
78. Check if the given String is Palindrome? (5 marks)
79. Define Algorithm? (3 marks)
80. What are the features of an efficient algorithm? (3 marks)
81. List down any four applications of data structures? (3 marks)
82. What is divide and conquer? (3 marks)
83. State the importance of dynamic programming. (3 marks)
84. Define storage structure? (3 marks)
85. Define file structure? (3 marks)
86. Write down the algorithm for solving Towers of Hanoi problem? (5 marks)
87. What do you mean by primitive data structure? (3 marks)
88. What are the three stages of problem solving aspect. (3 marks)
89. Define depth of recursion? (3 marks)
90. What is searching? (3 marks)
91. What is Linear search? (3 marks)
92. Define Space Complexity (3 marks)
93. Define Time Complexity (3 marks)
94. What are asymptotic notations? (3 marks)
95. What is information? (3 marks)
96. Define Recursion? (3 marks)
97. What is a Fibonacci sequence? (3 marks)

4. 98. Explain in detail the steps involved in Top down Design (5 marks)
99. Write short notes on efficiency of an algorithm (3 marks)
100.What are the two operations of Stack? (3 marks)
101.Write postfix from of the expression –A+B-C+D? (3 marks)
102.How do you test for an empty queue? (5 marks)
103.What is a circular queue? (3 marks)
104.Define non-linear data structure? (3 marks)
105.Define tree? (3 marks)
106.Define leaf? (3 marks)
107.What is meant by directed tree? (3 marks)
108.What is an ordered tree? (3 marks)
109.What is a Binary tree? (3 marks)
110.What are the applications of binary tree? (3 marks)
111.What is meant by traversing? (3 marks)
112.What are the different types of traversing in binary trees and explain them? (5
marks)
113.What are the two methods of binary tree implementation? (3 marks)
114.Define pre-order traversal? (3 marks)
115.Define post-order traversal? (3 marks)
116.Define in -order traversal? (3 marks)
117.What is the length of the path in a tree? (3 marks)
118.Define expression trees? (3 marks)
119.Define strictly binary tree? (3 marks)
120.Define complete binary tree? (3 marks)
121.What is an almost complete binary tree? (3 marks)
122.Define AVL Tree (3 marks)
123.Define collision resolution (3 marks)
124.How the Singly Linked List can be represented? (3 marks)
125.How the doubly linked list can be represented? (3 marks)
126.How does the polynomial equation can be represented with Linked List? (5
marks)
127.Merits and demerits of array implementation on linked lists (3 marks)
128.Insert a node in the last in Singly Linked List (5 marks)
129.Delete last node in Singly Linked List (5 marks)

5. 130.Search an element in a Singly Linked List (5 marks)
131.Find the length of a Singly Linked List (5 marks)
132.Methods to implement stack in C (3 marks)
133.How stack is implemented by Linked List? (3 marks)
134.Double ended queue (3 marks)
135.Delete an element from queue (5 marks)
136.Insert an element in a queue (5 marks)
137.Push and pop operations in stack (5 marks)
138.Enqueue and dequeue in queue (5 marks)
139.Convert the infix (a+b)*(c+d)/f into postfix & prefix expression (5 marks)
140.How to test for an empty queue? (3 marks)
141.Give the applications of priority queues (3 marks)
142.Check for an empty stack (3 marks)
143.Features of stack (3 marks)
144.Define tree data structure (3 marks)
145.Define leaf (3 marks)
146.Delete a node from a binary search tree (5 marks)
147.What is the result you get on inorder traversing binary search tree? (5 marks)
148.Convert the infix expression (A-B/C)*(D/E-F) into a postfix. (5 marks)
149.What are the steps to convert a general tree into binary tree? (5 marks)
150.What is directed tree? (3 marks)
151.What are internal nodes in a tree? (3 marks)
152.Balance factor in AVL tree (3 marks)
153.Length of the path of a tree (3 marks)
154.Expression trees (3 marks)
155.Threaded binary tree (3 marks)
156.Define minimum cost spanning tree? (3 marks)
157.Define sorting (3 marks)
158.Types of sorting (3 marks)
159.Internal sorting (3 marks)
160.External sorting (3 marks)
161.Insertion sort using array (5 marks)
162.Hashing (3 marks)
163.Need of hashing (3 marks)

6. 164.Problems in hashing (3 marks)
165.Collision in hashing (3 marks)
166.How does the bubble sort get its name? (3 marks)
167.Is the heap sort always better than the quick sort? (3 marks)
168.What are the collision resolution methods? (3 marks)
169.Define separate chaining (3 marks)
170.What is open addressing? (3 marks)
171.What is rehashing? (3 marks)
172.What is leaf node? (3 marks)
173.What is a root node? (3 marks)
174.How do you find the lowest common ancestor in a binary tree? (5 marks)
175.How do you check if a given binary tree is a subtree of another binary tree? (5
marks)
176.What is s-value? (3 marks)
177.How do you find the distance between two nodes in a binary tree with an
example? (5 marks)
178.Self balanced trees (3 marks)
179.How do you delete a node from a binary search tree? (5 marks)
180.What is the Red-Black tree data structure? (3 marks)
181.How do you find if two trees are identical? (5 marks)
182.How are binary trees used for sorting? (3 marks)
183.Why huffman coding is used? (3 marks)
184.Ellaborate huffman coding (3 marks)
185.Explain Josephus problem (3 marks)
186.Full binary tree (3 marks)
187.Perfect binary tree (3 marks)
188.Complete binary tree (3 marks)
189.Balanced binary tree (3 marks)
190.What exactly is a queue? What distinguishes it from the stack? (3 marks)
191.What’s the fastest sorting algorithm? Why? (3 marks)
192.Explain Big Oh Notation. With example (3 marks)
193.Explain Omega Notation. With example (3 marks)
194.Explain Theta Notation. With example (3 marks)

7. 195.What is linked list? Write and explain the algorithm for create and traverse
operations in singly linked list with example (5 marks)
196.What is the draw backs of single linked list? (3 marks)
197.What are the limitations of queue? (3 marks)
198.Explain linear search (3 marks)
199.Can we apply Binary search algorithm to a sorted Linked list? (3 marks)
200.What are the operations that can be performed on a data-structures? (3 marks)
201.Do you know how does dynamic memory allocation help in managing data? (3
marks)
202.How to check if a given Binary Tree is BST or not? (5 marks)
203.What is divide and conquer algorithm? (3 marks)
204.Add an element to the stack (5 marks)
205.Delete an element from the stack (5 marks)
206.Return the top element in the stack (5 marks)
207.Check if the stack is empty (5 marks)
208.Register stacks (3 marks)
209.Memory stacks (3 marks)
210.LIFO (3 marks)
211.FIFO (3 marks)
212.Characteristics of queue (3 marks)
213.Add an element in a queue (5 marks)
214.Delete an element in a queue (5 marks)
215.Get the first element from the queue (5 marks)
216.Get the last element from the queue (5 marks)
217.Appplications of queue (3 marks)
218.Singly Linked List (3 marks)
219.Creating a node in Singly Linked List (3 marks)
220.Delete a node from the start in Singly Linked List (5 marks)
221.Insert a node from the start in Singly Linked List (5 marks)
222.Traverse the Singly Linked List (5 marks)
223.Delete a node at the end in Singly Linked List (5 marks)
224.Deletion at the nth node of the Singly Linked List (5 marks)
225.Insertion at nth position in Singly Linked List (5 marks)
226.Insertion at the end in Singly Linked List (5 marks)

8. 227.Search an element in a Singly Linked List (5 marks)
228.Doubly Linked List (53 marks)
229.Deletion at beginning in Doubly Linked List (5 marks)
230.Deletion at Middle in Doubly Linked List (5 marks)
231.Deletion at last in Doubly Linked List (5 marks)
232.Insertion at the end in a Doubly Linked List (5 marks)
233.Insertion at nth node in a Doubly Linked List (5 marks)
234.Insertion at the beginning in a Doubly linked List (5 marks)
235.Circular Linked List (3 marks)
236.Insertion at the beginning in a Circular linked List (5 marks)
237.Insertion at the end in a Circular Linked List (5 marks)
238.Insertion at nth node in a Circular Linked List (5 marks)
239.Deletion from beginning in Circular Linked List (5 marks)
240.Deletion from nth position in Circular Linked List (5 marks)
241.Deletion from end in Circular Linked List (5 marks)
242.Binary Search Tree (3 marks)
243.Rules for Insertion in a Binary Search Tree (3 marks)
244.Searching in a Binary Search Tree (5 marks)
245.Insertion in a Binary Search Tree (5 marks)
246.Possible Cases In Deletion in a Binary Search Tree (5 marks)
247.Deletion in a Binary Search Tree (5 marks)
248.Insertion and Creation of an AVL Tree (5 marks)
249.AVL Tree Deletion (5 marks)
250.B-Tree: Deletion (5 marks)
251.B-Tree: Insertion (5 marks)
252.Inorder Tree Traversal in Binary Tree (5 marks)
253.Preorder Tree Traversal in Binary Tree (5 marks)
254.Postorder Tree Traversal in Binary Tree (5 marks)
255.Find the height of binary tree (5 marks)
256.Reverse an array or string (5 marks)
257.Boyer-Moore’s Voting Algorithm (5 marks)
258.Who is the founder of C language? (3 marks)
259.When was C language developed? (3 marks)
260.What is the use of printf() and scanf() functions? (3 marks)

9. 261.What is the difference between the local variable and global variable in C? (3
marks)
262.Define <stdio.h> (3 marks)
263.What is the use of the ‘==’ symbol? (3 marks)
264.Why is int known as a reserved word? (3 marks)
265.What is the stack area? (3 marks)
266.What are huge pointers? (3 marks)
267.Open hashing (3 marks)
268.Closed hashing (3 marks)
269.Linear probing method in hashing (3 marks)
270.Quadratic probing method in hashing (3 marks)
271.Hashing collision (3 marks)
272.Double hashing (3 marks)
273.Check if a string is palindrome represented in doubly linked list using recursion
(5 marks)
274.Write a function to check if a node exists in a binary tree or not. If the node
exists then return true otherwise return false. (5 marks)
275.Write a program to print in-order traversal of binary tree using recursion? (5
marks)
276.qsort() in C (3 marks)
277.NULL pointer in C (3 marks)
278.Dangling pointer in C (3 marks)
279.Generic pointer in C (3 marks)
280.What is the difference between pass by value by reference in c and pass by
reference in c? (3 marks)
281.Is that possible to add pointers to each other? (3 marks)
282.What is a near pointer in C? (3 marks)
283.What is a far pointer in C? (3 marks)
284.What is the size of a void pointer in C? (3 marks)
285.Differentiate between a constant pointer and pointer to a constant? (3 marks)
286.What is the FILE pointer? (3 marks)
287.Why are void pointers used? (3 marks)
288.Can math operations be performed on a void pointer? (3 marks)
289.Inbuilt functions in C (3 marks)

10. 290.User-defined functions in C (3 marks)
291.Usage of pointer in C (3 marks)
292.Static memory allocation (3 marks)
293.Dynamic memory allocation (3 marks)
294.malloc() Vs calloc() (3 marks)
295.free() in C (3 marks)
296.What is the purpose of sprintf() function? (3 marks)
297.Can we compile a program without main() function? (3 marks)
298.What is command line argument? (3 marks)
299.What is the acronym for ANSI?(3 marks)
300.Who is the main contributor in designing the C language after Dennis Ritchie?
(3 marks)
301.What is an infinite loop? (3 marks)
302.Write a program to print "hello world" without using a semicolon? (3 marks)
303.Write a program to swap two numbers without using the third variable? (3
marks)
304.Write a program to print Fibonacci series without using recursion? (5 marks)
305.Write a program to print Fibonacci series using recursion? (5 marks)
306.Write a program to check prime number in C Programming? (5 marks)
307.Why quicksort is preferred for arrays and merge sort for linked lists. (3 marks)
308.How will you represent a linked list in a graphical view? (3 marks)
309.How many types of Linked List exist? (3 marks)
310.What does the dummy header in the linked list contain? (3 marks)
311.Floyd's Cycle-Finding Algorithm (5 marks)
312.For which header list, the last node contains the null pointer? (3 marks)
313.Mention what is Linked lists? (3 marks)
314.What type of memory allocation is referred for Linked lists? (3 marks)
315.List some Queue real-life applications. (3 marks)
316.Is printing an application of queue? (3 marks)
317.How is queue used in printer? (3 marks)
318.What is the importance of queue? (3 marks)
319.LCFS (3 marks)
320.FCFS (3 marks)
321.What is application of priority queue? (3 marks)

11. 322.Is asynchronous data transfer an application of queue? (3 marks)
323.What is heap? (3 marks)
324.What is Priority Queue? (3 marks)
325.How is Binary Heap usually implemented? (3 marks)
326.Insert item into the Heap. Explain your actions. (5 marks)
327.Types of binary heap (3 marks)
328.Explain Min heap and max heap (3 marks)
329.What is Binary Heap? (3 marks)
330.Compare Heaps vs Arrays to implement Priority Queue (3 marks)
331.Explain how Heap Sort works (5 marks)
332.Name some ways to implement Priority Queue (3 marks)
333.What is the advantage of Heaps over Sorted Arrays? (3 marks)
334.What is the difference between Heap and Red-Black Tree? (3 marks)
335.How heaps store data? (5 marks)
336.Insertion in Binary Heap (5 marks)
337.Deletion in Binary Heap (5 marks)
338.How do you add elements to a binary heap? (5 marks)
339.Properties of Binomial Trees (3 marks)
340.Properties of Binomial Heaps (3 marks)
341.Merge two Binary heaps (5 marks)
342.Merge two Binomial heaps (5 marks)
343.Is a heap a binary tree? (3 marks)
344.Is heap a RAM or ROM? (3 marks)
345.Stack Memory Allocation (3 marks)
346.Heap Memory Allocation (3 marks)
347.Is stack faster than heap? (3 marks)
348.What data is stored in heap? (3 marks)
349.Which sorting technique uses heap tree? (3 marks)
350.What is Trie? (3 marks)
351.Structure of Trie node (3 marks)
352.Insert Operation in Trie (5 marks)
353.Search Operation in Trie (5 marks)
354.How to implement a Trie Data Structure? (5 marks)
355.What are the criteria of algorithm analysis? (3 marks)

12. 356.What are some examples of divide and conquer algorithms? (3 marks)
357.How many spanning trees can a graph has? (3 marks)
358.What is a minimum spanning tree (MST)? (3 marks)
359.What is interpolation search technique? (3 marks)
360.What is the prefix and post fix notation of (a + b) * (c + d)? (5 marks)
361.Write an algorithm to insert a node in a sorted linked list. (5 marks)
362.What is a Hash Table? (3 marks)
363.What is Dijkstra's shortest path algorithm? (5 marks)
364.What are Greedy algorithms? Give some example of it? (3 marks)
365.Write an algorithm to insert a node in the Binary search tree? (5 marks)
366.Explain how the encryption algorithm works? (3 marks)
367.What is the difference between the Singly Linked List and Doubly Linked List
data structure? (3 marks)
368.How Can You Store the Elements of a 2D Array in the Memory? (5 marks)
369.Define Postfix Expression (3 marks)
370.What Is a Dequeue? (3 marks)
371.Can You Explain the Working of a Selection Sort? (5 marks)
372.Can You Store a Duplicate Key in HashMap? (3 marks)
373.Is Binary Search Better Than Linear Search? (3 marks)
374.Define an AVL Tree (3 marks)
375.What Is the Left View of a Binary Tree? (3 marks)
376.What is B-tree? (3 marks)
377.Insertion in B-tree (5 marks)
378.Deletion in B-tree (5 marks)
379.Balance factor in AVl tree (3 marks)
380.380.Left rotate operation in an AVL tree
381.Why is Huffman the best compression algorithm? (3 marks)
382.How many bits may be required for encoding the message 'MISSISSIPPI'? (5
marks)
383.Write an algorithm to print codes from Huffman tree (5 marks)
384.How many nodes does a leftist tree with N nodes must have? (5 marks)
385.Disjoint set data structure (3 marks)
386.Define Hashing (3 marks)
387.Types of hashing (3 marks)

13. 388.Find max and min keys in B-tree (3 marks)
389.Create a red black tree by inserting following sequence of numbers - 8, 18, 5,
15, 17, 25, 40, and 80 (5 marks)
390.Write an algorithm to insert a node 20 to the red black tree you created in (Q-
389) (5 marks)
391.What is the space complexity of a hash table? (3 marks)
392.Merging two binomial trees (5 marks)
393.Inserting a node in a binomial heap (5 marks)
394.Write a program to find a pair with the given sum in an array using hashing (5
marks)
395.Prove that the maximum number of edges that a graph with n vertices is n*(n-
1)/2 (5 marks)
396.Search an element in separate chaining implementation (5 marks)
397.Elaborate LZW (Lempel-Ziv-Welch) compression technique (5 marks)
398.Queue overflow and underflow (5 marks)
399.Null path length of heap (3 marks)
400.What is primary clustering (3 marks)
401.Count the no.of nodes present in a Singly Linked List (5 marks)
402.Insert the elements 46, 52, 39, 74, 60, and 11 into hash table of size(T) of 7 and
h(k) = k mod T using linear and quadratic probing. (5 marks)
403.Load factor in hashing(3 marks)
404.Insert the elements 46, 52, 39, 74, 60, and 11 into hash table of size(T) of 7 and
h(k) = k mod T using linear and quadratic probing. Identify the better strategy
when the load factor is 50% (5 marks)
405.How does hash collision happen? (3 marks)
406.What are the chances of collisions with the large table? (3 marks)
407.Birthday Paradox (3 marks)
408.Open Addressing for Collision Handling (3 marks)
409.Secondary clustering (3 marks)
410.Applications of Hashing (3 marks)
411.Perfect Hashing (3 marks)
412.Distributed Hashing (3 marks)
413.Program for Red Black Tree Insertion (5 marks)
414.Tools used in Red black tree (3 marks)

14. 415.Definition of a red-black tree (3 marks)
416.Red-black tree's node structure (3 marks)
417.Why is it called a red-black tree? (3 marks)
418.Why red-black tree is balanced? (3 marks)
419.What is the maximum height of a red-black tree with 14 nodes? (5 marks)
420.How many nodes does a red-black tree have? (3 marks)
421.What is the depth property in red-black tree? (5 marks)
422.What is the difference between the Breadth First Search (BFS) and Depth First
Search (DFS)? (3 marks)
423.Define Segment Tree data structure and its applications. (3 marks)
424.What is topological sorting in a graph? (3 marks?)
425.Write code to check if two strings match where one string contains wildcard
characters (5 marks)
Addon questions
1. Check if a doubly-linked list of characters is palindrome or not using Recursion
(10 marks)
2. Write a code for bubble sort (10 marks)
3. How is the merge sort algorithm implemented? (10 marks)
4. Write to code to check whether a given year is leap year or not. (10 marks)
5. Find non-repeating characters in a string (10 marks)
6. Write a code for Heap sort (10 marks)
7. Merge two sorted lists (10 marks)
8. Intersection of two linked lists (10 marks)
9. Insert a node at the tail of a linked list (10 marks)
10. Print the Middle of a given linked list (10 marks)
11. Insert a node at the head of a linked list (10 marks)
12. How can someone insert a node at the end of Linked List? (10 marks)
13. How can someone insert a node in a random location of the Linked List? (10
marks)
14. How can we delete the first node from the singly linked list? (10 marks)
15. How can we reverse a singly linked list? (10 marks)
16. How can someone display singly linked list from first to last? (10 marks)

15. 17. Find all elements in an array that are greater than all elements to their right (10
marks)
18. Reverse a string using a stack data structure (10 marks)
19. Reverse an array (5 marks)
20. Evaluate a postfix expression (10 marks)
21. Convert Array to LinkedList (10 marks)
22. Reverse a doubly linked list (10 marks)
23. Remove Nth node from end of list (10 marks)
24. Given a singly linked list, write a program to group all odd nodes together
followed by the even nodes. (10 marks)
25. Given the head of a linked list and a value x, partition it such that all nodes less
than x come before nodes greater than or equal to x. (10 marks)
26. Josephus problem (10 marks)
27. Round robin algorithm (10 marks)
28. Convert Min heap to Max heap (10 marks)
29. Convert Max heap to Min heap (10 marks)
30. Convert binary tree to BST (10 marks)
31. Convert Linked List to array (10 marks)
32. Search an element in an array (5 marks)
33. Search an element in a Linked List (10 marks)
34. Polynomial Addition using Singly Linked List (10 marks)
35. Palindrome in Doubly Linked List (10 marks)
36. Find the common nodes between two binary search trees (10 marks)
37. Covert an array to circular linked list (10 marks)
38. Rotate a linked list (10 marks)
39. Reverse a linked list (10 marks)
40. Count no.of elements greater than all prior elements in an array (10 marks)
41. Rotate an array to the left by d position (10 marks)
42. Rotate an array to the right by d position (10 marks)
43. Move all negative elements to one side of the array (10 marks)
44. Find the kth largest and smallest element in an array (10 marks)
45. How do you find the missing number in a given integer array of 1 to 100? (5
marks)

16. 46. How is an integer array sorted in place using the quicksort algorithm? (10
marks)
47. How do you find the middle element of a singly linked list in one pass? (10
marks)
48. How do you find the length of a singly linked list? (5 marks)
49. How do you find the sum of two linked lists using Stack? (10 marks)
50. How do you find the third node from the end in a singly linked list? (10 marks)
51. How do you check if two strings are a rotation of each other? (10 marks)
52. How do you perform preorder traversal in a given binary tree? (10 marks)
53. How do you perform an inorder traversal in a given binary tree? (10 marks)
54. How do you implement a postorder traversal algorithm? (10 marks)
55. How are all leaves of a binary search tree printed? (10 marks)
56. How do you count the number of leaf nodes in a given binary tree? (10 marks)
57. How do you perform a binary search in a given array? (10 marks)
58. How do you reverse words in a given sentence without using any library
method? (5 marks)
59. Insert item into the Heap (5 marks)
60. Implement Kruskal's algorithm to find MST (10 marks)
61. Insertion in Binary Heap (10 marks)
62. Deletion in Binary Heap (10 marks)
63. Bubble sort (10 marks)
64. Quick sort (10 marks)
65. Linear search (5 marks)
66. Binary search (5 marks)
67. Merge sort (10 marks)
68. Insertion sort (10 marks)
69. Selection sort (10 marks)
70. Write a Recursive Function To Calculate the Height of a Binary Tree (10
marks)
71. Search for a node in AVL tree (10 marks)
72. Search operation in B-trees (10 marks)
73. How can you detect a cycle in a graph in AVL tree (10 marks)
74. Build min-heap (10 marks)
75. Build max-heap (10 marks)

17. 76. Insert element into leftist heap (10 marks)
77. Shell sorting (10 marks)
78. Convert decimal number to octal number (5 marks)
79. Convert binary number to decimal number (5 marks)
80. How do you code a red-black tree? (10 marks)