These are some of the Data Structure Programs I have learned to date in C programming.
This repository contains 10 programs: -
1.Stacks Operation
This C program uses an array to implement a simple stack with a fixed size of 5. It includes functions to push elements onto the stack, pop elements from it, and display its contents. The main() function provides a menu-driven interface for performing these operations.
2. Infix to Postfix Conversion using Stacks
This C program converts an infix expression to postfix notation using the Shunting Yard algorithm. It includes functions to handle operator precedence and stack operations. The infix_postfix function processes the input infix expression, utilizing a stack to manage operators and ensure correct precedence in the resulting postfix expression.
3. Evaluation of Suffix expression
This C program evaluates a postfix (reverse Polish notation) expression. It uses a stack to store operands and performs arithmetic operations based on the postfix notation. The eval function processes expressions, handling operators like +, -, *, /, %, and ^. The result is displayed after computation.
4. double Ended Queue
This C program implements a double-ended queue (deque) using a fixed-size array. It supports insertion at both front and rear (functions IF and IR), deletion from both front and rear (functions DF and DR), and displays the contents of the queue (Display). The program offers a menu-driven interface for these operations.
5. Circular Queue
This C program implements a circular queue using an array. It provides functions to insert elements (ir), delete elements from the front (df), and display the queue's contents. The queue operates in a circular manner, utilizing a fixed size of 5, with operations managed through front (f) and rear (r) pointers.
6. Singly Linked List Operation on Student Data
This C program implements a linked list to manage student records, including USN, name, branch, semester, and phone number. It allows insertion at the front (IF) and rear (IR), deletion from the front (DF) and rear (DR), and displays the list's contents (disp). The user interacts via a menu-driven interface.
7. doubly Linked List on Employee Data
This C program manages a doubly linked list of employee records, including SSN, name, department, designation, salary, and phone number. It allows insertion at the front (IF) and rear (IR), deletion from the front (DF) and rear (DR), and displays the list's contents (disp). The user interacts via a menu-driven interface.
8. Binary Search Tree Operations
This C program implements a Binary Search Tree (BST) with integer data. It provides functions to insert nodes (insert), traverse the tree in Inorder, Preorder, and Postorder (inorder, preorder, postorder), and search for specific values (search). The user interacts via a menu-driven interface for these operations.
9. Graph Traversals (BFS and DFS)
This C program implements Breadth-First Search (BFS) and Depth-First Search (DFS) algorithms for traversing a graph represented by an adjacency matrix. It determines the reachability of vertices from a given source and checks if the graph is connected. If connected, it outputs the spanning tree edges.
10. Hashing Using Linear Probing
This C program implements a hash table to store and search employee records, including employee ID, name, and age. It uses a hash function to map employee IDs to indices in the table. The program handles collisions with linear probing and provides options to insert and search for records.
Feel free to contact numarahamath@gmail.com if you have any doubts