https://github.com/talhat298/cse2122

This lab covers core data structures and algorithms, including array operations, linked lists, stacks, queues, recursion, and tree manipulation. It also explores graph algorithms, matrix operations, and sorting techniques, providing hands-on experience with fundamental concepts in computer science.
https://github.com/talhat298/cse2122

cpp

Last synced: 6 months ago
JSON representation

This lab covers core data structures and algorithms, including array operations, linked lists, stacks, queues, recursion, and tree manipulation. It also explores graph algorithms, matrix operations, and sorting techniques, providing hands-on experience with fundamental concepts in computer science.

• Host: GitHub
• URL: https://github.com/talhat298/cse2122
• Owner: TalhaT298
• Created: 2024-11-18T17:42:20.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2024-11-19T20:50:37.000Z (over 1 year ago)
• Last Synced: 2025-04-05T19:32:50.698Z (over 1 year ago)
• Topics: cpp
• Language: C
• Homepage:
• Size: 91.8 KB
• Stars: 0
• Watchers: 1
• Forks: 2
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
## CSE2122P (Data Structure)

### Array, Records and Pointers:

1. **Traversing:** Carry out the following operations on an Array:

   - a) Maximum Value

   - b) Minimum Value

   - c) Average Value

   - d) Total Value

   - e) Sin Value

2. **Inserting:** Insert:

   - a) 54 to a sorted array.

   - b) Rahim to a sorted array.

   - c) 99 to position 5.

   - d) Karim to position 5.

3. **Deleting:**

   - a) Delete Karim from a sorted array.

   - b) Delete an Item from position 2.

4. **Sorting:**

   - a) Sort integer data using Bubble sort.

   - b) Sort string data using Bubble sort.

5. **Searching:**

   - a) Search for 77 using Linear/Binary Search.

   - b) Search for Karim using Linear/Binary Search.

6. **Merging:**

   - a) Add two integer type arrays.

   - b) Add two character type arrays.

7. **Copy elements of a 2D array into a 1D/linear array** and print the elements of group 3 from the 1D array.

8. **Matrix:** Addition/Subtraction/Multiplication of two matrices.

9. **Sparse Matrix:** Store the element of a Triangular matrix A into a 1D array B and locate the elements A32 in the array B.

---

### Linked List:

1. **Create a Linked List** and store the value 5, 3, 9, 42, 0, 10.

2. **Traversing:** Perform the same operations as done on Array.

3. **Inserting:** Perform the same operations as done on Array.

4. **Deleting:** Perform the same operations as done on Array.

5. **Sorting:** Sort the contents of a list.

6. **Searching:** Perform the same operations as done on Array.

---

### STACKS, QUEUES, RECURSION:

1. **Push an Item onto a Stack.**

2. **Delete the top element of Stack.**

3. **Find the value of an Arithmetic expression P** written in Postfix notation.

4. **Transform an Infix expression into Postfix expression.**

5. **Find the value of an Arithmetic expression I** written in Infix notation.

6. **Sort 10 integer data using Quick-Sort algorithm.**

7. **Calculate the factorial of a given number using recursive technique.**

8. **Calculate the Nth Fibonacci number** using recursive technique.

9. **Solve the Towers of Hanoi problem for N disks.**

10. **Insert an element into a queue.**

11. **Delete an element from a queue.**

---

### TREE:

1. **Write a program to insert an element in a Binary Search Tree;** if the element is already inserted before, then display the location.

2. **Write a program to insert an element into the heap.**

3. **Write a program to delete an element from the heap.**

4. **Traverse the tree in preorder.**

5. **Traverse the tree in inorder.**

6. **Traverse the tree in postorder.**

---

### GRAPH AND THEIR APPLICATION:

1. **Write a program that takes an Adjacency matrix A** with `m` vertices as input and outputs the following:

   - a) Adjacency of V1, V2, ................., Vm

   - b) Number of paths of length 2 from Vi to Vj.

   - c) Number of paths of length 3 from Vi to Vj.

   - d) Number of paths of length 4 from Vi to Vj.

2. **Take adjacency matrix with `m` nodes as input** and calculate Br and from that calculate the Path Matrix, then determine whether the matrix is strongly connected or not.

3. **Find the Path Matrix** of an adjacency matrix with `m` nodes using Warshall’s Algorithm.

4. **Find the shortest path** of a Weighted Graph G with `m` nodes V1, V2, … , Vm and weight of each edge is w(e) using Warshall’s Algorithm.

5. **Write a program to create a Linked Representation of Graph,** enter some data, and read those data from the Graph.

6. **Write a program to traverse a Graph** represented in a Linked List using Breadth-First Search.

7. **Write a program to traverse a Graph** represented in a Linked List using Depth-First Search.

---