Data Structures Demystified

Jim Keogh, Ken Davidson (Autoren)

Buch | Softcover

300 Seiten

2004
McGraw-Hill Professional (Verlag)
978-0-07-225359-7 (ISBN)

Titel ist leider vergriffen;
keine Neuauflage

Artikel merken

Helps learn about data structures. This book explains memory, addresses, and hash tables. It is suitable for both entry-level or seasoned designer or programmer.

Whether you are an entry-level or seasoned designer or programmer, learn all about data structures in this easy-to-understand, self-teaching guide that can be directly applied to any programming language. From memory and addresses to hashtables, authors Keogh and Davidson, provide clear explanations that demystify this “algebra of programming.”

Jim Keogh is on the faculty of Columbia University teaching courses in its technology certification program. He has spent 15 years developing computer systems for major Wall Street firms such as Salomen, Inc. and Bear Stearns and has written several best-selling books for Prentice Hall and IDG.

1: Memory, Abstract Data Types, and Addresses 2: The Point About Variables and Pointers 3: What Is an Array? 4: Stacks Using an Array 5: Queues Using an Array 6: What Is a Linked List? 7: Stacks Using Linked Lists 8: Queues Using Linked Lists 9: Stacks and Queues: Insert, Delete, Peek, Find 10: What Is a Tree? 11: What Is a Hashtable? A: Final Exam B: Answers to Quizzes and Final Exam

Erscheint lt. Verlag	16.3.2004
Reihe/Serie	Demystified
Zusatzinfo	40 Illustrations
Sprache	englisch
Maße	185 x 231 mm
Gewicht	499 g
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
ISBN-10	0-07-225359-2 / 0072253592
ISBN-13	978-0-07-225359-7 / 9780072253597
Zustand	Neuware