/DSA-College-Codes

Primary LanguageC

Data Structures Lab

Welcome to the Data Structures Lab! This repository contains materials for the B.Tech. II Year I Sem. Data Structures Lab. Below you will find essential information about the course, including prerequisites, objectives, outcomes, list of experiments, and recommended textbooks.

Course Information

  • Course Code: Data Structures Lab
  • Duration: II Year I Semester
  • Lecture Hours: 0
  • Tutorial Hours: 0
  • Practical Hours: 3
  • Credits: 1.5

Prerequisites

  • Programming for Problem Solving

Course Objectives

  • Cover various concepts of the C programming language.
  • Introduce searching and sorting algorithms.
  • Provide an understanding of data structures such as stacks and queues.

Course Outcomes

  • Ability to develop C programs for computing and real-life applications using basic elements like control statements, arrays, functions, pointers, and strings, and data structures like stacks, queues, and linked lists.
  • Ability to implement searching and sorting algorithms.

List of Experiments

  1. Write a program that uses functions to perform the following operations on a singly linked list:

    • i) Creation
    • ii) Insertion
    • iii) Deletion
    • iv) Traversal

  2. Write a program that uses functions to perform the following operations on a doubly linked list:

    • i) Creation
    • ii) Insertion
    • iii) Deletion
    • iv) Traversal

  3. Write a program that uses functions to perform the following operations on a circular linked list:

    • i) Creation
    • ii) Insertion
    • iii) Deletion
    • iv) Traversal

  4. Write a program that implements stack (its operations) using:

    • i) Arrays
    • ii) Pointers

  5. Write a program that implements Queue (its operations) using:

    • i) Arrays
    • ii) Pointers

  6. Write a program that implements the following sorting methods to sort a given list of integers in ascending order:

    • i) Quick sort
    • ii) Heap sort
    • iii) Merge sort

  7. Write a program to implement the tree traversal methods (Recursive and Non-Recursive).

  8. Write a program to implement: Binary Search tree.

  9. Write a program to implement the graph traversal methods.

  10. Implement Pattern matching algorithms using Boyer-Moore and Knuth-Morris-Pratt.

Textbooks

  1. Data Structures and Algorithms in C - Michael T. Goodrich, Roberto Tamassia, David M. Mount

Contributors

Feel free to contribute by submitting pull requests or by raising issues. Happy coding!