My laboratory works/assignments for Algorithms and Data Structures. This whole repository was coded with C and written in Indonesian language. Feel free to take inspiration from any of my assignments.
- C Programming Language
- Minimal amount of frameworks (simple programs)
- Usage of C algorithms and data structure
- Coded in a Windows 64-bit environment
- Coded in Indonesian - some with English
- File Processing
- Pointer and Array Passing
- Structure
- Modular Programming
- Linked List: Singular Linked List, Doubly Linked List, Doubly Circular Linked List
- Hash Tables
- Stack
- Queue
- Tree: Binary Balancing Tree, AVL Tree, Binary Search Tree, Spanning Tree
- Disjoint Set
- Graph (Adjacency Matrix)
- Linked List Manipulations
- Basic Sorting: Bubble Sort, Selection Sort, Insertion Sort
- Advanced Sorting: Quick Sort, Merge Sort, Shell Sort, Radix Sort
- Searching: Sequential Search, Binary Search, Interpolation Search
- Hashing: Linear Probing, Rehashing, Quadratic Probing, Separate Chaining
- Union-Find Disjoint Set
- Breadth First Search, Depth First Search
- Topological Sort
- Travelling Salesman Problem
- Dijkstra Shortest Path Algorithm
- Prim's and Kruskal's Minimum Spanning Tree Algorithm
- Week 2 consists of making a 3D-shape volume and area calculator. The results are then stored in a structure which you can call anytime with the history function. Featuring usage of pointers, and structures.
- Week 3 consists of two programs. The first program is a text transformator program that swaps the lowercase sentences to uppercase sentences, uppercase to lowercase sentences, and a switch function that transforms lowercase into uppercase and vice versa. The second program is a 3x3 matrix calculator. This program can multiply, add, and transpose two 3x3 matrices.
- Week 4 consists of three programs. First program is text-trasformator with memory allocation, second program is a matrix calculator with memory allocation. The final and 'big' program is a system/program to rent a room. Rent-a-room is a program which uses Single Linked Lists as its main lifeblood. You can use this program to borrow rooms, delete already borrowed rooms (for now, only deleting all is possible), and display all borrowed rooms. This program illustrates the concepts of adding, deleting, and displaying the contents of Single Linked Lists. Another feature is that you cannot borrow a room which has already been borrowed by someone else. The algorithm for not being able to borrow already borrowed room feature is quite simple but it takes time to wrap your head around it (I've been there too).
- Week 5 is an improvisation of rent-a-room program. I added a feature to delete, and approve requests to rent a room. Deleting the room is an applied concept of deleting in Linked Lists. Approving requests is just a really small feature that improves the beauty of the program.
- Week 6 has two programs. The first program is to sort data from name, weight, and height with basic sorting algorithms like bubble sort, selection sort, and insertion sort. The second program is an improvisation of the Week 5 program. The program uses radix sort to sort the identification number that was inputted in the program.
- Week 7 has a simple program that takes user's name, and 14 last grades. Then, the program will sort the data in either ascending or descending format with more advanced algorithm than Week 6's first program. The algorithms are Quick Sort, Merge Sort, and Shell Sort. The last 10 grades will be calculated and divided by 10 to show the average grade that the user gets. Finally, the program can output all the sorted data inserted into it via a Doubly Linked List.
- Week 8 has two programs. The first program is a very simple program to binary search a data from an array. The second big program is called 'activities'. The program allows you to display a list of data from a file, do ascending sort based on name a data from .txt file with different algorithms, search a data from a .txt file with different algorithms, add a new activity with a randomized ID to a .txt file.
- Week 9 has a simple program that reads from a file. From there, you can search for any of the data that is in the file with the keyword being the first three characters. Then, you can add a new data or delete a data. The program is an application of hashing and usage of hash tables.
- Week 10 has two programs for stack and queue data structure. The stack one is a parenthesis expression checker (it checks "({[]})" symbols). A valid expression is an expression that has the same amount of opening and closing symbols, meaning that it is balanced in every way possible. Characters like 1, a, C, are not valid parenthesis characters! Exit the program by typing "-1" in the program when it asks for an expression. The second program is an application of queue data structure. It takes any numbers and if the queue is empty, then the program will enqueue that number, that number of times. An example of this would be if you typed 3 into the program and the queue is empty, then the program will output "333". If the queue is not empty, then there would be an if statement. If the number that you put is less than what is in the front of the queue, then the program will dequeue the numbers in the queue that number of times. Example, if there is "333" in the queue and you put 2 in the program, then the program will dequeue the 3 two times, so it results in "3". If the number you put is larger than the front of the queue, or same as in the front of the queue, then the program will enqueue the number the front amount of times. Example, if there is "333" in the queue and you put 4 in the program, then the program will output "333444". I know this week is a bit confusing, but it is actually really simple once you get your head wrapped around it.
- Week 11 has a program that is an application of Balancing Binary Tree Data Structure. The program accepts numbers to be inserted, then the program will store it in the tree data structure. Then, the program can search for the data, or display the data in the preorder, inorder, or postorder format.
- Week 12 has a program that takes inputs in form of cities/towns. Then, using Union-Find Disjoint Set Algorithm, you can connect and merge the towns to be in one set. The program is also coded with a checker - so you can check whether two towns have already been connected or not.
- Week 13 has three programs. The first and the second program are simply programs to show how BFS and DFS works with adjacency matrix. The third program, Subject Sorter, is a program that takes any amount of subjects. The subjects are then connected with each other (which has to be learned before the next? kind of way), then the program will sort the subjects with Topological Sort Algorithm. The program will then display the results of the sorting (which has to be learned first before the other subject is learned).
- Week 14 has three programs. The first program is to demonstrate the Travelling Salesman Problem and its solution, using TSP Algorithm. The second program is to demonstrate Dijkstra's Algorithm. The program accepts input of "source#destination#weight", and it will continue to make new nodes in the undirected graph. Program will stop once the user typed -#-#0, and then it will output the shortest path between the nodes that are already made. The third program is a demonstration of MST using Kruskal and Prim Algorithm. The input is a graph in the form of adjacency matrix.
Copy or download the code into your Integrated Developer Environment of your choice, then build and run it. It is as simple as that. Don't forget to copy the text file to the directory of the .c and or the executable file, so the program does not get any segmentation faults.
- Week 6's second program radix sort is not working. I do not know why this happens, but feel free to post a pull request if you know how to solve the problem.
- Week 6's second program is unable to insert a new data if you delete the last data in the Linked List. Feel free to post a pull request if you know how to fix this.
- Week 8's activities.c's merge sort is not so efficient as it uses arrays instead of structure. If anyone knows how to pass a struct into the merge sort, then feel free to post a pull request.
If you have any ideas on how to improve the algorithms, feel free to submit a pull request.
This repository has a MIT License.
- Week 14 assignment added.
- Readme.md updated.
- All weekly challenges in this subject (Algorithms and Data Structures) in my university are finally solved in this update. I don't know whether I will add my final project here or not.
- This repository's basic contents are complete. If there is any update, then it is to simplify the algorithm and/or to fix bugs that the programs may have. Another possibility of update is adding my final project to this repository.
- Week 13 assignment added.
- Readme.md updated.
- Week 12 assignment added.
- Readme.md updated.
- Removed 'Reference Programs' folder.
- Week 11 assignment added.
- Readme.md updated.
- Week 10 assignment added.
- "Reference Programs" folder added.
- Readme.md updated.
- Week 9 assignment added.
- Readme.md updated.
- Week 8 assignment added.
- Readme.md updated.
- Added new sections "Algorithms" and "Basic C Functions" in Readme.md.
- Updated "Architecture / Philosophies" in Readme.md.
- Week 7 assignment added.
- Readme.md updated.
- Week 6 assignments added.
- Readme.md updated.
- Added the new "Bugs" section in Readme.md.
- Week 5 assignment added.
- Readme.md updated.
- Grammar fixes.
- Week 4 assignment added.
- Readme.md updated.
- Initial release, with Week 2 and Week 3.