06EC761 - DATA STRUCTURE USING C++ |
PART – A |
UNIT – I |
INTRODUCTION: Functions and parameters, Dynamic memory allocation
classis, Testing and debugging. Data Representation, Introduction, Linear
lists, Formula-based representation linked representation, Indirect addressing
simulating pointers. |
UNIT – II |
ARRAYS AND MATRICS: Arrays, Matrices, Special matrices spare
matrices. |
UNIT – III |
STACKS: The abstract data types, Derived classed and inheritance,
Formula-based representation, Linked representation, Applications. |
UNIT – IV |
Queues: The abstract data types, Derived classes and inheritance, Formulabased
representation, Linked Linked representation, Applications. |
PART – B |
UNIT – V |
SKIP LISTS AND HASHING: Dictionaries, Linear representation, Skip list
presentation, Hash table representation. |
UNIT – VI |
BINARY AND OTHER TREES: Trees, Binary trees, Properties and
representation of binary trees, Common binary tree operations, Binary tree
traversal the ADT binary tree, ADT and class extensions. |
UNIT – VII |
PRIRITY QUEUES: Linear lists, Heaps, Leftist trees. |
UNIT – VIII |
Search Trees: Binary search trees, B-trees, Applications. |
REFERENCE |
TEXT BOOKS: |
1. Data structures, Algorithms, and applications in C++ - Sartaj
Sahni, McGraw Hill.2000. |
Reference Books |
1. Object Oriented Programming in C++ - Balaguruswamy. TMH,
1995.
2. Programming in C++ - Balaguruswamy. TMH, 1995 . |
|