Lovely Professional University, Punjab

Course Code Course Title Lectures Tutorials Practicals Credits Course Planner
CSE205 DATA STRUCTURES AND ALGORITHMS 3 0 2 4 16921::Arvind Kumar
Course Weightage ATT: 5 CA: 50 ETP: 45 Exam Category: X6: Mid Term Exam: Not Applicable – End Term Exam:
Practical
Course Focus EMPLOYABILITY,SKILL DEVELOPMENT

Course Outcomes :Through this course students should be able to

CO1 :: understand the time and space complexity of programs and data-structures.
CO2 :: illustrate the importance of Linked List in context of real world problems
CO3 :: differentiate the Stack and Queue data structures for problem solving
CO4 :: use of recursion in iteration process and tree data structure
CO5 :: analyze the effectiveness of AVL Tree and Heap Data Structures
CO6 :: use of Graph and Hashing techniques in problem solving

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

Relevant Websites ( RW )
Sr No (Web address) (only if relevant to the course) Salient Features
RW-1 https://www.geeksforgeeks.org/data-structures/ Every data structure explained with the help of demo program

RW-2 http://www.cs.usfca.edu/~galles/visualization/Algorithms.html Data structures visualization

RW-3 https://www.tutorialspoint.com/data_structures_algorithms/index.htm Tutorials give a clear understanding of concepts in easy and simplified
manner
RW-4 http://www.cs.auckland.ac.nz/software/AlgAnim/huffman.html Huffman Encoding

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.
 Software/Equipments/Databases
Sr No (S/E/D) (only if relevant to the course) Salient Features
SW-1 Dev C++ /Borland C++/Turbo C++ IDE to implement data structures in convenient and faster way

LTP week distribution: (LTP Weeks)

Weeks before MTE 7
Weeks After MTE 7
Spill Over (Lecture) 7

Detailed Plan For Lectures

Week Lecture Broad Topic(Sub Topic) Chapters/Sections of Other Readings, Lecture Description Learning Outcomes Pedagogical Tool Live Examples
Number Number Text/reference Relevant Websites, Demonstration/
books Audio Visual Aids, Case Study /
software and Virtual Images /
Labs animation / ppt
etc. Planned
Week 1 Lecture 1 Introduction(Basic Data T-1 RW-1 Lecture 0, Introduction Remembering basic Lecture cum Keeping files in
Structures.) R-1 RW-3 to data structures concepts and demonstration, a
algorithmic notations brain storming folder, directory
used in data structure
structures,
complexity of
algorithms
Lecture 2 Introduction(Basic Concepts T-1 RW-1 Applications of Understanding Lecture cum Moves on
and Notations) R-1 RW-3 different types of data how to apply demonstration, chess board
structures and time suitable data brain storming
space trade off structure for
given application
Introduction(Complexity T-1 RW-1 Applications of Understanding Lecture cum Moves on
analysis: time space and R-1 RW-3 different types of data how to apply demonstration, chess board
trade off) structures and time suitable data brain storming
space trade off structure for
given application
Introduction(Omega T-1 RW-1 Applications of Understanding Lecture cum Moves on
Notation) R-1 RW-3 different types of data how to apply demonstration, chess board
structures and time suitable data brain storming
space trade off structure for
given application
Introduction(Theta Notation) T-1 RW-1 Applications of Understanding Lecture cum Moves on
R-1 RW-3 different types of data how to apply demonstration, chess board
structures and time suitable data brain storming
space trade off structure for
given application

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.
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.
Week 1 Lecture 2 Introduction(Big O notation) T-1 RW-1 Applications of Understanding Lecture cum Moves on
R-1 RW-3 different types of data how to apply demonstration, chess board
structures and time suitable data brain storming
space trade off structure for
given application
Lecture 3 Arrays(Linear arrays: T-1 RW-1 traversal, insertion and Understanding Lecture cum Placing a chair
memory representation) R-1 RW-3 deletion operation in manipulation of demonstration, in between a
SW-1 arrays elements in an array brain storming row of chairs

