Lovely Professional University, Punjab

Course Code Course Title Course Planner Lectures Tutorials Practicals Credits
CAP267 DATA STRUCTURES 19656::Dr. Anil Sharma 3 0 0 3
Course Weightage ATT: 5 CA: 25 MTT: 20 ETT: 50
Exam Category: 55: Mid Term Exam: All Subjective – End Term Exam: All
Subjective
Course Orientation COMPETITIVE EXAMINATION (Higher Education), KNOWLEDGE ENHANCEMENT, PLACEMENT EXAMINATION

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 http://www.introprogramming.info/english-intro-csharp-book/read-online/chapter-17- Tutorial on Trees and Graphs
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.

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.
 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
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

LTP week distribution: (LTP Weeks)

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

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 Basic concepts and Arrays T-1 AV-1 L1: Introductory lecture L1: Student will Discussion and Implementing a
(Introduction to data (lecture 0) understand the need demonstration particular task
structures and algorithms) L2: Introduction to data of data structures and using some
structures and algorithms L2: algorithm
algorithms Students will learn
about basic
terminology used in
data structures and
algorithms

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 Basic concepts and Arrays T-1 AV-1 L1: Introductory lecture L1: Student will Discussion and Implementing a
(Introduction to data (lecture 0) understand the need demonstration particular task
structures and algorithms) L2: Introduction to data of data structures and using some
structures and algorithms L2: algorithm
algorithms Students will learn
about basic
terminology used in
data structures and
algorithms
Lecture 3 Basic concepts and Arrays T-1 OR-2 Introduction to data Student will learn Discussion with Arranging
(Data structure operations) R-1 SW-1 structures various about data structures power point clothes within
operations to be operations presentation almirah
performed on Data
Structures
Basic concepts and Arrays T-1 OR-2 Introduction to data Student will learn Discussion with Taking the right
(Control structures) R-1 SW-1 structures various about data structures power point decision and
operations to be operations presentation performing
performed on Data some tasks again
Structures and again
Week 2 Lecture 4 Basic concepts and Arrays T-1 OR-1 Introduction to Student will learn Lecture cum Car speeds: top
(Complexity of algorithms) RW-2 algorithm complexity: about concept of big demonstration, speed,
best case, average case O notation and brain storming recommended
and worst case, big-O algorithm complexity speed, minimum
notation speed
Basic concepts and Arrays T-1 OR-1 Introduction to Student will learn Lecture cum Predictability of
(Asymptotic notations for R-1 RW-2 algorithm complexity: about concept of big demonstration, happening of a
complexity) R-2 best case, average case O notation and brain storming particular task
and worst case, big-O algorithm complexity
notation
Lecture 5 Basic concepts and Arrays T-1 RW-1 Introduction to Student will learn Discussion with Students sitting
(Representation of linear AV-1 sequential storage of about storing data in power point in a class roll
arrays) data elements a sequence presentation numberwise
without leaving
any chair in
between
Basic concepts and Arrays T-1 RW-1 Introduction to Student will learn Discussion with Taking
(Traversing linear arrays) AV-1 traversing of linear about processing power point attendance of
arrays every element of presentation students roll
array number wise
Lecture 6 Basic concepts and Arrays T-1 RW-3 Inserting and deleting Student will learn Discussion with Placing and
(Insertion and deletion in array element in a array about Insertion and power point removing CDs
linear arrays) deletion of data in presentation in a
linear arrays CD-Case
Basic concepts and Arrays T-1 RW-3 Introduction to pointers Student will learn Discussion with Arranging of
(Introduction to pointers) about the concept of power point files and folders
pointers presentation on Computer
System

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(Representation T-1 RW-1 Linked Lists, its Students will learn Lecture cum Chain, slides
of linked lists in memory) VL-1 memory representation about linked list and demonstration, management in
and processing each its representation in brain storming presentation.
element memory
of linked list
Linked Lists(Traversing a T-1 RW-1 Linked Lists, its Student will learn Lecture cum Processing of
single linked list) VL-1 memory representation about traversing each demonstration, files within
and processing each and every element of brain storming Folder and
element linked list subfolder
of linked list
Lecture 8 Linked Lists(Searching a T-1 RW-2 Finding for the Student will learn Discussion with Searching for a
linked list) RW-4 particular element in about searching of demonstration on particular file
linked list particular element in compiler within a folder
linked
list
Linked Lists(Insertion in to T-1 RW-2 Linked list, its creation Student will learn Discussion with Adding new
a linked list) RW-4 by inserting elements at about inserting data demonstration on contact numbers
different positions in a linked list compiler to mobile phone
Lecture 9 Linked Lists(Deletion from T-1 RW-2 Algorithm to delete Students will learn Discussion with Removal of
a linked list) AV-2 nodes from a linked list about management of demonstration on damaged link
dynamic memory compiler from a chain.
allocation on delete
operation
Week 4 Lecture 10 Linked Lists(Header linked T-1 RW-3 Introduction to header Student will learn Discussion with Engine of the
lists) AV-3 linked lists about header linked power point train carrying
lists presentation bogies with it
Linked Lists(Circular linked T-1 RW-3 Introduction to circular Student will learn Discussion with Students holding
lists) AV-3 linked lists about circular linked power point each others hand
lists presentation and standing on
a circle
Lecture 11 Linked Lists(Memory T-1 RW-4 Introduction of memory Student will learn Discussion with DMU Train
allocation of two way lists) R-1 allocation of two way about memory power point
lists and various allocation of two way presentation
operations that can be lists
performed on them
Lecture 12 Linked Lists(Operations on T-1 AV-2 Introduction to two way Student will learn Discussion with
two way lists) AV-3 lists operations about two way lists power point
operations presentation
Week 5 Lecture 13 Stacks and Queues(Array T-1 RW-3 Representing stack Students will learn Lecture cum Stack of books,
representation of stacks) AV-1 using linked list and about demonstration, tiles etc
array, push and pop implementation of brain storming
operations array as per LIFO
arrangement
Stacks and Queues(Linked T-1 OR-1 Introduction to stack Student will learn Lecture cum Stack of books,
representation of stacks) R-2 OR-2 using linked list about stack using demonstration, tiles etc
linked list 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.
Week 5 Lecture 14 Stacks and Queues(Stack T-1 AV-3 Stack representation of Students will come to Lecture cum
applications in arithmetic arithmetic expressions, know about prefix, demonstration,
expression conversion and transformation and infix and post-fix brain storming
evaluation) evaluation notations preparation
and inter conversion
Lecture 15 Stacks and Queues(Tower of T-1 OR-1 Arrangement of disc as Students will come to Discussion and Placing disc
Hanoi problem) VL-1 per tower of hanoi know about the demonstration from one tower
applications of stacks to another tower
Stacks and Queues(Use of T-1 OR-1 Function call, recursion, Student will learn Discussion and Traversing
stacks in recursion) VL-1 complexity issues about recursion in demonstration folders and files
stacks from root to last
node.
Week 6 Lecture 16 Test 1
Lecture 17 Stacks and Queues(Quick T-1 RW-4 Algorithm of quick sort Student will learn power point
sort) R-1 AV-1 about quick sort and presentation with
reducing complexity animations
while sorting
Lecture 18 Stacks and Queues(Linked T-1 OR-2 Representation of queue Students will learn Discussion and Process
representations of queues) R-2 RW-1 using arrays and linked about memory demonstration scheduling
list and operations management algorithms
as per FIFO
arrangement
Stacks and Queues(Array T-1 OR-2 Introduction to Queue Student will learn Discussion and Peoples
representation of circular RW-1 using Array about array demonstration standing in
queues) representations representations of Railway
queues reservation
counter
Week 7 Lecture 19 Stacks and Queues(Deques) T-1 AV-3 Different versions of Students will learn Lecture cum Process
R-1 VL-1 queue and its operations about memory discussion, brain scheduling
management storming algorithms
as per FIFO
arrangement
Stacks and Queues(Priority T-1 AV-3 Different versions of Student will learn Lecture cum VIP person gets
queues) VL-1 queue and its operations about Priority Queues discussion, brain more
storming importance then
individual
citizen

