Lovely Professional University, Punjab

Course Code Course Title Course Planner Lectures Tutorials Practicals Credits
CSE205 DATA STRUCTURES AND ALGORITHMS 14770::Sawal Tandon 3.0 0.0 0.0 3.0
Course Orientation 1 :DISCIPLINE KNOWLEDGE, 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 Seymour Lipschutz 1st 2014 MCGRAW HILL EDUCATION
Reference Books
Sr No Title Author Edition Year Publisher Name
R-1 DATA STRUCTURES AND ALFRED V. AHO, 1st 2013 PEARSON
ALGORITHMS JEFFREY D. ULLMAN
AND JOHN E.
HOPCROFT

Relevant Websites
Sr No Web address (only if relevant to the course) Salient Features
RW-1 http://www.thegeekstuff.com/2012/01/advanced-c-pointers/ Pointer to pointer, pointer to functions, array of pointers

RW-2 http://cslibrary.stanford.edu/103/ Linked List

RW-3 http://www.cs.auckland.ac.nz/software/AlgAnim/huffman.html Huffman Encoding

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

RW-5 https://www.cs.auckland.ac.nz/software/AlgAnim/hash_tables.html Hashing

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 for all the data structures and sorting searching techniques
AV-2 http://nptel.ac.in/video.php?subjectId=106102064 Data structures audio video tutorials

Software/Equipments/Databases

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

SW-1 Dev C++ software (http://www.bloodshed.net/dev/devcpp.html ), Borland C++ Efficient implementation of various data structures involving the use of
pointers.

LTP week distribution: (LTP Weeks)

 Weeks before MTE 7
Weeks After MTE 7
Spill Over 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:1-2 RW-4 Lecture-0 and Learn basic concepts Lecture cum Keeping files in
Structures.) R-1:1 AV-1 Introduction to data and algorithmic demonstration, a folder,
AV-2 structures notations used in data brain storming directory
structures, structure
complexity of
algorithms
Lecture 2 Introduction(Basic Concepts T-1:1-2 RW-4 Applications of different Ability to apply Lecture cum Shopping list,
and Notations) R-1:1 SW-1 types of data structures suitable data structure discussion, brain design of a
AV-1 and time space trade off for given application storming calculator, chess
AV-2 board, map etc.

Lecture 3 Introduction(Theta Notation) T-1:1-2 RW-4 Algorithmic notations, Learn basic concepts Lecture cum Car speeds: top
R-1:1 AV-1 different parameters of and algorithmic demonstration, speed,
AV-2 complexity evaluation notations used in data brain storming recommended
of algorithms structures, speed, minimum
complexity of speed
algorithms
Introduction(Big O notation) T-1:1-2 RW-4 Algorithmic notations, Learn basic concepts Lecture cum Car speeds: top
R-1:1 AV-1 different parameters of and algorithmic demonstration, speed,
AV-2 complexity evaluation notations used in data brain storming recommended
of algorithms structures, speed, minimum
complexity of speed
algorithms
Introduction(Omega T-1:1-2 RW-4 Algorithmic notations, Learn basic concepts Lecture cum Car speeds: top
Notation) R-1:1 AV-1 different parameters of and algorithmic demonstration, speed,
AV-2 complexity evaluation notations used in data brain storming recommended
of algorithms structures, speed, minimum
complexity of speed
algorithms
Week 2 Lecture 4 Introduction(Complexity T-1:1 RW-4 Analyzing the Capability to Lecture cum Specification of
analysis: time space and R-1:1 SW-1 complexity of given calculate the demonstration, mileage of a
trade off) AV-1 structure of algorithm or complexity of any brain storming vehicle
AV-2 program code given algorithm
Week 2 Lecture 5 Arrays(Linear arrays: T-1:4 RW-4 Introduction and Visualization of Lecture cum Sitting
memory representation) SW-1 memory representation contigeous memory demonstration, arrangement of
AV-1 of arrays allocation. brain storming students in class
AV-2 in a line.

