Data Structures: (Initiated by Shivanand…)

Basic Concepts:
1. Define the term algorithm.
2. Define linear data structure and non-linear data structure.
3. Define queue. State any two applications where queue is used.
4. Differentiate between stack and queue (any two points).
5. Differentiate between linear and non-linear data structures on any two parameters.
6. Define complexity and classify it.
7. Define Abstract data type.
8. Define the terms:
(i) Sibling
(ii) Depth of tree
9. Define the terms:
(i) Binary tree
(ii) Binary search tree
10. Define the terms:
(i) In-degree
(ii) Out-degree

Operations on Data Structures:

1. List any four operations on data structure.
2. Write any four operations that can be performed on data structure.
3. List any four applications of stack.
4. List any four types of queue.
5. List any four applications of queue.
6. Enlist queue operations condition.
7. Write an algorithm to count number of nodes in singly linked list.
8. Define overflow and underflow with respect to stack.

Graphs and Trees:

1. Describe undirected graph with a suitable example.
2. Describe directed and undirected graph.
3. Differentiate between tree and graph with respect to any four parameters.
4. Explain in-degree and out-degree of a graph with an example.
5. Draw and explain construction of circular queue.
 6. Explain node structure for single linked list. Also, write advantages of singly list over array
(any two).
7. Explain the working of Binary search with an example.

Stack:
1. Show the effect of PUSH and POP operations on the stack of size 10. Push (10), Push (20),
Pop, Push (30).
2. Write an algorithm for performing push and pop operations on stack.
3. Describe stack overflow and stack underflow with an example.

Queue:
1. Describe queue full and queue empty operation conditions on linear queue with suitable
diagrams.
2. Draw a binary search tree for the given numbers: 50, 33, 44, 22, 77, 35, 60, 40.
3. Sorting and Searching Algorithms:

Sorting Algorithms:
1. Describe the working of bubble sort with an example.
2. Sort the following numbers in ascending order using quick sort. Given numbers: 50, 2, 6, 22,
3, 39, 49, 25, 18, 5.
3. Describe working of selection sort with an example. Also, sort given input list in ascending
order using selection sort: 55, 25, 5, 15, 35.
4. Sort the following numbers in ascending order using Bubble sort. Given numbers: 29, 35, 3,
8, 11, 15, 56, 12, 1, 4, 85, 5 & write the output after each interaction.
5. Sort the given numbers in ascending order using Radix sort: 348, 14, 641, 3851, 74.
6. Describe working of selection sort method with suitable example.
7. Describe the working of Radix sort method with an example.

Searching Algorithms:
1. Differentiate between linear search and binary search.
2. Explain the working of Binary search with an example.
3. State any two differences between linear search and binary search.
4. Find the position of element 29 using binary search method in an array ‘A’ given below: A =
{11, 5, 21, 3, 29, 17, 2, 43}.
5. Find the position of element 21 using binary search method in Array ‘A’ given below: A = {11,
5, 21, 3, 29, 17, 2, 45}.
 6. Evaluate the following postfix expression: 5, 6, 2, +, *, 12, 4, /, – Show diagrammatically each
step of evaluation using stack.
7. Evaluate the following arithmetic expression P written in postfix notation: P : 4, 2, ^, 3, *, 3,
–, 8, 4, /, +.

Linked List:
1. Describe the concept of linked list with the terminologies: node, next pointer, null pointer,
and empty list.
2. Create a singly linked list using data fields 15, 20, 22, 58, 60. Search a node 22 from the SLL
and show procedure step-by-step with the help of diagram from start to end.
3. Create singly linked list using data fields 10, 20, 30, 40, 50 and show step-by-step procedure
with the help of diagram from start to end.
4. Write an algorithm to delete an intermediate node from a singly linked list.
5. Write an algorithm to insert a new node at the beginning and end of singly linked list.
6. Write an algorithm to delete a node from the beginning of a circular linked list.
7. Explain the advantages of circular linked list over linear linked list with example.

Expression Conversion and Evaluation:

1. Convert the following infix expression into prefix expression: (A + B) * (C / G) + F.

2. Convert the following infix expression to its prefix form using stack: A + B – C * D / E + F.
3. Convert the following infix expression into postfix form using stack: A + B – C * D/E + F.
4. Convert the following infix expression to postfix expression using stack and show the details
of stack in each step: Expression: A * B ↑ C – D / E + [F / G].
5. Convert the following expression into postfix form. Give stepwise procedure: A + B ↑ C * (D
/ E) – F / G.
6. Convert the following infix expression to postfix expression using stack: (A + B – C + D * E / F
^ G).

