Data structures using C++

1. What is dynamic memory allocation? Explain the dynamic allocation and deallocation of memory to one-dimensional array. 2. What is testing and debugging?Explain the need of testing. 3. What are sparse matrices? Explain a sparse matrix with its array representation. 4. Write a program to multiply two matrices. 5. Briefly explain the usage of stack to find the path in 'Rat in a maze' problem. 6. Explain the formula based representation of Queues. 7. Explain the method of searching a sorted chain using skip list representation. 8. Write a constructor and destructor program for a skip list. 9. With a proof, explain the properties of binary tree. 10. Explain the common ways to traverse a binary tree with program. 11. Explain insertion and deletion of an element into a max heap. 12. Define a binary search tree. 13. What are template functions in c++? 14. Explain with example New and Delete operators used for dynamic memory allocation in c++. 15. Explain different methods of testing and the procedure for debugging a c++ code. 16. Explain different data representation methods. 17. What is sparse matrix? Write c++ code for adding two sparse matrices. 18. Define Stacks. 19. Explain Queues as data structures using linked representation. 20. What are skip lists? Explain how insertion and deletion operations are performed on the skip lists with example. 21. What is a priority queue? How do you differentiate minimum priority queue from maximum priority queue. write the ADT class definition for maximum priority queue. 22. List at least eight common binary tree operations. 23. Explain trees as a data structures and write the ADT class definition for binary tree. 24. Write the ADT class definition for BSTree (Binary search tree ).

25. Write short notes on: Doubly linked list, Binary tree Traversal, Circular Queue, AVL Trees. 26. In a formula based representation of linear lists, write a program to delete and insert an element. 27. In a linked representation of queue, write program to add and delete a node. 28. What is a pointer variable? Can we have multiple pointer to a variable. 29. Write a note on dynamic memory allocation. 30. What is stack? List basic operations in stack. 31. Define recursion. explain with an example. 32. What is circular queue? 33. What is linked list ? Show how an element is added and removed from the front end of the list. 34. List the advantages and disadvantages of doubly linked list over singly linked list. 35. Define the terms : Binary tree, Strictly binary tree, Complete binary tree. 36. Draw a binary tree for the expression 3 + 4 * ( 6 7 ) / 5 + 3. 37. Write an algorithm to evaluate postfix expression. 38. Convert each of the following infix expression into its postfix and prefix form. a) ( A + B ) * C D $ E * F b) A B / C * D $ E c) ( A + B ) * ( C + D E ) * F 39. What are the advantages and disadvantages of representing a stack or queue by a linked list 40. What is a binary search tree? Construct a binary search tree for the following list of integer 8,13,10,12,6,5,12.
41. Construct a binary tree for the following expressions: a) A + ( B C ) * ( E + F ) / G b) ( 5 + 6 * 7 ) $ (( 5 + 6 ) * 7 )

42. Define stack. List the operations on stack. 43. Implement reversing a string, using a stack. 44. What is the advantages of circular queue over linear queue. 45. What is recursion? Explain

46. What are binary trees? Mention different types of binary trees and explain briefly. 47. What is priority Queue? Explain different types of priority queues. 48. Explain Circular list and Doubly linked list using suitable diagram.