Arrays(2D and 3D Arrays T-1:4 RW-4 Introduction and Visualization of Lecture cum Sitting
and Representation) SW-1 memory representation contigeous memory demonstration, arrangement of
AV-1 of arrays allocation. brain storming students in class
AV-2 in a line.

Lecture 6 Arrays(Traversal) T-1:4 RW-4 Traversal, linear search, Ability to apply Lecture cum Visiting to a
SW-1 binary search and appropriate searching demonstration, page in a book
AV-1 bubble sort algorithm at brain storming
AV-2 appropriate place.

Arrays(Sorting) T-1:4 RW-4 Traversal, linear search, Ability to apply Lecture cum Visiting to a
SW-1 binary search and appropriate searching demonstration, page in a book
AV-1 bubble sort algorithm at brain storming
AV-2 appropriate place.

Arrays(Bubble sort) T-1:4 RW-4 Traversal, linear search, Ability to apply Lecture cum Visiting to a
SW-1 binary search and appropriate searching demonstration, page in a book
AV-1 bubble sort algorithm at brain storming
AV-2 appropriate place.

Week 3 Lecture 7 Arrays(Insertion) T-1:4 RW-4 Insertion, deletion and Manipulation of Lecture cum Placing a chair
SW-1 other operations on elements in an array demonstration, in between a
AV-1 arrays brain storming row of chairs
AV-2

Arrays(Deletion) T-1:4 RW-4 Insertion, deletion and Manipulation of Lecture cum Placing a chair
SW-1 other operations on elements in an array demonstration, in between a
AV-1 arrays brain storming row of chairs
AV-2

Arrays(Merging and their T-1:4 RW-4 Insertion, deletion and Manipulation of Lecture cum Placing a chair
complexity analysis.) SW-1 other operations on elements in an array demonstration, in between a
AV-1 arrays brain storming row of chairs
AV-2

Lecture 8 Linked Lists(Introduction) T-1:5 RW-2 Introduction to linked Linked representation Lecture cum Chain, slides
R-1:2 RW-4 list, its creation by of memory and demonstration, management in
SW-1 inserting elements at dynamic allocation. brain storming presentation.
AV-1 different positions
AV-2
Week 3 Lecture 8 Linked Lists(Memory T-1:5 RW-2 Introduction to linked Linked representation Lecture cum Chain, slides
representation) R-1:2 RW-4 list, its creation by of memory and demonstration, management in
SW-1 inserting elements at dynamic allocation. brain storming presentation.
AV-1 different positions
AV-2

Linked Lists(Allocation) T-1:5 RW-2 Introduction to linked Linked representation Lecture cum Chain, slides
R-1:2 RW-4 list, its creation by of memory and demonstration, management in
SW-1 inserting elements at dynamic allocation. brain storming presentation.
AV-1 different positions
AV-2

Linked Lists(Insertion) T-1:5 RW-2 Introduction to linked Linked representation Lecture cum Chain, slides
R-1:2 RW-4 list, its creation by of memory and demonstration, management in
SW-1 inserting elements at dynamic allocation. brain storming presentation.
AV-1 different positions
AV-2

Lecture 9 Linked Lists(Traversal) T-1:5 RW-2 Algorithm to traverse Node to node access Lecture cum Presentation
R-1:2 RW-4 linked list in linked list based demonstration, rehearsal
SW-1 upon location and brain storming
AV-1 values
AV-2

Week 4 Lecture 10 Linked Lists(Deletion) T-1:5 RW-2 Algorithm to delete Management of Lecture cum Removal of
R-1:2 RW-4 nodes from a linked list dynamic memory demonstration, damaged link
SW-1 allocation on delete brain storming from a chain.
AV-1 operation
AV-2

Lecture 11 Linked Lists(Two-way lists: T-1:5 RW-2 Different variant of Modification in the Lecture cum Arrangement of
operations on two way R-1:2 RW-4 linked list design of linked list demonstration, coaches of a
linked lists.) SW-1 to increase efficiency brain storming train
AV-1
AV-2

