Explain LIFO and FIFO with applications. Define source code, why some languages are high level, ways to represent an algorithm, and qualities of a good algorithm. Define computer ethics.

9. (i) a) LIFO Meaning: Last In, First Out. Application: Managing the undo/redo history in a text editor. b) FIFO Meaning: First In, First Out. Application: Processing print jobs in a printer queue. 9. (ii) a) What is a source code? Source code is a set of human-readable instructions written in a programming language that a programmer creates. It defines how a computer program should function. b) Give a reason why some programming languages are classified as high level programming languages. High-level programming languages are classified as such because they use syntax closer to human language, abstracting away complex hardware details and making them easier for programmers to read, write, and maintain. c) State two ways in which you can represent an algorithm. • Flowchart • Pseudocode d) State the qualities of a good algorithm. • It must be finite (terminate after a finite number of steps). • It must be unambiguous (each step is clearly defined). • It must be effective (each step can be carried out). • It must have zero or more inputs. • It must produce one or more outputs. 9. (iii) a) Computer ethics Computer ethics refers to the moral principles and guidelines that govern the responsible and appropriate use of computers, information technology, and digital resources. b) Hacking Hacking is the act of gaining unauthorized access to a computer system, network, or data, often with malicious intent, by exploiting vulnerabilities. c) Copyright Copyright is a legal right granted to the creator of original literary, artistic, musical, or dramatic works, giving them exclusive rights to reproduce, distribute, perform, or display their work. 9. (iv) a) Evaluate 34_10 a binary Step 1: Divide the decimal number by 2 and record the remainder. 34 ÷ 2 = 17 R 0 17 ÷ 2 = 8 R 1 8 ÷ 2 = 4 R 0 4 ÷ 2 = 2 R 0 2 ÷ 2 = 1 R 0 1 ÷ 2 = 0 R 1 Step 2: Read the remainders from bottom to top. 100010_2 b) Evaluate 10110101_2 - 11111_2 Step 1: Align the binary numbers and perform subtraction, borrowing when necessary. ccccccccc & 1 & 0 & 1 & 1 & 0 & 1 & 0 & 1_2 \\ & 0 & 0 & 0 & 1 & 1 & 1 & 1 & 1_2 \\ & 1 & 0 & 0 & 1 & 0 & 1 & 1 & 0_2 \\ 10010110_2 c) Evaluate 101101_2 × 101_2 Step 1: Perform binary multiplication similar to decimal multiplication. ccccccc & & 1 & 0 & 1 & 1 & 0 & 1_2 \\ × & & & & & 1 & 0 & 1_2 \\ & & 1 & 0 & 1 & 1 & 0 & 1 & (101101 × 1) \\ & 0 & 0 & 0 & 0 & 0 & 0 & (101101 × 0 , shifted) \\ 1 & 0 & 1 & 1 & 0 & 1 & & & (101101 × 1 , shifted twice) \\ 1 & 1 & 1 & 0 & 0 & 0 & 0 & 1_2 \\ Step 2: Add the partial products. 11100001_2 Send me the next one 📸