University Codes

Coding Exercises and Experiments.

🗃️ DBMS Class Labs

• First lab (basic commands | RDBMS: MySQL)
• Basic implementation of ER diagram (ER diagram to Relational Model, University database simulation | RDBMS: PostgreSQL)

📐 Data Structure & Algorithms Class Exercises

💾 Data Structures

Dynamic Linear Data Structures

• 3a. Stack (with std::vector)
• 3b. Queue (with singly linked list, with tail)
• 3c. Circular Queue (with std::vector)
• 3d. Priority Queue (with std::vector)

Linked Lists

• 4a. Singly Linked List (with tail)
• 4b. Doubly Linked List (with tail)
• 4c. Circular Linked List (with singly linked list, with tail pointing to head)
  
  

Graphs

• Finite Multi Graph (implemented using std::vector and std::unordered_map. can be made directed or undirected)
  • Vertex (storing neighbors and edge costs in std::unordered_map inside corresponding vertices)

📑 Algorithms

Searching Algorithms

• 1a. Linear Search
• 1b. Binary Search
• 1c. Fibonacci Search

Evaluation of Arithmetic Expression

• 2.a Arithmetic Expression Conversion(infix -> prefix, infix -> postfix)
• 2.b Evaluation of Arithmetic Expression(prefix, postfix)

Tree traversal techniques

• 5a. Inorder
• 5b. Preorder
• 5c. Postorder
• 5d. Breadth First Search
• 5e. Depth First Search

Graph traversal techniques

• 6a. Breadth First Search (BFS on a Finite Multi Graph, refer to Data Structure Folder for Finite Multi Graph Implementation)
• 6b. Depth First Search (DFS on a Finite Multi Graph, refer to Data Structure Folder for Finite Multi Graph Implementation)

Dijkstra's Algorithm

• 7. Dijkstra's Algorithm for Single Source Shortest Path

Sorting Algorithms

• 9.a Merge Sort
• 9.b Quick Sort

📇 Object Oriented Programming Class Exercises

• OOP and C++ concepts examples (example for use of: classes, inheritance, polymorphism, friend function, operator overloading, constructor overloading, solve diamond problem)
• Example of Copy Contructor and Operator Overloading (example for use of: copy constructor, operator overloading)