DSA C++ College 3rd Sem

Maintained by Soumojit Shome

Commands :

Create a Directory :

mkdir directory_name

Create File :

pluma fileName

Change Directory :

cd /path/to/directory

Compile C++ :

g++ fileName.cpp

Run :

./a.out

or

./a.exe

---

Day Wise DSA Lab Program :

1. 21 July 2023 Day 1 : Basic CPP

• Array Input Output
• Max Min
• Insert New Element in an Array
• Linear Search Without Function
• Linear Search With Function
• Binary Search

Search Name	Best Time Complexity	Average Time Complexity	Worst Time Complexity	Worst Space Complexity
Linear	O(1)	O(n)	O(n)	O(1)
Binary	O(1)	O(log n)	O(log n)	O(1)

2. 28 July 2023 Day 2 : Stack

• Stack | Push, Pop, Display
• Stack | Class | Push, Pop, Display

3. 4 Aug 2023 Day 3 : Copying Elements Between Stacks

• Stack Copy Program | Copying Elements Between Stacks

4. 11 Aug 2023 Day 4 : Queue

• Queue Without Class
• Queue With Class

5. 18 Aug 2023 Day 5 : Circular Queue

• Decimal to Binary Converter
• Circular Queue Without Class
• Circular Queue Using Class
• Creating Your Own Header File

6. 25 Aug 2023 Day 6 : Sparse Matrix

• Sparse Matrix
• File Read Write

7. 1 Sep 2023 Day 7 : Infix Postfix Prefix

• Infix to Postfix
• Infix to Prefix
• Postfix to Infix
• Prefix to Infix

8. 8 Sep 2023 Day 8 : Postfix Evaluation

• Postfix Evaluation
• Singly Linked List

9. 15 Sep 2023 Day 9 : Linked List

• Singly Linked List

10. 22 Sep 2023 Day 10 : Circular Singly Linked List

• Circular Singly Linked List

11. 6 Oct 2023 Day 11 : Sorting

• Bubble Sort
• Insertion Sort
• Selection Sort
• Quick Sort
• Merge Sort
• Heap Sort

Sorting Readme

Sort Name	Best Time Complexity	Average Time Complexity	Worst Time Complexity	Worst Space Complexity	Stable	Adaptive
Bubble	O(n)	O(n^2)	O(n^2)	O(1)	Yes	Yes
Insertion	O(n)	O(n^2)	O(n^2)	O(1)	Yes	Yes
Selection	O(n^2)	O(n^2)	O(n^2)	O(1)
Quick	O(nlogn)	O(nlogn)	O(n^2)	O(logn)		Yes
Merge	O(nlogn)	O(nlogn)	O(nlogn)	O(n)	Yes
Heap	O(nlogn)	O(nlogn)	O(nlogn)	O(n)

12. 13 Oct 2023 Day 12 : Implement a stack using singly linked list

• Implement a stack using singly linked list

13. 3 Nov 2023 Day 13 : Implement a stack and Queue using singly linked list Using Class

• Implement a Stack and Queue using singly linked list and Using Class

14. 10 Nov 2023 Day 14 : Doubly Linked List

• Doubly Linked List

15. 17 Nov 2023 Day 15 : Tree

• Linked Representation
• PreOrder Traversal
• PostOrder Traversal
• InOrder Traversal

16. 24 Nov 2023 Day 16 : Binary Tree Input Element

• Binary Tree Input Element

Graph

• BFS Breadth First Search
• DFS Depth First Search

Important

1. Binary search
2. Linear search
3. Matrix addition
4. Matrix multiplication
5. Stack using array
6. Stack using linked list
7. Infix to prefix
8. Infix to postfix
9. Postfix evaluation
10. Queue using array
11. Circular queue using array
12. Circular queue using linked list
13. Queue using linked list
14. Single linked list
15. Circular linked list
16. Double linked list
17. Polynomial addition
18. Sparse matrix addition
19. Sparse matrix subtraction
20. Bubble sort
21. Insertion sort
22. Selection sort
23. Quick sort
24. Merge sort
25. Heap sort
26. Tower Of Hanoi
27. BST formation
28. Tree traversal
29. Find the common elements between two matrices

---

Example of the algorithm of 'Tower Of Hanoi' (For n=3).

Tower Of Hanoi YouTube Video Link : Click Here

Best Of Luck 🤗 🎉