Back close
Admissions

Course Detail

Course Name Data Structures Lab
Course Code 26CSA582
Program M. C. A.
Semester 1
Credits 1
Campuses Amritapuri, Mysuru

Syllabus

  1. Write programs to perform linear search and binary search on onedimensional arrays.
  2. Implement sorting algorithms:
    • Bubble sort
    • Insertion sort
    • Selection sort
    • Shell sort
  3. Implement array operations: insertion, deletion, merging, and traversal.
  4. Implement singly linked list with operations: insertion, deletion, and traversal.
  5. Implement doubly linked list and perform forward and backward traversal.
  6. Implement circular linked list and demonstrate its applications.
  7. Implement stack using array representation.
  8. Implement stack using linked list representation.
  9. Develop applications of stack:
    • Infix to postfix conversion
    • Postfix expression evaluation
  10. Implement recursive algorithms:
    • Tower of Hanoi
  11. Implement merge sort using recursion.
  12. Implement quicksort using recursion.
  13. Implement queue using array representation.
  14. Implement circular queue and demonstrate enqueue and dequeue operations.
  15. Implement binary tree and perform:
    • Inorder traversal
    • Preorder traversal
    • Postorder traversal
  16. Implement binary search tree with insertion and deletion.
  17. Construct and evaluate an expression tree.
  18. Implement graph representation and perform:
    • Breadth First Search (BFS)
    • Depth First Search (DFS)

Objectives and Outcomes

Course Description

This course is a foundation course for data structure. This course introduces linear and nonlinear data structures such as arrays, stacks, queues, linked lists, graphs, and trees and their applications.

Course Objectives

  • To provide hands‑on experience in implementing data structures using modular programming.
  • To enable students to design efficient data handling solutions using appropriate data structures.
  • To reinforce higher‑order problem‑solving skills through implementation‑based learning.

Course Outcomes

COs Description
CO1 Implement and test array‑based and linked data structures to construct reliable data handling modules.
CO2 Design and develop stack‑ and recursion‑based solutions for expression processing and classical algorithmic problems.
CO3 Construct and apply queue variants and hashing techniques to solve problems involving orderly data access and retrieval.
CO4 Implement and integrate tree‑based data structures to model hierarchical relationships and structured data representations.
CO5 Develop and analyze graph‑based solutions using traversal techniques to represent and solve connectivity‑oriented problems.

CO-PO Mapping

PO/PSO  PO1  PO2  PO3  PO4  PO5  PO6 PO7 PO8
CO
CO1 3 3 3 – – – – 2
CO2 3 3 2 – – – – 2
CO3 3 3 2 – – – – 2
CO4 3 3 2 – – – – 2
CO5 3 3 2 – – – – 2

Text Books / References

  • E. Horowitz & Sahni, Fundamental Data Structure, Galgotia Book Source, 1983.
  • Y. Langsam, M J. Augenstein and A M. Tenenbaum, Data Structures using C and C++. PHI Learning Pvt. Ltd.
  • Classic Data Structures by D. Samanta, Second Edition.

DISCLAIMER: The appearance of external links on this web site does not constitute endorsement by the School of Biotechnology/Amrita Vishwa Vidyapeetham or the information, products or services contained therein. For other than authorized activities, the Amrita Vishwa Vidyapeetham does not exercise any editorial control over the information you may find at these locations. These links are provided consistent with the stated purpose of this web site.

Admissions Apply Now