Vous êtes sur la page 1sur 2

Lendi Institute of Technology & Engineering

Jonnada, Vizianagaram 535 005


LESSON PLAN
Department
: CSE
Class
: II/IV B.TECH
Name of the Subject: ADVANCED DATA STRUCTURES
Name of the faculty : A.YUGANDHARA RAO

UNIT

Name Of The Topic

No of
Periods
required

Dictionaries : Sets,
Dictionaries,

Hash Tables, Open Hashing,


Closed Hashing

Hashing Functions: Division


Method

Multiplication Method

Analysis of Closed Hashing


Result

Hash Table Restructuring, Skip


Lists, Analysis of Skip Lists

Hashing programs, problem


solving(tutorial)

Date
: 14-12-2015
Semester : II

Total
No of
Periods

13

Tentative date
of completion

Actual
date of
REMARKS
completion

14-12-2015
To
30-12-2015

The First Unit Will be Completed approximately in 13 Hours

II

Balanced Trees : AVL Trees:


Maximum Height of an AVL Tree

Insertions and Deletions

2-3 Trees: Insertion, Deletion.

AvlTree Construction Problems


and programs(Tutorial)

12

31-12-2015
To
19-01-2016

The Second Unit Will be Completed approximately in 12 Hours

III

Binary Heaps : Implementation of


Insert and Delete min
Creating Heap.

Binomial Queues : Binomial


Queue Operations

Binomial Amortized Analysis

Lazy Binomial Queues

2
20-01-2016
10

To
03-02-2016

2
Binary Heap, Binomila Queue
exercises(Tutorial)
The Third Unit Will be Completed approximately in 10 Hours
IV

Graph algorithms : MinimumCost Spanning Trees- Prim's


Algorithm,

Kruskal's Algorithm

15-02-2016

Shortest Path Algorithms: Dijkstra's


Algorithm

To

All Pairs Shortest Paths Problem:


Floyd's Algorithm,Warshalls
Algorithm

27-02-2016

2
Kruskals, Primss
Problems(tutorial)
The Fourth Unit Will be Completed approximately in 8 Hours
Sorting Methods : Order Statistics:
Lower Bound on Complexity for
Sorting Methods: Lower Bound
on Worst Case Complexity
V

Lower Bound on Average Case


Complexity, Heap Sort

2
1

29-02-2016
To
12-03-2016

Quick Sort

Radix Sorting, Merge Sort

All Sorting Techniques


exercises(Tutorial)

The Fifth Unit Will be Completed approximately in 9 Hours


Pattern matching and Tries :
Pattern matching algorithms

the Boyer Moore algorithm

The Knuth-Morris-Pratt algorithm


VI

14-03-2016

Tries: Definitions and concepts of


digital search tree

Binary trie, Patricia, Multi-way trie

File Structures: Fundamental File


Processing Operations-opening
files , closing files,

Reading and Writing file contents,


Special characters in files.

Fundamental File
Structure Concepts

Pattern Matching
Problems(Tutorial)

To
05-04-2016
14

The Sixth Unit Will be Completed approximately in 14 hours


Total number of periods required

66

TEXT BOOKS:
1.
2.
3.

Data Structures, A Pseudocode Approach, Richard F Gilberg, Behrouz A Forouzan,


Cengage.
Fundamentals of DATA STRUCTURES in C: 2nd ed, , Horowitz , Sahani, Anderson-freed, Universities Press
Data structures and Algorithm Analysis in C, 2nd edition, Mark Allen Weiss, Pearson

REFERENCE BOOKS:
1.
2.
3.
4.
5.
6.

Web : http://lcm.csa.iisc.ernet.in/dsa/dsa.html
http://utubersity.com/?page_id=878
http://freevideolectures.com/Course/2519/C-Programming-and-Data-Structures
http://freevideolectures.com/Course/2279/Data-Structures-And-Algorithms
File Structures :An Object oriented approach with C++, 3 rd ed, Michel J Folk, Greg Riccardi, Bill Zoellick
C and Data Structures: A Snap Shot oriented Treatise with Live examples from Science and Engineering, NB
Venkateswarlu & EV Prasad, S Chand, 2010.

Name: A.YUGANDHARA RAO


Date: 14-12-2016
Remarks:

HOD