Advanced Data Structures

Advanced Data Structures

4.11 - 1251 ratings - Source

Different strategies for problem solving, Need for OOP, Overview of OOP principles-encapsulation, Inheritance, Polymorphism. C++ class overview-class definition, Objects, Class members, Access control, Class scope, Constructors and destructors, Inline functions, Static class members, This pointer, Friend functions, Dynamic memory allocation and deallocation (new and delete).Polymorphism and InheritanceFunction overloading, Operator overloading, Generic programming function and class templates, Inheritance basics, Base and derived classes, Different types of inheritance, Base class access control, Virtual base class, Function overriding, Run time polymorphism using virtual functions, Abstract classes.Streams, Libraries and error handling-stream classes hierarchy, Console I/O, Formatted I/O, File streams and string streams, Exception handling mechanism, Standard template library.Algorithms, Performance analysis-time complexity and space complexity, Review of basic data structures, The list ADT, Stack ADT, Implementation using template class in C++, Queue ADT, Implementation using template class, Priority queues-definition, ADT, Heaps, Definition, Insertion and deletion, Application-heap sort, Disjoint sets-disjoint set ADT, Disjoint set operations, Union and find algorithms.Skip lists and hashingDictionaries, Linear list representation, Skip list representation, Operations-insertion, Deletion and searching, Hash table representation, Hash functions, Collision resolution- separate chaining, Open addressing-linear probing, Quadratic probing, Double hashing, Rehashing, Extendible hashing, Comparison of hashing and skip lists.Search trees (Part I)Binary search trees, definition, ADT, Implementation, Operations searching, Insertion and deletion, Balanced search trees-AVL trees, Definition, Height of an AVL tree, Representation, operations-insertion, Deletion and searching.Search trees (Part II)Red-black trees representation, Insertion, Deletion, Searching splay trees introduction, The splay operation, B-Trees, B-Tree of order m, Height of a B-Tree, Insertion deletion and searching.Pattern matching and triesPattern matching algorithms-Brute force, The Boyer-Moore algorithm, The Knuth-Morris-Pratt algorithm, Standard tries, Compressed tries, Suffix trees, Search engines-inverted files.Different strategies for problem solving, Need for OOP, Overview of OOP principles-encapsulation, Inheritance, Polymorphism.

Title:Advanced Data Structures
Publisher:Technical Publications - 2007-01-01


You Must CONTINUE and create a free account to access unlimited downloads & streaming