Subject knowledge requirements for entry into computer science teacher training. Expert group s recommendations



Similar documents
AQA GCSE in Computer Science Computer Science Microsoft IT Academy Mapping

EMC Publishing. Ontario Curriculum Computer and Information Science Grade 11

CS Matters in Maryland CS Principles Course

OKLAHOMA SUBJECT AREA TESTS (OSAT )

MICHIGAN TEST FOR TEACHER CERTIFICATION (MTTC) TEST OBJECTIVES FIELD 050: COMPUTER SCIENCE

KS3 Computing Group 1 Programme of Study hours per week

WJEC GCSE in Computer Science Computer Science Microsoft IT Academy Mapping

Stage 5 Information and Software Technology

Describe the process of parallelization as it relates to problem solving.

Thomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science. Unit of Study / Textbook Correlation

CS Standards Crosswalk: CSTA K-12 Computer Science Standards and Oracle Java Programming (2014)

ARIZONA CTE CAREER PREPARATION STANDARDS & MEASUREMENT CRITERIA SOFTWARE DEVELOPMENT,

What makes a good coder and technology user at Mountfields Lodge School?

SIM-PL: Software for teaching computer hardware at secondary schools in the Netherlands

INFORMATION TECHNOLOGY

50 Computer Science MI-SG-FLD050-02

School of Computer Science

Essentials of Computer Programming. Computer Science Curriculum Framework

Course Information Course Number: IWT 1229 Course Name: Web Development and Design Foundation

ADVANCED SCHOOL OF SYSTEMS AND DATA STUDIES (ASSDAS) PROGRAM: CTech in Computer Science

The programming language C. sws1 1

Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

How to research and develop signatures for file format identification

Instructional Design Framework CSE: Unit 1 Lesson 1

Cambridge International Examinations Cambridge International General Certificate of Secondary Education

School District of Springfield Township

COWLEY COLLEGE & Area Vocational Technical School

Computer Programming I & II*

Competencies for Secondary Teachers: Computer Science, Grades 4-12

COMPUTER SCIENCE/ COMPUTER NETWORKING AND TECHNOLOGIES (COSC)

DIABLO VALLEY COLLEGE CATALOG

Diploma Of Computing

SECTION C [short essay] [Not to exceed 120 words, Answer any SIX questions. Each question carries FOUR marks] 6 x 4=24 marks

NOVA COLLEGE-WIDE COURSE CONTENT SUMMARY ITE INTRODUCTION TO COMPUTER APPLICATIONS & CONCEPTS (3 CR.)

Computing at School Working Group endorsed by BCS, Microsoft, Google and Intellect. March 2012

Information and Software Technology Years Syllabus

Course Descriptions. preparation.

TECHNOLOGY Computer Programming II Grade: 9-12 Standard 2: Technology and Society Interaction

2003 HSC Notes from the Marking Centre Software Design and Development

Course Structure of Three Year Degree B.A Programme in Computer Application under Semester System of Dibrugarh University (General Programme)

Introduction to Information Technology Course Number 10009

Masters in Human Computer Interaction

Masters in Advanced Computer Science

Initial teacher training criteria. Statutory guidance for accredited initial teacher training providers in England

Masters in Artificial Intelligence

SYLLABUS. Cambridge IGCSE Computer Science. Cambridge Secondary 2

IE Class Web Design Curriculum

River Dell Regional School District. Computer Programming with Python Curriculum

Masters in Networks and Distributed Systems

FOXBORO. I/A Series SOFTWARE Product Specifications. I/A Series Intelligent SCADA SCADA Platform PSS 21S-2M1 B3 OVERVIEW

School of Computer Science

#820 Computer Programming 1A

Fundamentals of Programming and Software Development Lesson Objectives

INTRODUCTION TO INFORMATION TECHNOLOGY CSIT Class Hours: 3.0 Credit Hours: 4.0 Laboratory Hours: 3.0 Revised: August 24, 2012

REGULATIONS FOR THE DEGREE OF BACHELOR OF SCIENCE IN BIOINFORMATICS (BSc[BioInf])

Computer Science Course Descriptions Page 1

Assessment for Master s Degree Program Fall Spring 2011 Computer Science Dept. Texas A&M University - Commerce

The string of digits in the binary number system represents the quantity

Analyzing 6LoWPAN/ZigBeeIP networks with the Perytons Protocol Analyzer May, 2012

ARIZONA CTE CAREER PREPARATION STANDARDS & MEASUREMENT CRITERIA SOFTWARE DEVELOPMENT,

CPU Organisation and Operation

SYLLABUS. Cambridge O Level Computer Science. Cambridge Secondary 2

SYLLABUS. Cambridge O Level Computer Science. Cambridge Secondary 2

Domains and Competencies

Masters in Computing and Information Technology

Course MS10975A Introduction to Programming. Length: 5 Days

ABET General Outcomes. Student Learning Outcomes for BS in Computing

Information and Technology Literacy Framework. PreK-12