Linked Lists(Header linked T-1:5 RW-2 Different variant of Modification in the Lecture cum Arrangement of
lists: Grounded and R-1:2 RW-4 linked list design of linked list demonstration, coaches of a
Circular) SW-1 to increase efficiency brain storming train
AV-1
AV-2

Lecture 12 MCQ,Test1
Week 5 Lecture 13 Stacks(Introduction: List T-1:6 RW-4 Representing stack Implementation of Lecture cum Stack of books,
and Array representations, R-1:2 SW-1 using linked list and array as per LIFO demonstration, tiles etc
Operations on stack AV-1 array, push and pop arrangement brain storming
(traversal, push and pop)) AV-2 operations
Week 5 Lecture 14 Stacks(Arithmetic T-1:6 RW-4 Stack representation of Pre-fix, in-fix and Lecture cum Compiler design
expressions) R-1:2 SW-1 arithmetic expressions, post-fix notations demonstration,
AV-1 tranformation and preparation and inter- brain storming
AV-2 evaluation conversion

Stacks(Evaluation and T-1:6 RW-4 Stack representation of Pre-fix, in-fix and Lecture cum Compiler design
transformation of R-1:2 SW-1 arithmetic expressions, post-fix notations demonstration,
expressions) AV-1 tranformation and preparation brain storming
AV-2 evaluation

Stacks(Polish notation) T-1:6 RW-4 Stack representation of Pre-fix, in-fix and Lecture cum Compiler design
R-1:2 SW-1 arithmetic expressions, post-fix notations demonstration,
AV-1 tranformation and preparation and inter- brain storming
AV-2 evaluation conversion

Lecture 15 Stacks(Quick sort) T-1:6 RW-4 Algorithm of quick sort Reducing complexity Lecture cum Data mining
R-1:2 SW-1 while sorting demonstration,
AV-1 brain storming
AV-2

Week 6 Lecture 16 Queues and Recursion T-1:6 RW-4 Function call, recursion, Looping with out Lecture cum Traversing
(Function Call) R-1:2 SW-1 complexity issues iterating statements demonstration, folders and files
AV-1 brain storming from root to last
AV-2 node.

Queues and Recursion T-1:6 RW-4 Function call, recursion, Looping with out Lecture cum Traversing
(Recursion implementation R-1:2 SW-1 complexity issues iterating statements demonstration, folders and files
and Complexity issues.) AV-1 brain storming from root to last
AV-2 node.

Lecture 17 Stacks(Towers of Hanoi.) T-1:6 RW-4 Arrangement of disc as Another application Lecture cum
R-1:2 SW-1 per tower of hanoi of stack demonstration,
AV-1 brain storming
AV-2

Lecture 18 Queues and Recursion T-1:6 RW-4 Representation of queue Memory management Lecture cum Process
(operations (traversal, R-1:2 SW-1 using arrays and linked as per FIFO demonstration, scheduling
insertion and deletion)) AV-1 list and operations arrangement brain storming algorithms
AV-2

Queues and Recursion(Array T-1:6 RW-4 Representation of queue Memory management Lecture cum Process
and list representation) R-1:2 SW-1 using arrays and linked as per FIFO demonstration, scheduling
AV-1 list and operations arrangement brain storming algorithms
AV-2

Week 7 Lecture 19 Queues and Recursion T-1:6 RW-4 Different versions of Memory management Lecture cum Process
(Priority Queues) R-1:2 SW-1 queue and its operations as per FIFO demonstration, scheduling
AV-1 arrangement brain storming algorithms
AV-2
Week 7 Lecture 19 Queues and Recursion T-1:6 RW-4 Different versions of Memory management Lecture cum Process
(Deques) R-1:2 SW-1 queue and its operations as per FIFO demonstration, scheduling
AV-1 arrangement brain storming algorithms
AV-2

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

