000			03330cam a2200241 a 4500
001			vtls000002110
003			VRT
005			20250102222431.0
008			081117s1997 nyua | 001 0 eng
020			_a0195108434
039		9	_a201402040103 _bVLOAD _c201007171159 _dmalmash _c200811220920 _dvenkatrajand _c200811171329 _dNoora _y200811171327 _zNoora
050	0	0	_aQA76.73.C153 _bB46 1997
100	1		_aBerman, A. Michael, _d1957- _91362
245	1	0	_aData Structures via C++ : _bobjects by evolution / _cA. Michael Berman.
260			_aNew York : _bOxford University Press, _c1997.
300			_axxi, 471 p. : _bill. ; _c24 cm.
504			_aIncludes bibliographical references (p. 463-464) and index.
505			_a1. Software Engineering and Computer Programming; Software Engineering and Computer Science; The Software Life-Cycle; Why C++?; 2. Designing Software: Two Approaches; Why Design?; Top-Down Design; The Object Alternative; Which method is Better, TDD or OOD?; 3. Software Reliability; Riss of Faulty Software; Testing; Applying Program Correctness Techniques; 4. Abstract Data Types, Classes and Objects; Problem: Computing with Time; Describing Data Types; ADT Implementation and Code Reuse; Information Hiding, Encapsulation, and Views; Creating Encapsulated ADT's Using the C++ Class; Using Standard C++ Class Libraries; ADT's, Objects, and Object-Oriented Programming; 5. Efficiency; Selecting Good Algorithms; The Many Faces of Program Efficiency; Algorithms for Searching; Analysis of some Simple Sorting Algorithms; 6. Recursion; Solving Problems with Recursion; Recursive Definitions; Applying Recursion to Sorting and Searching Problems; How is Recursion implemented?; 7. Lists; Problem: A Membership Management Program; The List ADT; Implementing Lists; The Inorder List ADT; Variations on a Linked List; A Dynamic Linear List; The Membership Management Program Revisited; 8. Stacks; Problem: Robot Navigation; The Stack ADT; Implementing the Stack 1: Array; Creating Generic Classes with Templates; Implementing the Stack 2: Dynamic List; Applications of the Stack ADT; The Robot Navigation Problem Solved; 9. Queue; Problem: Computer Network Performance; The Queue ADT; Implementing a Queue 1: Array; Implementing a Queue 2: Dynamic List; Simulation: modelling a computer network; 10. Tables; A Data Structure to Support Retrieval by Key; Implementing a Table; Hash Tables for Fast Retrieval; Using Tables; 11. Trees; Introducing Trees; Building a Binary Tree; Tree Traversal; Binary Search Trees; Reuse Through Inheritance: A Hierarchy of Trees; Performance of Binary Trees; 12. Graphs; Example
520			_aThis text is designed for a CS2 data structures course using C++ as the base programming language. The author introduces Object-Oriented Programming concepts in the context of traditional data structures and alghorithms, emphasizing encapsulation from the beginning and gradually bringing in generics, inheritance and polymorphism as the book progresses. Real world examples present the material in a way that makes the text accessible to students. All supporting materials, including source code, will be available to the faculty and students via the World Wide Web.
650		0	_aC++ (Computer program language) _91216
650		0	_aData structures (Computer science) _9188
942			_2lcc _n0 _cBK
999			_c394 _d394