Download CURRICULUM SUMMARY * September to October 2008

CURRICULUM SUMMARY – January to April 2017
SUBJECT: Computer Science
Week
1
Dates
2
2-5 Jan
9 -13 Jan
3
4
16-20 Jan
23-27 Jan
5
6
30 Jan-3
Feb
6 – 10 Feb
7
13 - 17 Feb
20 – 24 Feb
8
27 Feb -3
Mar
9
6 – 10 Mar
YEAR GROUP: IB1
Learning objectives
Problem Solving &
Programming - Recursion
Introduction to
Abstract data structures
Abstract data structures
Abstract Data Structures –
Stacks
Abstract Data Structures –
Queues
Abstract Data Structures –
Linked Lists
Abstract Data Structures –
Binary Tree
TEACHER: Joshua Eddyson
Activities (in brief)
Describe the characteristics of a two-dimensional array.
Construct algorithms using two-dimensional arrays.
 Describe the characteristics and applications of a stack.
 Construct algorithms using the access methods of a stack.
 Describe the characteristics and applications of a queue
 Construct algorithms using the access methods of a queue.
 Describe the features and characteristics of a dynamic data structure.
 Describe how linked lists operate logically.
 Sketch linked lists (single, double and circular
 Describe how trees operate logically (both binary and non-binary)
 Define the terms: parent, left-child, right-child, subtree, root and leaf.
 State the result of inorder, postorder and preorder tree traversal.
 Sketch binary trees.
Mid-Term
Break
Resource Management
Operating Systems








Identify the resources that need to be managed within a computer system.
Evaluate the resources available in a variety of computer systems.
Identify the limitations of a range of resources in a specified computer system.
Describe the possible problems resulting from the limitations in the resources in a
computer system.
Explain the role of the operating system in terms of managing memory, peripherals
and hardware interfaces.
Outline OS resource management techniques: scheduling, policies, multitasking,
virtual memory, paging, interrupt, polling.
Discuss the advantages of producing a dedicated operating system for a device.
Outline how an operating system hides the complexity of the hardware from users and
10
13 – 17 Mar
Control Systems
11
20 – 24
Mar
Control Systems/
Distributed Systems
12
27 – 31 Mar
Introduction to Object
Oriented Programming
13
3 – 7 Apr
Feedback and Assessment
applications.
 Discuss a range of control systems.
 Outline the uses of microprocessors and sensor input in control systems.
 Evaluate different input devices for the collection of data in specified situations.
 Explain the relationship between a sensor, the processor and an output transducer.
 Describe the role of feedback in a control system
 Discuss the social impacts and ethical considerations associated with the use of
embedded systems.
 Compare a centrally controlled system with a distributed system.
 Outline the role of autonomous agents acting within a larger system
 Define the term recursion.
 Describe the application of recursive algorithms.
 Construct algorithms that use recursion
 Trace recursive algorithms.
Feedback and Assessment