Computer Science Curriculum Content, KS5

Similar documents
Teddington School Sixth Form

A Level Computing. Course Content Checklist. Name: Tutor Group: Teaching Group: Target Grade: Page 1 of 38

Switching to AQA from Edexcel

Learning Programme Fundamentals of data representation AS Level

Switching to AQA from OCR

Department Curriculum and Assessment Outline

2c. Content of Computer systems (Component 01)

COMPUTING SUBJECT KNOWLEDGE AUDIT

Learning objectives. Computer principles The characteristics of contemporary processors, input, output and storage devices

AQA GCSE Computer Science PLC

Edexcel GCSE in Computer Science Microsoft IT Academy Mapping

OCR Level 3 Advanced GCE in Computer Science (H446)

This document contains additional questions; it is not intended to be treated as a complete paper.

OCR H446 A-Level Computer Science

Advanced Diploma in Computer Science (907) Computer Systems Architecture

OCR GCSE (9-1) Computer Science J276 Accompanying Instructional Document

Personalised Learning Checklist ( ) SOUND

OCR H446 A-Level Computer Science

F453 Module 7: Programming Techniques. 7.2: Methods for defining syntax

Autumn 1 Autumn 2 Spring 1 Spring 2 Summer 1 Summer 2. networks. environmental concerns. Knowledge and skills covered: Knowledge and skills covered:

HASTINGS HIGH SCHOOL

GCSE Computer Science for OCR Overview Scheme of Work

Floating Point Arithmetic

SAMPLE CURRICULUM GUIDE June 2014

OCR H446 A-Level Computer Science

Syllabus for Computer Science General Part I

Autumn 1 Autumn 2. An Introduction to Idsall s Network & esafety. Programming with Scratch. Spring 1 Spring 2

ASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology

Part I Basic Concepts 1

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)


OCR J276 (9-1) GCSE Computer Science

AP Computer Science AB

Objectives. Connecting with Computer Science 2

M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I

ICT & Computing Progress Grid

Computing 1: Computer Systems

M.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. Time : 03 Hours Maximum Marks : 75

The type of all data used in a C (or C++) program must be specified

SAMPLE COURSE OUTLINE COMPUTER SCIENCE GENERAL YEAR 12

Time : 03 Hours Maximum Marks : 75

School of Computer Science

Chapter Three. Arithmetic

CS 265. Computer Architecture. Wei Lu, Ph.D., P.Eng.

COMPUTER SCIENCE/INFORMATION SYSTEMS DEGREE PLAN

Diskrečioji matematika

«Computer Science» Requirements for applicants by Innopolis University

Year 10 OCR GCSE Computer Science (9-1)

F453. COMPUTING Advanced Computing Theory ADVANCED GCE. Thursday 23 June 2011 Morning

COMP3 (JUN13COMP301) General Certificate of Education Advanced Level Examination June 2013

COURSE OUTLINE COMPUTER SCIENCE GENERAL YEAR 12: 2019 UNIT 3 AND UNIT 4

Number Systems. Decimal numbers. Binary numbers. Chapter 1 <1> 8's column. 1000's column. 2's column. 4's column

OHIO ASSESSMENTS FOR EDUCATORS (OAE) FIELD 010: COMPUTER INFORMATION SCIENCE

Introduction to C. Why C? Difference between Python and C C compiler stages Basic syntax in C

Higher National Unit specification: general information

COSC 243. Data Representation 3. Lecture 3 - Data Representation 3 1. COSC 243 (Computer Architecture)

University of Baghdad College of Science Department of Computer Science األسم الكامل: High Diploma Qualification Exam Date: 13 Aug Time: 3 hrs.

OCR J276 GCSE Computer Science

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

Binary representation and data

Computer Organisation CS303

15110 PRINCIPLES OF COMPUTING SAMPLE EXAM 2

UNIVERSITY OF CAMBRIDGE INTERNATIONAL EXAMINATIONS General Certificate of Education Advanced Level. Paper 3 October/November hours

1) What is information system? Describe the basic concepts of information systems.

Java Software Solutions for AP Computer Science 3rd Edition, Lewis et al. 2011

COMPUTER SCIENCE SPECIFICATION GCE AS/A LEVEL. WJEC GCE AS/A LEVEL in. Teaching from For award from 2016 (AS) For award from 2017 (A level)

COURSE OUTCOMES OF M.Sc(IT)

COMPUTER SCIENCE SPECIFICATION GCE AS/A LEVEL. WJEC GCE AS/A LEVEL in. Teaching from For award from 2016 (AS) For award from 2017 (A level)

Assessment for the CS Degree Program FY Fall 12 - Spring 13 Computer Science Dept. Texas A&M University - Commerce

SECOND SEMESTER BCA : Syllabus Copy

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register

ECE 2030D Computer Engineering Spring problems, 5 pages Exam Two 8 March 2012

JAVA PROGRAMMING. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit:

Chapter 2 Bits, Data Types, and Operations

OCR A Level GCE Computer Science

Course overview. Computer Organization and Assembly Languages Yung-Yu Chuang 2006/09/18. with slides by Kip Irvine

Data Representation COE 301. Computer Organization Prof. Muhamed Mudawar

Digital Logic. The Binary System is a way of writing numbers using only the digits 0 and 1. This is the method used by the (digital) computer.

COMP2611: Computer Organization. Data Representation