Arrays(Array operations: T-1 RW-1 traversal, insertion and Understanding Lecture cum Placing a chair
traversal, insertion, deletion, R-1 RW-3 deletion operation in manipulation of demonstration, in between a
sorting, searching and SW-1 arrays elements in an array brain storming row of chairs
merging and their
complexity analysis.)
Week 2 Lecture 4 Arrays(Linear arrays: T-1 RW-1 traversal, insertion and Understanding Lecture cum Placing a chair
memory representation) R-1 RW-3 deletion operation in manipulation of demonstration, in between a
SW-1 arrays elements in an array brain storming row of chairs

Arrays(Array operations: T-1 RW-1 traversal, insertion and Understanding Lecture cum Placing a chair
traversal, insertion, deletion, R-1 RW-3 deletion operation in manipulation of demonstration, in between a
sorting, searching and SW-1 arrays elements in an array brain storming row of chairs
merging and their
complexity analysis.)
Lecture 5 Arrays(Linear arrays: T-1 RW-1 traversal, insertion and Understanding Lecture cum Placing a chair
memory representation) R-1 RW-3 deletion operation in manipulation of demonstration, in between a
SW-1 arrays elements in an array brain storming row of chairs

Arrays(Array operations: T-1 RW-1 traversal, insertion and Understanding Lecture cum Placing a chair
traversal, insertion, deletion, R-1 RW-3 deletion operation in manipulation of demonstration, in between a
sorting, searching and SW-1 arrays elements in an array brain storming row of chairs
merging and their
complexity analysis.)
Lecture 6 Sorting and Searching T-1 RW-1 Sorting elements of Analyzing how to Lecture cum Making students
(Bubble sort) R-1 RW-2 array apply appropriate demonstration, sit according to
SW-1 sorting algorithm at brain storming roll-nos. in a
appropriate place row
Sorting and Searching T-1 RW-1 Sorting elements of Analyzing how to Lecture cum Making students
(Insertion sort) R-1 RW-2 array apply appropriate demonstration, sit according to
SW-1 sorting algorithm at brain storming roll-nos. in a
appropriate place row
Sorting and Searching T-1 RW-1 Sorting elements of Analyzing how to Lecture cum Making students
(Selection sort) R-1 RW-2 array apply appropriate demonstration, sit according to
SW-1 sorting algorithm at brain storming roll-nos. in a
appropriate place row

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.
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.
Week 3 Lecture 7 Linked Lists(Introduction) T-1 RW-1 Introduction to linked Understanding linked Lecture cum Chain, slides
R-1 RW-3 list and its creation representation of demonstration, management in
SW-1 memory and dynamic brain storming presentation
allocation
Linked Lists(Memory T-1 RW-1 Introduction to linked Understanding linked Lecture cum Chain, slides
representation) R-1 RW-3 list and its creation representation of demonstration, management in
SW-1 memory and dynamic brain storming presentation
allocation
Linked Lists(Allocation) T-1 RW-1 Introduction to linked Understanding linked Lecture cum Chain, slides
R-1 RW-3 list and its creation representation of demonstration, management in
SW-1 memory and dynamic brain storming presentation
allocation
Lecture 8 Linked Lists(Traversal) T-1 RW-1 Introduction to linked Understanding linked Lecture cum Chain, slides
R-1 SW-1 list and its creation representation of demonstration, management in
memory and dynamic brain storming presentation
allocation
Linked Lists(Insertion) T-1 RW-1 Introduction to linked Understanding linked Lecture cum Chain, slides
R-1 SW-1 list and its creation representation of demonstration, management in
memory and dynamic brain storming presentation
allocation
Lecture 9 Linked Lists(Traversal) T-1 RW-1 Introduction to linked Understanding linked Lecture cum Chain, slides
R-1 SW-1 list and its creation representation of demonstration, management in
memory and dynamic brain storming presentation
allocation
Linked Lists(Insertion) T-1 RW-1 Introduction to linked Understanding linked Lecture cum Chain, slides
R-1 SW-1 list and its creation representation of demonstration, management in
memory and dynamic brain storming presentation
allocation
Week 4 Lecture 10 Linked Lists(Deletion) T-1 RW-1 Algorithm to traverse Understanding linked Lecture cum Chain, slides
R-1 SW-1 and delete nodes in representation of demonstration, management in
linked list memory and dynamic brain storming presentation
allocation
Lecture 11 Linked Lists(Header linked T-1 RW-1 Different variant of Analyzing Lecture cum Arrangement of
lists: Grounded and R-1 SW-1 linked list modification in the demonstration, coaches of a
Circular) design of linked list brain storming train
to increase efficiency
Lecture 12 Linked Lists(Header linked T-1 RW-1 Different variant of Analyzing Lecture cum Arrangement of
lists: Grounded and R-1 SW-1 linked list modification in the demonstration, coaches of a
Circular) design of linked list brain storming train
to increase efficiency
Week 5 Lecture 13 Linked Lists(Two-way lists: T-1 RW-1 Different variant of Analyzing Lecture cum Arrangement of
operations on two way R-1 SW-1 linked list modification in the demonstration, coaches of a
linked lists) design of linked list brain storming train
to increase efficiency
Lecture 14 Test - Code based 1

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.
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.
Week 5 Lecture 15 Stacks(Introduction: List T-1 RW-1 Representing stack Understanding Lecture cum Navigation of
and Array representations, R-1 RW-2 using linked list and implementation of demonstration, directory
Operations on stack SW-1 array, push and pop stack using array and brain storming structure in
(traversal, push and pop)) operations linked list as per windows
LIFO arrangement
Week 6 Lecture 16 Stacks(Arithmetic T-1 RW-1 Stack representation of Understanding prefix, Lecture cum Compiler design
expressions: polish notation, R-1 SW-1 arithmetic expressions infix and postfix demonstration,
evaluation and expression using stack notations preparation brain storming
transformation of
expressions.)
Lecture 17 Queue(Array and list T-1 RW-1 Representation of queue Understanding Lecture cum Process
representation) R-1 RW-2 using arrays and linked memory management demonstration, scheduling
SW-1 list and operations as per FIFO brain storming algorithms
arrangement
Lecture 18 Queue(operations (traversal, T-1 RW-1 Different versions of Understanding Lecture cum Process
insertion and deletion)) R-1 SW-1 queue and its operations memory management demonstration, scheduling
as per FIFO brain storming algorithms
arrangement
Queue(Priority Queues) T-1 RW-1 Different versions of Understanding Lecture cum Process
R-1 SW-1 queue and its operations memory management demonstration, scheduling
as per FIFO brain storming algorithms
arrangement
Week 7 Lecture 19 Queue(Deques) T-1 RW-1 Different versions of Understanding Lecture cum Process
R-1 SW-1 queue and its operations memory management demonstration, scheduling
as per FIFO brain storming algorithms
arrangement

