Lovely Professional University, Punjab

Course Code Course Title Course Planner Lectures Tutorials Practicals Credits
CSE215 DATA STRUCTURES AND ALGORITHMS 12427::Harjeet Kaur 0.0 0.0 2.0 1.0
LABORATORY
Course Orientation 3 :SOFTWARE SKILL, 5 :PLACEMENT EXAMINATION, 6 :PLACEMENT EXAMINATION(Mass Recruiters), 7 :COMPETITIVE
EXAMINATION(Higer Education)

TextBooks
Sr No Title Author Edition Year Publisher Name
T-1 Data Structures using C Reema Thareja 2nd 2014 OXFORD UNIVERSITY PRESS
Reference Books
Sr No Title Author Edition Year Publisher Name
R-1 DATA SARTAJ SAHNI 2nd UNIVERSITIES PRESS PVT. LTD
STRUCTURES,ALGORITHMS
AND APPLICATIONS IN C++

Other Reading

Sr No Journals articles as Compulsary reading (specific articles, complete reference)

OR-1 E-book: Data Structures and Algorithm Analysis in C Mark Allen Weiss at http://ebookbrowse.com/ ,

Relevant Websites
Sr No Web address (only if relevant to the course) Salient Features
RW-1 http://www.nptel.iitm.ac.in/ Video lectures on data structures concepts

RW-2 http://www.cprogramming.com/algorithms-and-data-structures.html Implementation of various data structures in C and C++

RW-3 http://www.cplusplus.com/doc/tutorial/structures/ Relavent C++ documentation for data structures

Audio Visual Aids

Sr No AV aids (only if relevant to the course) Salient Features
AV-1 http://www.csse.monash.edu.au/~dwa/Animations/index.html Animations of algorithms in data structure

Software/Equipments/Databases

Sr No S/E/D (only if relevant to the course) Salient Features

SW-1 C/C++ Compiler and IDE Efficient implementation of various data structures involving the use of
pointers
Virtual Labs
Sr No VL (only if relevant to the course) Salient Features
VL-1 http://cse.iitkgp.ac.in/~rkumar/pds-vlab/ Work space for lab work and simulations
 Scheme for CA:
Component Frequency Out Of Each Marks Total Marks
Practical 3 4 10 30

Total :- 10 30

*Each experiment of the lab will be evaluated using following relative scheme:
Component % of Marks
J/E 50
VIVA 50

Detailed Plan For Practicals

Practical No Broad topic (Subtopic) Practical Description Learning Outcomes Equipment Used
Practical 1 Basics(Pointers and records) Identification of Applications of Arrays and Ability to identify the scenario where C/C++ IDE and Compiler
role of pointers in maintaining them arrays are preferred to be used as basic
data structure
Basics(Array of structures and pointers) Identification of Applications of Arrays and Ability to identify the scenario where C/C++ IDE and Compiler
role of pointers in maintaining them arrays are preferred to be used as basic
data structure
Practical 2 Arrays(Insertion) Managing linearly arranged block of data Efficient implementation and management C/C++ IDE and Compiler
and study of different scenarios where such of array list
data is used
Arrays(Deletion) Managing linearly arranged block of data Efficient implementation and management C/C++ IDE and Compiler
and study of different scenarios where such of array list
data is used
Arrays(Dynamic creation of arrays) Managing linearly arranged block of data Efficient implementation and management C/C++ IDE and Compiler
and study of different scenarios where such of array list
data is used
Arrays(Linear search) Managing linearly arranged block of data Efficient implementation and management C/C++ IDE and Compiler
and study of different scenarios where such of array list
data is used
Arrays(Binary search) Managing linearly arranged block of data Efficient implementation and management C/C++ IDE and Compiler
and study of different scenarios where such of array list
data is used
Practical 3 Arrays(Bubble sort) Evaluation 1 and implementation of Bubble Evaluation C/C++ IDE and Compiler
Sort
Practical 4 Linked Lists(Insertion) Improving performance of linear data Recognition of difference between C/C++ IDE and Compiler
management by using pointers and applications of arrays and linked list
Identification of Applications of Linked
List
Practical 4 Linked Lists(Deletion) Improving performance of linear data Recognition of difference between C/C++ IDE and Compiler
management by using pointers and applications of arrays and linked list
Identification of Applications of Linked
List
Linked Lists(Traversal) Improving performance of linear data Recognition of difference between C/C++ IDE and Compiler
management by using pointers and applications of arrays and linked list
Identification of Applications of Linked
List
Practical 5 Linked Lists(Header linked list) Other variations of linked list and their Efficient implementation of linear data C/C++ IDE and Compiler
applications structure and management of linked list
Linked Lists(Circular linked list) Other variations of linked list and their Efficient implementation of linear data C/C++ IDE and Compiler
applications structure and management of linked list
Practical 6 Linked Lists(Two-way lists) Evaluation 2 and implementation of two Evaluation C/C++ IDE and Compiler
way linked list
Practical 7 Stacks and Queues(Insertion) Constrained linear data structures using Ability to modify the design of basic C/C++ IDE and Compiler
Arrays and Linked lists linear data structure as per the
requirement of application
Stacks and Queues(Deletion) Constrained linear data structures using Ability to modify the design of basic C/C++ IDE and Compiler
Arrays and Linked lists linear data structure as per the
requirement of application
Stacks and Queues(Traversal) Constrained linear data structures using Ability to modify the design of basic C/C++ IDE and Compiler
Arrays and Linked lists linear data structure as per the
requirement of application
Practical 8 Stacks and Queues(Quick sort) Applications of stacks and queues Capability to write programs using C/C++ IDE and Compiler
appropriate linear data structure
Practical 9 Stacks and Queues(Tower of Hanoi) Evaluation 3 and implementation of Tower Evaluation C/C++ IDE and Compiler
of Hanoi
Practical 10 Trees(BST creation) Hierarchical arrangement of data and its Identification of scenarios where data will C/C++ IDE and Compiler
traversal be put in non linear hierarchical fashion
Trees(BST insertion) Hierarchical arrangement of data and its Identification of scenarios where data will C/C++ IDE and Compiler
traversal be put in non linear hierarchical fashion
Practical 11 Trees(BST deletion) Applications of various representations of Efficiently accessing and managing data C/C++ IDE and Compiler
binary tree- I
Practical 12 Trees(Heap insertion) Evaluation 4 and implementation of Evaluation C/C++ IDE and Compiler
insertion in Heap
Practical 13 Trees(Heap deletion) Applications of various representations of Understanding of significance of C/C++ IDE and Compiler
binary tree- II complexity issues
Trees(Heap sort) Applications of various representations of Understanding of significance of C/C++ IDE and Compiler
binary tree- II complexity issues
Practical 14 Searching and Sorting techniques Common sorting algorithm and their Usage of appropriate technique at C/C++ IDE and Compiler
(Implementation of all searching and applications appropriate place
sorting techniques)
SPILL OVER
Practical 15 Spill Over