mywbut.com GATE SOLVED PAPER - CS (A) 2 k (B) ( k+ (C) 3 logk 2 (D) 2 logk 3

UNIT 7A Data Representation: Numbers and Text. Digital Data

Chapter 1. Data Storage Pearson Addison-Wesley. All rights reserved

Introduction to Computer Science (I1100) Data Storage

Introduction. Problem Solving on Computer. Data Structures (collection of data and relationships) Algorithms

Madhya Pradesh Bhoj (Open) University, Bhopal

Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates. Invitation to Computer Science, C++ Version, Third Edition

Stewards Pooi Kei College Secondary 4 Information and Communication Technology Teaching Schedule ( )

Systems Architecture. Systems Architecture. Memory. Memory. Memory. Memory. The Purpose and Function. The Purpose and Function

KS3 Computing - Life Without Levels

The type of all data used in a C++ program must be specified

Course Schedule. CS 221 Computer Architecture. Week 3: Plan. I. Hexadecimals and Character Representations. Hexadecimal Representation

MACHINE LEVEL REPRESENTATION OF DATA

Boca Raton Community High School AP Computer Science A - Syllabus 2009/10

CS 216 Fall 2007 Final Exam Page 1 of 10 Name: ID:

WYSE Academic Challenge 2002 Computer Science Test (Sectional) SOLUTION

E40M. Binary Numbers, Codes. M. Horowitz, J. Plummer, R. Howe 1

Programme Outcome COURSE OUTCOMES MCA

Goals for this Week. CSC 2400: Computer Systems. Bits, Bytes and Data Types. Binary number system. Finite representations of binary integers

3 Data Storage 3.1. Foundations of Computer Science Cengage Learning

Chapter 2 Bits, Data Types, and Operations

Transcription:

Computer Science Curriculum Content, KS5 HT1 HT2 HT3 HT4 HT5 HT6 Data Structure Data Representation Introduction to the chosen Single- and multi-dimensional arrays (or equivalent) Number systems Operations and simple data types, Concepts Relational operations in a. Data Dictionary Boolean Number bases Bits and bytes Unsigned binary Unsigned binary arithmetic Encryption Vernam cipher with ciphers String-handling operations in a Random number generation in a Fields, records and files Signed binary using two s complement. Practical Numbers with a fractional part Error checking and correction Bitmapped graphics Constants and variables in a Exception handling Classes Objects Analogue and digital. Analogue/digital conversion, Digital representation of sound Information coding systems ASCII and Unicode Representing images, sound and other data Subroutines (procedures/functions) Parameters of subroutines Returning a value/values from a subroutine Integer numbers Rational numbers Irrational numbers Real numbers Ordinal numbers Structured Local variables in subroutines Global variables in a

Theory of computation Systematic approach to problem solving Hardware and Abstraction and automation Problem-solving Following and writing algorithms Aspects of development Bit patterns, images, sound and other data Data compression Abstraction Information hiding Procedural abstraction Functional abstraction Data abstraction Problem abstraction/reduction Decomposition Logic gates Boolean algebra Relationship between hardware and Classification of Role of an operating system (OS) Automation Finite state machines (FSMs) Finite state machines (FSMs) without output Types of program translator

Computer organisation and architecture Internal hardware components of a computer The meaning of the stored program concept. The processor and its components. The Fetch-Execute cycle and the role of registers within it. Addressing modes Machine-code/ assembly operations. Factors affecting processor performance External hardware devices. Secondary storage devices Consequences of uses of computing and Networking Individual (moral), social (ethical), legal and cultural issues and opportunities methods Network topology Types of networking between hosts Wireless networking

HT1 HT2 HT3 HT4 HT5 HT6 Data Structure Fundamentals of functional Fundamentals of algorithms Arithmetic operations in a Single- and multi-dimensional arrays (or equivalent) Data types, Dictionaries Boolean Boolean operations in a Fields, records and files Constants and variables in a Exception handling Object-oriented Abstract data types/data structures Functional paradigm Writing functional programs Simple tree-traversal algorithms Reverse Polish infix transformations Subroutines (procedures/functions) Parameters of subroutines Returning a value/values from a subroutine Queues Stacks Graphs Trees Lists in functional Searching algorithms Sorting algorithms, Dijkstra s shortest path algorithm Role of stack frames in subroutine calls Recursive techniques paradigms Hash tables Vectors Data Representation Number bases Bits and bytes Unsigned binary arithmetic Encryption Rounding errors Absolute and relative errors Range and precision Normalisation of floating point form Signed binary using two s complement. Practical Numbers with a fractional part Error checking and correction Underflow and overflow Information coding systems Analogue/digital conversion. Digital representation of sound Information coding systems ASCII and Unicode Representing images, sound and other data Bit patterns, images, sound and other data

Bitmapped graphics Data compression Theory of computation Systematic approach to problem solving Hardware and Computer organisation and architecture Problem-solving Following and writing algorithms Information hiding Procedural abstraction Functional abstraction Data abstraction Decomposition Automation Finite state machines (FSMs) Finite state machines (FSMs) without output Maths for regular expressions Context-free s Backus-Naur Form (BNF)/syntax diagrams Maths for understanding Big-0 notation Order of complexity Limits of computation Classification of algorithmic problems Aspects of development Logic gates Boolean algebra Relationship between hardware and Classification of Role of an operating system (OS) Internal hardware components of a computer The meaning of the stored program concept. The processor and its components. The Fetch-Execute cycle and the role of registers within it. Computable and non-computabl e problems Types of program translator Addressing modes Machine-code/ assembly operations. Factors affecting processor performance External hardware devices. Secondary storage devices

Consequences of uses of computing Individual (moral), social (ethical), legal and cultural issues and opportunities and Networking Fundamentals of databases Non-exam assessment - the computing practical project Conceptual data models and entity relationship modelling Database design and normalisation techniques Structured Query Language (SQL) Analysis Requirements The Internet and how it works Internet security The Transmission Control Protocol/Internet Protocol (TCP/IP) protocol Client server databases Design Implementation Testing Evaluation methods Network topology Types of networking between hosts Wireless networking