This repository contains C code implementing various exercises related to data structures. Below is a brief overview of the exercises covered in this repository along with a guide on how to navigate through the code.
-
Exercise 1 - Matrix Operations
- Implementation of basic matrix operations including retrieval, update, and addition of matrices.
- Demonstrates fundamental concepts of array manipulation in C.
-
Exercise 2 - Placeholder
- This exercise serves as a placeholder and currently does not contain any specific implementation.
-
Exercise 3 - Student Directory Management
- Implementation of a student directory management system.
- Features include adding students, displaying all students, displaying students by course, and preloading sample student data.
-
Exercise 4 - LIFO Stack (Simple)
- Implementation of a LIFO (Last In, First Out) stack using arrays.
- Includes functionalities for pushing elements onto the stack and popping elements from the stack.
-
Exercise 5 - LIFO Stack (Linked Lists)
- Implementation of a LIFO stack using linked lists.
- Provides functionalities for pushing and popping elements from the stack.
-
Exercise 6 - Placeholder
- This exercise serves as a placeholder and currently does not contain any specific implementation.
- Clone the repository to your local machine using
git clone <repository-url>. - Navigate to the cloned directory.
- Compile the C code using a C compiler such as GCC.
- Execute the compiled binary to interact with the implemented exercises.
- Run the
mainprogram to access the exercise menu. - Choose the desired exercise by entering the corresponding number.
- Follow the on-screen prompts to interact with the chosen exercise.
This repository was created as an assignment for the Data Structures course at the University of Piraeus. The code was developed by the students as part of their coursework.
This repository is provided under the MIT License. You are free to use and modify the code for educational purposes.