SPILL OVER
Week 7 Lecture 20 Spill Over
Lecture 21 Spill Over

MID-TERM
Week 8 Lecture 22 Recursion(Introduction) T-1 RW-1 Introduction of recursion Using recursive Lecture cum
R-1 SW-1 and problem of tower of solutions for different demonstration,
Hanoi problems brain storming
Recursion(Recursive T-1 RW-1 Introduction of recursion Using recursive Lecture cum
implementation of Towers R-1 SW-1 and problem of tower of solutions for different demonstration,
of Hanoi) Hanoi problems brain storming
Lecture 23 Recursion(Merge sort) T-1 RW-1 Algorithm of merge sort Using recursive Lecture cum
R-1 SW-1 using recursive method solutions for different demonstration,
problems brain storming
Lecture 24 Recursion(Quick sort) T-1 RW-1 Algorithm of Quick sort Using recursive Lecture cum
R-1 SW-1 using recursive solutions for demonstration,
method different problems brain storming

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.
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.
Week 9 Lecture 25 Trees(Binary trees: T-1 RW-1 Introduction to tree data Remembering Lecture cum
introduction (complete and R-1 SW-1 structure and its memory nonlinear memory demonstration,
extended binary trees), representation arrangements and its brain storming
memory representation applications
(linked, sequential))
Lecture 26 Trees(In-order traversal) T-1 RW-1 Tree traversal basics: in- Understanding node Lecture cum
R-1 SW-1 order and pre-order tree to node access demonstration,
traversal algorithm brain storming
Trees(Pre-order traversal) T-1 RW-1 Tree traversal basics: in- Understanding node Lecture cum
R-1 SW-1 order and pre-order tree to node access demonstration,
traversal algorithm brain storming
Lecture 27 Trees(Post-order traversal T-1 RW-1 Tree traversal basics and Understanding node Lecture cum
using recursion) R-1 SW-1 post-order tree traversal to node access demonstration,
algorithm brain storming
Week 10 Lecture 28 Trees(Binary Search Tree: T-1 RW-1 Insertion, deletion of Understanding Lecture cum
introduction, searching, R-1 SW-1 nodes and its algorithm arrangements of data demonstration,
insertion and deletion) in binary search tree after manipulations brain storming
Lecture 29 Test - Code based 2
Lecture 30 AVL trees and Heaps(AVL T-1 RW-1 Introduction to AVL Applying another Lecture cum
trees Introduction) R-1 RW-2 trees and insertion requirement to make demonstration,
more efficient brain storming
arrangement of data
in nonlinear data
structure
AVL trees and Heaps(AVL T-1 RW-1 Introduction to AVL Applying another Lecture cum
trees Insertion) R-1 SW-1 trees and insertion requirement to make demonstration,
more efficient brain storming
arrangement of data
in nonlinear data
structure
Week 11 Lecture 31 AVL trees and Heaps(AVL T-1 RW-1 Deletion in AVL tree Applying another Lecture cum
trees Deletion) R-1 RW-2 requirement to make demonstration,
more efficient brain storming
arrangement of data
in nonlinear data
structure
Lecture 32 AVL trees and Heaps T-1 RW-1 Introduction to heap and Understanding array Lecture cum
(Heaps: Insertion) R-1 RW-2 insertion operation representation of demonstration,
SW-1 trees brain storming

