A repository containing Data Structures Laboratory programs in C corresponding to the syllabus of ISL36 from the Department of Information Science Engineering at Ramaiah Institute of Technology, Bangalore.
Attention: The programs provided in this repository are solely intended for educational and learning purposes. The creator of these programs accepts no responsibility for any consequences resulting from the use or misuse of the code provided herein.
Users are advised to exercise caution and use these programs at their own risk. It is recommended to thoroughly understand the code and its implications before learning it for a lab examination. Using these programs for cheating in any lab examination is strictly frowned upon and not encouraged.
By using these programs, users acknowledge and accept the inherent risks associated with using these programs and agree to hold the creator harmless from any damages, liabilities, or losses that may arise from their use.
-
Student Information using Structures (
student.c
): Summary: A program to store and display student information using structures. -
Dynamic Memory Allocation for Marks (
marksalloc.c
): Summary: A program to dynamically allocate memory for student marks and display them. -
Stack Operations using Array Implementation (
stack.c
): Summary: A program to perform stack operations using an array. -
Recursive Programs: i) Recursive Fibonacci Series Display (
recursive_fibonacci.c
): Summary: A program to display the Fibonacci series recursively.ii) Recursive Tower of Hanoi Solution (
recursive_towerofhanoi.c
): Summary: A program to solve the Tower of Hanoi problem recursively. -
Infix to Postfix Conversion using Stack (
postfix.c
): Summary: A program to convert infix expressions to postfix using a stack. -
Evaluate Postfix Expression using Stack (
evaluatepostfix.c
): Summary: A program to evaluate postfix expressions using a stack. -
Queue-based Process Scheduling Simulation (
queue_processscheduling.c
): Summary: A program to simulate process scheduling using a queue. -
Circular Queue Data Structure (Array Implementation) (
circularqueue_processscheduling.c
): Summary: A program to implement the circular queue data structure using an array for process scheduling simulation. -
Memory Allocation to Files using Singly Linked List (
linkedlist_filealloc.c
): Summary: A program to allocate memory to files based on size using a singly linked list. -
Memory Allocation to Files using Doubly Linked List (
doublylinkedlist.c
): Summary: A program to allocate memory to files based on size using a doubly linked list. -
Memory Allocation to Files using Circular Linked List (
circularlinkedlist.c
): Summary: A program to allocate memory to files based on size using a circular linked list. -
Forward and Backward Web Browsing using Stack (Linked List Implementation) (
stack_list.c
): Summary: A program to simulate web browsing using a stack implemented with a linked list. -
Queue Data Structure (Linked List Implementation) (
queue_list.c
): Summary: A program to implement the queue data structure using a linked list. -
Binary Search Tree for Student Marks Management (
binarysearchtree_studentmarks.c
): Summary: A program to manage student marks using a binary search tree.
-
Prerequisites:
- Ensure that you have a compatible C compiler installed on your system.
-
Clone the Repository:
- Clone or download the repository to your local machine.
-
Navigate to the Directory:
- Open a terminal or command prompt and navigate to the directory where you cloned or downloaded the repository.
-
Compile the Programs:
- Compile each program using the appropriate compiler command.
-
Execute the Programs:
- Run the compiled executable files.
-
Follow Program Instructions:
- Interact with the programs and follow their prompts.
-
Explore and Experiment:
- Modify the code and observe its effects to gain insights into data structures and algorithms concepts.
By following these instructions, you can set up and run the Data Structures Laboratory programs in C on your local machine for educational purposes.