File Details:

Questions:

1. Define Array, Multidimensional Array, Sparse Array, and Tridiagonal Array. Give examples of each.
2. How are sparse matrices represented in memory? Write an algorithm to add two such matrices.
3. Write an explanatory note on Polish Notation and its application to Computer Science.
4. Write an explanatory note on Evaluation of Postfix Notation.
5. Explain the Overflow and Underflow conditions with respect to the Stack Data Structure.
6. Discuss the Applications of Stack in implementing recursion. Provide examples to support your answer.
7. Differentiate between Queue and Deque.
8. Differentiate between Prefix and Infix.
9. Differentiate between D-Queue and Priority Queue.
10. What are the applications of linked lists in Computer Science? Why are linked lists known as dynamic data structures?
11. Illustrate the operations of list traversal and insertion with the help of pseudocode.
12. Give the recursive definition for tree.
13. Define Binary Tree and Complete Binary Tree.
14. What do you understand by Binary Search Tree? Construct a Binary Search Tree for the given numbers and explain how search operations are performed efficiently.
15. Write short notes on Tree Traversal.
16. Write short notes on Expression Trees.
17. Write short notes on Path Length.
18. Differentiate between Circular List and Doubly Linked List.
19. Differentiate between B-Tree and Binary Search Tree.
20. Differentiate between Indexing and Searching in a B-Tree.
21. Write the recursive algorithm for inserting an element into a tree.
22. Write the algorithm for converting from Infix to Postfix notation and illustrate with an example.