📊 Data Structures Record: College Assignments 📚

Welcome to the Data Structures Record repository! This collection of programs spans 16 weeks of intensive learning, practice, and application of data structures and algorithms using the C programming language, meticulously crafted as part of my college coursework.

🚀 Table of Contents

• Week 1: Implementation of Single Linked List
• Week 2: Implementation of Doubly Linked List
• Week 3: Applications of Singly Linked List
• Week 4: Implementation of Stack using Array and Linked List
• Week 5: Applications of Stack (Infix to Postfix)
• Week 6: Applications of Stack (Evaluating Arithmetic Expression)
• Week 7: Implementation of Queue using Array and Linked List
• Week 8: Performing Tree Traversal Techniques
• Week 9: Implementation of Binary Search Tree
• Week 10: Implementation of AVL Tree
• Week 11: Implementation of BFS, DFS
• Week 12: Performing Topological Sorting
• Week 13: Implementation of Prim’s Algorithm
• Week 14: Implementation of Dijkstra’s Algorithm
• Week 15: Program to Perform Sorting
• Week 16: Implementation of Collision Resolution Techniques

Week-by-Week Breakdown

Week 1: Implementation of Single Linked List

• Document: Week 1
• Content: Implementation of single linked list with insertion, deletion, and display operations.

Week 2: Implementation of Doubly Linked List

• Document: Week 2
• Content: Implementation of doubly linked list with insertion, deletion, and display operations.

Week 3: Applications of Singly Linked List

• Document: Week 3
• Content: Using singly linked list for polynomial manipulation (addition, subtraction, multiplication).

Week 4: Implementation of Stack using Array and Linked List

• Document: Week 4
• Content: Implementation of stack using both array and linked list representations.

Week 5: Applications of Stack (Infix to Postfix)

• Document: Week 5
• Content: Using stack to convert infix expressions to postfix notation.

Week 6: Applications of Stack (Evaluating Arithmetic Expression)

• Document: Week 6
• Content: Using stack to evaluate arithmetic expressions.

Week 7: Implementation of Queue using Array and Linked List

• Document: Week 7
• Content: Implementation of queue using both array and linked list representations.

Week 8: Performing Tree Traversal Techniques

• Document: Week 8
• Content: Implementing tree traversal techniques: inorder, preorder, and postorder.

Week 9: Implementation of Binary Search Tree

• Document: Week 9
• Content: Implementation of binary search tree with insertion, deletion, and search operations.

Week 10: Implementation of AVL Tree

• Document: Week 10
• Content: Implementation of AVL tree for self-balancing binary search tree operations.

Week 11: Implementation of BFS, DFS

• Document: Week 11
• Content: Implementing breadth-first search (BFS) and depth-first search (DFS) algorithms.

Week 12: Performing Topological Sorting

• Document: Week 12
• Content: Implementing topological sorting of a directed graph using DFS.

Week 13: Implementation of Prim’s Algorithm

• Document: Week 13
• Content: Implementing Prim’s minimum spanning tree (MST) algorithm.

Week 14: Implementation of Dijkstra’s Algorithm

• Document: Week 14
• Content: Implementing Dijkstra’s shortest path algorithm.

Week 15: Program to Perform Sorting

• Document: Week 15
• Content: Implementing various sorting algorithms: quick sort, merge sort.

Week 16: Implementation of Collision Resolution Techniques

• Document: Week 16, Week 16B, Week 16C
• Content: Implementing collision resolution techniques: open addressing, closed addressing, rehashing.