SPILL OVER
Week 7 Lecture 21 Spill Over

MID-TERM
Week 8 Lecture 22 Trees(Binary trees concept T-1 RW-2 Introduction to binary Student will learn Lecture cum
and terminology) AV-1 trees concept about basic discussion, brain
terminology used in storming
binary tree

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 8 Lecture 22 Trees(Sequential and linked T-1 RW-2 Introduction to tree data Student will be able Lecture cum
representation of binary R-2 AV-1 structure and to work on non linear discussion, brain
trees) representation of binary memory storming
tree using Arrays and arrangements and its
Linked List applications
Lecture 23 Trees(Expression trees) T-1 VL-1 Introduction to infix, Student will learn Discussion with
prefix and postfix about expression of power point
expression of binary tree tree presentation
Trees(Traversal algorithms T-1 VL-1 Study about tree Students will learn Discussion with
of binary trees) R-2 traversing algorithms about the tree power point
traversal basics presentation
Lecture 24 Trees(Binary search trees T-1 OR-2 Searching, insertion and Student will learn Discussion and
and its operations) RW-3 deletion operations in about binary search demonstration
binary tree trees and its
operations
Week 9 Lecture 25 Test 2
Lecture 26 Trees(AVL trees and its T-1 RW-1 Introduction to AVL Another requirement Lecture cum
operations) RW-2 trees and its based efficient discussion, brain
operations:insertion and arrangement of tree storming
deletion data structure
Lecture 27 Trees(Binary heaps and its T-1 OR-1 Introduction to binary Student will learn Discussion with
operations) RW-2 heaps: insert and delete about binary heaps power point
operations and its operations and presentation
array representation
of trees
Week 10 Lecture 28 Trees(Heap sort) T-1 RW-2 Algorithm of heap sort Student will learn Discussion with
about sorting power point
technique using heap presentation
sort
Lecture 29 Graphs(Graph theory T-1 VL-1 Introduction to graph, Student will learn Lecture cum
terminology) sequential and linked about graph and its discussion, brain
representation of graph memory storming
representation
Graphs(Memory T-1 VL-1 Introduction to graph, Student will learn Lecture cum
representation of graphs) sequential and linked about graph and its discussion, brain
representation of graph memory storming
representation
Lecture 30 Graphs(Operations on T-1 AV-2 Operations on graphs Student will learn Discussion with
graphs) R-1 and shortest path node to node demonstration on
algorithm movement within compiler
graphs
Graphs(Breadth first search T-1 AV-2 Introduction to Student will learn Discussion with
traversal) traversing a graph: about BFS algorithm demonstration on
Breadth first search compiler
algorithm

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 11 Lecture 31 Graphs(Depth first search T-1 RW-2 Introduction to Student will learn Discussion with
traversal) RW-3 traversing a graph: about DFS algorithm power point
Depth first search presentation
algorithm
Lecture 32 Graphs(Warshall's algorithm T-1 AV-3 Operations on graphs Student will learn Lecture cum
for shortest path) VL-1 and shortest path about Warshall's discussion, brain
algorithm algorithm storming
Lecture 33 Graphs(Topological sorting) T-1 AV-1 Topological sorting and Effective use of Lecture cum
application of graphs graph data structure discussion, brain
at relevant place storming
Week 12 Lecture 34 Searching and sorting(Linear T-1 OR-1 Algorithm of sequential Student will learn Discussion with
searching) AV-1 searching technique i.e about implementation demonstration on
linear search of searching compiler
techniques in data
structures
Searching and sorting T-1 OR-1 Algorithm of binary Student will learn Discussion with
(Binary Search) R-1 AV-1 search about implementation demonstration on
of searching compiler
techniques in data
structures
Lecture 35 Searching and sorting T-1 OR-1 Algorithm of bubble sort Understanding Discussion with
(Bubble sort) OR-2 and discussion on the different ordering demonstration on
complexity of the techniques in compiler
algorithm ascending and
descending order.
Lecture 36 Test 3
Week 13 Lecture 37 Searching and sorting T-1 RW-1 Algorithm for sorting Student will learn Lecture cum
(Selection sort) R-2 AV-3 data using selection sort about algorithm of discussion, brain
and understanding its selection sort storming
efficiency
Lecture 38 Searching and sorting T-1 AV-3 Algorithm for sorting Student will learn Lecture cum
(Insertion sort) R-1 data using insertion sort about insertion sort discussion, brain
and understanding algorithm storming
its efficiency
Lecture 39 Searching and sorting(Merge T-1 AV-2 Algorithm for sorting Student will learn Discussion with
sort) AV-3 data using merge sort about merge sort demonstration on
and understanding compiler
its efficiency
Week 14 Lecture 40 Searching and sorting T-1 RW-2 Hashing techniques and Compression that Discussion with
(Introduction to hashing collision detection provide security as power point
methods) well as efficient use presentation
of resources

SPILL OVER
Week 14 Lecture 42 Spill Over
Week 15 Lecture 43 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.
 Week 15 Lecture 44 Spill Over
Lecture 45 Spill Over

Scheme for CA:

CA Category of this Course Code is:A0203 (2 best out of 3)

Component Weightage (%)

Test 50
Test 50
Test 50

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
Test 1 To evaluate the Basic concepts and Arrays, Linked Lists, Stacks and Queues Individual Offline 30 5/6
writing skill of (Linked representations of queues)
students on the basis
of class learning
Test 2 To ensure Stacks and Queues, Trees(Binary search trees and its operations), Individual Offline 30 8/9
understanding of the AVL Trees
concepts and check
the student's
progress and his
performance on
individual basis
Test 3 To assess the Graphs, Sorting and Searching algorithms Individual Offline 30 11 / 12
learning and
grasping ability of
students

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.