Chetan-Raut / Data-Structures-4-BSc

This Repository Contains Data Structure Programs for RTM Nagpur University BSc Sem III Computer Science ⭐

DSA for BSc Sem III-RTMNU

Welcome to the "Data-Structures-4-BSc" repository! This repository contains a collection of data structure programs designed specifically for (BSc Semester III Computer Science) students at RTM Nagpur University. These programs are aimed at helping you understand and practice various data structures concepts.

Table of Contents

• Introduction
• Usage
• Program List
• Resources
• Contact

Introduction

In this repository, you will find a variety of data structure programs that cover fundamental concepts taught in BSc Sem III Computer Science at RTM Nagpur University. These programs are intended to enhance your understanding of data structures and algorithms through practical implementation.

Usage

To use the programs in this repository, follow these steps:

1. Clone the repository to your local machine using command: git clone https://github.com/Chetan-Raut/Data-Structures-4-BSc.git

2. Navigate to the appropriate program directory using a terminal or code editor.

3. Compile and run the program using a suitable compiler or integrated development environment (IDE).

4. Study the code and experiment with different inputs to gain a better understanding of the data structure and algorithm being demonstrated.

Program List

Here's a list of the data structure programs available in this repository:

Program 1: Program to insert a node at the beginning, at the end and in the middle of the given linked list.

Program 2: Program to delete a node at the beginning, at the end and in the middle of the given linked list.

Program 3: Program to create a linked list of customer names and their telephone numbers. (Using Menu Driven and include features of adding a new Customer and deleting an existing Customer.)

Program 4: Program to reverse a linked list.

Program 5: Program to search a value in the given linked list.

Program 6: Program to insert a node at the beginning, at the end or in the middle of a given doubly linked list.

Program 7: Program to delete a node from the beginning, at the end or in the middle of a given doubly linked list.

Program 8: Program to create, insert and delete a node in Circular linked list.

Program 9: Program to push and pop an element into / from a stack implemented using linked list.

Program 10: Program to push and pop an element into / from a stack implemented using Array.

Program 11: Program to evaluate postfix expression.

Program 12: Program to sort an array using quick sort.

Program 13: Program to solve Towers of Hanoi problems using recursion.

Program 14: Program to perform insertion and deletion operation in linear queues.

Program 15: Program to perform insertion and deletion operation on circular queues.

Program 16: Program to sort an array using Insertion sort.

Program 17: Program to sort an array using Selection sort.

Program 18: Program to insert an element in a binary search tree.

Program 19: Program to traverse inorder of a binary tree.

Program 20: Program to traverse preorder of a binary tree.

Program 21: Program to traverse postorder of a binary tree.

Feel free to explore each program and its accompanying documentation.

Resources

Here are some recommended resources for further learning about data structures and algorithms:

• Classical Data Structures : D. Samanta. PHI, New Delhi
• DATA STRUCTURE : LIPSCTUZ SCHUM OUTLINE SERIES
• Data structure Using C++ : Y. Kanetkar

Contact

If you have any questions or suggestions, feel free to reach out to the repository owner:

• Name: Chetan Raut
• Email: [e-mail]

Happy coding! 😉