INTRODUCTION:
C++ and its features, Data types, Variables, Operators, Expressions, Control structures, classes and Objects, Functions andparameters, function overloading, Recursion, Constructors, Destructors and Operator overloading, Inheritance, Polymorphism, Programming examples.
ARRAYS AND MATRICES:
Arrays, Matrices, Special matrices, Sparsematrices.
POINTERS:
Pointers, Dynamic memory allocation LINEAR LISTS: Data objects and structures, Introduction to Linear and Non Linear data structures, Linear list data structures, Array Representation, Vector Representation, Singly Linked lists and chains.
STACKS:
The abstract data types, Array Representation, Linked Representation, Applications- Parsing and Evaluation of arithmetic expressions, Parenthesis Matching & Towers of Hanoi.
QUEUES:
The abstract data types, ArrayRepresentation, Linked Representation, Applications-Railroad car arrangement, Priority Queues HASHING: Dictionaries, Linear representation, Hash table representation.
TREES:
Binary trees, Properties and representation of binary trees, Commm binary tree operations, Binary tree traversal the ADT binary tree, ADT binary tree and the class linked binary tree. Binary search trees operations and implementation. Heaps, Applications-Heap Sorting
Course Outcomes:
After studying this course, students will be able to:
1. Relate to Dynamic memory allocation, Various types of data struc- tures, operations and algorithms and Sparse matrices and Hashing
2 Apply object-oriented approach to solve problems
3. Understand non-Linear data structures trees and their applications
4. Design appropriate data structures for solving computing problems
5. Analyze the operations of Linear Data structures: Stack, Queue and Linked List and their applications
Text Book:
1. Data structures, Algorithms, and applications in C++, Sartaj Sahni, Universities Press, 2nd Edition, 2005.
Reference Books:
2 Object Oriented Programming with C++, E.Balaguruswamy, TMH, 6th Edition. 2013.