MCA 206: Data Structures Using C++ Lab

Lectures: 6 Periods/Week Sessional Marks: 30
University Exam: 3 Hours University Examination Marks: 70


Lab cycle

  1. Write a program for implementing the operations on complex numbers using classes.
  2. Program for finding the area of circle, rectangle and room using function overloading.
  3. Program for finding the volume of box using constructor overloading.
  4. Program for Sorting 'n' elements Using bubble sort technique.
  5. Sort given elements using Selection Sort.
  6. Sort given elements using Insertion Sort.
  7. Sort given elements using Merge Sort.
  8. Sort given elements using Quick Sort.
  9. Implement the following operations on single linked list.
    (i) Creation (ii) Insertion (iii) Deletion (iv) Display
  10. Implement the following operations on double linked list.
    (i) Creation (ii) Insertion (iii) Deletion (iv) Display
  11. Implement the following operations on circular linked list.
    (i) Creation (ii) Insertion (iii) Deletion (iv) Display
  12. Programfor splitting given linked list.
  13. Programfor traversing the given linked list in reverse order.
  14. Merge two given linked lists.
  15. Create a linked list to store the names of colors.
  16. Implement Stack Operations Using Arrays.
  17. Implement Stack Operations Using Linked List.
  18. ImplementQueue Operations Using Arrays.
  19. ImplementQueue Operations Using Linked List.
  20. Implement Operations on CircularQueue.
  21. Construct and implement operations on PriorityQueue.
  22. Implement Operations on double ended Queue.
  23. Converting infix expression to postfix expression by using stack.
  24. Write program to evaluate post fix expression.
  25. Implement Operations on two way stack.
  26. Add two polynomials using Linked List.
  27. Multiply Two polynomials using Linked List.
  28. Construct BST and implement traversing techniques recursively.
  29. Implement preorder traversal on BST non recursively.
  30. Implement inorder traversal on BST non recursively.
  31. Implement postorder traversal on BST non recursively.
  32. Implement binary search techniques recursively.