Programming in Little Man Computer (LMC)

1. LMC
2. Tasks
3. Questions
4. Exercises
5. Exam questions

11.5.1.3 analyze a simple program written in the language of assembler 

Types of programming errors

1. Syntax error or Compilation error
2. Run-time error
3. Logical error
4. Table for comparison of types of errors
5. Questions
6. Exercises
7. Exam questions

12.5.3.5 describe a syntax error in a programming
12.5.3.1 describe run-time errors in a programming 
12.5.3.6 describe a logic error in a programming

Types of test data

• Video
• Definitions
• Task 1
• Questions
• Exercises
• Exam questions

12.5.3.2 perform testing using normal data 
12.5.3.3 perform testing using extreme data
12.5.3.4 perform testing using erroneous data 
 

Stages of compiler design

1. Lexical analysis
2. Syntactic analysis
3. Code generation
4. Code optimization
5. Questions
6. Exercises
7. Exam questions

12.5.1.3 describe program compilation stages: lexical and syntactic analysis, code generation and optimization​

Simple expert system (declarative languages)

Questions

Exercises

Exam questions

12.5.1.2  create a simple expert system

Generation of programming languages

1. First Generation Language (Machine language)
2. Second Generation language (Assembly Language)
3. Third Generation languages (High-Level Languages)
4. Fourth generation language (Very High-level Languages)
5. Fifth generation language (Artificial Intelligence Language)
6. Questions
7. Exercises
8. Exam questions

11.5.1.1 distinguish between generations of programming languages

Low and High level languages

11.5.1.2 classify programming languages into low and high-level

11.5.1.5 advantages and disadvantages of high-level languages 

11.5.1.6 advantages and disadvantages of low-level languages 

RAM vs ROM

1. Definitions and features
2. Comparisons
3. Questions
4. Exercises

11.3.4.1 explain the differences between RAM and ROM memory 

Declarative and imperative programming languages

1. Declarative languages
2. Imperative languages
3. Difference between declarative and imperative programming
4. Comparing the two approaches
5. Questions
6. Exercises
7. Exam questions

LO: 12.5.1.1  compare declarative and imperative programming languages 

Data structure Binary tree

1. Concept of a tree
2. A more general definition of a tree
3. A binary search tree
4. Traversing a binary tree
5. Questions
6. Exercises
7. Exam questions

12.5.2.2 build a binary tree