Data Structures Lab Programs

Course Code: R1UC308B
Institution: Galgotias University, Greater Noida
School: School of Computer Science and Engineering
Program: B.Tech Computer Science Engineering
Semester: III

📚 About

This repository contains all 25 lab programs from the Data Structures course covering fundamental concepts including arrays, recursion, searching algorithms, sorting algorithms, linked lists, stacks, queues, trees, and graphs.

📋 List of Programs

Arrays

1. ArrayInsertDelete.java - Insert and delete elements in 1-D array
2. ReverseArray.java - Reverse an array
3. MatrixOperations.java - Addition and multiplication of 2D matrices
4. MaxMinArray.java - Find maximum and minimum in array

Recursion

5. Factorial.java - Factorial using iteration and recursion
6. Fibonacci.java - Fibonacci series using iteration and recursion
7. TowerOfHanoi.java - Tower of Hanoi problem
8. PrintNto1.java - Print numbers from n to 1 using recursion

Searching

9. LinearSearch2D.java - Linear search in 2D matrix
10. BinarySearch.java - Binary search in sorted array
11. FirstLastOccurrence.java - Find first and last occurrence in sorted array

Sorting

12. BubbleSort.java - Bubble sort implementation
13. SelectionSort.java - Selection sort implementation
14. InsertionSort.java - Insertion sort implementation
15. QuickSort.java - Quick sort implementation
16. MergeSort.java - Merge sort implementation

Linked Lists

17. SinglyLinkedList.java - Menu-driven singly linked list with insert, delete, search, display
18. DoublyLinkedList.java - Doubly linked list implementation
19. CircularLinkedList.java - Circular linked list implementation

Stack & Queue

20. StackArray.java - Stack operations (push, pop, isEmpty, isFull) using array
21. CircularQueue.java - Circular queue operations using array

Trees

22. BinaryTree.java - Binary tree traversals (inorder, preorder, postorder)
23. BST.java - Binary Search Tree with insert, delete, search operations

Graphs

24. BFS.java - Breadth-First Search traversal
25. DFS.java - Depth-First Search traversal

🚀 How to Run

Prerequisites

• Java Development Kit (JDK) 8 or higher
• Any Java IDE (Eclipse, IntelliJ IDEA, VS Code) or command line

Compilation

javac ProgramName.java

Execution

java ProgramName

Example

javac 01_ArrayInsertDelete.java
java ArrayInsertDelete

📖 Topics Covered

• Arrays: Basic operations, traversal, insertion, deletion
• Recursion: Understanding recursive calls and base cases
• Searching: Linear and binary search techniques
• Sorting: Comparison-based sorting algorithms
• Linked Lists: Dynamic data structures with various types
• Stacks: LIFO principle implementation
• Queues: FIFO and circular queue implementations
• Trees: Binary trees, BST, tree traversals
• Graphs: BFS and DFS graph traversal algorithms

💡 Key Concepts

• Time and space complexity analysis
• Iterative vs recursive approaches
• In-place vs auxiliary space algorithms
• Static vs dynamic data structures
• Menu-driven program design

📝 Notes

• All programs include user input functionality via Scanner class
• Programs follow standard Java naming conventions
• Each program includes proper comments and documentation
• Menu-driven programs include multiple operation options

🤝 Contributing

Feel free to:

• Report bugs or issues
• Suggest improvements
• Add optimized versions
• Contribute additional test cases

📄 License

This repository is for educational purposes as part of the B.Tech CSE curriculum at Galgotias University.

👤 Author

Aditya Gupta
Admission No: 24SCSE1011357
B.Tech Computer Science Engineering
Galgotias University

---

⭐ Star this repository if you find it helpful!