Book Details

Programming and Data Structures II

Programming and Data Structures II

Published by uLektz

Course Code : ULZHS0082
Author : uLektz
University : General for All University
Regulation : 2013
Categories : Arts and Science
Format : ico_bookePUB3 (DRM Protected)
Type :

eBook

FREE

Buy Now

Description :Programming and Data Structures II of ULZHS0082 covers the latest syllabus prescribed by General for All University for regulation 2013. Author: uLektz, Published by uLektz Learning Solutions Private Limited.

Note : No printed book. Only ebook. Access eBook using uLektz apps for Android, iOS and Windows Desktop PC.

Topics
UNIT I OBJECT ORIENTED PROGRAMMING FUNDAMENTALS

1.1 C++ Programming features

1.2 Data Abstraction

1.3 Encapsulation

1.4 Class

1.5 Object

1.6 Constructors

1.7 Static members – constant members – member functions

1.8 Pointers – references - Role of this pointer

1.9 Storage classes

1.10 Function as arguments

UNIT II OBJECT ORIENTED PROGRAMMING CONCEPTS

2.1 String Handling

2.2 Copy Constructor

2.3 Polymorphism – compile time and run time polymorphisms

2.4 Function overloading

2.5 Operators overloading

2.6 Dynamic memory allocation

2.7 Nested classes

2.8 Inheritance

2.9 Virtual functions.

UNIT III C++ PROGRAMMING ADVANCED FEATURES

3.1 Abstract class

3.2 Exception handling

3.3 Standard libraries

3.4 Generic Programming

3.5 Templates – class template - function template

3.6 STL

3.7 Containers

3.8 Iterators

3.9 Function adaptors

3.10 Allocators

3.11 Parameterizing the class

3.12 File handling concepts.

UNIT IV ADVANCED NON-LINEAR DATA STRUCTURES

4.1 AVL trees

4.2 B-Trees

4.3 Red-Black trees

4.4 Splay trees

4.5 Binomial Heaps

4.6 Fibonacci Heaps

4.7 Disjoint Sets

4.8 Amortized Analysis

4.9 Accounting method

4.10 Potential method

4.11 Aggregate analysis.

UNIT V GRAPHS

5.1 Representation of Graphs

5.2 Breadth-first search

5.3 Depth-first search

5.4 Topological sort

5.5 Minimum Spanning Trees

5.6 Kruskal and Prim algorithm

5.7 Shortest path algorithm

5.8 Dijkstra’s algorithm

5.9 Bellman-Ford algorithm

5.10 Floyd - Warshall algorithm

loading