SHRI VISHNU ENGINEERING COLLEGE FOR WOMEN: : BHIMAVARAM

LESSON PLAN
COURSE: II Year B. Tech

BRANCH: ECE-A

CLASS

YEAR: 2014-2015

: II-I Sem.

Faculty Name: Sri P.KIRAN SREE

Designation: Associate Professor

SUBJECT: D ATA STRUCTURES

PRE-REQUISITES:
A student should have good mathematical background and should have sound knowledge
on the basic constructs, concepts of C language.
COURSE OBJECTIVE:
1. To teach efficient storage mechanisms of data for an easy access.
2. To design and implementation of various basic and advanced data structures.
3. Be familiar with the use of data structures as the foundational base for computer solutions
to problems.
4. Become introduced to and investigate the differing logical relationships among various
data items.
5. Understand the generic principles of computer programming as applied to sophisticated
data structures.
6. Introduce various techniques for representation of the data in the real world.
COURSE OUTCOMES:
1. Student will be able to choose appropriate data structure as applied to specified problem
definition.
2. Student will be able to handle operations like searching, insertion, deletion, traversing
mechanism etc. on various data structures
3. Students will be able to use linear and non- linear data structures like stacks , queues ,
linked list etc
4. Apply algorithm analysis techniques to evaluate the performance of an algorithm and to
compare data structures.
5. Use simple data structures in modeling and designing solutions.

LESSON PLAN
S.No

No
of
Hrs

Date

Topic(s) Pl anned

Unit I
Overview of the syllabus,
Review of important concept of C
Algorithm Analysis and Space,
Time Complexity of an algorithm

1.

26-8-14

2.

28-8-14

3.

1-9-14

4.
5.
6.

1
1
1

2-9-14
4-9-14
5-9-14

7.

6-9-14

8.

8-9-14

9.

9-9-14

Importance of Sorting in DS,

Bubble sort, Insertion Sort
Quick Sort

10.
11.
12.

1
1
1

11-9-14
12-9-14
13-9-14

Radix Sort
Merge Sort
Heap Sort

13.

15-9-14

14.
15.
16.
17.
18.

1
1
1
1
1

16-9-14
18-9-14
19-914
20-9-14
22-9-14

19.

23-9-14

20.

25-9-14

Unit II
Importance of Stack Data Structure
Stack operations, Representation of Stack
using arrays
Reversing list
Factorial Calculation
Infix-Postfix Transformation
Evaluating a arithmetic expression
Importance of Queue Data Structure
Queue operations, Representation of Queue
using arrays
Implementation of queue operations using
a Stack
Round Robin Algorithm, Circular Queue

21.

26-9-14

Enqueue, Dequeue

22.

27-9-14

Priority Queue

Recursion importance,
Linear & Binary recursion,
Factorial &GCD examples
Fibonacci Series, Tail recursion
Towers of Hanoi
Searching introduction
Linear & Binary Search
Fibonacci Search

Unit III

Reference
Books

R3,R1
T1(21-27)
T2(54-62)
T3-402
T1-176
T2(243)
T2(246-248)
T1-180
T1(76-78)
T2(424-427)
T2(428)
T1-173
T1-322
T3-52, T4
T1-173
T3-89
T1-330
T1-325
T1-343
T2(219-224)

T2-230
T2-232
T3(17-24)
T1-188

T2-256
T3-136
T2-260
T1-192
T2-264
T1-193
T2-268, T4

Rema
rks

23.

9-10-14

Single Linked Lists(SLL) Importance

SLL representation
SLL operations

24.

10-10-14

25.
26.

1
1

11-10-14
13-10-14

27.

14-10-14

Merging two SLL, Reversing a SLL

Representing polynomial expression using
SLL
Sparse Matrix Representation using SLL

28.
29.

1
1

16-10-14
17-10-14

Advantages & Disadvantages of SLL

Circular linked lists

30.

18-10-14

Double Linked Lists

