SEMESTER II
CORE THEORY PAPER -2
C++ & DATA STRUCTURES (CCS21)
UNIT-I:
Principles of Object Oriented Programming – Beginning with C++ – Token , Expressions and Control Structures- Functions in C++ – Classes and Objects – Constructors and Destructors.
UNIT-II:
Operator Overloading and Type Conversions – Inheritance : Extending Classes –
Pointers, Virtual Functions and Polymorphism - Managing Console I/O Operations. Working with Files - Templates – Exception Handling – Manipulating Strings.
UNIT-III:
Data Design & implementations: Different views of data – Abstraction and Built-in Types – Arrays ADTs Stacks and Queue (Linear and Linked) , Stack (Array and
Pointer)- Applications- Infix to Postfix Conversions – Queue(Array and Pointer) –
List(Array and Pointer) – Applications: (Polynomial Addition) - Doubly Linked Lists.
UNIT – IV:
Programming with Recursion : Recursion – Verifying and Writing Recursive Functions
Binary Search Tree : Implementation – Tree Traversal
Graphs: Implementations – BFS – DFS – Dijkstras Shortest Path Algorithm.(Chapter 7:Section 7.1,7.4 7.5, Chapter 8:Section 8.1,8.4, Chapter 9:Section 9.3)
UNIT-V:
Sorting and Searching Algorithms: Sorting – Searching – Hashing (Chapter 10:
Section 10.1,10.2,10.3)
TEXT BOOK:
1. Object Oriented Programming with C++, E Balagurusamy, Tata McGraw Hill, 6th Edition, 2014. (Units I, II)
2. C++ Plus Data Structure, Nell Dale, Jones & Bartlett Publishers, 4th Edition, 2010. (Units III, VI & V)
======================================================
LIST OF LAB EXERCISES
1. Constructors & Destructors, Copy Constructor.
2. Friend Function & Friend Class.
3. Inheritance.
4. Polymorphism & Function Overloading.
5. Virtual Functions.
6. Overload Unary & Binary Operators Both as Member Function & Non Member Function.
7. Class Templates & Function Templates.
8. Exception Handling Mechanism.
9. Standard Template Library concept.
10. File Stream classes.
11. Array implementation of Stack, Queue: Infix to postfix
12. Implementation of Stack, Queue, List, Doubly Linked List - using Pointers-Polynomial Addition
13. Implementation of Binary Search Tree, Traversal
14. Implementation of Searching and Sorting Algorithms.
15. Graph Implementation of shortest path (Djikstras)
======================================================

No comments:
Post a Comment