Department of Information Technology. II B.Tech I Sem. DATA STRUCTURES THROUGH C++ (Subject code# 53023) Dept of IT

Size: px

Start display at page:

Download "Department of Information Technology. II B.Tech I Sem. DATA STRUCTURES THROUGH C++ (Subject code# 53023) Dept of IT"

Noel Jackson
5 years ago
Views:

1 Department of Information Technology II B.Tech I Sem DATA STRUCTURES THROUGH C++ (Subject code# 53023) Mrs.D.Sravanthi Asst. Professor J.B.Institute of Engg & Technology Yenkapally, Moinabad(Mandal) Himathnagar(post),Hydreabad

2 Results Target Total Strength of the Class: 05 S. No Class / Division No. of Students a. First Class with Distinction 70 b. First Class 30 c. Pass Class 5 Method of Evaluation a. Internal Examination b. Unit Wise Assignments c. Descriptive Exam D Objective e. Final Examination Course Objective To get well acquainted with OOPS concepts, Data Structures and to be able to implement them using C++

3 J.B.Institute of Engg & Technology Department of Information Technology Syllabus Subject Name : DATA STRUCTURES THROUGH C++ Subject Code : Class Unit I Unit II Unit III Unit IV Unit V Unit - VI Unit - VII Unit - VIII : II B.Tech C++ class overview Basic OOP concepts, Class Definition, Objects,Class Members, Access Control, Class Scope, Constructers and Destructors,Parameter passing methods, Inline functions, static class members, this pointer, friend functions, dynamic memory allocation and de-allocation, exception handling Function overloading, Operator Overloading, Generic Programming- Function and Class templates, Inheritance basics, base and derived classes, inheritance types, base class access control, runtime polymorphism using virtual functions, abstract classes, streams I/O Algorithms, performance analysis- time complexity and space complexity, Review of basic data structures- The ADT, Stack ADT, Queue ADT, array and linked implementations using template classes in C++. Trees Basic Terminology, Binary Tree ADT, array and linked representations, traversals, threaded binary trees. Dictionaries, linear representation, skip representation, operations insertion, deletion and searching, Hashing hash table representation, hash functions, collision resolution- separate chaining, open addressing linear probing, quadratic probing, double hashing, rehashing, extendible hashing, comparison of hashing and skip s. Priority Queues Definition, ADT, Realizing a Priority Queue using Heaps, Definition, insertion, Deletion, Heap sort, External Sorting- Model for external sorting, Multiway merge, polyphase merge. Search Trees(Part I) : Binary search trees, Definition, ADT, Implementation, operations- searching, insertion and deletion, AVL Trees, Definition, operations- Insertion and searching. Search Trees(Part II); B-Trees, Definition, B-Tree of order m, insertion, deletion and searching, comparison of search Trees. Graphs Basic Terminology, representations of Graphs, Graph search methods DFS, BFS. Text Processing- Pattern matching algorithms Brute force, The Knuth Morri-Pratt algorithm. Tries Standard Tries, Compressed Tries, Suffix Tries

4 Books / Material Text Books (TB) TB. Data Structures and Algorithm and Applications in C++,S.Sahni,University Press(India)Pvt. Ltd. TB2. Data Structures and Algorithms in C++, Micheal T.Goodrich,R.Tamassia and D.Mount, Wiley Student edtion, Jofn Wiley and Sons Suggested / Reference Books (RB) RB. Data Structures and Algorithms in C++, Mark Allen Weiss,Pearson Education RB2.Data Structures and Algorithms in C++, Adam Drozdek, Cengage learning RB3. Data Structures using C and C++, Langsam, Augenstein and Tenenbaum, PHI RB4. Problem Solving with C++, The OOP, W.Savitch, Pearson education. RB5.Advanced Data Strucures & Algorithms in C++, V.V.Munuswamy, Jaico publisher

5 J.B.Institute of Engg & Technology Department of Information Technology SUBJECT PLAN : Subject Name : DATA STRUCTURES THROUGH C++ Subject Code : Class : II B.Tech Faculty Name : D. Sravanthi Number of Hours / lectures available in this Semester / Year Unit Topic Total No. of Hours I C++ class overview 0 II OOP concepts 0 III Algorithms and performance analysis 8 IV Dictionaries, Hashing 8 V Priority Queues, External Sorting 7 VI Search Trees(Part I) 7 VII Search Trees(Part II) 2 VIII Text Processing 7 Total 69

6 J.B.Institute of Engg & Technology Department of Information Technology LESSON PLAN : Subject Name : DATA STRUCTURES THROUGH C++ Subject Code : Class : II B.Tech Faculty Name: D.Sravanthi Unit I: C++ class overview To learn OOP concepts. To learn developing programs using classes. Total no_ of classes: 0 C++ overview Basic OOP concepts, 2 classes, objects, members 3 Access control, scope, constructors and destructors 4 Parameter passing, inline functions 5 Static members, this pointer, friend functions 6 Dynamic memory allocation. 7 Exception handling

7 UNIT-II : To learn Polymorphism, Learn Generic Programming - Templates To learn Inheritance and implement using base and derived classes. Total No_ of Classes: 0 8 Function overloading, 9 Operator overloading, 0 Generic programming, template functions and classes Inheritance-basics, types, base class access control 2 Runtime polymorphism- virtual functions 3 Abstract classes 4 Stream I/O UNIT-III To know and analyze Algorithms Lists Stack Queues Trees Total No_ of Classes: 07 5 Algorithms, performance analysis,3 6 Lists ADT & implementation,3 7 Stack ADT & implementation,3 8 Queue ADT & implementation,3 9 Trees Basics, Binary Tree ADT,3 array and linked representations 20 Tree traversals,3 5 Algorithms, performance analysis,3 OQ DQ OQ DQ

8 UNIT-IV : To learn about Dictionaries. Skip Lists and Operations on skip s. Creating Hash Tables. Total No_ of Classes: Dictionaries linear representation,4 23 Skip representation & operations,4 24 Deletion and searching operations,4 25 Hashing hash table representation,4 26 Hash functions collision resolution,4 27 Open addressing linear probing,,4 quadratic probing 28 Double hashing, rehashing,4 UNIT-V: To learn Priority Queues. External Sorting Total No_ of Classes: Priority Queues- ADT, representation,4 3 Heaps, insertion & deletion,4 32 Heap sort,4 33 External sorting- Multi-way merge,4 34 Polyphase merging,4

9 UNIT-VI: To learn about Search Trees and their operations AVL Trees and their operations Total No_ of Classes: Search trees(part ) binary search,3 trees-adt, implementation 36 Insertion operations,3 37 Deletion operations.3 38 AVL Trees Definition,3 39 Operations- insertion,3 40 Searching operations,3 UNIT-VII: To learn B-Trees and operations on B-Trees Graphs and Graph Total No_ of Classes: 2 4 Search Trees (part-2) definition and,3 ADT 42 B-Trees-definition,3 43 B-Tree of order m,3 44 Insertion operation on b-tree,3 45 Deletion operation on B-Tree 46 Searching operations on B-Tree 47 Comparison of Search Trees,3 448 Graphs Basics and Terminology,3 49 Graph Representations,3 50 Graph Search Methods,3 5 DFS method 52 BFS method

COURSE PLAN. Assoc.Proffessor,Asst.Professor

COURSE PLAN. Assoc.Proffessor,Asst.Professor COURSE PLAN FACULTY DETAILS: Name of the Faculty:: Designation: Department:: B.Madhavi,B.Deepthi Reddy Assoc.Proffessor,Asst.Professor IT COURSE DETAILS Name Of The Programme:: B.Tech Batch:: 2012-2016