31.

20-10-14

32.

21-10-14

33.
34.
35.
36.

1
1
1
1

24-10-14
25-10-14
27-10-14
28-10-14

37.

30-10-14

38.
39.
40.
41.
42.

1
1
1
1
1

31-10-14
1-11-14
3-11-14
6-11-14
7-11-14

Unit IV
Introduction to Binary Tree data structure
Representation of Binary Tree using arrays
Representation of Binary Tree using
Linked Lists
Operations on Binary Tree
Binary Tree Traversals(Recursive)
Binary Tree Traversals(Recursive)
Creation of Binary tree from in-order and
pre-order
Creation of Binary tree from in-order and
pre-order
Unit V
Non recursive algorithm for In order
Non recursive algorithm for Pre order
Non recursive algorithm for Post order
Threaded Binary Tree
Threaded Binary Tree

43.

8-11-14

Binary search tree, basic concepts

44.

10-11-14

BST operations( insertion, deletion)

45.

11-11-14

Balanced binary trees importance, basics

46.

13-11-14

Balanced binary trees operations

47.

14-11-14

48.

15-11-14

49.

17-11-14

Applications of balanced binary trees

Unit VI
Importance of Graph Data structure
Representation of a graph using linked lists
Representation of a graph using linked lists

T1-114
T1(130-134)
T2(162-172)
T3-173
T2-211
T2-110
R3(178-182)
T2-162
T3-179
T2-180
T1-144
T2-188
T1-214
T3(189-236)
T2-286
T1-217
T1-224
T1-225
T2-287, R2
T2-289, T4

T3-211,R3
T3-212
T3-213
T3-239
T2-311
R1-167
T1(233-243)
R1(218-225)
T1(233-243)
T3-249
T3(261-268)
R1(28-240)
T2-316
T2(316-340)
T1-277
T1-286
T2-390

50.

18-11-14

51.

20-11-14

Representation of a graph using Adjacency

Matrix
BFS algorithm

52.

21-11-14

DFS algorithm

53.
54.
55.

1
1
1

22-11-14
24-11-14
25-11-14

56.

27-11-14

Dijkstras shortest path

Transitive closure
Prims Algorithm for minimum spanning
tree
Warshalls algorithm

57.
58.

1
1

28-11-14
29-11-14

59.

1-12-14

60.
61.
62.
63.
64.
65.
66.
67.
68.

1
1
1
1
1
1
1
1
1

2-12-14
4-12-14
5-12-14
6-12-14
8-12-14
9-12-14
11-12-14
12-12-14
13-12-14

Shell Sort
Totally monotone matrices and some
applications
Splay trees.
Finger search trees and their applications
Kruskal Algorithm
Review of I Unit
Review of II Unit
Review of III Unit
Review of IV Unit
Review of V Unit
Review of VI Unit

T2-361
T1-294 ,T4
T3-329
T3-330
R1(199-202)
T2-413
T2(405-415)
T2-407
T1-282
T2-414
R2, R1
R3, T4
T2-337
R1-211
T4
T2-409

Additional Topics (Not included in Syllabus)

1. Shell Sort
2. Totally monotone matrices and some applications
3. Splay trees.
4. Finger search trees and their applications
5. Kruskal Algorithm
TEXT BOOKS:
1. Data Structure with C, Seymour Lipschutz, TMH
2. Data Structures Using C, Reema Thareja,OXFORD
3. Data Structures, 2-e, Richard F, Gilberg , Forouzan, Cengage
4. Data Structures and algorithm analysis in C,2 nd edition Mark Allen Weiss, Pearson
REFERENCE BOOKS:
1. Data Structures and Algorithms, 2008,G.A.V.Pai, TMH
2. Classic Data Structures, 2-e, Debasis ,Samanta,PHI,2009
3. Fundamentals of Data Structure in C, 2-e, Horowitz,Sahni, Anderson
Freed,University Prees

Signature of the Faculty