S3-DS-Lab

This repository is dedicated to storing programs necessary for the Data Structures lab sessions conducted in Semester 3 for KTU students (2019 Syllabus).

Index

This folder contains the following programs:

• Cycle 1:

  • Sparse Representation
  • Sparse Sum
  • Sparse Symmetry
  • Sparse Transpose
  • Polynomial Addition
  • Polynomial Evaluation

• Cycle 2:

  • Infix To Postfix
  • Postfix Evaluation
  • Stack
  • Minimum Element in Stack
  • Sorted Stack Push
  • Queue
  • Circular Queue
  • Priority Queue

• Cycle 3:

  • Queue Using Stack
  • Singly Linked List (SLL)
  • Polynomial Addition & Multiplication Using SLL
  • Stack Using SLL
  • Queue Using SLL
  • Sorted Insert Into SLL & Reversing An SLL
  • Circular List
  • Deque
  • Palindrome Using DLL

• Cycle 4:

  • Searching Algorithms

    • Linear Search
    • Binary Search
    • Combined

  • Sorting Algorithms

    • Bubble Sort
    • Insertion Sort
    • Selection Sort
    • Quick Sort
    • Merge Sort
    • Heap Sort
    • Combined

• Cycle 5:

  • Delete A Node In A Tree
  • Tree Traversal Algorithms
  • Traversal And Deletion Combined

• Cycle 6:

  • Graph Traversal Algorithms (Using Matrix & List)
  • Hashing (Chaining & Linear Probing)

• Additional Programs:

  • Array Rotation
  • Decimal To Hexadecimal
  • Removing Duplicate Elements (SLL)
  • Positive & Negative Numbers (SLL)

Few additional practice programs are in the Lab Exam folder. Feel free to explore the folders and use the programs as needed for your lab sessions.