programming

Page 1

Programming

  • Y11 Computer Science - ATAR

Page 2

Class Rules

  • Resources are used responsibly.

  • No food or drinks allowed except for water.

  • No technology (phones, iPod, EarPods) is allowed in school and must remain in your bag.

  • School uniforms must be worn according to school rules.

  • Raise your hand if you have a question.

  • Speak respectfully and use respectful language.

  • Come to class ready to learn; be resilient throughout the lesson.

  • Violation of class rules may result in detention, with three consecutive detentions leading to further consequences.

Page 3

Course Overview

Year 11 Computer Science โ€“ ATAR

  • Unit 1: Design and development of programming and network solutions.

  • Unit 2: Design and development of database solutions and cyber security considerations.

Key Topics
  • Programming

  • Networking

  • Communications

  • Cyber Security

  • Data Management

Page 4

Course Outline (Weeks 1-3)

Knowledge

  • Introduction to semester 1 assessment requirements.

  • Programming fundamentals:

    • Data representation in binary, decimal, and hexadecimal.

    • Program control structures: sequence, selection, iteration.

    • Modular coding using functions, parameters, arguments, and variable scope (Global, Local).

    • Data types used in solutions.

Skills

  • Apply programming skills using pseudocode and a programming language:

    • Control structures: sequence, selection, iteration.

    • Modular coding: functions, parameters, and variable scope.

    • Apply necessary data types: integer, float, string, Boolean.

Operators
  • Arithmetic operators (+, -, *, /, %)

  • Relational operators (=, >, <, >=, <=)

  • Logical operators (AND, OR, NOT)

Page 5

Course Outline (Weeks 5-6)

Knowledge

  • Characteristics of data structures:

    • One-dimensional arrays.

  • Processing of text files: open for read/write/append, read/process data, write/append content, close.

  • Good programming practices:

    • Framework for Software Development: problem description, define requirements, development schedule.

    • Design data structures.

    • Develop and debug code, unit testing, use of live data, and evaluate.

Skills

  • Read and write complex logical expressions (AND, OR, NOT).

  • Apply pseudocode and programming languages for data structures, good programming practices, etc.

Page 6

Course Outline (Weeks 7-8)

Knowledge

  • Structured algorithms and benefits (ease of development, understanding, modification).

  • Representing algorithms: pseudocode and efficient algorithm design.

  • Processing arrays: load, print contents, add numbers, identify maximum/minimum.

  • Processing text files: open, read, write, and close.

Page 7

Course Outline (Weeks 9-10)

Knowledge

  • Testing: appropriate test data, boundary conditions.

  • Error detection and debugging code (syntax errors, runtime errors, logic errors).

Ethical and Legal Implications

  • Software development implications including piracy, copyright laws, and software licenses.

Page 8

Assessment Outline

Assessment Types and Weights

  • Project: 20% (Semester 1, Weeks 5-12)

  • Practical Test: 10% (Semester 1, Week 10)

  • Theory Test: 20% (Semester 1, Week 14)

  • Final Examination:

    • Semester 1: 30% (Week 16)

    • Semester 2: 20% (Week 16)

Assessment Tasks

  • Design and create an interactive puzzle or game.

  • Investigate and manipulate databases with SQL queries.

Page 9

Grok Learning

  • Complete programming tutorials on groklearning.com.

  • Sign in with student email; complete Module 1: Talking to your computer.

Page 10

Course Outline Repeat (Weeks 1-3)

Knowledge and Skills
  • Same structure as Page 4 regarding programming skills and operators.

Page 11

Learning Objective

  • Represent characters as numbers in binary, decimal, and hexadecimal.

Page 12

Questions and Conversion Table

Number

Decimal

Working Area

Binary Number

128

1

10000000

64

1

01000000

...

...

...

...

Page 13

Hexadecimal Basics

  • Uses decimal numbers with six extra symbols (A-F). | Decimal | Binary | Hexadecimal | |---------|--------|-------------| | 0 | 0 | 0 | | 1 | 1 | 1 | | ... | ... | ... |

Page 14

Hexadecimal โ€“ Base 16

  • Decoding examples ranging from Decimal 0-15. | Decimal | Hexadecimal | |---------|--------------| | 0 | 0 | | ... | ... |

Page 15

Hexadecimal Conversion Practice

Example for Decimal 45:

  1. Calculate how many 16's fit into 45.

  2. Remaining value is 13 which converts to D in Hex.

    • Final answer: 2D

Page 16

Hexadecimal Extension

  • Write how to convert from decimal 16 to 31.

Page 17

Additional Hexadecimal Examples

  • Decimal numbers from 16โ€“31. | Decimal | Hex | |---------|-----| | 16 | 10 | | 32 | 20 |

Page 18

Denary to Hexadecimal

  • Example conversion from decimal to hexadecimal for given ranges.

Page 19

Task: Create Hexadecimal Numbers 16 to 47

Example: Conversion process with steps outlined.

Page 20

Answers for Hexadecimal Numbers 16 to 47

Page 21

Flowchart Basics

  • Flowcharts represent algorithms visually, using shapes to denote different functions.

Page 22

Symbols in Flowcharts

  • Process, Decision, Flow Line, Terminator, Data (I/O).

Page 23

Flowchart Shapes and Meanings

  • Terminal, Input/Output, Process, Decision. Emphasizes structured programming.

