Lovely Professional University,Punjab

Format For Instruction Plan [for Courses with Lectures and Labs

Course No

Cours Title

Course Planner

CSE205

DATA STRUCTURES

14594 :: Usha Mittal

Text Book:

Other Specific Book:

Lectures Tutorial Practical Credits

4

1 Schaum Outline series by: Seymour Lipschutz, Publishers: Tata McGraw Hill, New Delhi,Year of Publication:2006

2 Adam Drozdek, Data Structure & Algorithms in C++. Thomson

3 Yashwant P Kanetkar, Title: Let Us C

Other Reading
Sr No

Jouranls atricles as compulsary readings (specific articles, Complete reference)

4 [Link]
5 [Link]
6 [Link]
7 [Link]
8 [Link]
9 [Link]

Relevant Websites
Sr. No. (Web adress) (only if relevant to the courses)

Salient Features

10 [Link]

Arrays in data structures

11 [Link]

Pointer Arrays

12 [Link]

Linked List

13 [Link]

Stacks

Approved for Spring Session 2011-12

14 [Link]

Queues

15 [Link]

Stacks and Queues

16 [Link] Recursion
ml
17 [Link]

Binary Tree

18 [Link]

Binary Search tree

19 [Link]

Binary search Tree

20 [Link]

Heap

21 [Link]

Graphs

22 [Link]

Hashing

23 [Link]

Hash Table

24 [Link]
Hashing ppt
sa=t&source=web&cd=1&ved=0CBUQFjAA&url=http%3A%2F
%[Link]%2F~lee%2Fcs157b
%[Link]&rct=j&q=hashing%20in%20data
%20structure%20ppt&ei=jUK0TIn0F4GivQOjtoCmCg&us
25 [Link]
Searching and sorting
sa=t&source=web&cd=1&ved=0CBUQFjAA&url=http%3A%2F
%[Link]%2F~bpalmer
%2FDSA1%2FLectures%2FWeek%25204%2520Searching
%2520and%[Link]&rct=j&q=searching%20an
26 [Link]

introduction to pointers

Detailed Plan For Lectures

Week Number Lecture Number Lecture Topic

Chapters/Sections of Pedagogical tool

Textbook/other
Demonstration/case
reference
study/images/anmatio
n ctc. planned

Part 1
Week 1

Lecture 1

Basic concepts and notations, data structures and

data structure operations

->Reference :1,Ch 1
Sec 1.1 1.2 1.3 1.4

Lecture 2

Basic Data structures like arrays, linked list, stacks

and queues etc.

->Reference :1,Ch 1
Sec 1.1 1.2 1.3 1.4 1.5

Approved for Spring Session 2011-12

Week 1

Week 2

Week 3

Week 4

Lecture 3

Complexity Analysis: Mathematical notation and

functions, algorithmic complexity and time space
trade off, Big O Notation

->Reference :1,Ch 2
sec 2.1 2.2 2.3 2.4 2.5
2.6 2.7 2.8

Lecture 4

The best, average & Worst cases analysis

methodology

->Reference :1,Ch 2
sec 2.5 2.6

Lecture 5

Introduction to arrays, Representation of arrays in

memory, traversing linear arrays.

->Reference :1,Ch 4
sec 4.1 4.2 4.3 4.4

Lecture 6

Operations on arrays: insertion and deletion

->Reference :1,Ch 4
sec 4.5

Lecture 7

Linear Search and Binary Search and analysis of

their complexity

->Reference :1,Ch 4
sec 4.7 4.8

Lecture 8

Multidimensional Arrays, Pointers; Pointer Arrays

->Reference :1,Ch 4
sec 4.9 4.10

Lecture 9

Records; Records Structures, Representation of

records in memory

->Reference :1,Ch 4
sec 4.11 4.12

Lecture 10

Dynamic memory management,Usage of pointers,

memory management functions,
debugging pointers

->Reference
:3,Chapter 5
->Reference :26

Lecture 11

Introduction to linked list, Representation in

memory, Traversing of linked list

->Reference :1,Ch 5
Sec 5.1 5.2 5.3 5.4

Lecture 12

Searching in sorted linked list and in unsorted linked ->Reference :1,Ch 5

list. Memory Allocation
Sec 5.5 5.6

Lecture 13

Insertion into linked list

->Reference :1,Ch 5
Sec 5.7

Lecture 14

Deletion in linked list

->Reference :1,Ch 5
Sec 5.8

Lecture 15

Header linked list and its operations

->Reference :1,Ch 5
Sec 5.9

Lecture 16

Circular linked list and its operations

->Reference :1,Ch 5
Sec 5.9

Lecture 17

Two way linked list, traversing and searching in two ->Reference :1,Ch 5
way linked list
Sec 5.10

Lecture 18

Insertion in two way linked list

Lecture 19

Deletion in two way linked list. Applications of linked ->Reference :1,Ch 5

list.
Sec 5.10

Lecture 20

Conduct Test 1

[Link]

multidimensional_array.
ppt

Term Paper Allotment

Part 2
Week 4

Week 5

circular_linked_list.ppt

->Reference :1,Ch 5
Sec 5.10
Allotment of mini project

Approved for Spring Session 2011-12

Week 6

Week 7

Lecture 21

Introduction to stacks, sequential and linked

representation of stacks.

->Reference :1,Ch 6
sec 6.1 6.2 6.3 6.4

[Link]

Lecture 22

Stack Operations

->Reference :1,Ch 6
sec 6.5

Lecture 23

Applications of linked list: Arithmetic expressions;

polish notation

->Reference :1,Ch 6
sec 6.5

Lecture 24

Applications of linked list: Arithmetic expressions;

polish notation

->Reference :1,Ch 6
sec 6.7 6.8

[Link]

Lecture 25

Definition of Recursion, Function Call & Recursion

implementation & Complexity issues,

->Reference :1,Ch 6
sec 6.10 6.11

[Link]

Lecture 26

Tower of hanoi

->Reference :1,Ch 6
sec 6.12 6.13

Lecture 27

Introduction to Queues, Representation in memory, ->Reference :1,Ch 7

Operations on queues
sec 7.1 7.2 7.3 7.4

Lecture 28

Various types of queues and its applications

->Reference :1,Ch 7
sec 7.4

MID-TERM
Part 3
Week 8

Week 9

Week 10

Lecture 29

Introduction of binary trees,basic terminology,

representing binary trees in memory,

->Reference :1,Ch 7
sec 7.4

Lecture 30

Traversal of binary trees using stack.

->Reference :1,Ch 7
sec 7.7 7.8

Lecture 31

Introduction to BST, searching in BST

->Reference :1,Ch 7
sec 7.8

Lecture 32

Insertion & Deletion in BST

->Reference :1,Ch 7
sec 7.9

Lecture 33

AVL Search Trees, Insertion in AVL Search trees

->Reference :1,Ch 7
sec 7.10 7.11

Lecture 34

Deletion in AVL Search Trees

->Reference :1,Ch 7
sec 7.12

Lecture 35

Heaps, insertion in heap

->Reference :1,Ch 7
sec 7.17

Lecture 36

Deletion in heap, Heap sort, Heaps as priority

Queues.

->Reference :1,Ch 7
sec 7.17

Lecture 37

Huffman Algorithm

->Reference :1,Ch 7
sec 7.18

Lecture 38

Introduction to graphs, basic terminology

Lecture 39

Sequential and linked representation

->Reference :1,Ch 8
sec 8.1 8.2 8.3 8.5

[Link]

[Link]

Approved for Spring Session 2011-12

Part 4
Week 10

Lecture 40

Traversing a graph(BFS, DFS)

->Reference :1,Ch 8
sec 8.7

Week 11

Lecture 41

Warshall's Algorithm, Shortest Path

->Reference :1,Ch 8
sec 8.4

Lecture 42

Topological Sorting, Applications of Graphs

->Reference :1,Ch 8
sec 8.8

Lecture 43

Hashing, hash table, hash Functions

->Reference :1,Ch 9
sec 9.9

Lecture 44

Various types of hash functions, Collision resolution ->Reference :1,Ch 9

techniques.
sec 9.9

Lecture 45

Searching and sorting use of various data structures ->Reference :1,Ch 9

for searching and sorting
sec 9.1 9.2

Lecture 46

Bubble Sort

->Reference :1,Ch 4
sec 4.6

[Link]

Lecture 47

Insertion Sort

->Reference :1,Ch 9
sec 9.3

[Link]

Lecture 48

Selection Sort

->Reference :1,Ch 9
sec 9.4

[Link]

Lecture 49

Merge Sort

->Reference :1,Ch 9
sec 9.6

[Link]

Lecture 50

Quick Sort

->Reference :1,Ch 6
sec 6.6

[Link]

Lecture 51

Radix Sort

->Reference :1,Ch 9
sec 9.7

[Link]

Lecture 52

Comparison of all the sorting algorithms and their

complexity analysis

->Reference :1,ch 9

[Link]

Week 12

Week 13

Submission of mini
project

Term Paper Submission

[Link]

Spill Over
Week 14

Lecture 53

Abstract data types

Lecture 54

Uses of queues in Operating System

Details of homework and case studies

Approved for Spring Session 2011-12

Homework No.

Objective

Test 1

To have a
knowledge of
basics of data
Structure

Mini project 1

Term Paper 1

Topic of the Homework

Nature of homework
(group/individuals/field
work

Syllabus covered from week 1 to week 4

Individual

Evaluation Mode

Allottment /
submission
Week

Written Test

3/5

To have the
A mini project is allocated to a group of 3 students. Mini project be Group
knowledge of
like implementation of telephone directory, address book, English
practical concepts dictionary etc.
of data structures.

Mini Project

5 / 10

To have the
knowledge of
basic data
structure and
applications of
data structures.

Term paper

3 / 11

Term Paper

Individual

Scheme for CA:out of 100*

Component

Frequency

Term Paper,Test,Mini project

Out Of
2

Each Marks Total Marks

3

Total :-

10

20

10

20

* In ENG courses wherever the total exceeds 100, consider x best out of y components of CA, as explained in teacher's guide available on the
UMS
List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper)
Sr. No. Topic
1 AVL trees and its operations .Comparisons with other trees and uses
2 In depth comparisons of all sorting algorithms and considering the cases in which a particular sorting
3 Role of Data Structures in Compiler Design
4 Compare the practical performance of Fibonacci heaps and binary heaps.
5 Complexity of Algorithms
6 Queue and its uses in Opearting System

Approved for Spring Session 2011-12

7 Application of Linked Lists in Operating System at least 4 cases

8 Role of Data Structures in Programming languages
9 Different Balanced binary trees
10 Comparative study of BFS, DFS on trees and graphs
11 Fault tolerant data structures
12 Comparative Study of Dynamic and Static Array
13 Multi-dimension Linked Lists
14 Travelling salesman problem
15 Hashing

Approved for Spring Session 2011-12