- COMP1000 ▼
- Transition to Processing
- Primitive Operations
- Algorithms
- Variables
- Moving Composite Shapes
- Debugging in Processing
- Boolean expressions
- Conditions
- Loops
- Functions
- Function call dissection
- Scope
- Arrays
- Arrays and Functions
- Reference Semantics
- Multi-dimensional Arrays
- Handling null Arrays
- Strings
- Refactoring
- Program Design
- Case Study
- Code Style Guide
- PRACTICE QUESTIONS
- COMP1010 ▼
- COMP1000 REVISION
- Foundation for COMP1010
- Transition to Java
- Debugging in Java
- Unit Testing
- Classes - Writing your own Types
- Classes - Copying objects
- Classes - Functions inside objects
- Classes - Composition
- Classes - Array of objects
- Classes - Class holding array(s)
- Recursion - What goes on during a function call
- Recursion
- Recursion with String data
- Tail-optimized recursion
- Recursion with arrays
- Lists
- Iteration
- List of Lists
- Sorting Algorithms
- Stacks and Queues
- Custom-built ArrayList
- Recursive data structures - 1
- Recursive data structures - 2
- Searching
- Assembly Programming
- PRACTICAL CLASS MATERIAL
- COMP6010 ▼
- COMP2160 ▼
- Common ▼
- Research Skills (Java/MiniConsole) ▼
- Research Skills (Machine Learning) ▼
- Regular expressions ▼
- Edit (README for details)
- Search the site - NEW!
Assembly Programming
Assumed Knowledge
Learning Outcomes
- Be able to understand how to write basic programs at assembly-level.