Published by Technical Publications, 2011

Used
/
Paperback /
Quantity Available: 0

We're sorry; this specific copy is no longer available. Here are our closest matches for *Data Structures* by A.A.PUNTAMBEKAR.

second edition. 848 pages. 9.30x7.00x1.50 inches. In Stock. Bookseller Inventory #

**Synopsis:** Trees Basic tree concepts, Binary trees and their properties, Representation using sequential and linked organization, Full and complete binary trees, Converting tree to a binary tree, Binary tree traversals, BFS, DFS (recursive and non-recursive), Infix, Postfix, Prefix, Huffmans codes. Binary search trees and operations. BST as an ADT, Threaded binary trees, Insertion and deletion of nodes in inorder threaded binary tree, Preorder, Inorder and postorder traversals of inorder threaded binary tree, Applications of binary trees : Gaming, Expression and decision trees. Graphs Basic concepts, Operations, Graphs storage structures, Traversals : Depth first and breadth first. Graph algorithm, Graph as an ADT, Minimum spanning trees : Kruskals and Prims algorithm for shortest path and topological sorting. Symbol Tables : Static and dynamic tree table, AVL tree, AVL tree implementation, AVL tree algorithms. Hash Tables : Basic concepts, Hash function, Hashing methods, Collision resolution, Bucket hashing. Heaps and Multiway Trees Heap : Basic concepts, Heap implementation algorithm and heap sort, Heap as an ADT, Heap applications. Multiway trees : B tree implementation, B-tree variations. Files External storage devices, Files : definition and concepts, File organization : Sequential files, Random, Linked, Inverted and cellular partitions. Processing of sequential, Index sequential and direct files. Sequential file organization, Direct file organization, Index sequential file organization and their implementation. Abstract data types : ADT, Classes and objects, Generic programming: Introduction to STL (Standard Template Library), Containers, Iterators and algorithms, Study of container template classes for vectors and stacks and related algorithms.

Title: **Data Structures**

Publisher: **Technical Publications**

Publication Date: **2011**

Binding: **Paperback**

Book Condition: **Brand New**

Published by
Technical Publications 0

ISBN 10: 9350993236
ISBN 13: 9789350993231

New
Softcover
Quantity Available: > 20

Seller

Rating

**Book Description **Technical Publications 0. Softcover. Book Condition: New. This book covers about Dictionaries, Balanced Trees, Priority Queues, Graphs, Graph Algorithms, Sorting Methods, Pattern Matching and Tries, File Structures Printed Pages: 336. Bookseller Inventory # 94907

More Information About This Seller | Ask Bookseller a Question

Published by
Technical Publications 0

New
Softcover
First Edition
Quantity Available: > 20

Seller

Rating

**Book Description **Technical Publications 0. Softcover. Book Condition: New. First edition. Data Abstraction and Overloading Overview of C++ - Structures - Class scope and accessing class members - Reference variables - Initialization - Constructors - Destructors - Member functions and classes - Friend function - Dynamic memory allocation - Static class members - Container classes and integrators - Proxy classes - Overloading : Function overloading and operator overloading. Inheritance and Polymorphism Base classes and derived classes - Protected members - Casting class pointers and member functions - Overriding - Public, protected and private inheritance - Constructors and destructors in derived classes - Implicit derived - Class object to base - Class object conversion - Composition vs. inheritance - Virtual functions - this pointer - Abstract base classes and concrete classes - Virtual destructors - Dynamic binding. Linear Data Structures Abstract Data Types (ADTs) - List ADT - Array-based implementation - Linked list implementation - Singly linked lists - Polynomial manipulation - Stack ADT - Queue ADT - Evaluating arithmetic expressions. Non-Linear Data Structures Trees - Binary trees - Binary tree representation and traversals - Application of trees: Set representation and union-find operations - Graph and its representations - Graph traversals - Representation of graphs - Breadth-first search - Depth-first search - Connected components. Sorting and Searching Sorting algorithms : Insertion sort - Quick sort - Merge sort - Searching : Linear search - Binary search. Printed Pages: 392. Bookseller Inventory # 95882

More Information About This Seller | Ask Bookseller a Question

Published by
Technical Publications 0

ISBN 10: 9350993236
ISBN 13: 9789350993231

New
Softcover
Quantity Available: > 20

Seller

Rating

