This project is developed in C++ and includes several laboratory works and a course project, focusing on fundamental data structures and algorithms.
-
Lab 1: Doubly Linked List
- Implementation of a doubly linked list with basic operations such as insertion, deletion, and traversal.
-
Lab 2: Divide and Conquer
- Implementation of divide and conquer algorithms, demonstrating the principle of breaking down a problem into smaller sub-problems.
-
Lab 3: Sorting Algorithms
- Implementation of various sorting algorithms:
- Insertion Sort
- Selection Sort
- Bubble Sort
- Merge Sort
- Shell Sort
- Quick Sort
- Implementation of various sorting algorithms:
-
Lab 4: Binary Tree
- Implementation of a binary tree with fundamental operations such as insertion, deletion, and traversal.
-
Course Project: Huffman Coding Algorithm
- Implementation of the Huffman coding algorithm for data compression.
- C++17 or higher
- A C++ compiler (e.g., g++, clang++)