Data Structures in C++ Lab Question Bank(OU)

MCA I/II Data Structure in C ++ Lab

1. Write a class to implement a Stack. Use the Stack to evaluate postfix expression.

2. Write a class to implement a Stack. Use the Stack to convert infix to postfix expression.

3. Write a class to implement a growing Stack. A growing stack doubles its size whenever it overflows.

4. Write a template class to implement a Stack. Use the Stack to evaluate postfix expressions.

5. Write a class to implement a queue.

6. Write a template class to implement a queue.

7. Write a class to represent a polynomial as a linked list. Write a C ++ program to add two polynomials.

8. Write a C ++ class to implement binary search. Represent the list of item as a template class.

9. Write a C ++ class to implement linear search. Represent the list of items As a template class. Demonstrate it by searching for items of integers and strings.

10. Write a C ++ to implement hashing.

11. Write a class to implement Selection sort. Represent the list of items to be sorted as a template.

12. Write a class to implement shell sort. Represent the list of items to be sorted as a template.

13. Write a class to implement merge sort. Represent the lists of items to be sorted as template.

14. Write a class to implement Quick sort. Represent the list of items to be sorted as template.

15. Write a class to implement inorder traversal of binary tree.

16. Write a class to implement preorder traversal of binary tree.

17. Write a class to implement post order traversal of binary tree.

18. Write a class to implement heapsort.

19. Write a class to implement binary search tree. Balance the tree as an AVL tree.

20. Write a class to implement binary search tree.

21. Write a class to implement Breadth First Search of a graph.

22. Write a class to implement Depth First Search of a graph.

23. Write a class to implement binary and linear searches on a list of items represent as an array.

24. Write a class to implement a singly linked list of integer.

25. Write a class to implement a doubly linked list of strings.

26. Write a class to implement a singly linked list of strings.

27. Write a class to implement doubly linked list of strings.

28. Write a class to implement a stack using linked list.

29. Write a class to implement a queue using linked list.

30. Write a class to implement a circular list.

*****