Chapter 0 Preface¶
Chapter 1 Introduction for Data Structures and Algorithms Courses¶
Chapter 2 Object-Oriented Programming¶
Chapter 3 List Interface & Array-based Lists¶
Chapter 4 Algorithm Analysis¶
Chapter 5 Introduction to Pointers in Java¶
- 5.1. Basic References
- 5.2. Practice Exercises
- 5.2.1. JHAVEPOPEx1
- 5.2.2. JHAVEPOPEx2
- 5.2.3. JHAVEPOPEx3
- 5.2.4. JHAVEPOPEx4
- 5.2.5. JHAVEPOPEx5
- 5.2.6. JHAVEPOPEx6
- 5.2.7. JHAVEPOPEx7
- 5.2.8. JHAVEPOPEx8
- 5.2.9. JHAVEPOPEx9
- 5.2.10. JHAVEPOPEx10
- 5.2.11. JHAVEPOPEx11
- 5.2.12. JHAVEPOPEx12
- 5.2.13. JHAVEPOPEx13
- 5.2.14. JHAVEPOPEx14
- 5.2.15. JHAVEPOPEx15
- 5.2.16. JHAVEPOPEx16
- 5.2.17. JHAVEPOPEx17
- 5.2.18. JHAVEPOPEx18
- 5.3. Local Memory
- 5.4. Heap Memory
- 5.5. Link Nodes
Chapter 6 Stacks¶
Chapter 7 Recursion¶
- 7.1. Introduction
- 7.2. Writing a recursive function
- 7.3. Code Completion Practice Exercises
- 7.3.1. Introduction
- 7.3.2. Recursion Programming Exercise: Largest
- 7.3.3. Recursion Programming Exercise: Multiply
- 7.3.4. Recursion Programming Exercise: GCD
- 7.3.5. Recursion Programming Exercise: log
- 7.3.6. Recursion Programming Exercise: Cummulative Sum
- 7.3.7. Recursion Programming Exercise: Add odd positions
- 7.3.8. Recursion Programming Exercise: Sum Of the Digits
- 7.3.9. Recursion Programming Exercise: Count Characters
- 7.4. Writing More Sophisticated Recursive Functions
- 7.5. Harder Code Completion Practice Exercises
- 7.6. Writing Practice Exercises
- 7.7. Tracing Recursive Code
- 7.8. Tracing Practice Exercises
- 7.9. Summary Exercises