MID-TERM
Week 8 Lecture 22 Trees(Binary trees) T-1:7 RW-2 Introduction to tree data Non linear memory Lecture cum Directory
R-1:3 RW-3 structure and its memory arrangements and its discussion, brain structure and file
RW-4 representation applications storming system, Web
SW-1 site link
AV-1 structure
AV-2

Trees(Memory T-1:7 RW-2 Introduction to tree data Non linear memory Lecture cum Directory
Representation (Linked, R-1:3 RW-3 structure and its memory arrangements and its discussion, brain structure and file
Sequential)) RW-4 representation applications storming system, Web
SW-1 site link
AV-1 structure
AV-2

Lecture 23 Trees(Pre-order traversal T-1:7 RW-2 Tree traversal basics and Node to node access Lecture cum Directory
using Stack) R-1:3 RW-3 pre-order tree traversal as per RLR algorithm discussion, brain structure and file
RW-4 algorithm storming system, Web
SW-1 site link
AV-1 structure
AV-2

Lecture 24 Trees(In-order traversal T-1:7 RW-2 In order and post order Node to node access Lecture cum Directory
using Stack) R-1:3 RW-3 traversing algorithm on using LRN and LNR discussion, brain structure and file
RW-4 tree storming system, Web
SW-1 site link
AV-1 structure
AV-2

Trees(Post-order traversal T-1:7 RW-2 In order and post order Node to node access Lecture cum Directory
using Stack) R-1:3 RW-3 traversing algorithm on using LRN and LNR discussion, brain structure and file
RW-4 tree storming system, Web
SW-1 site link
AV-1 structure
AV-2
Week 9 Lecture 25 Trees(Binary Search Tree- T-1:7 RW-2 Introduction to binary Arranging data Lecture cum Directory
searching) R-1:3 RW-3 search tree, insertion efficiently discussion, brain structure and file
RW-4 and deletion of nodes storming system, Web
SW-1 site link
AV-1 structure
AV-2

Trees(Binary Search Tree- T-1:7 RW-2 Introduction to binary Arranging data Lecture cum Directory
Insertion) R-1:3 RW-3 search tree, insertion efficiently discussion, brain structure and file
RW-4 and deletion of nodes storming system, Web
SW-1 site link
AV-1 structure
AV-2

Lecture 26 Trees(Binary Search Tree- T-1:7 RW-2 Deletion algorithm in Re-arrangements to Lecture cum Directory
deletion) R-1:3 RW-3 BST continue same order discussion, brain structure and file
RW-4 and arrangements storming system, Web
SW-1 after manipulations site link
AV-1 structure
AV-2

Lecture 27 Trees(AVL trees T-1:7 RW-2 Introduction to AVL Another requirement Lecture cum Directory
Introduction) R-1:3 RW-3 trees and insertion based efficient discussion, brain structure and file
RW-4 arrangement of tree storming system, Web
SW-1 data structure site link
AV-1 structure
AV-2

Trees(AVL trees Insertion) T-1:7 RW-2 Introduction to AVL Another requirement Lecture cum Directory
R-1:3 RW-3 trees and insertion based efficient discussion, brain structure and file
RW-4 arrangement of tree storming system, Web
SW-1 data structure site link
AV-1 structure
AV-2

Week 10 Lecture 28 Trees(AVL trees Deletion) T-1:7 RW-2 Deletion in AVL tree Different form of Lecture cum Directory
R-1:3 RW-3 trees and operations discussion, brain structure and file
RW-4 storming system, Web
SW-1 site link
AV-1 structure
AV-2

Lecture 29 Trees(Heaps: Insertion) T-1:7 RW-2 Introduction to heap, Array representation Lecture cum Directory
R-1:3 RW-3 insertion and deletion of trees discussion, brain structure and file
RW-4 algorithm, Heapsort storming system, Web
SW-1 site link
AV-1 structure
AV-2
Week 10 Lecture 29 Trees(Heaps: Deletion) T-1:7 RW-2 Introduction to heap, Array representation Lecture cum Directory
R-1:3 RW-3 insertion and deletion of trees discussion, brain structure and file
RW-4 algorithm, Heapsort storming system, Web
SW-1 site link
AV-1 structure
AV-2