RARITAN VALLEY COMMUNITY COLLEGE ACADEMIC COURSE OUTLINE. CISY 105 Foundations of Computer Science

Master of Science in Computer Science

Module 12: Microsoft Windows 2000 Clustering. Contents Overview 1 Clustering Business Scenarios 2 Testing Tools 4 Lab Scenario 6 Review 8

Doctor of Philosophy in Computer Science

Course Descriptions. CS 101 Intro to Computer Science

COMPUTER SCIENCE (5651) Test at a Glance

SYLLABUS. Cambridge IGCSE Computer Science. For examination in June and November Cambridge Secondary 2

RARITAN VALLEY COMMUNITY COLLEGE COURSE OUTLINE. CISY 103 Computer Concepts and Programming

Fundamentals of Computer Science (FCPS) CTY Course Syllabus

Professional Organization Checklist for the Computer Science Curriculum Updates. Association of Computing Machinery Computing Curricula 2008

AP Computer Science A - Syllabus Overview of AP Computer Science A Computer Facilities

Topics. Introduction. Java History CS 146. Introduction to Programming and Algorithms Module 1. Module Objectives

Bachelors of Computer Application Programming Principle & Algorithm (BCA-S102T)

Software: Systems and Application Software

Oct 15, Internet : the vast collection of interconnected networks that all use the TCP/IP protocols

West Windsor-Plainsboro Regional School District Computer Programming Grade 8

SYLLABUS For examination in June and November Cambridge International AS and A Level Computing. Cambridge Advanced

Mathematics Subject Knowledge Enhancement (SKE) Programme Guide Academic Year 2013/14

DATA ITEM DESCRIPTION

PARCA Certified PACS Associate (CPAS) Requirements

The Elective Part of the NSS ICT Curriculum D. Software Development

Update on Progress 8 measure and reforms to secondary school accountability framework

CURRICULUM VITAE EDUCATION:

Clarke College. Major Requirements

Computer Science 217

A Time Efficient Algorithm for Web Log Analysis

SYLLABUS For examination in June and November Cambridge International AS and A Level Computer Science. Cambridge Advanced

Copyright 2012 Pearson Education, Inc. Chapter 1 INTRODUCTION TO COMPUTING AND ENGINEERING PROBLEM SOLVING

How to Write a Pennsylvania Customized Assessment

ACADEMY OF INTERACTIVE

Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

2667A - Introduction to Programming

Transcription:

Subject knowledge requirements for entry into computer science teacher training Expert group s recommendations

Introduction To start a postgraduate primary specialist or secondary ITE course specialising in computing or computer science a successful applicant will need to have demonstrated that they already have sufficient subject knowledge to begin the course and the capacity to develop such knowledge where they have identified knowledge gaps, before completing the course. The subject knowledge specified below is considered by an expert group, comprising members from the computer and games industry, computer science academics, Naace, ITTE and CAS, to be the minimum necessary for trainees to take full advantage of the training offered and to produce teachers capable of teaching a rigorous course and in the secondary phase leading to a high status qualification in computing. For a primary specialist entering a post-graduate course this subject knowledge may be demonstrated by the applicant having an A level in Computing/Computer Science or the equivalent - possibly gained through industrial or school-based experience or a subject knowledge enhancement course (SKE) in computing / computer science. Trainees completing an undergraduate course as a primary computing specialist will need to have covered these criteria by the completion of their course. For a secondary specialist this subject knowledge may be demonstrated by the applicant having a degree with a significant content in computing / computer science or the equivalent - possibly gained through industrial or school-based experience or a SKE course in computing/computer science. These criteria are indicative only and providers are free to develop their own. The criteria 1 below should support institutions in developing the syllabus for a SKE course. Key concepts Demonstrate understanding of the key concepts associated with the areas outlined below, at the level appropriate for entry to the relevant teacher training course: 1. Language, Machines & Computation - languages, algorithms, machines and computational models 2. Data and representation - data representation, data storage, data transmission, data structures, digital and analogue conversion 1 The work is based on: CAS (2012), Computer Science: A Curriculum For Schools, Computing At Schools Working Group, available at www.computingatschools.org.uk ; discussions of the Computer Science Subject Expert Group, 3 July 2012 (convened by the Teaching Agency) and at Microsoft Victoria, 2 August; and discussions at The Association for Information Technology in Teacher Education (ITTE) Research Conference, Oxford, 5-7 July 2012. 2

3. Communication & Co-ordination - input-process-output, communication protocols, networks and the internet 4. Abstraction and Design hardware, software, simulation & modelling, interfaces, categorisation 5. Wider Context of Computing - intelligence & consciousness, looking at the natural world in computational terms, creativity & intellectual property, moral & ethical considerations, uses of computing and jobs/career paths Key processes Demonstrate understanding of and apply the key processes associated with Computational Thinking, at the level appropriate for entry to the relevant teacher training course: 1. Abstraction modelling (representing real world issues, systems, situations); decomposing (breaking a problem into sub problems, solving sub problems, putting solutions together); generalising & classifying. 2. Programming - design and write programs; abstraction mechanisms; debugging, testing and reasoning about programs Range and content Demonstrate knowledge and understanding of, and be able to apply, the following, at the level appropriate for entry to the relevant teacher training course: 3

