DSA End Term Exam Questions - B.Tech 3rd Semester

This repository contains end-term exam questions for the Data Structures and Algorithms (DSA) course for B.Tech 3rd Semester students at Graphic Era Hill University. The topics covered in this repository include:

• Array
• Linked List
• Sorting Techniques
• Searching Techniques
• Trees and Graphs

Table of Contents

1. Introduction
2. Topics Covered
3. Exam Questions
4. Contributing
5. License
6. Prerequisites
7. How to Run

Introduction

This repository serves as a compilation of end-term exam questions and practice problems to help B.Tech 3rd-semester students prepare for their DSA exam. The questions are structured around the core topics of the course, providing a well-rounded understanding of the subject.

Topics Covered

1. Array

• Basic operations on arrays (insertion, deletion, searching)
• Array manipulation problems (reverse, rotate, etc.)
• Multi-dimensional arrays and their applications

2. Linked List

• Single, double, and circular linked lists
• Operations on linked lists (insertion, deletion, traversal, reversal)
• Merging and splitting linked lists
• Detecting cycles in a linked list

3. Sorting Techniques

• Bubble Sort, Selection Sort, Insertion Sort
• Merge Sort, Quick Sort, Heap Sort
• Time and Space complexity analysis of sorting algorithms

4. Searching Techniques

• Linear Search, Binary Search
• Time complexity analysis
• Searching in rotated sorted arrays

5. Trees and Graphs

• Binary Trees, Binary Search Trees
• Tree traversal techniques (Pre-order, In-order, Post-order)
• Graph representation (Adjacency Matrix, Adjacency List)
• Graph traversal techniques (BFS, DFS)

Exam Questions

The repository includes a set of end-term exam questions based on the aforementioned topics, which may include:

• Theory Questions: Concepts and theory behind various data structures and algorithms.
• Practical Questions: Code-based problems that test your ability to implement and use various data structures and algorithms.
• Problem Solving: Questions that involve applying DSA concepts to solve real-life problems.

Contributing

Contributions are welcome! If you would like to contribute to this repository, please fork it and submit a pull request. You can help improve this repository by adding more exam questions, providing solutions, or enhancing the explanations for each topic.

License

This repository is licensed under the MIT License. See the LICENSE file for more information.

---

Feel free to explore and use the materials in this repository for your exam preparation.

Prerequisites

Before running the program, make sure you have:

• A C compiler installed (e.g., GCC).
• Basic understanding of sorting and searching algorithms.

---

How to Run

Clone the repository:

To use the program, first clone the repository to your local machine:

git clone https://github.com/aditya2006p/DSA-Question.git