Object Oriented Programming and Data Structures detail syllabus for Robotics And Automation Engineering (Robotics & Automation), 2017 regulation is taken from Anna University official website and presented for students of Anna University. The details of the course are: course code (EC8301), Category (ES), Contact Periods/week (3), Teaching hours/week (3), Practical Hours/week (0). The total course credits are given in combined syllabus.
For all other robotics & automation 3rd sem syllabus for be 2017 regulation anna univ you can visit Robotics & Automation 3rd Sem syllabus for BE 2017 regulation Anna Univ Subjects. The detail syllabus for object oriented programming and data structures is as follows.”
Course Objective:
- To comprehend the fundamentals of object oriented programming, particularly in C++.
- To use object oriented programming to implement data structures.
- To introduce linear data structures.
- To study about the non-linear data structures
- To understand about the different algorithms
Unit I
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Unit II
Inheritance and Polymorphism
Base Classes and Derived Classes – Protected Members – Casting Class pointers and Member Functions – Overriding – Public, Protected and Private Inheritance – Constructors and Destructors in derived Classes – Implicit Derived – Class Object To Base – Class Object Conversion – Composition Vs. Inheritance – Virtual functions – This Pointer – Abstract Base Classes and Concrete Classes -Virtual Destructors – Dynamic Binding.
Unit III
Linear Data Structures
Abstract Data Types (ADTs) – List ADT – array-based implementation – linked list implementation -singly linked lists -Polynomial Manipulation – Stack ADT – Queue ADT – Evaluating arithmetic expressions
Unit IV
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Unit V
Sorting and Searching
Sorting algorithms: Insertion sort – Quick sort – Merge sort – Searching: Linear search -Binary Search
Course Outcome:
Upon completion of the course, students will be able to:
- To know about data abstraction
- Explain the concepts of Object oriented programming.
- Write simple applications using C++.
- To demonstrate different linearity in data structures.
- Discuss the different methods of organizing large amount of data.
Text Books:
- Deitel and Deitel, C++, How To Program, Fifth Edition, Pearson Education, 2005.
- Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, Third Edition, Addison-Wesley, 2007.
References:
- Bhushan Trivedi, Programming with ANSI C++, A Step-By-Step approach, Oxford University Press, 2010.
- Goodrich, Michael T., Roberto Tamassia, David Mount, Data Structures and Algorithms in C++, 7th Edition, Wiley. 2004.
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, Second Edition, Mc Graw Hill, 2002.
- Bjarne Stroustrup, The C++ Programming Language, 3rd Edition, Pearson Education, 2007.
- Ellis Horowitz, Sartaj Sahni and Dinesh Mehta, Fundamentals of Data Structures in C++, Galgotia Publications, 2007.
For detail syllabus of all other subjects of BE Robotics & Automation, 2017 regulation do visit Robotics & Automation 3rd Sem syllabus for 2017 Regulation.
Dont forget to download iStudy for latest syllabus and results, class timetable and more.