Dawood Public School Course Outline for 2014-2015 Subject: Computer Science Class: IX Study Guide Reference Book: Cambridge IGCSE Computer Studies Course book by Chris Leadbetter, Stewart Wainwright and Alan Stinchcombe Dawood Public School’s Computer Department Webpage: https://sites.google.com/site/olevelcomputers For CIE Booklets: https://sites.google.com/site/olevelcomputers/about-me/7010-cie-booklets Section 1: Theory of Computer Science 1.3 Hardware and software 1.3.2 Computer architecture 1.3.3 Input devices August Section1: Theory of Computer Science 1.3 Hardware and software 1.3.4 Output devices 1.3.5 Memory, storage devices and media 1.3.6 Operating systems September Section1: Theory of Computer Science 1.1 Hardware and software 1.3.7 High- and low-level languages 1.3.1 Logic gates October Section 2 Practical Problem-solving and Programming November 2.2 Programming 2.2.1 Programming concepts 2.2.2 Data structures; arrays December Mid-Year Examination Section 2 Practical Problem-solving and Programming January 2.1 Algorithm design and problem-solving 2.1.1 Problem-solving and design 2.1.2 Pseudo code Section 2 Practical Problem-solving and Programming February 2.1 Algorithm design and problem-solving 2.1.2 Pseudo code Section 2 Practical Problem-solving and Programming March 2.1 Algorithm design and problem-solving 2.1.2 Pseudo code (continue) April Revision Period May Final Examination Month-Wise Distribution of Topics August Section 1: Theory of Computer Science 1.2 Hardware and software 1.3.2 Computer architecture and the fetch- execute cycle 1.3.3 Input devices Learning objectives Activities or Learning resources After completion of this lesson, students will be able to: 1.3.2 Computer architecture and the fetchexecute cycle Show understanding of the basic Von Neumann model for a computer system and the stored program concept. Describe the stages of the fetch-execute cycle. History of computer website www.computerhistory.org/timeline/?category=cmptr Outline of computer systems and their components at: www.teachict.com/gcse_computing/ocr/211_hardware_softwar e/computer_system/home_computer_system.htm 1.3.3 Input devices Describe the principles of operation of a range of input devices including scanners, barcode readers, digital cameras, keyboards, mice, touch screens, microphones. Describe how these principles are applied to real-life scenarios, for example: scanning of passports at airports, barcode readers at supermarket checkouts, and touch screens on mobile devices. Describe how a range of sensors can be used to input data into a computer system, including light, temperature, magnetic field, gas, pressure, moisture, humidity, pH/acidity/alkalinity and motion/infra-red. Describe how these sensors are used in real-life scenarios, for example: street lights, security devices, pollution control, games, and household and industrial applications BBC Bite size contains notes, activities, tests, etc.: www.bbc.co.uk/schools/gcsebitesize/ict/system/0ict systemsrev1.shtml Websites such as http://computer.howstuffworks.com/ and http://en.wikipedia.org/wiki/Input_device Cambridge O Level Computer Studies Course book pp.49–66 Cambridge O Level Computer Studies Revision Book Chp12.3 Covering: 2D and 3D scanners, barcode readers, digital cameras, keyboards, mice, touch screens, microphones Level Computer Studies Course book pp. 66–71 Cambridge O Level Computer Studies Revision Book 2.3 Illustrated notes on sensors: www.O Levelict.info/theory/2/sensor/ September Section1: Theory of Computer Science 1.3 Hardware and software 1.3.4 Output devices 1.3.5 Memory, storage devices and media 1.3.6 Operating systems Learning objectives Activities or Learning resources After completion of this lesson, students will be able to: 1.3.4 Output devices Describe the principles of operation of a range of output devices, including: inkjet, laser and 3D printers; 2D and 3D cutters; speakers and headphones; actuators; flat-panel display screens. Principles are applied to real-life scenarios for example: printing single items on demand or in large volumes; banks of digital displays; use of small screens on mobile devices; smart boards. Websites such as: http://computer.howstuffworks.com/ and http://en.wikipedia.org/wiki/Output_device Cambridge O Level Computer Studies Course book pp. 71–9 Cambridge O Level Computer Studies Revision Book Chap 12.3 1.3.5 Memory, storage devices and media Show understanding of the difference between: primary, secondary and off-line storage. Introduction to operating systems: http://gcsecomputing.net/wpcontent/uploads/2012/01/OCR%20A451%202.1.2% 20CPU%20-%20Summary.pdf Websites such as: http://computer.howstuffworks.com/computer-rammemory-channel.htm http://en.wikipedia.org/ which has entries for various related topics Cambridge O Level Computer Studies Course book pp. 79–88 Cambridge O Level Computer Studies Revision Book Chap 12.4 Cambridge O Level Computer Studies Course Book pp. 92–4 Cambridge O Level Computer Studies Revision Book 13 Several pages describing operating systems and their Describe the principles of operation of a range of types of storage devices and media including magnetic, optical and solid state. Describe how these principles are applied to currently available storage solutions, such as SSDs, hard disk drives, USB flash memory, DVDs, CDs and Blu-ray. Calculate the storage requirement of a file. functions: www.howstuffworks.com/operating-system1.htm Windows, Linux, Android could be used as examples Cambridge O Level Computer Studies Course book pp. 102–5 1.3.6 Operating systems Describe the purpose of an operating system. Show understanding of the need for interrupts. October Section1: Theory of Computer Science 1.2 Hardware and software 1.3.7 High- and low-level languages and their translator 1.3.1 Logic gates Learning objectives Activities or Learning resources After completion of this lesson, students will be able to: 1.3.7 High- and low-level languages and their translators Show understanding of the need for both high-level and low-level languages. Show understanding of the need for compilers when translating programs written in a high-level language. Show understanding of the use of interpreters with high-level language programs. Show understanding of the need for assemblers when translating programs written in assembly language. Cambridge O Level Computer Studies Course Book pp. 255–9 Cambridge O Level Computer Studies Revision Book Chap 8.1 An introduction to different levels of programming language: www.teachict.com/gcse_computing/ocr/216_programming/programming _languages/home_programming_language s.htm Cambridge O Level Computer Studies Course book pp. 257–9 Introduction to high-level language: www.teachict.com/gcse_computing/ocr/216_programming/programming _languages/miniweb/pg4.htm Extension work: History of compiler writing: http://en.wikipedia.org/wiki/History_of_compiler_ writing First high-level language to have a complete compiler: http://en.wikipedia.org/wiki/Fortran 1.3.1 Logic gates The first programming language to express operations Use logic gates to create electronic using English-like statements: circuits. http://en.wikipedia.org/wiki/FLOW-MATIC Understand and define the functions of NOT, AND, OR, NAND, Cambridge O Level Computer Studies Course Book pp. 277–281 NOR and XOR (EOR) gates, including the binary output Cambridge O Level Computer Studies Revision Book produced from all the possible Chap 9 binary inputs. Draw truth tables and recognize a Some solutions here: http://nrich.maths.org/5967/solution logic gate from its truth table. Recognize and use the following standard symbols used to represent logic gates. Produce truth tables for given logic circuits. Produce a logic circuit to solve a given problem or to implement a given written logic statement, such as IF (switch A is NOT on) OR (switch B is on AND switch C is NOT on) then alarm, X, sounds. November Section 2 Practical Problem-solving and Programming 2.2 Programming 2.2.1 Programming concepts 2.2.2 Data structures; arrays Learning objectives Activities or Learning resources After completion of this topic, students will be able to: Cambridge O Level Computer Studies Course Book pp. 39–42 2.2.1 Programming concepts Theory notes on data types: www.teachict.com/gcse_computing/ocr/216_programming/handling_data/ home_handling_data.htm Declare and use variables and constants. Understand and use basic data types: Integer, Real, Char, String and Boolean. Understand and use the concepts of sequence, selection, repetition, totaling and counting. Use predefined procedures/functions Cambridge O Level Computer Studies Coursebook pp. 260-8 Cambridge O Level Computer Studies Revision Book Book Chap 8.3 Pseudo code in ‘Absolute beginner’s guide to programming’: http://books.google.co.uk/ 2.2.2 Data structures; arrays Declare the size of onedimensional arrays, for example: A[1:n] . Show understanding of the use of a variable as an index in an array. Read values into an array using a FOR … TO … NEXT loop. December Mid-Year Examination January Section 2 Practical Problem-solving and Programming 2.1 Algorithm design and problem-solving 2.1.1 Problem-solving and design 2.1.2 Pseudo code Learning objectives Activities or Learning resources 2.1.1 Problem-solving and design For Notes, Practice Questions and Past papers Visit Our own website for O-level computer studies that is maintained by Dawood public school’s faculty. https://sites.google.com/site/olevelcomputers/home Show understanding that every computer system is made up of sub-systems, which in turn are made up of further sub-systems. Use top-down design, structure diagrams, flowcharts, pseudo code, library routines and subroutines. Work out the purpose of a given algorithm. Explain standard methods of solution. Suggest and apply suitable test data. Understand the need for validation and verification checks to be made on input data (validation could include range checks, length checks, type checks and check digits). Use trace tables to find the value of variables at each step in an algorithm. Identify errors in given algorithms and suggest ways of removing these errors. Produce an algorithm for a given problem (either in the form of pseudo code or flowchart). Comment on the effectiveness of a given solution. For Notes : https://sites.google.com/site/olevelcomputers/aboutme/7010-notes For Past Papers P1 : https://sites.google.com/site/olevelcomputers/aboutme/7010-past-papers-p1 For Past Papers P3: https://sites.google.com/site/olevelcomputers/aboutme/7010-past-papers-p3 For CIE Booklets: https://sites.google.com/site/olevelcomputers/aboutme/7010-cie-booklets February Section 2 Practical Problem-solving and Programming 2.1 Algorithm design and problem-solving 2.1.2 Pseudo code Learning objectives Activities or Learning resources 2.1.2 Pseudo code Understand and use pseudo code, using the following commands and statements: INPUT and OUTPUT (e.g. READ and PRINT) totaling (e.g. Sum ← Sum + Number) counting (e.g. Count ← Count + 1) (Candidates are advised to try out solutions to a variety of different problems on a computer using a language of their choice; no particular programming language will be assumed in this syllabus.) Understand and use pseudo code for assignment, using ← Understand and use pseudo code, using the following conditional statements: IF … THEN … ELSE … ENDIF CASE … OF … OTHERWISE … ENDCASE For Notes, Practice Questions and Past papers Visit Our own website for O-level computer studies that is maintained by Dawood public school’s faculty. For Video Lectures Visit : https://sites.google.com/site/computerstudies7010/Home/videos March Section 2 Practical Problem-solving and Programming 2.1 Algorithm design and problem-solving 2.1.2 Pseudo code Learning objectives Activities or Learning resources Open Discussion Activity: The topic will be covered through open discussion session. Students will be asked to prepare a presentation to highlight major ethical issues. Understand and use pseudo code, using the following loop structures: FOR … TO … NEXT REPEAT … UNTIL WHILE … DO … ENDWHILE Online quiz Activity: http://quizlet.co/subject/computer-ethics/ April Revision Learning Objectives: Revision Tests Practice worksheets Assignments Past Papers May Final Exams