Trees(sorting and T-1:7 RW-2 Introduction to heap, Array representation Lecture cum Directory
complexity analysis) R-1:3 RW-3 insertion and deletion of trees discussion, brain structure and file
RW-4 algorithm, Heapsort storming system, Web
SW-1 site link
AV-1 structure
AV-2

Lecture 30 MCQ,Test2
Week 11 Lecture 31 Trees(Huffman algorithm) T-1:7 RW-2 Compression algorithm Technique for Lecture cum
R-1:3 RW-3 for different strings efficient use of discussion, brain
RW-4 resources to arrange storming
SW-1
AV-1
AV-2

Lecture 32 Graphs(Sequential T-1:8 RW-4 Introduction and Linear representation Lecture cum Maps and
Representation) R-1:6-7 SW-1 representation of graphs of non linear data discussion, brain Navigation
AV-1 structures storming
AV-2

Graphs(Linked T-1:8 RW-4 Introduction and Linear representation Lecture cum Maps and
Representation) R-1:6-7 SW-1 representation of graphs of non linear data discussion, brain Navigation
AV-1 structures storming
AV-2

Lecture 33 Graphs(Insertion) T-1:8 RW-4 Operations on graphs Node to node Lecture cum Maps and
R-1:6-7 SW-1 and shortest path movement within discussion, brain Navigation
AV-1 algorithm graphs storming
AV-2

Graphs(Deletion) T-1:8 RW-4 Operations on graphs Node to node Lecture cum Maps and
R-1:6-7 SW-1 and shortest path movement within discussion, brain Navigation
AV-1 algorithm graphs storming
AV-2

Graphs(Warshall's T-1:8 RW-4 Operations on graphs Node to node Lecture cum Maps and
algorithm) R-1:6-7 SW-1 and shortest path movement within discussion, brain Navigation
AV-1 algorithm graphs storming
AV-2
Week 11 Lecture 33 Graphs(Searching) T-1:8 RW-4 Operations on graphs Node to node Lecture cum Maps and
R-1:6-7 SW-1 and shortest path movement within discussion, brain Navigation
AV-1 algorithm graphs storming
AV-2

Graphs(Shortest path T-1:8 RW-4 Operations on graphs Node to node Lecture cum Maps and
algorithm Floyd Warshall R-1:6-7 SW-1 and shortest path movement within discussion, brain Navigation
Algorithm(modified AV-1 algorithm graphs storming
warshall algorithm)) AV-2

Week 12 Lecture 34 Graphs(Graph Traversal: T-1:8 RW-4 Operations on graphs Node to node Lecture cum Maps and
BFS, DFS) R-1:6-7 SW-1 and shortest path movement within discussion, brain Navigation
AV-1 algorithm graphs storming
AV-2

Lecture 35 Graphs(Topological sorting, T-1:8 RW-4 Topological sorting and Effective use of Lecture cum Maps and
applications of graphs.) R-1:6-7 SW-1 application of graphs graph data structure discussion, brain Navigation
AV-1 at relevant place storming
AV-2

Lecture 36 MCQ,Test3
Week 13 Lecture 37 Hashing(Hashing T-1:9 RW-4 Hashing techniques and Compression that Lecture cum Hashcode
Introduction) RW-5 collision detection provide security as discussion, brain generation
SW-1 well as efficient use storming algorithms,
AV-1 of resources security
AV-2 algorithms

Hashing(Hash Functions) T-1:9 RW-4 Hashing techniques and Compression that Lecture cum Hashcode
RW-5 collision detection provide security as discussion, brain generation
SW-1 well as efficient use storming algorithms,
AV-1 of resources security
AV-2 algorithms

Hashing(Hash Table) T-1:9 RW-4 Hashing techniques and Compression that Lecture cum Hashcode
RW-5 collision detection provide security as discussion, brain generation
SW-1 well as efficient use storming algorithms,
AV-1 of resources security
AV-2 algorithms