Range and Content Algorithms Programming Data Computers & Social Informatics Communication and the Internet A student about to embark on a primary teacher training course as a CS specialist should know, understand and be able to: Explain that an algorithm is a precise way of solving a problem which can be followed by humans and computers. Give examples of algorithms met in everyday life. Explain that computers need more precise instructions than humans and the need for precision to avoid errors. Explain and show how algorithms can use selection (if), repetition (loops), procedures (subalgorithms within an algorithm). Explain the need for accuracy of algorithms. Distinguish between an algorithm and the Code competently in at least two programming languages, which may both be visual ;; at least one of these must allow the use of programming concepts such as selection, repetition, procedures, variables and relational operators. Explain and use programming concepts such as selection, repetition, procedures, variables, and relational operators. Review and assess the quality of code. Find and correct errors in syntax and meaning. Explain that computers are controlled by sequences of precise instructions known as programs Explain that computers follow instructions/ blindly; hence the need for care and precision. Explain how computers represent all data in binary, with a variety of examples: unsigned integers, text representation (e.g. ASCII), different sound file data/types, and different graphics data/file types. Explain how the same binary data can be interpreted in different ways e.g. an 8-bit value could be a character or a number. Explain how the same information can be represented in a computer in a variety of ways e.g. sound as mp3 or MIDI. Explain that data can have errors, how this might affect results and decisions based on the data and how errors can be Explain what a computer is and give examples of devices that include computers. Explain and describe the key characteristics of basic computer architecture (eg CPU, memory, hard disk, mouse, display etc). Explain why there are sometimes different operating systems and application software for the same hardware. Explain and use common troubleshooting techniques. Explain Moore s Law and multitasking by computers. Discuss social and ethical issues raised by the role of computers in the world. Explain the importance of human-computer interface design Explain what the World Wide Web and the Internet are, and the difference. Outline the key features of the World Wide Web and their relationships eg browsers, URLs, navigation methods Outline how data are transported on the Internet, including packets and the notion of a protocol. Explain the role of search engines and what happens when a user requests a web page in a browser. Explain the technological perspective on safety and security.

programs that implements that algorithm Represent algorithmic steps in multiple programming languages (e.g. logo, scratch). Explain how and use programs to simulate environments to test hypothesis. Explain and show how programs can be planned, tested and corrected and documented. Explain how HTML constructs the rendering of a web page reduced. and content of the Data Protection Act, Computer Misuse Act and Copyright legislation (and other relevant legislation). Discuss career paths for those studying Computing. In addition to the above, a student about to embark on secondary teacher training as a CS specialist should know, understand and be able to: Explain how the choice of an algorithm should be influenced by the data. Be able to explain and use several key algorithms (e.g. sorting, searching, shortest path). Explain how algorithms can be improved, validated, tested and corrected. Program competently in a least two programming languages, at least one of which must be textual. Explain and use programming concepts such as selection, repetition, procedures, constants, variables, relational operators, logical operators and functions. Explain and use truth Explain the difference between data and information. and use of hexadecimal, two s complement, signed integers, and string manipulation. data compression, and be able to describe simple compression methods. Explain the use of logic gates and registers. Explain Von Neumann architecture. Explain the fetchexecute cycle. Explain and use low level instruction sets and assembly code. Explain what compilers and interpreters are and do and give some examples of when they are used. Explain the concepts of: client/server models; MAC addresses, IP addresses and domain names; and cookies. Explain a real protocol e.g. using telnet to interact with an HTTP server. Explain routing; redundancy and 5

Explain that a single problem could be solved by more than one algorithm. Explain and show how different algorithms can have different performance characteristics for the same task. Successfully apply algorithms in solving GCSE and A level type problems. tables and Boolean valued variables. Explain and use twodimensional arrays (and higher). Explain and use nested constructs (e.g. a loop that contains a conditional, and vice versa) Explain the concept of procedures that call procedures;. Explain how low level languages work and when they are used, being able to give simple examples. Explain that a program can be written to satisfy requirements and that they should be corrected if they do not meet these. Successfully apply programming in solving Computing/Computer Science GCSE and A level type problems analogue to digital conversions and how this works. Explain the limitations of using binary representations eg rounding errors, sampling frequency and fractional numbers. Explain how structured data can be represented in tables in a relational database, and simple database queries Explain the main functions of operating systems. error correction; encryption and security. 6

Crown copyright 2012 You may re-use this information (excluding logos) free of charge in any format or medium, under the terms of the Open Government Licence. To view this licence, visit http://www.nationalarchives.gov.uk/doc/open-government-licence/ or e-mail: psi@nationalarchives.gsi.gov.uk. Where we have identified any third party copyright information you will need to obtain permission from the copyright holders concerned. Any enquiries regarding this publication should be sent to us at https://www.education.gov.uk/help/contactus. This document is also available from our website at www.education.gov.uk. 7