Theory and problems of data structures
About the Book: Data Structures (SIE) True to the ideology of the Schaums Outlines, the present version of this book includes the discussion on basics of data structures supplemented with solved examples and programming problems. The classic and popular text is back with refreshed pedagogy and progr...
Saved in:
Main Author: | |
---|---|
Format: | Book |
Published: |
New York
McGraw-Hill
1986
©1986 |
Series: | Schaum's Outline series
|
Subjects: | |
Online Access: | Click Here to View Status and Holdings. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
MARC
LEADER | 00000n a2200000 a 4501 | ||
---|---|---|---|
001 | wils-243013 | ||
005 | 2022931161510 | ||
020 | # | # | |a 0070380015 |q paperback |
040 | # | # | |a UiTM |b eng |c UiTM |e rda |
090 | 0 | 0 | |a QA76.9.D35 |b L56 1986 |
100 | 1 | # | |a Lipschutz, Seymour |e author |
245 | 1 | 1 | |a Theory and problems of data structures |c Seymour Lipschutz |
264 | # | 1 | |a New York |b McGraw-Hill |c 1986 |
264 | # | 1 | |c ©1986 |
300 | # | # | |a 344 pages |b illustrations |c 27cm |
336 | # | # | |a text |2 rdacontent |
337 | # | # | |a unmediated |2 rdamedia |
338 | # | # | |a volume |2 rdacarrier |
490 | 1 | # | |a Schaum's Outline series |
504 | # | # | |a Includes bibliographical references and indexes |
520 | # | # | |a About the Book: Data Structures (SIE) True to the ideology of the Schaums Outlines, the present version of this book includes the discussion on basics of data structures supplemented with solved examples and programming problems. The classic and popular text is back with refreshed pedagogy and programming problems helps the students to have an upper hand on the practical understanding of the subject. Salient Features: Expanded discussion on Recursion (Backtracking, Simulating Recursion), Spanning Trees. Covers all important topics like Strings, Arrays, Linked Lists, Trees Highly illustrative with over 300 figures and 400 solved and unsolved exercises Content 1.Introduction and Overview 2.Preliminaries 3.String Processing 4.Arrays, Records and Pointers 5.Linked Lists 6.S tacks, Queues, Recursion 7.Trees 8.Graphs and Their Applications 9.Sorting and Searching About the Author: Seymour Lipschutz Seymour Lipschutz, Professor of Mathematics, Temple University |
650 | # | 0 | |a Data structures (Computer science) |
856 | 4 | 0 | |z Click Here to View Status and Holdings. |u https://opac.uitm.edu.my/opac/detailsPage/detailsHome.jsp?tid=243013 |
964 | # | # | |c BOK |d 01 |
998 | # | # | |a 00264#1a002.8.2||00264#1b002.8.4||01264#1a002.8.2||01264#1b002.8.4||00300##a002.17.2||00300##b003.6.1||00300##c002.17.2||00520##a007.2||00520##b007.2|| |