File Details:

Questions:

1. How is a 2-dimensional array represented in memory? Discuss with an example.
2. Write a short note on Tridiagonal matrices and their applications in computer science.
3. Explain how we can represent a stack using an array and a linked list.
4. Write the algorithm for converting infix to postfix and prefix to postfix.
5. What are the applications of the stack data structure in computer science?
6. What do you understand by linear linked list and doubly linked list? Write the procedure to insert an element in the middle of a doubly linked list.
7. Differentiate between queue and deque. Give applications of each.
8. Differentiate between linear array and linked list, inorder and preorder tree traversal, binary trees and B-trees, hashing and binary search.
9. Write the procedure or steps for performing the removal of duplicate elements from a sorted linked list, construction of balanced binary search tree from given keys, and constructing an expression tree for an infix expression.
10. Write the algorithm for heapsort and trace it for a given list of numbers. What is the time complexity for performing merge sort on a list of size N?
11. Perform insertion sort on a given list. What is the complexity of this algorithm in the average case and best case?
12. Write short notes on sparse arrays, priority queue, and indexing using B-Trees.
13. Write a C program for creating a B-Tree, traversing a linked list, and binary search.