0% found this document useful (0 votes)
9 views

Data Structure

Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views

Data Structure

Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

CHRISTU JYOTHI INSTITUTE OF TECHNOLOGY AND SCIENCE

Colombo Nagar, Yeshwanthapur, Jangaon


DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

MODEL LESSON PLAN


Name of the Faculty : M. RAMARAJU Department : Computer Science & engineering
Designation :ASST.PROF. Subject : DATA STRUCTURE
Course/Year/Semester: B.TECH/III/I
Subject Code : EM614PE
No of theory Classes : 4 No of Tutorial Classes : 1 No of Remedial Classes :1

S.No Unit Topic Page No’s Text Book / No of Topic Teachin


(As Per JNTUH) (From -To) Reference books/ lectures Coverage g Aids
Journals required due Dates
Basic concepts- Algorithm
Specification-Introduction

Recursive algorithms

Data Abstraction Performance


analysis- time complexity and
space complexity, Asymptotic
Notation-Big O, Omega and
Theta notations,

Introduction to Linear and Non


Linear data structures. http://
1
Singly Linked Lists- btechsmartclass.com/
12 12-01-2019
Operations-Insertion, Deletion, data_structures& BLACK
I Concatenating singly linked
lists, T1 BOARD
Circularly linked lists-
Operations for Circularly linked
lists,

Doubly Linked Lists-


Operations- Insertion, Deletion.

Representation of single, two


dimensional arrays, sparse
matrices-array and linked
representations.
Stack ADT, definition,
operations, array and linked
implementations in C,

applications-infix to postfix
conversion,
Postfix expression evaluation,
recursion implementation, http://
Queue ADT, definition and btechsmartclass.com/ BLACK
2 II 14 21-01-2019
operations ,array and linked data_structures& BOARD
Implementations in C,
T1
Circular queues-Insertion and
deletion operations,

Deque (Double ended


queue)ADT,
array and linked
implementations in C.
3 III Trees – Terminology, http:// 12 3-2-19 BLACK
Representation of Trees,
btechsmartclass.com/ & BOARD
Binary tree ADT, Properties of data_structures& 21-2-19
Binary Trees, Binary Tree
T1
Representations-array and
linked representations, Binary
Tree traversals,

Threaded binary trees,


Max Priority
Queue ADT-implementation-
Max Heap-Definition, Insertion
into a Max Heap, Deletion from
a Max Heap.

Graphs – Introduction,
Definition, Terminology, Graph
ADT, Graph Representations-
Adjacency matrix,
Adjacency lists, Graph
traversals- DFS and BFS.
Searching- Linear Search,
Binary Search,

Static Hashing-Introduction,
hash tables, hash functions,
(a) Collision resolution
techniques http://
Overflow Handling.
btechsmartclass.com/ BLACK
4 IV 12 20-03-2019
(b) Bubble sort and data_structures& BOARD
merge sort T1
Sorting-Insertion Sort,
Selection Sort, Radix Sort,
Quick sort, Heap Sort,
Comparison of Sorting
methods.
Search Trees-Binary Search
Trees, Definition, Operations-
Searching, Insertion and
Deletion,

AVL Trees-
Definition and Examples,
Insertion into an AVL Tree ,

B-Trees, Definition, B-Tree of


order m, operations-Insertion
and Searching, Introduction to
Red-Black http://
btechsmartclass.com/ BLACK
5 V Splay Trees(Elementary 12 10-04-2019
treatment-only Definitions and data_structures& BOARD
Examples), T1
Comparison of Search Trees.

a) Brute force pattern


matching algorithm.
Pattern matching algorithm-
The Knuth-Morris-Pratt
algorithm,

Tries (examples only).


Total no of class 62
a,b- Gaps or Missing contents in a syllabus

TEXT BOOKS:
1. Fundamentals of Data structures in C, 2nd Edition, E.Horowitz, S.Sahni and Susan
Anderson-Freed, Universities Press.
2. Data structures A Programming Approach with C, D.S.Kushwaha and A.K.Misra, PHI.
REFERENCE BOOKS:
1. Data structures: A Pseudocode Approach with C, 2nd edition, R.F.Gilberg And B.A.Forouzan, Cengage
Learning.
2. Data structures and Algorithm Analysis in C, 2nd edition, M.A.Weiss, Pearson.
3. Data Structures using C, A.M.Tanenbaum,Y. Langsam, M.J.Augenstein, Pearson.
4. Data structures and Program Design in C, 2nd edition, R.Kruse, C.L.Tondo and B.Leung,Pearson.
5. Data Structures and Algorithms made easy in JAVA, 2nd Edition, Narsimha Karumanchi, CareerMonk
Publications.
6. Data Structures using C, R.Thareja, Oxford University Press.
7. Data Structures, S.Lipscutz,Schaum’s Outlines, TMH.
8. Data structures using C, A.K.Sharma, 2nd edition, Pearson..

FACULTY: Mr. RAMA RAJU HOD

You might also like