**Book Description **Technical Publications 0. Softcover. Book Condition: New. This book covers about Dictionaries, Balanced Trees, Priority Queues, Graphs, Graph Algorithms, Sorting Methods, Pattern Matching and Tries, File Structures Printed Pages: 336. Bookseller Inventory # 94907

More Information About This Seller | Ask Bookseller a Question

Published by
Technical Publications 0

New
Softcover
First Edition
Quantity Available: > 20

Seller

Rating

**Book Description **Technical Publications 0. Softcover. Book Condition: New. First edition. Data Abstraction and Overloading Overview of C++ - Structures - Class scope and accessing class members - Reference variables - Initialization - Constructors - Destructors - Member functions and classes - Friend function - Dynamic memory allocation - Static class members - Container classes and integrators - Proxy classes - Overloading : Function overloading and operator overloading. Inheritance and Polymorphism Base classes and derived classes - Protected members - Casting class pointers and member functions - Overriding - Public, protected and private inheritance - Constructors and destructors in derived classes - Implicit derived - Class object to base - Class object conversion - Composition vs. inheritance - Virtual functions - this pointer - Abstract base classes and concrete classes - Virtual destructors - Dynamic binding. Linear Data Structures Abstract Data Types (ADTs) - List ADT - Array-based implementation - Linked list implementation - Singly linked lists - Polynomial manipulation - Stack ADT - Queue ADT - Evaluating arithmetic expressions. Non-Linear Data Structures Trees - Binary trees - Binary tree representation and traversals - Application of trees: Set representation and union-find operations - Graph and its representations - Graph traversals - Representation of graphs - Breadth-first search - Depth-first search - Connected components. Sorting and Searching Sorting algorithms : Insertion sort - Quick sort - Merge sort - Searching : Linear search - Binary search. Printed Pages: 392. Bookseller Inventory # 95882

More Information About This Seller | Ask Bookseller a Question

Published by
Technical Publications 0

ISBN 10: 9350996960
ISBN 13: 9789350996966

New
Softcover
First Edition
Quantity Available: > 20

Seller

Rating

**Book Description **Technical Publications 0. Softcover. Book Condition: New. First edition. Object Oriented Programming Fundamentals C++ Programming features - Data abstraction - Encapsulation - Class - Object - Constructors - Static members - Constant members - Member functions - Pointers - References - Role of this pointer - Storage classes - Function as arguments. Object Oriented Programming Concepts String handling - Copy constructor - Polymorphism - Compile time and run time polymorphisms - Function overloading - Operators overloading - Dynamic memory allocation - Nested classes - Inheritance - Virtual functions. C++ Programming Advanced Features Abstract class - Exception handling - Standard libraries - Generic programming - Templates - Class template - Function template - STL - Containers - Iterators - Function adaptors - Allocators - Parameterizing the class - File handling concepts. Advanced Non-Linear Data Structures AVL trees - B-Trees - Red-Black trees - Splay trees - Binomial heaps - Fibonacci heaps - Disjoint sets - Amortized analysis- Accounting method - Potential method - Aggregate analysis. Graphs Representation of graphs - Breadth-first search - Depth-first search - Topological sort - Minimum spanning trees - Kruskal and Prim algorithm - Shortest path algorithm - Dijkstra`s algorithm - Bellman-Ford algorithm - Floyd - Warshall algorithm. Printed Pages: 456. Bookseller Inventory # 95889

More Information About This Seller | Ask Bookseller a Question

Published by
Technical Publications 0

ISBN 10: 9350996960
ISBN 13: 9789350996966

New
Softcover
First Edition
Quantity Available: > 20

Seller

Rating

**Book Description **Technical Publications 0. Softcover. Book Condition: New. First edition. Object Oriented Programming Fundamentals C++ Programming features - Data abstraction - Encapsulation - Class - Object - Constructors - Static members - Constant members - Member functions - Pointers - References - Role of this pointer - Storage classes - Function as arguments. Object Oriented Programming Concepts String handling - Copy constructor - Polymorphism - Compile time and run time polymorphisms - Function overloading - Operators overloading - Dynamic memory allocation - Nested classes - Inheritance - Virtual functions. C++ Programming Advanced Features Abstract class - Exception handling - Standard libraries - Generic programming - Templates - Class template - Function template - STL - Containers - Iterators - Function adaptors - Allocators - Parameterizing the class - File handling concepts. Advanced Non-Linear Data Structures AVL trees - B-Trees - Red-Black trees - Splay trees - Binomial heaps - Fibonacci heaps - Disjoint sets - Amortized analysis- Accounting method - Potential method - Aggregate analysis. Graphs Representation of graphs - Breadth-first search - Depth-first search - Topological sort - Minimum spanning trees - Kruskal and Prim algorithm - Shortest path algorithm - Dijkstra`s algorithm - Bellman-Ford algorithm - Floyd - Warshall algorithm. Printed Pages: 456. Bookseller Inventory # 95889

