CS25303 Data Structures Laboratory – Semester III – EEE(Comp) – R-2025

Subject Code & Name: CS25303 – Data Structures Laboratory

Regulation: R-2025

Semester: III (Third Semester)

Branch: B.E. Electrical and Computer Engineering (EEE(Comp))

Credits / L-T-P: 2 Credits | L-T-P: 0-0-4

Course Objectives

  • To demonstrate array implementation of linear data structure algorithms.
  • To implement the applications using Stack.
  • To implement the applications using Linked list.
  • To implement Binary search tree and AVL tree algorithms.
  • To implement the Heap algorithm.
  • To implement Dijkstra’s algorithm.
  • To implement Prim’s algorithm.
  • To implement Sorting, Searching and Hashing algorithms.

Full Unit-wise Syllabus

List of Experiments

  • Array implementation of Stack, Queue and Circular Queue ADTs
  • Implementation of Singly Linked List
  • Linked list implementation of Stack and Linear Queue ADTs
  • Implementation of Polynomial Manipulation using Linked list
  • Implementation of Evaluating Postfix Expressions, Infix to Postfix conversion
  • Implementation of Binary Search Trees
  • Implementation of AVL Trees
  • Implementation of Heaps using Priority Queues
  • Implementation of Dijkstra’s Algorithm
  • Implementation of Prim’s Algorithm
  • Implementation of Linear Search and Binary Search
  • Implementation of Insertion Sort and Selection Sort
  • Implementation of Merge Sort
  • Implementation of Open Addressing (Linear Probing and Quadratic Probing)

Course Outcomes (COs)

  • CO1: Implement and test linear data structures such as arrays stacks, queues, circular queues, and linked lists to solve computational problems.
  • CO2: Design and develop applications using linked lists expression evaluation techniques, binary search trees AVL trees, and heaps.
  • CO3: Apply graph algorithms such as Dijkstra’s and Prim’s algorithms to solve shortest path and minimum spanning tree problems.
  • CO4: Implement and analyze searching, sorting, and hashing techniques to improve the efficiency of data processing and retrieval. Semester IV.

Assessment Pattern (Quick Note)

  • Weightage: Continuous Assessment 60% | End Semester Examinations 40%
  • Internal methodology: Project (30%), Assignment (10%), Practical (30%), Internal Examinations (30%)

Source: Official Anna University – B.E. Electrical and Computer Engineering R-2025 Curriculum
Last Updated: September 2026

ANNA UNIVERSITY | SYLLABUS | UNIVERSITY QUESTION PAPER | NOTES

Comments