Data Structures Using C and C ++ Yedidyah Langsam, Moshe J. Augustein, et.al english

By:

Langsam Yedidyah

Material type: Text

TextPublication details: India PHIEdition: 2nd ed 1995Description: iii-670 p. ; soft bound 17.5 *23.7 cmISBN:

978-81-203-1177-0

DDC classification:

23 005.73 LAN

Contents:

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

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
Books	Tetso College Library Computer Science	Non-fiction	005.73 LAN (Browse shelf(Opens below))	Available		12087

Browsing Tetso College Library shelves, Shelving location: Computer Science, Collection: Non-fiction Close shelf browser (Hides shelf browser)

Previous						No cover image available		Next
Previous	005.72 JAI Web Designing and Publishing	005.72 JAI Web Designing and Publishing	005.73 JAI Problem solving in Data structure & Algorithms Using JAVA:/	005.73 LAN Data Structures Using C and C ++	005.73 LIP Data Structures With C	005.74 DAT An Introduction to Database Systems	005.74 ELM Fundamentals of database systems	Next

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.

to post a comment.