Miscellaneous:
1. Define pointer and null pointer.
2. List any four types of queue.
3. Explain the concept of recursion using stack.
4. Explain the time and space complexity of the following algorithms in terms of time and
space:
(i) Binary search
 (ii) Bubble sort
5. Write an algorithm to count number of nodes in singly linked list.
6. Show the effect of PUSH and POP operations on the stack of size 10. PUSH(10), PUSH(20),
POP, PUSH(30), POP, and final structure.
7. Draw tree for given expression: (a – 2b + 5c)3 * (6d – 8e)7.
8. Write a program in C to search a particular data from the given array using Linear Search.

2 Marks Questions:
1. Define the term algorithm.
2. Define linear data structure and non-linear data structure.
3. Define queue. State any two applications where queue is used.
4. Define complexity and classify it.
5. Define Abstract Data Type.
6. Define the terms:
a. Sibling
b. Depth of tree
c. In-degree
d. Out-degree
7. What is the need for a linked list?
8. What is a binary tree?
9. What is the difference between depth-first search and breadth-first search?
10. What is a circular queue?
11. What is an adjacency matrix?
12. Define Binary Search Tree (BST).
13. Define the terms:
a. Leaf node
b. Root node in a binary tree.
14. Define Priority Queue.
4 Marks Questions:
1. Differentiate between stack and queue (any two points).

2. Differentiate between linear and non-linear data structures on any two parameters.

3. Define the terms:

(i) Binary tree

(ii) Binary search tree

4. List any four operations on data structure.

5. List any four applications of stack.

6. List any four types of queue.

7. List any four applications of queue.

8. Enlist queue operations condition.

9. Write an algorithm to count the number of nodes in a singly linked list.

10. Define overflow and underflow with respect to stack.

11. Discuss the advantages of linked list over arrays.

12. Differentiate between singly linked list and doubly linked list.

13. What are the advantages and disadvantages of using a stack?

14. Explain the operations in a circular queue.

15. Explain different types of linked lists.

16. Write an algorithm for Inorder tree traversal.

17. Write an algorithm for Preorder tree traversal.

18. Write an algorithm for Postorder tree traversal.

6 Marks Questions:
1. Describe undirected graph with a suitable example.

2. Describe directed and undirected graph.

3. Explain stack operations in detail.

4. Explain tree traversal techniques with examples.

5. Explain different types of linked lists.

6. Discuss different types of trees with examples.

7. Explain the concept of a priority queue with its applications.

8. Explain Depth-First Search (DFS) and Breadth-First Search (BFS) in graphs.

9. Write a program to implement a stack using linked list.

10. Write a program to implement a queue using linked list.

11. Explain the working of circular linked list with an example.

12. Write an algorithm to delete a node in a singly linked list.

13. Write a program to search an element in a binary search tree (BST).

14. Describe and implement a depth-first search (DFS) algorithm for a graph.

15. Describe and implement a breadth-first search (BFS) algorithm for a graph.
Most commonly asked questions

1. Define the term algorithm

2. List any 4 applications of queue

3. Differentiate between stack and queue

4. Define Binary tree

5. Define Binary search tree

6. Describe directed and undirected graph

7. Differentiate between linear and non-linear data structures

8. Describe the concept of linked list

9. Describe queue full and queue empty operation conditions on linear queue

10. Write a C program to implement bubble sort

11. Differentiate between tree and graph

12. Explain the working of Binary search with an example

13. Write a program to traverse a linked list

14. Describe circular linked list with suitable diagram

15. Explain time and space complexity with an example

16. Convert infix expression to postfix using stack

17. Write an algorithm for preorder traversal of a binary tree

18. Evaluate the postfix expression

19. Write an algorithm to delete a node from singly linked list

20. Differentiate between binary search and sequential search

21. Write an algorithm to insert a new node at the beginning and end of a singly linked list

22. Explain stack overflow and stack underflow with examples

23. Show memory representation of stack using array

24. Draw the tree structure for given expressions

25. Differentiate between Linked List and Array

26. Describe the concept of circular Queue along with its need

27. Show the effect of PUSH and POP operations on the stack

28. Create a singly linked list using data fields

29. Explain node structure for singly linked list

30. Differentiate between stack and queue

31. Write a C program for insertion, deletion in an array

32. Evaluate arithmetic expressions written in postfix notation

33. Find the position of an element using binary search

34. Explain the working of selection sort with example

35. Differentiate between linear list and circular list

36. Describe the working of Radix sort method with an example

37. Write an algorithm to count the number of nodes in a singly linked list

38. Explain the working of linear search with example

39. Describe the effect of PUSH and POP operations on a stack of size 10