Lecture 33 AVL trees and Heaps T-1 deletion operation and Understanding array Lecture cum
(Heaps: Deletion) R-1 heap sort representation of demonstration,
trees brain storming
AVL trees and Heaps T-1 deletion operation and Understanding array Lecture cum
(HeapSort) R-1 heap sort representation of demonstration,
trees brain storming

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.
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.
Week 12 Lecture 34 AVL trees and Heaps T-1 RW-4 Compression algorithm Applying technique Lecture cum Making students
(Huffman algorithm) R-1 for different strings for efficient use of demonstration, sit according to
resources to arrange brain storming roll-nos. in a
row
Lecture 35 Graphs(Graph Traversal: T-1 Operations on graphs Understanding node Lecture cum
BFS, DFS) R-1 and shortest path to node movement demonstration,
algorithm within graphs brain storming
Lecture 36 Graphs(Warshall's T-1 Operations on graphs Understanding node Lecture cum
algorithm) R-1 and shortest path to node movement demonstration,
algorithm within graphs brain storming
Week 13 Lecture 37 Graphs(Shortest path T-1 Operations on graphs Understanding node Lecture cum
algorithm Floyd Warshall R-1 and shortest path to node movement demonstration,
Algorithm(modified algorithm within graphs brain storming
warshall algorithm))
Lecture 38 Test - Code based 3
Lecture 39 Hashing(Hashing T-1 RW-1 Hashing techniques and Applying Lecture cum
introduction: hash functions, R-1 collision detection efficient searching demonstration,
hash table) brain storming
Week 14 Lecture 40 Hashing(Open hashing T-1 RW-1 Hashing techniques and Applying Lecture cum
(separate chaining)) R-1 collision detection efficient searching demonstration,
brain storming
Hashing(Closed hashing T-1 RW-1 Hashing techniques and Applying Lecture cum
(open addressing): linear R-1 collision detection efficient searching demonstration,
probing, quadratic probing brain storming
and double hashing.)

