Lovely Professional University, Punjab

Course Code Course Title Course Planner Lectures Tutorials Practicals Credits
CAP282 DATA STRUCTURES-LABORATORY 22021::Monika Yadav 0 0 3 2
Course Weightage ATT: 5 CAP: 45 ETP: 50 Exam Category: X6: Mid Term Exam: Not Applicable – End Term Exam:
Practical
Course Orientation SKILL ENHANCEMENT

TextBooks ( T )
Sr No Title Author Publisher Name
T-1 DATA STRUCTURES SEYMOUR LIPSCHUTZ MCGRAW HILL EDUCATION
Reference Books ( R )
Sr No Title Author Publisher Name
R-1 DATA STRUCTURES AND ALFRED V. AHO, PEARSON
ALGORITHMS JEFFREY D. ULLMAN
AND JOHN E.
HOPCROFT
R-2 DATA STRUCTURES AND MARK ALLEN WEISS PEARSON
ALGORITHM ANALYSIS IN C
Other Reading ( OR )

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

OR-1 Journal of Computer and System Sciences, Volume 33, Issue 1, August 1986, Pages 66-74, J. Ian Munro
(http://www.sciencedirect.com/science/article/pii/0022000086900437) ,
OR-2 Journal of Computer and System Sciences, Volume 38, Issue 1, February 1989, Pages 86-124,James R. Driscoll, Neil Sarnak, Daniel D. Sleator, Robert E. Tarjan
(http://www.sciencedirect.com/science/article/pii/0022000089900342) ,
Relevant Websites ( RW )
Sr No (Web address) (only if relevant to the course) Salient Features
RW-1 https://ece.uwaterloo.ca/~dwharder/aads/Lecture_materials/ Power point presentation and notes on various topics:algorithm analysis,
lists, stacks, and queues, trees, graphs, sorting algorithms etc.
RW-2 https://www.tutorialspoint.com/data_structures_algorithms/tree_data_structure.htm Tutorial on Trees and Graphs

RW-3 http://www.mycplus.com/tutorials/data-structures/arrays-c-cpp-programming/ Tutorial on Arrays

RW-4 http://www.tutorialspoint.com/data_structures_algorithms/index.htm A tutorial giving great understanding on data structures concepts and
algorithm programming in simple and easy steps.
Audio Visual Aids ( AV )
Sr No (AV aids) (only if relevant to the course) Salient Features
AV-1 http://nptel.ac.in/video.php?subjectId=106102064 Video lectures on data structures

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 AV-2 http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j- Video lectures on introduction to algorithms
introduction-to-algorithms-sma-5503-fall-2005/video-lectures/
AV-3 http://www.csse.monash.edu.au/~dwa/Animations/index.html Animations for all the data structures and sorting searching techniques

Software/Equipments/Databases
Sr No (S/E/D) (only if relevant to the course) Salient Features
SW-1 C/C++ Compiler Software for implementing data structure programs

Virtual Labs ( VL )
Sr No (VL) (only if relevant to the course) Salient Features
VL-1 http://iiith.vlab.co.in/index.php?sub=21&brch=46 Related to trees and graphs

*Each experiment of the lab will be evaluated using following relative scheme:
Component Weightage (%)
Performance/Job 100
evaluation/conduct/skill
execution/demonstration

Detailed Plan For Practicals

Practical No Broad topic Subtopic Other Readings Learning Outcomes

Practical 1 Arrays Deletion in array SW-1 Student will learn about deleting element from a
particular position in an array
Arrays Insertion in array RW-1 Student will learn about inserting element at
AV-1 particular position in an array

Practical 2 Arrays Traversal of linear arrays RW-4 Student will learn about traversing each and every
element present in array
Arrays Merging of two arrays RW-4 Student will be able to merge two arrays into one
array. P3: Lab Evaluation I
Practical 3 Arrays Merging of two arrays RW-4 Student will be able to merge two arrays into one
array. P3: Lab Evaluation I
Arrays Reverse of array AV-2 Student will be able to reverse the elements of
array. P3: Lab Evaluation I
Arrays Traversal of linear arrays RW-4 Student will learn about traversing each and every
element present in array
Practical 4 Linked Lists Deletion in one way linked list VL-1 Student will learn about deleting element from
particular position in one way linked list
Linked Lists Insertion in one way linked list RW-4 Student will learn about inserting element at
particular position in one way linked list

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Practical 5 Linked Lists Operations on two way linked list RW-1 Student will learn about traversing, inserting and
deleting elements in two way linked list. P6: Lab
Evaluation 2
Linked Lists Traversal of one way linked list RW-1 Student will learn about traversing each and every
element present in one way linked list
Practical 6 Linked Lists Traversal of one way linked list RW-1 Student will learn about traversing each and every
element present in one way linked list
Linked Lists Operations on two way linked list RW-1 Student will learn about traversing, inserting and
deleting elements in two way linked list. P6: Lab
Evaluation 2
Practical 7 Linked Lists Operations on circular linked list AV-2 Student will learn about traversing, inserting and
deleting elements in circular linked list
Stacks and Queues Implementation of push and pop OR-1 Student will learn about inserting and deleting
operations in stack elements from stack
Practical 8 Stacks and Queues Insertion in circular queues VL-1 Student will learn about inserting elements in
circular queues. P9: Lab Evaluation 3
Practical 9 Stacks and Queues Insertion in circular queues VL-1 Student will learn about inserting elements in
circular queues. P9: Lab Evaluation 3
Stacks and Queues Deletion in circular queues RW-2 Student will learn about deleting elements in
circular queues. Student will learn about heap sort
technique. P9: Lab Evaluation 3
Stacks and Queues Implementation of priority queues RW-2 Student will learn about inserting and deleting
AV-3 elements from priority queues. P9: Lab Evaluation
3
Practical 10 Trees Operations on binary search trees RW-4 Student will learn about insertion and deletion
operations on binary search trees
Trees Inorder traversal RW-4 Student will learn about traversing nodes of tree
using inorder traversal
Trees Postorder traversal RW-3 Student will learn about traversing nodes of tree
using postorder traversal
Trees Preorder traversal RW-2 Student will learn about traversing nodes of tree
using preorder traversal
Practical 11 Trees Binary heap operations RW-4 Student will learn about basic binary heap
operations. Student will learn about heap sort
technique. P12: Lab Evaluation 4
Practical 12 Trees Binary heap operations RW-4 Student will learn about basic binary heap
operations. Student will learn about heap sort
technique. P12: Lab Evaluation 4
Trees Heap sort RW-3 Student will learn about heap sort technique. P12:
Lab Evaluation 4
Practical 13 Searching and sorting Linear search RW-4 Student will be able to perform sequential search on
array using linear search
Searching and sorting Binary search RW-2 Student will be able to search element from array
using binary search

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Practical 13 Searching and sorting Bubble sort RW-2 Student will be able to sort elements of an array
using bubble sort
Practical 14 Searching and sorting Insertion sort RW-4 Student will be able to sort elements of an array
using insertion sort
Searching and sorting Selection sort OR-2 Student will be able to sort elements of an array
RW-2 using selection sort

Searching and sorting Merge sort RW-4 Student will be able to sort elements of an array
using merge sort
SPILL OVER
Practical 15 Spill Over

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.