Preface¶
Introduction for Data Structures and Algorithms Courses¶
Object Oriented Programming¶
List Interface & Array based Lists¶
Algorithm Analysis¶
Introduction to Pointers in Java¶
- 5.1. Pointers Chapter Introduction
- 5.2. Basic References Part 1
- 5.3. Basic References Part 2
- 5.4. Pointers Syntax
- 5.5. Local Memory
- 5.6. Heap Memory
- 5.7. Link Nodes
- 5.8. Link Nodes Practice Exercises
- 5.9. Pointers Concepts Summary
- 5.10. Additional Practice Exercises
- 5.11. More Practice Exercises
- 5.11.1. AddNodeAfterRef7
- 5.11.2. ChangeHeadNodeValue
- 5.11.3. ConcatenateTwoLists
- 5.11.4. DeleteNode
- 5.11.5. FirstNodeEqualsValue
- 5.11.6. InsertListAfterRef13
- 5.11.7. InsertListInMiddle
- 5.11.8. LastNodeParam5
- 5.11.9. LastNodeRef1
- 5.11.10. LoopInChain15
- 5.11.11. MiddleNodeRef3
- 5.11.12. ReferenceSecondLastNode
- 5.11.13. ReferenceValueNode
- 5.11.14. RemoveRefNext9
- 5.11.15. ReverseUpToRef11
Stacks¶
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 values
- 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
