Data structures using C and C++ / by Yedidyah Langsam, Moshe J. Augenstein, Aaron M. Tenenbaum.
Material type: TextPublication details: Upper Saddle River, N.J. : Prentice Hall, c1996Edition: 2nd edDescription: xvi, 672 p. : ill. ; 24 cmISBN: 0130369977 (pbk)Subject(s): C (Computer program language) | C++ (Computer program language) | Data structures (Computer science)DDC classification: 005.73Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
Books | Namal Library Computer Science | 005.73 LAN-D 1996 8937 (Browse shelf (Opens below)) | Available | 0008937 |
Rev. ed. of: Data structures using C / Aaron M. Tenenbaum, Yedidyah Langsam, Moshe J. Augenstein. c1990.
Includes bibliographical references (p. 647-661) and index.
Introduction to data structures --
Information and meaning --
Arrays in C --
Structures in C --
Classes in C++ --
The stack --
Definition and examples --
Representing stacks in C --
Example: Infix, postfix, and prefix --
Recursion --
Recursive definition and processes --
Recursion in C --
Writing recursive programs --
Simulating recursion --
Efficiency of recursion --
Queues and lists --
The queue and its sequential representation --
Linked lists --
Lists in C --
Example: Simulation using linked lists --
Other list structures --
The linked list in C++ --
Trees --
Binary trees --
Binary tree representations --
Example: The Huffman algorithm --
Representing lists as binary trees --
Trees and their applications --
Example: Game trees --
Sorting --
General background --
Exchange sorts --
Selection and tree sorting --
Insertion sorts --
Merge and radix sorts --
Searching --
Basic search techniques --
Tree searching --
General search trees --
Hashing --
Graphs and their applications --
Graphs --
A flow problem --
Linked representation of graphs --
Graph traversal and spanning forests --
Storage management --
General lists --
Automatic list management --
Dynamic memory management.
There are no comments on this title.