Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/bpavan16/phonesimulator-dsa-project
This is a Data Structures and Algorithms (DSA) course project created during the 3rd semester of (BE)
https://github.com/bpavan16/phonesimulator-dsa-project
algorithms course-project dsa-algorithm dsa-implementations
Last synced: about 16 hours ago
JSON representation
This is a Data Structures and Algorithms (DSA) course project created during the 3rd semester of (BE)
- Host: GitHub
- URL: https://github.com/bpavan16/phonesimulator-dsa-project
- Owner: bPavan16
- Created: 2024-01-05T13:33:29.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2025-01-16T07:35:27.000Z (2 days ago)
- Last Synced: 2025-01-16T08:32:52.451Z (2 days ago)
- Topics: algorithms, course-project, dsa-algorithm, dsa-implementations
- Language: C
- Homepage:
- Size: 60.5 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Phone Simulator
## Overview
The Phone Simulator is a C application that simulates basic phone functionalities using various data structures such as hashtables, heaps, graphs, linked lists, stacks, queues, and trees## Project Structure
```
phone-simulator
├── src
│ ├── main.c
│ ├── data_structures
│ │ ├── hashtable.c
│ │ ├── hashtable.h
│ │ ├── heap.c
│ │ ├── heap.h
│ │ ├── graph.c
│ │ ├── graph.h
│ │ ├── linkedlist.c
│ │ ├── linkedlist.h
│ │ ├── queue.c
│ │ ├── queue.h
│ │ ├── stack.c
│ │ ├── stack.h
│ │ ├── tree.c
│ │ └── tree.h
│ ├── simulator
│ │ ├── phone.c
│ │ └── phone.h
│ └── utils
│ ├── common.c
│ └── common.h
├── Makefile
└── README.md
```## Setup Instructions
1. Clone the repository:
```
git clone
```
2. Navigate to the project directory:
```
cd phone-simulator
```## Usage
After building the project, run the executable to start the phone simulator:
```
gcc main.c
./phone-simulator.out
```## Contributing
Feel free to submit issues or pull requests for improvements and enhancements.