Introduction

Congratulations on reaching the final module of the Data Structures course! This section is designed to help you apply the knowledge and skills you've acquired throughout the course. You will find a selection of final projects that cover various data structures and their applications. These projects are intended to challenge you and solidify your understanding of the concepts.

Project 1: Implementing a Library Management System

Objective

Create a library management system that uses different data structures to manage books, members, and transactions.

Requirements

Books Management:
- Use a Linked List to store book information (title, author, ISBN, availability).
- Implement functions to add, remove, and search for books.
Members Management:
- Use a Queue to manage the list of members waiting to borrow a book.
- Implement functions to add and remove members from the queue.
Transactions Management:
- Use a Stack to keep track of the borrowing and returning transactions.
- Implement functions to push and pop transactions.

Example Code Snippet

class Book:
    def __init__(self, title, author, isbn):
        self.title = title
        self.author = author
        self.isbn = isbn
        self.available = True

class Library:
    def __init__(self):
        self.books = LinkedList()
        self.members = Queue()
        self.transactions = Stack()

    def add_book(self, book):
        self.books.append(book)

    def remove_book(self, isbn):
        # Implement removal logic
        pass

    def search_book(self, title):
        # Implement search logic
        pass

    def add_member(self, member):
        self.members.enqueue(member)

    def remove_member(self):
        return self.members.dequeue()

    def borrow_book(self, isbn, member):
        # Implement borrowing logic
        pass

    def return_book(self, isbn, member):
        # Implement returning logic
        pass

Exercise

Implement the remove_book and search_book methods.
Implement the borrow_book and return_book methods.
Test your library management system with various scenarios.

Project 2: Social Network Graph

Objective

Create a social network graph where users can follow each other, and you can find the shortest path between two users.

Requirements

User Management:
- Use a Graph to represent users and their connections.
- Implement functions to add users and create connections (edges).
Shortest Path:
- Implement Dijkstra's algorithm to find the shortest path between two users.

Example Code Snippet

class User:
    def __init__(self, name):
        self.name = name
        self.connections = []

class SocialNetwork:
    def __init__(self):
        self.users = {}

    def add_user(self, user):
        self.users[user.name] = user

    def add_connection(self, user1, user2):
        self.users[user1].connections.append(user2)
        self.users[user2].connections.append(user1)

    def shortest_path(self, start_user, end_user):
        # Implement Dijkstra's algorithm
        pass

Exercise

Implement the shortest_path method using Dijkstra's algorithm.
Test your social network graph with various users and connections.

Project 3: E-commerce Product Catalog

Objective

Create an e-commerce product catalog that allows users to search for products and sort them by different criteria.

Requirements

Product Management:
- Use a Binary Search Tree (BST) to store product information (name, price, category).
- Implement functions to add, remove, and search for products.
Sorting:
- Implement functions to sort products by price and category.

Example Code Snippet

class Product:
    def __init__(self, name, price, category):
        self.name = name
        self.price = price
        self.category = category

class ProductCatalog:
    def __init__(self):
        self.products = BinarySearchTree()

    def add_product(self, product):
        self.products.insert(product)

    def remove_product(self, name):
        # Implement removal logic
        pass

    def search_product(self, name):
        # Implement search logic
        pass

    def sort_by_price(self):
        # Implement sorting logic
        pass

    def sort_by_category(self):
        # Implement sorting logic
        pass

Exercise

Implement the remove_product and search_product methods.
Implement the sort_by_price and sort_by_category methods.
Test your product catalog with various products and sorting criteria.

Conclusion

These final projects are designed to help you apply the concepts and techniques you've learned throughout the course. By completing these projects, you will gain practical experience in implementing and using data structures in real-world scenarios.

Final Projects

Introduction

Project 1: Implementing a Library Management System

Objective

Requirements

Example Code Snippet

Exercise

Project 2: Social Network Graph

Objective

Requirements

Example Code Snippet

Exercise

Project 3: E-commerce Product Catalog

Objective

Requirements

Example Code Snippet

Exercise

Conclusion

Data Structures Course

Module 1: Introduction to Data Structures

Module 2: Lists

Module 3: Stacks

Module 4: Queues

Module 5: Trees

Module 6: Graphs

Module 7: Conclusions and Additional Resources