Chapter 23 Computational Thinking and Problem-

solving

Syllabus sections covered: 4.1 (Sections 4.1.1 – 4.1.3)

Teaching resources

Topics

Syllabus

section

40 min.

periods

Resources in

coursebook

Resources on

this CD-ROM

1

Computational thinking

4.1.1

1

Exercise 23.01

2

Standard algorithms

4.1.2

6

Task 23.01

Task 23.02

**Extension Question

23.01

Task 23.03

Exam-style Question 1

Exercise 23.02

Exercise 23.03

3

Stacks and queues

4.1.3

2

Exercise 23.04

Exercise 23.05

4

Linked lists

4.1.3

6

Task 23.04

Task 23.05

Task 23.06

Exam-style Question 2

Exercise 23.06

Exercise 23.07

5

Binary trees

4.1.3

4

*Task 23.07

Exercise 23.08

6

Hash tables

4.1.2

4

Worked Example 23.01

*Exercise 23.09

7

Dictionaries

4.1.3

2

Task 23.08

Tasks and exercises marked * are for students who have completed the basic

exercises.

Tasks and exercises marked ** are stretch and challenge exercises.

Past exam paper questions

Paper

Series

Question

Topic

9691/21

Nov 2015

1

arrays of records, sorting

9691/31

Nov 2015

5

binary tree

9691/32

Nov 2015

4

binary tree

9691/31

June 2015

4

stack

9691/33

June 2015

4

stack

9691/33

Nov 2014

1c-e

queue and stack

9691/31

June 2014

4

binary tree

9691/32

June 2014

4

binary tree

9691/33

June 2014

4

binary tree

9691/31

Nov 2013

1c

binary tree

9691/31

Nov 2013

5

stack

Supporting notes

The concepts in this unit are more complex than in Unit 2. Students need to have a

good foundation of programming skills to build on.

An excellent facility for demonstrating different sort algorithms can be found at:

CH 23 Chapter Notes. nnnnnnnjj

Disaster Management (OE 601 CE)

Osmania University

Recommended for you

Comments

Students also viewed

Related documents