E238 Languages
Timetable 2006

Term 1

Week 1: Wednesday

Didn’t happen. Period 1 Assembly (minus one)

Week 2: Wednesday

For Languages and programming, you need with you:

• pen
• paper
• pencil
• eraser
• short ruler

Slow start: Explanations, course outline, web site.

Text Book: Chapter 15: pp.

Start with Section 1.1 Pascal Programs

Week 3:

Wednesday: Finish Section 1.1 Pascal Programs
Homework: Do Ex.1.1B Q. 5.
Draw plan. Write code.

Friday (plus one): Mark homework
Homework: Do Ex. 1.1B Q. 6
Start Section 1.2 Variable Types

Week 4:

Monday (plus one): Mark homework
Finish Section 1.2 Variable Types
Homework: Do Ex. 1.2B Q. 4 or 5

Tuesday (plus one) : Mark homework
Do Section 1.3
Homework: Do Ex. 1.3B Q. 5

Wednesday: Mark homework
Do Section 1.4
Homework: Do Ex. 1.4 B Q. 5
Test next Wednesday

Friday: Year 12s leave early for School Ball

Week 5: Wednesday

Test on Pascal Chapter 1.

Week 6: Wednesday

Week 7: Wednesday

Supervised: Do 1998 TEE, Question 32

Week 8: Wednesday

Week 9: Wednesday

Week 10: Wednesday

Term 2

Week 1: Wednesday

Week 2: Wednesday

Week 3: Wednesday

Week 4: Wednesday

Week 5: Wednesday

Semester 1 exams (minus two)

Week 6: Wednesday

Semester 1 exams (minus three)

Week 7: Wednesday

Week 8: Wednesday

Section 4.1 Procedures

Week 9: Wednesday

Section 4.2 Menu Driven Programs

Week 10: Wednesday

Section 4.3 Text Files

Week 11: Wednesday

Section 4.4 Searching Text Files

Term 3

Week 1: Wednesday

Section 5.1 Passing Parameters

Week 2: Wednesday

Section 5.2 Returning Data

Week 3: Wednesday

Section 5.3 Functions

Week 4: Wednesday

Section 5.4 Further Parameters
Section 5.5 Recursion

Week 5: Wednesday

Section 6.1 Defining Arrays

Week 6: Wednesday

Section 6.2 Maxima and Minima

Week 7: Wednesday

Section 6.3 Searching Arrays

Week 8: Wednesday

Section 6.4 Files of Arrays

Week 9: Wednesday

Week 10: Wednesday

Term 4

Week 1:

Semester 2 exams (minus four)

Week 2: Wednesday

Chapter 10 Data Structures
Section 10.1 Stacks
Section 10.2 Queues
Section 10.3 Pointers

Week 3: Wednesday

1. Define:

• machine code
• assembler languages
• procedural languages
• fourth generation languages (4GL)

2. Define and compare:

• interpreters
• compilers

3. Apply:

• sequence
• selection
• iteration

4. Apply modular principles and simple parameter-passing.

5. Apply data structures, including simple arrays and records.

6. Apply Pseudocode and Nassi-Shneiderman diagrams
to solve simple problems.

7. Apply programming to solve simple problems.

Note: Students are expected to understand these principles
common to languages in a variety of contexts,
rather than to learn a specific language.