Object Oriented Programming and Advanced Data Structures detailed syllabus for Information Technology (IT) for 2019 regulation curriculum has been taken from the Anna Universities official website and presented for the IT students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below.
For Information Technology 4th Sem scheme and its subjects, do visit IT 4th Sem 2019 regulation scheme. The detailed syllabus of object oriented programming and advanced data structures is as follows.
Course Objective:
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.
Unit I
Object Oriented Programming Fundamentals
Data Abstraction – Encapsulation – Class – Object – Constructors – Static members -Constant members – Member functions – Pointers – References – Role of “this” Pointer -String Handling – Copy Constructor – Polymorphism – Function Overloading – Operators Overloading – Dynamic Memory Allocation.
Suggested Activities:
- Flipped Classroom – Features of OOP, Pointers.
- External learning – Dynamic memory allocation operators and its usage.
- Exploration of examples on static functions and usage of “this” pointer.
- Exploration of the usage of reference variables, pointer to reference and reference to a pointer.
- Application development using Friend functions and function overloading.
Suggested Evaluation Methods:
- Assignments on the usage of dynamic memory allocation operators, Friend functions and reference variables.
- Quizzes on pointers and usage of pointers.
- Demonstration of the application development.
Unit II
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Unit III
Advanced Non-Linear Data Structures
AVL Trees – Splay Trees – B-Trees – Red Black Trees – Leftist Heaps – Binomial Heap.
Suggested Activities:
- Flipped classroom on binary search trees and binary heap concepts.
- External learning – Fibonacci Heap, Tries.
- Exploration of application of trees where trees can be applied for real time problems.
- Practical – Design and Implementation of a suitable tree/heap structure for solving a given real time problem such as implementation of syntax trees in compilers/ implementation of Binary Space Partition in video games/order statistics problem.
Suggested Evaluation Methods:
- Assignments on Fibonacci Heaps, Tries, Real time problem solving using Trees/Heaps.
- Quizzes on BST, Binary Heap.
- Demonstration of practical learning component.
Unit IV
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Unit V
Advanced Graph Algorithms
Applications of Depth First Search – Undirected Graphs – Biconnectivity – Directed Graph -Finding Strong Components – All Pair Shortest paths – Floyd Warshall algorithm – Network Flow Problem – A Simple Maximum Flow Algorithm.
Suggested Activities:
- Flipped Classroom on BFS and its applications.
- External learning – Inline memory data structures.
- Exploration of more applications of DFS and its usage in real time scenario.
- Simulation of All Pair Shortest Path with various graphs.
Suggested Evaluation Methods:
- Assignments on inline memory data structures and application of a DFS algorithm to solve a real time problem.
- Quizzes on BFS and few more applications of DFS.
Course Outcome:
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Text Books:
- Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++” , Fourth Edition, Pearson Education, 2013.
- Herbert Schildt, “C++ The Complete Reference”, Fourth Edition, McGraw Hill Education, 2003.
References:
- Paul Deitel, Harvey Deitel, “C++ How to Program”, Tenth Edition, Pearson Education, 2017.
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to Algorithms” , Third Edition, McGraw Hill, 2009.
- Robert Sedgewick, “Algorithms in C++”, Third Edition, Pearson Education , 1998.
- Bjarne Stroustrup, “The C++ Programming Language”, Fourth Edition, Pearson Education, 2014.
- Michael T, Goodrich, Roberto Tamassia, David Mount, “”Data Structures and Algorithms in C++”, Seventh Edition, Wiley Publishers, 2004.
Course Outcome:
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Course Outcome:
For detailed syllabus of all other subjects of Information Technology, 2019 regulation curriculum do visit IT 4th Sem subject syllabuses for 2019 regulation.
For all Information Technology results, visit Anna University IT all semester results direct link.