Hashing(Open hashing T-1:9 RW-4 Hashing techniques and Compression that Lecture cum Hashcode
(separate chaining)) RW-5 collision detection provide security as discussion, brain generation
SW-1 well as efficient use storming algorithms,
AV-1 of resources security
AV-2 algorithms
Week 13 Lecture 37 Hashing(Closed hashing T-1:9 RW-4 Hashing techniques and Compression that Lecture cum Hashcode
(open addressing)) RW-5 collision detection provide security as discussion, brain generation
SW-1 well as efficient use storming algorithms,
AV-1 of resources security
AV-2 algorithms

Lecture 38 Hashing(Quadratic Probing) T-1:9 RW-4 Probing in hashing, Compression that Lecture cum Hashcode
RW-5 techniques provide security as discussion, brain generation
SW-1 well as efficient use storming algorithms,
AV-1 of resources security
AV-2 algorithms

Lecture 39 Sorting and Searching T-1:9 RW-4 Algorithms for sorting Understanding Lecture cum Arrangement of
(Insertion sort) R-1:8 SW-1 data and understanding different ordering discussion, brain records
AV-1 its efficiency techniques in storming wherever
AV-2 ascending and applicable
descending order.
Sorting and Searching T-1:9 RW-4 Algorithms for sorting Understanding Lecture cum Arrangement of
(Selection sort) R-1:8 SW-1 data and understanding different ordering discussion, brain records
AV-1 its efficiency techniques in storming wherever
AV-2 ascending and applicable
descending order.
Sorting and Searching(Radix T-1:9 RW-4 Algorithms for sorting Understanding Lecture cum Arrangement of
sort) R-1:8 SW-1 data and understanding different ordering discussion, brain records
AV-1 its efficiency techniques in storming wherever
AV-2 ascending and applicable
descending order.
Sorting and Searching(Shell T-1:9 RW-4 Algorithms for sorting Understanding Lecture cum Arrangement of
sort) R-1:8 SW-1 data and understanding different ordering discussion, brain records
AV-1 its efficiency techniques in storming wherever
AV-2 ascending and applicable
descending order.
Week 14 Lecture 40 Sorting and Searching T-1:9 RW-4 Algorithms for sorting Understanding Lecture cum Applications
(Complexity analysis and R-1:8 SW-1 data and understanding different ordering discussion, brain where ordering
comparison of all searching AV-1 its efficiency techniques in storming of records
and sorting techniques.) AV-2 ascending and required
descending order.
Sorting and Searching T-1:9 RW-4 Algorithms for sorting Understanding Lecture cum Applications
(Merge sort) R-1:8 SW-1 data and understanding different ordering discussion, brain where ordering
AV-1 its efficiency techniques in storming of records
AV-2 ascending and required
descending order.

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

Scheme for CA:

Component Frequency Out Of Each Marks Total Marks
MCQ,Test 2 3 10 20
Total :- 10 20

Details of Academic Task(s)

AT No. Objective Topic of the Academic Task Nature of Academic Task Evaluation Mode Allottment /
(group/individuals/field submission Week
work
MCQ1 To evaluate progress Objective type questions, containing multiple choices with Individual Performance in 3/4
of individual student negative marking 25 percent, as per contents delivered from academic task
based upon basic lecture number 1 to 11 (quiz)
data structures and
complexity
MCQ2 To evaluate progress Objective type questions, containing multiple choices with Individual Performance in 9 / 10
of individual student negative marking 25 percent, as per contents delivered from academic task
based upon lecture number 15 to 29 (quiz)
algorithms and
concepts
Test1 To evaluate progress Subjective test with mix of analytic and descriptive type questions Individual Performance in 11 / 12
of individual student as per contents delivered from lecture 30 to 35. All questions academic task (test)
based upon should be of 5 marks each or in multiples of 5.
applicabilty of
learned concepts