Data Structures Through C++

DATA STRUCTURES THROUGH C++
OBJECTIVES:
 To be familiar with basic techniques of object oriented principles and exception handling using
c++
 To be familiar with the concepts like Inheritance,Polymorphism
 Solve problems using data structures such as linear lists,stacks,queues,hash tables
 Be familiar with advanced data structures such as balanced search trees, AVL Trees, and B Trees.
OUTCOMES:
 Distinguish between procedures and object oriented programming.

 Apply advanced data structures strategies for exploring complex data structures.
 Compare and contrast various data structures and design techniques in the area of
Performance.
 Implement data structures algorithms through C++.
 Incorporate data structures into the applications such as binary search trees, AVL and B Trees.
 Implement all data structures like stacks, queues, trees, lists and graphs and compare their
performance and trade offs
UNIT- I: Arrays
Abstract Data Types and the C++ Class, An Introduction to C++ Class-Data Abstraction and Encapsulation
in C++-Declaring Class Objects and Invoking Member Functions-Special Class Operations-Miscellaneous
Topics-ADT’s and C++Classes, The Array as an Abstract Data Type, The Polynomial Abstract Data Type-
Polynomial Representation- Polynomial Addition. Sparse Matrices, Introduction- Sparse Matrix
Representation- Transposing a Matrix- Matrix Multiplication, Representation of Arrays.
UNIT-II: Stacks and Queues

Templates in C++, Template Functions- Using Templates to Represent Container Classes, The Stack
Abstract Data Type, The Queue Abstract Data Type, Sub typing and Inheritance in C++, Evaluation of
Expressions, Expression-Postfix Notation- Infix to Postfix.
UNIT-III: Linked Lists

Single Linked List and Chains, Representing Chains in C++, Defining a Node in C++-Designing a Chain Class
in C++- Pointer manipulation in C++- Chain Manipulation Operations, The Template Class Chain,
Implementing Chains with Templates-Chain Iterators- Chain Operations- Reusing a Class, Circular Lists,
Available Space Lists, Linked Stacks and Queues, Polynomials, Polynomial Representation- Adding
Polynomials- Circular List Representation of Polynomials , Equivalence Classes, Sparse Matrices, Sparse
Matrix Representation- Sparse Matrix Input-Deleting a Sparse Matrix, Doubly Linked Lists, Generalized
Lists, Representation of Generalized Lists- Recursive Algorithms for Lists-Reference Counts, Shared and
Recursive Lists
UNIT-IV: Trees
Introduction, Terminology, Representation of Trees, Binary Trees, The Abstract Data Type, Properties of
Binary Trees, Binary Tree Representation, Binary Tree Traversal and Tree Iterators, Introduction, Inorder
Traversal , Preorder Traversal, Postorder Traversal, Thread Binary Trees, Threads, Inorder Traversal of a
Threaded Binary Tree, Inserting a Node into a Threaded Binary Tree, Heaps, Priority Queues, Definition
of a Max Heap, Insertion into a Max Heap, Deletion from a Max Heap, Binary Search Tree, Definition,
Searching a Binary Search Tree, Insertion into a Binary Search Tree, Deletion from a Binary Search Tree,
Height of Binary Search Tree.
UNIT-V: Graphs
The Graph Abstract Data Type, Introduction, Definition, Graph Representation, Elementary Graph
Operation, Depth First Search, Breadth First Search, Connected Components, Spanning Trees,
Biconneted Components, Minimum Cost Spanning Trees, Kruskal’s Algorithm , Prim’s Algorithm, Sollin’s
Algorithm, Shortest Paths and Transitive Closure, Single Source/All Destination: Nonnegative Edge Cost,
Single Source/All Destination: General Weighs, All-Pairs Shortest Path, Transitive Closure.
UNIT-VI: Sorting
Insertion Sort, Quick Sort, Merge Sort, Merging, Iterative Merge Sort, Recursive Merge Sort, Heap Sort.
TEXT BOOKs:
1. Data structures, Algorithms and Applications in C++, S.Sahni, 2 nd edition, Universities Press,
Pvt.Ltd.
2. Data structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education. Ltd:,
Second Edition.
3. Data structures and Algorithms in C++, Michael T.Goodrich, R.Tamassia and Mount, Wiley
student edition, John Wiley and Sons.
REFERENCE BOOKS:
1. Data structures and algorithms in C++,3 rd Edition, Adam Drozdek, Thomson

2. Data structures using C and C++, Langsam, Augenstein and Tanenbaum, PHI.
3. Problem solving with C++,The OOP, Fourth edition, W.Savitch, Pearson education.

Data Structures Through C++

Uploaded by

Copyright:

Available Formats

Data Structures Through C++

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Data Structures Through C++

Uploaded by

Copyright:

Available Formats

DATA STRUCTURES THROUGH C++

 Distinguish between procedures and object oriented programming.

UNIT-II: Stacks and Queues

UNIT-III: Linked Lists

1. Data structures and algorithms in C++,3 rd Edition, Adam Drozdek, Thomson

You might also like