My Account Details
ISBN10: 007146994X | ISBN13: 9780071469944
ISBN10: 007146994X
ISBN13: 9780071469944
Step 1 . Download Adobe Digital Editions to your PC or Mac desktop/laptop.
Step 2. Register and authorize your Adobe ID (optional). To access your eBook on multiple devices, first create an Adobe ID at account.adobe.com. Then, open Adobe Digital Editions, go to the Help menu, and select "Authorize Computer" to link your Adobe ID.
Step 3. Open Your eBook. Use Adobe Digital Editions to open the file. If the eBook doesn’t open, contact customer service for assistance.
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.”
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
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
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
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
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
11: What Is a Hashtable? A: Final Exam B: Answers to Quizzes and Final Exam
B: Answers to Quizzes and Final Exam
Need support? We're here to help - Get real-world support and resources every step of the way.
Top