More Information About This Seller | Ask Bookseller a Question

Published by
Technical Publications 0

ISBN 10: 935099321X
ISBN 13: 9789350993217

New
Softcover
First Edition
Quantity Available: > 20

Seller

Rating

**Book Description **Technical Publications 0. Softcover. Book Condition: New. First edition. This book covers Recursion and Linear Search, Sorting Techniques, Stacks and Queues, Linked Lists, Trees, Advanced Concepts of Trees, Graphs,Sets Printed Pages: 434. Bookseller Inventory # 94910

More Information About This Seller | Ask Bookseller a Question

Published by
Technical Publications 0

ISBN 10: 9350990849
ISBN 13: 9789350990841

New
Softcover
First Edition
Quantity Available: > 20

Seller

Rating

**Book Description **Technical Publications 0. Softcover. Book Condition: New. First edition. A detail description on Linear Structures: Abstract Data Types (ADT) - List ADT - Array-based implementation - Linked list implementation - Cursor-based linked lists - Doubly-linked lists - Applications of lists - Stack ADT - Queue ADT - Circular queue implementation - Applications of stacks and queues. Tree Structures: Tree ADT - Tree traversals - Left child right sibling data structures for general trees - Binary tree ADT - Expression trees - Applications of trees - Binary search tree ADT - Threaded binary trees. Balanced Trees: AVL trees - Splay trees - B-tree - Heaps - Binary heaps - Applications of binary heaps. Hashing and Set: Hashing - Separate chaining - Open addressing - Rehashing - Extendible hashing - Disjoint set ADT - Dynamic equivalence problem - Smart union algorithms - Path compression - Applications of set. Graphs: Definitions - Topological sort - Breadth-first traversal - Shortest-path algorithms - Minimum spanning tree - Prim?s and Kruskal?s algorithms - Depth-first traversal - Biconnectivity - Euler circuits - Applications of graphs. Printed Pages: 520. Bookseller Inventory # 95809

More Information About This Seller | Ask Bookseller a Question

Published by
Technical Publications 0

ISBN 10: 935099321X
ISBN 13: 9789350993217

New
Softcover
First Edition
Quantity Available: > 20

Seller

Rating

**Book Description **Technical Publications 0. Softcover. Book Condition: New. First edition. This book covers Recursion and Linear Search, Sorting Techniques, Stacks and Queues, Linked Lists, Trees, Advanced Concepts of Trees, Graphs,Sets Printed Pages: 434. Bookseller Inventory # 94910

More Information About This Seller | Ask Bookseller a Question

Published by
Technical Publications 0

ISBN 10: 9350990849
ISBN 13: 9789350990841

New
Softcover
First Edition
Quantity Available: > 20

Seller

Rating

**Book Description **Technical Publications 0. Softcover. Book Condition: New. First edition. A detail description on Linear Structures: Abstract Data Types (ADT) - List ADT - Array-based implementation - Linked list implementation - Cursor-based linked lists - Doubly-linked lists - Applications of lists - Stack ADT - Queue ADT - Circular queue implementation - Applications of stacks and queues. Tree Structures: Tree ADT - Tree traversals - Left child right sibling data structures for general trees - Binary tree ADT - Expression trees - Applications of trees - Binary search tree ADT - Threaded binary trees. Balanced Trees: AVL trees - Splay trees - B-tree - Heaps - Binary heaps - Applications of binary heaps. Hashing and Set: Hashing - Separate chaining - Open addressing - Rehashing - Extendible hashing - Disjoint set ADT - Dynamic equivalence problem - Smart union algorithms - Path compression - Applications of set. Graphs: Definitions - Topological sort - Breadth-first traversal - Shortest-path algorithms - Minimum spanning tree - Primâ€™s and Kruskalâ€™s algorithms - Depth-first traversal - Biconnectivity - Euler circuits - Applications of graphs. Printed Pages: 520. Bookseller Inventory # 95809

More Information About This Seller | Ask Bookseller a Question