**CS6301 Programming and Data Structures 2 Syllabus**

CS6301 Programming and Data Structures 2 Syllabus Regulation 2013 Anna University free download. Programming and Data Structures 2 CS6301 Syllabus pdf free download.

**OBJECTIVES: CS6301 Programming and Data Structures 2 Syllabus**

The student should be made to:

Be familiar with the C++ concepts of abstraction, encapsulation, constructor, polymorphism, overloading and Inheritance.

Learn advanced nonlinear data structures.

Be exposed to graph algorithms

Learn to apply Tree and Graph structures

**UNIT I OBJECT ORIENTED PROGRAMMING FUNDAMENTALS CS6301 Programming and Data Structures 2 Syllabus**

C++ Programming features – Data Abstraction – Encapsulation – class – object – constructors – static members – constant members – member functions – pointers – references – Role of this pointer – Storage classes – function as arguments.

**UNIT II OBJECT ORIENTED PROGRAMMING CONCEPTS CS6301 Programming and Data Structures 2 Syllabus**

String Handling – Copy Constructor – Polymorphism – compile time and run time polymorphisms – function overloading – operators overloading – dynamic memory allocation – Nested classes – Inheritance – virtual functions.

**UNIT III C++ PROGRAMMING ADVANCED FEATURES CS6301 pds 2 Programming and Data Structures 2 Syllabus**

Abstract class – Exception handling – Standard libraries – Generic Programming – templates – class template – function template – STL – containers – iterators – function adaptors – allocators – Parameterizing the class – File handling concepts.

**UNIT IV ADVANCED NON-LINEAR DATA STRUCTURES CS6301 Programming and Data Structures 2 Syllabus**

AVL trees – B-Trees – Red-Black trees – Splay trees – Binomial Heaps – Fibonacci Heaps – Disjoint Sets – Amortized Analysis – accounting method – potential method – aggregate analysis.

**UNIT V GRAPHS CS6301 Programming and Data Structures 2 pds 2 Syllabus**

Representation of Graphs – Breadth-first search – Depth-first search – Topological sort – Minimum Spanning Trees – Kruskal and Prim algorithm – Shortest path algorithm – Dijkstra‟s algorithm – Bellman-Ford algorithm – Floyd – Warshall algorithm.

Subject Name | Programming and Data Structures 2 |

Subject code | CS6301 |

Regulation | 2013 |

CS6301 Programming and Data Structures 2 Syllabus **Click here to download**

**CS6301 Programming and Data Structures 2 Notes**

**CS6301 Programming and Data Structures 2 Important questions**

**CS6301 Programming and Data Structures 2 Question Bank**