SPILL OVER
Week 14 Lecture 41 Spill Over
Lecture 42 Spill Over
Week 15 Lecture 43 Spill Over
Lecture 44 Spill Over
Lecture 45 Spill Over

Scheme for CA:

CA Category of this Course Code is:C010203 (Total 4 tasks, 1 compulsory and out of remaining 2 best out of 3 to be considered)

Component Iscompulsory Weightage (%) Mapped CO(s)

Test - Code based 2 NO 30 CO3, CO4
Test - Code based 3 NO 30 CO5, CO6
Test - Code based 1 NO 30 CO1, CO2

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.
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.
 Programming Practice Yes 40 CO1, CO2,
CO3, CO4,
CO5, CO6

Details of Academic Task(s)

Academic Task Objective Detail of Academic Task Nature of Academic Academic Task Marks Allottment /
Task Mode submission
(group/individuals) Week
Programming To evaluate the Student have to solve assigned MCQs and Coding practice Individual Online 30 1 / 14
Practice overall learnings of problems
students
Test - Code based To evaluate progress Mix of MCQs and Coding Problems Individual Online 30 4/5
1 of individual
student based upon
basic data structures
implementation and
complexity
Test - Code based To evaluate progress Mix of MCQs and Coding Problems Individual Online 30 9 / 10
2 of individual
student based upon
applicability of
learned concepts
Test - Code based To evaluate progress Mix of MCQs and Coding Problems Individual Online 30 12 / 13
3 of individual
student based upon
applicability of
learned concepts

Detailed Plan For Practicals

Practical No Broad topic Subtopic Other Readings Learning Outcomes

Practical 1 Array Program to implement insertion and Implementation of array
deletion operations in arrays
Practical 2 Searching Program to implement different Implementation of searching techniques
searching techniques - linear and
binary search
Practical 3 Sorting Program to implement different Implementation and analyzing how to apply
sorting techniques – bubble, selection appropriate sorting algorithm at appropriate place
and insertion sort

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 4 Linked List Program to implement searching, Implementation and analysis of different operations
insertion and deletion operations in on linked list
linked list
Practical 5 Doubly Linked List Program to implement searching, Implementation and analysis of different operations
insertion and deletion operations in on doubly linked list
doubly linked list
Practical 6 Stack Program to implement push and pop Understanding implementation of stack using array
operations in stacks using both arrays and linked list as per
and linked list LIFO arrangement
Practical 7 Queues Program to implement enqueue and Understanding implementation of queue using array
dequeue operations in queues using and linked list as per FIFO arrangement
both arrays and
linked list
Practical 8 Recursions Program to demonstrate concept of Implementation of recursions
recursions with problem of tower of
Hanoi
Practical 9 Recursive Sorting Program to implement recursive Implementation of merge and quick sorting
sorting techniques - merge sort, quick
sort
Practical 10 Tree Program to create and traverse a Implementation of binary tree
binary tree recursively
Practical 11 Binary Search Tree Program to implement insertion and Implementation of different operations on BST
deletion operations in BST
Practical 12 Heaps Program to implement insertion and Implementation of heap
deletion operations in Heaps and Heap
Sort
SPILL OVER
Practical 13 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.