Scribd
Upload
2 views2 pages

Unit1 AnswerKey

This document is an answer key for a Grade 9 Programming Fundamentals series, covering problem solving and algorithms. It includes scoring guides for various parts such as fill in the blanks, pseudo-code completion, expression evaluation, and short answer questions. Each section provides specific answers and marking criteria for teachers' use only.

Uploaded by

lfatiharical
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views2 pages

Unit1 AnswerKey

This document is an answer key for a Grade 9 Programming Fundamentals series, covering problem solving and algorithms. It includes scoring guides for various parts such as fill in the blanks, pseudo-code completion, expression evaluation, and short answer questions. Each section provides specific answers and marking criteria for teachers' use only.

Uploaded by

lfatiharical
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Programming Fundamentals Series · 9 Units · Grade 9 · Unit 1 of 9 — Answer Key

Problem Solving & Algorithms


■ FOR TEACHER USE ONLY Do not distribute

■ Scoring Guide

Part Topic Pts Guidance

A Fill in the Blanks 10 1 pt each. Accept exact word from word bank only.

Pseudo-Code B1: 5 pts (1 per blank). B2: 5 pts (1 per blank). Accept equivalent
B Completion 10 variable names.

C Expression Evaluation 10 1 pt each. C1 award 1pt for correct working even if arithmetic error.

D Short Answer 10 See marking guidance below each answer.

PART A Fill in the Blanks — Answers

1. operator 2. variable

3. algorithm 4. Pseudo-code

5. flowchart 6. modulus

7. finite 8. counter

9. True 10. False

PART B Pseudo-Code Completion — Answers

B1 — Find the Larger Number

# Answers shown in green


Step 1: Start
Step 2: Read num1
Step 3: Read num2
Step 4: IF num1 > num2 THEN
Step 5: Print num1
Step 6: ELSE
Step 7: Print num2
Step 8: End

B2 — Print 1 to 5 with a Loop


Step 1: Start
Step 2: counter = 1
Step 3: Print counter
Step 4: counter = counter + 1
Step 5: IF counter <= 5 THEN go to Step 3
Step 6: End

PART C Expression Evaluation — Answers

C1 11 (10+1) C6 True

C2 32 (2^5) C7 False (4==4)

C3 2 (17=3×5+2) C8 False

C4 4 (floor div) C9 True

C5 True C10 False (not True)

PART D Short Answer — Marking Guide

D1 — 6 Problem-Solving Steps (3 pts — ½ pt each)


1. Define the problem · 2. Analyse the problem · 3. Identify alternatives · 4. Choose the best solution · 5. Implement the
solution · 6. Test the solution

D2 — Algorithm Definition (2 pts)


Model Answer: An algorithm is a finite, ordered set of clear, unambiguous steps that solves a well-defined problem.
Award 2 pts: finite + ordered/step-by-step mentioned. Award 1 pt: general correct definition without key terms.

D3 — Linear vs Loop (2 pts)


Model Answer: A linear algorithm executes steps once, top to bottom, with no repetition. A loop algorithm repeats a
block of steps until a condition is met.
Award 1 pt per correct definition.

D4 — Positive/Negative/Zero Algorithm (3 pts)


Step 1: Start
Step 2: Read number
Step 3: IF number > 0 THEN Print "Positive"
Step 4: ELSE IF number < 0 THEN Print "Negative"
Step 5: ELSE Print "Zero"
Step 6: End

Award 1 pt: correct input step. Award 1 pt: correct IF/ELSE IF structure. Award 1 pt: all 3 cases covered.

You might also like