Scribd
Upload
25 views

II-I DS Lab-EEE

Uploaded by

vijaygate2013
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
25 views

II-I DS Lab-EEE

Uploaded by

vijaygate2013
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

II Year I semester

L T P C
0 1 2 2
DATA STRUCTURES LAB
EEE

Course Objectives:

 To provide the knowledge of basic data structures and their implementations.


 To understand importance of data structures in context of writing efficient programs.
 To develop skills to apply appropriate data structures in problem solving.
Course Outcomes: At the end of the course, Student will be able to

CO1: Explain the role of data structures in organizing and accessing data.
CO2: Design, implement, and apply linked lists for dynamic data storage.
CO3: Develop programs using stacks to handle recursive algorithms, manage program states and
solve related problems.
CO4: Apply queue-based algorithms for efficient task scheduling and breadth-first
traversal in graphs and distinguish between deques and priority queues and apply
them appropriately to solve data management challenges.
CO5: Implementing trees and binary search trees and utilizing these data structures effectively.
Mapping of Course Outcomes with Program Outcomes and Program Specific Outcomes:

Course
Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
(COs)
CO1 3 2 3 2
CO2 3 3 3 2 3 3 3 2
CO3 3 3 2 3 2 3 3 2
CO4 3 3 3 2 3 3 3 3 3
CO5 3 3 2 3 3 3 2

SYLLABUS
UNIT I

Introduction to Data Structures: Definition and importance of Data structures, Abstract


data types (ADTs) and its specifications, Arrays: Introduction, 1-D, 2-D Arrays, accessing
elements of array, Row Major and Column Major storage of Arrays, Searching Techniques:
Linear & Binary Search, Sorting Techniques: Bubble sort, Selection sort, Quick sort.

Sample experiments:

1. Program to find min & max element in an array.


2. Program to implement matrix multiplication.
3. Find an element in given list of sorted elements in an array using Binary search.
4. Implement Selection and Quick sort techniques.

UNIT II

Linked Lists: Singly linked lists: representation and operations, doubly linked lists and
circular linked lists, Comparing arrays and linked lists, Applications of linked lists.
Sample experiments:

1. Write a program to implement the following operations.


a. Insert b. Deletion c. Traversal
2. Write a program to store name, roll no, and marks of students in a class using circular
double linked list.
3. Write a program to perform addition of given two polynomial expressions using
linked list.
UNIT III

Stacks: Introduction to stacks: properties and operations, implementing stacks using arrays
and linked lists, Applications of stacks in expression evaluation, backtracking, reversing list
etc.

Sample experiments:
1. Implement stack operations using
a. Arrays b. Linked list
2. Convert given infix expression into post fix expression using stacks.
3. Evaluate given post fix expression using stack.
4. Write a program to reverse given linked list using stack.
UNIT IV

Queues: Introduction to queues: properties and operations, Circular queues, implementing


queues using arrays and linked lists, Applications of queues scheduling, etc.

Deques: Introduction to deques (double-ended queues), Operations on deques and their


applications.

Sample experiments:

1. Implement Queue operations using


a. Arrays b. Linked list
2. Implement Circular Queue using
a. Arrays b. Linked list
3. Implement Dequeue using linked list.
UNIT V

Trees: Introduction to Trees, Binary trees and traversals, Binary Search Tree – Insertion,
Deletion & Traversal

Sample experiments:

1. Implement binary tree traversals using linked list.

2. Write program to create binary search tree for given list of integers. Perform in-order traversal
of the tree. Implement insertion and deletion operation

Textbooks:
1. Data Structures and algorithm analysis in C, Mark Allen Weiss, Pearson, 2nd Edition.
2. Fundamentals of data structures in C, Ellis Horowitz, Sartaj Sahni, Susan Anderson-
Freed, Silicon Press, 2008
Reference Books:
1. Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn and Peter
Sanders.
2. C Data Structures and Algorithms by Alfred V. Aho, Jeffrey D. Ullman, and John E.
Hopcroft.
3. Problem Solving with Algorithms and Data Structures by Brad Miller and David
Ranum.
4. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L.
Rivest, and Clifford Stein.
5. Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting,
Searching, and Graph Algorithms" by Robert Sedgewick.

You might also like