Page 24

Programming

  • Y11 Computer Science - ATAR (Repeat)

Page 25

Hexadecimal Further Practice

  • Conversions for given hexadecimal values from 30 to 39.

Page 26

Course Outline Repeat (Weeks 1-3)

Page 27

Learning Objective

  • Apply program control structures: Sequence, Selection, Iteration.

Page 28

Pseudocode Introduction

  • Structured and simplified sentences to represent algorithms.

Page 29

Pseudocode Best Practices

  • Guidelines for effective pseudocode writing: readability, one statement per line, clear keywords, etc.

Page 30

Sequence Control Structure

  • SEQUENCE: Instructions are processed in the order written.

Page 31

Sequence Example

  • Flowchart and pseudocode for sequential processing.

Page 32

Control Structure - Selection

  • SELECTION: Decision-based control structures (if-then).

Page 33

One-Way Selection

  • Explained with syntax and example.

Page 34

Activity - One-Way Selection

  • Create flowchart and pseudocode based on conditions.

Page 35

Flowchart and Pseudocode Example

Page 36

Programming

  • Year 11 Review Section

Page 37

Course Outline Repeat (Weeks 1-3)

Page 38

Review Exercises - Convert Binary

  • Convert provided binary numbers to decimal.

Page 39

Activity One-Way Selection

  • Create pseudocode for specific conditions.

Page 40

One-Way Selection Example

Page 41

Two-Way Selection Explanation

  • If-then-else structure.

Page 42

Two-Way Selection Activity

  • Complete pseudocode and flowchart.

Page 43

Two-Way Selection Example

Page 44

Nested Selection Overview

  • Explanation of nested control structures.

Page 45

Nested Selection Activity

  • Complete pseudocode for age-dependent pricing.

Page 46

Nested Selection Example

Page 47

Nested Selection Summary

Page 48

PRACTICE TASK

  • One-Way, Two-Way, and Multi-Way Selection examples.

Page 49

PRACTICE examples with conditions.

Page 50

Review - Convert Hexadecimal to Decimal

Page 51

Review Calculations for Hexadecimal Values

Page 52

Iteration Explanation

  • Repetition of actions, also called looping.

Page 53

For Loop Concept

  • Fixed or counted loop repeating a known number of times.

Page 54

For Loop Activity

  • Complete pseudocode for total scores of a cricket team.

Page 55

For Loop Activity Solution

Page 56

Programming Review Section

Page 57

Course Outline Repeat

Page 58

While Loop Pre-Test

  • Explanation of variable repetitions based on conditions.

Page 59

While Loop Activity

  • Convert code from FOR LOOP to WHILE LOOP.

Page 60

While Loop Implementation

Page 61

Repeat Until Concept

  • Post-Test looping explanation.

Page 62

Repeat Until Activity

Page 63

Repeat Until Flowchart Example

Page 64

Post Test Presumptions on Age Entry

Page 65

Programming Review Section

Page 66

Course Outline Repeat (Weeks 1-3)

Page 67

Learning Objectives Repeat

Page 68

Sequence Practice Activity

Page 69

Sequence Practice Requirements

Page 70

Pseudocode for Athlete Race Times

Page 71

Data Type Definition

Page 72

Simple Data Types Overview

Page 73

Programming Review Section

Page 74

Pseudocode Practice for Ticket Purchase

Page 75

Full Pseudocode Example for Ticket Purchase

Page 76

Multiple Pseudocode Tasks for Calculation

Page 77

Sample Task Answers

Page 78

Pseudocode Example for Two Numbers

Page 79

Pseudocode Execution for y= x+7

Page 80

Course Outline Repeat (Weeks 1-3)

Page 81

Learning Objective on Modular Coding

  • Focus on parameters and scope.

Page 82

Constants vs Variables

Page 83

Key Differences Table

Page 84

Scope of an Identifier Overview

Page 85

Scope in Various Programming Languages

Page 86

Naming Variables Best Practices

Page 87

Library Import Functionality

Page 88

Modularization Explanation

Page 89

Benefits of Modularization

Page 90

Module Best Practices

Page 91

Differences Between Modularization and Library Imports

Page 92

Modularization Implementation Details

Page 93

Example of Modularization in Code

Page 94

Parameters in Function Calls

Page 95

Writing Modules Example

Page 96

Structured Code and Modularization

Page 97

Pseudocode Summary for Swim Data

Page 98

Programming Review Section Repeat

Page 99

Course Outline Repeat (Weeks 1-3)

Page 100

Ticket Pricing Algorithm Exploration

Page 101

Practice Question Answering Algorithm

Page 102

Binary & Hexadecimal Review Table

Page 103

Conversion Review from Decimal to Binary & Hexadecimal

Page 104

Modularization Summary

Page 105

Definition of Modularization

Page 106

Benefits of Modularization Repeat

Page 107

Module Best Practices Overview Repeat

Page 108

Example Detailed Code Structure for Area Calculation

Page 109

Function Overview and Requirements

Page 110

How Functions Work in Code

Page 111

Comparison Tables for Modularization and Functions

Page 112

Functions Exercise Task

Page 113

Functions Solution Example

Page 114

Programming Review Section Repeat

Page 115

Course Outline Repeat (Weeks 1-3)

Page 116

Objective on Operator Usage

Page 117

Operators Activity Task

Page 118

Scratch Challenge Overview