This repository contains the programs and resources developed during the CST201 Data Structures Lab sessions.
Contributors:
This repository serves as a central hub for sharing and referencing the lab programs and resources created in CST201. It aims to:
- Facilitate collaboration: Students can access and share code and resources with each other, enabling better understanding and troubleshooting.
- Maintain a record of work: Programs and resources are preserved for future reference and revision.
- Promote learning: Sharing and reviewing code and resources promotes knowledge exchange and reinforces key data structures concepts.
The repository is organized into folders corresponding to each data structure or algorithm covered in the lab sessions:
- Binary Search Tree: Contains programs and resources related to implementing and manipulating binary search trees.
- Binary Search: Contains programs and resources related to implementing the binary search algorithm.
- Graph: Contains programs and resources related to representing and manipulating graphs using various techniques.
- Hashing-closed: Contains programs and resources related to implementing closed hashing for efficient data storage and retrieval.
- Hashing-open: Contains programs and resources related to implementing open hashing to handle collisions in hash tables.
- Infix to Postfix Conversion: Contains programs and resources related to converting infix expressions to postfix expressions.
- Linear Search: Contains programs and resources related to implementing the linear search algorithm.
- Linked List: Contains programs and resources related to implementing various operations on linked lists.
- Polynomial Addition: Contains programs and resources related to adding polynomials using linked lists.
- Polynomial Multiplication: Contains programs and resources related to multiplying polynomials using linked lists.
- Postfix Evaluation: Contains programs and resources related to evaluating postfix expressions.
- Queue/Priority Queue: Contains programs and resources related to implementing and manipulating queues and priority queues.
- Sorting: Contains programs and resources related to implementing various sorting algorithms like bubble sort, selection sort, insertion sort, etc.
- Sparse Matrix: Contains programs and resources related to representing and manipulating sparse matrices.
- Stack: Contains programs and resources related to implementing and manipulating stacks.
- Fork the repository: This creates your own copy of the code and resources, allowing you to make modifications and contribute your work.
- Clone the repository: Download your forked copy to your local machine.
- Navigate to the relevant folder based on the data structure or algorithm you want to explore.
- Review and explore the provided programs and resources.
- Feel free to modify and adapt the code and resources for your own learning or project purposes.
Contributions are welcome to this repository. Please consider contributing by:
- Adding programs and resources from your own lab sessions.
- Improving existing code or documentation.
- Reporting any issues or bugs.
Before contributing, please review the following guidelines:
- Ensure your contributions are relevant to the CST201 course.
- Follow the existing coding style and formatting.
- Provide clear and concise comments for your code.
- Open a pull request for your contributions.
This repository is licensed under the MIT License. Please refer to the LICENSE file for details.
For any questions or feedback, please feel free to open an issue on the GitHub repository.
Important
This repository is intended for educational purposes only. The provided programs may be incomplete or contain errors. Use them at your own risk and discretion.