Book Details

Object Oriented Programming and Data Structures

Object Oriented Programming and Data Structures

Published by uLektz

Course Code:ULZHS0147

Author:uLektz

University: General for All University

Regulation:2017

Categories:Electronics & Communication

Format : ico_bookePUB3 (DRM Protected)

Type :eBook

Rs.160 Rs.25 Rs.85% off

Preview Buy Now

Description :Object Oriented Programming and Data Structures of ULZHS0147 covers the latest syllabus prescribed by General for All University for regulation 2017. 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 DATA ABSTRACTION & OVERLOADING

1.1 Overview of C++

1.2 Structures

1.3 Class Scope and Accessing Class Members

1.4 Reference Variables

1.5 Initialization

1.6 Constructors and Destructors

1.7 Member Functions and Classes

1.8 Friend Function

1.9 Dynamic Memory Allocation

1.10 Static Class Members

1.11 Container Classes and Integrators

1.12 Proxy Classes

1.13 Overloading:Function overloading and Operator Overloading

UNIT II INHERITANCE & POLYMORPHISM

2.1Base Classes and Derived Classes

2.2 Protected Members

2.3 Casting Class pointers and Member Functions

2.4 Overriding

2.5 Public, Protected and Private Inheritance

2.6 Constructors and Destructors in derived Classes

2.7 Implicit Derived - Class Object To Base - Class Object Conversion

2.8 Composition Vs. Inheritance

2.9 Virtual functions

2.10 This Pointer

2.11 Abstract Base Classes and Concrete Classes

2.12 Virtual Destructors

2.13 Dynamic Binding

UNIT III LINEAR DATA STRUCTURES

3.1 Abstract Data Types (ADTs)

3.2 List ADT

3.3 Array based implementation

3.4 Linked list implementation

3.5 Singly linked lists

3.6 Polynomial Manipulation

3.7 Stack ADT

3.8 Queue ADT

3.9 Evaluating arithmetic expressions

UNIT IV NON-LINEAR DATA STRUCTURES

4.1 Trees

4.2 Binary Trees - Binary tree representation and traversals

4.3 Application of trees -Set representation and Union, Find operations

4.4 Graph and its representations - Graph Traversals , Representation of Graphs

4.5 Breadth-first search and Depth-first search

4.6 Connected components

UNIT V SORTING and SEARCHING

5.1 Sorting algorithms - Insertion sort, Quick sort, Merge sort

5.2 Searching - Linear search, Binary Search

loading