Computer science Higher level Paper 1

Similar documents
Markscheme November 2016 Computer science Higher level Paper 1

Abstract Data Structures IB Computer Science. Content developed by Dartford Grammar School Computer Science Department

Abstract Data Structures IB Computer Science. Content developed by Dartford Grammar School Computer Science Department

M12/5/COMSC/SP1/ENG/TZ0/XX COMPUTER SCIENCE STANDARD LEVEL PAPER 1. Friday 18 May 2012 (afternoon) 1 hour 30 minutes INSTRUCTIONS TO CANDIDATES

elc International School

Code No: R Set No. 1

Birkbeck (University of London) MSc Examination. Department of Computer Science and Information Systems. Fundamentals of Computing (COIY058H7)

N04/5/COMSC/SP1/ENG/TZ0/XX COMPUTER SCIENCE STANDARD LEVEL PAPER 1. Monday 15 November 2004 (afternoon) 1 hour 15 minutes INSTRUCTIONS TO CANDIDATES

Tuesday 14 June 2016 Afternoon Time allowed: 1 hour 15 minutes

Outline. policies. with some potential answers... MCS 260 Lecture 19 Introduction to Computer Science Jan Verschelde, 24 February 2016

Cambridge International General Certificate of Secondary Education 0478 Computer Science June 2015 Principal Examiner Report for Teachers

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.

1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \

Unit 1 Computer Systems, Programming and Networking Concepts


Do not open this examination paper until instructed to do so. Answer all the questions.

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level

Draw a diagram of an empty circular queue and describe it to the reader.

*M29890A0120* M29890A W850/U4385/ /3/3/ Turn over

AP Computer Science A Course Syllabus

CPT1. Unit 1 Computer Systems, Programming and Networking Concepts. General Certificate of Education January 2004 Advanced Subsidiary Examination

Cambridge International Examinations Cambridge International Advanced Level

In addition to the correct answer, you MUST show all your work in order to receive full credit.

COP 1170 Introduction to Computer Programming using Visual Basic

CE161-4-AU UNIVERSITY OF ESSEX. Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE. Time allowed: TWO hours

Dawood Public School Course Outline Computer Studies Class VI

17 February Given an algorithm, compute its running time in terms of O, Ω, and Θ (if any). Usually the big-oh running time is enough.

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level

University of Palestine. Final Exam 2 nd semester 2014/2015 Total Grade: 50

PREMOCK GCE EXAMINATIONS

Cambridge Ordinary Level 2210 Computer Science June 2016 Principal Examiner Report for Teachers

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level

Sardar Patel University S Y BSc. Computer Science CS-201 Introduction to Programming Language Effective from July-2002

Chapter 20: Binary Trees

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

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

BCS THE CHARTERED INSTITUTE FOR IT. BCS HIGHER EDUCATION QUALIFICATIONS BCS Level 4 Certificate in IT COMPUTER AND NETWORK TECHNOLOGY

OCR H446 A-Level Computer Science

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

Project 2: Scheme Interpreter

Cambridge International Examinations Cambridge International General Certificate of Secondary Education. Paper 1 May/June hours 30 minutes

There are many other applications like constructing the expression tree from the postorder expression. I leave you with an idea as how to do it.

Kadi Sarva Vishwavidyalaya, Gandhinagar

Cambridge International General Certificate of Secondary Education 0478 Computer Science June 2016 Principal Examiner Report for Teachers

BCS THE CHARTERED INSTITUTE FOR IT. BCS HIGHER EDUCATION QUALIFICATIONS BCS Level 4 Certificate in IT SOFTWARE DEVELOPMENT

ICT WORKSHEET GRADE 9 TERM1 EXAMINATION

NOTE: Answer ANY FOUR of the following 6 sections:

VALLIAMMAI ENGINEERING COLLEGE SRM NAGAR, KATTANGULATHUR

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

Question Points Score

MIDTERM EXAMINATION - CS130 - Spring 2003

1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with a neat diagram?

AP Computer Science AB

(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75. Paper - I : INFORMATION TECHNOLOGY

UNIVERSITY OF CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Secondary Education. Paper 1 October/November hours

Chapter 9 Introduction to Arrays. Fundamentals of Java

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level

17CS33:Data Structures Using C QUESTION BANK

COMPUTER SCIENCE. Paper 1

Touch screen. Uses of Touch screen: Advantages of Touch screen: Disadvantages of Touch screen:

Data Structure Advanced

RYERSON POLYTECHNIC UNIVERSITY DEPARTMENT OF MATH, PHYSICS, AND COMPUTER SCIENCE CPS 710 FINAL EXAM FALL 96 INSTRUCTIONS

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level

INSTRUCTIONS TO CANDIDATES INFORMATION FOR CANDIDATES. Computer Science (A Level)

CARIBBEAN EXAMINATIONS COUNCIL

1. Stack overflow & underflow 2. Implementation: partially filled array & linked list 3. Applications: reverse string, backtracking

Scheme of work Cambridge International AS & A Level Computing (9691)

DC104 DATA STRUCTURE JUNE Q.2 a. If you are using C language to implement the heterogeneous linked list, what pointer type will you use?

GCSE Computer Science for OCR Overview Scheme of Work

MEHRAN UNIVERSITY OF ENGINEERING AND TECHNOLOGY, JAMSHORO. FIRST TERM FIRST YEAR (1 ST TERM) B.E.(ELECTRICAL) REGULAR EXAMINATION 2009 OF 09-BATCH.

Scheme G. Sample Test Paper-I. Course Name : Computer Engineering Group Course Code : CO/CD/CM/CW/IF Semester : Second Subject Tile : Programming in C

Year 10 OCR GCSE Computer Science (9-1)

WYSE Academic Challenge 2002 Computer Science Test (Sectional) SOLUTION

AP Computer Science A Syllabus

Algorithms. Abdelghani Bellaachia, CSCI 1121 Page: 1

ST. MARY S COLLEGE FORM 4

1) What is the primary purpose of template functions? 2) Suppose bag is a template class, what is the syntax for declaring a bag b of integers?

Summer Final Exam Review Session August 5, 2009

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring Instructions:

3.6 MONITORING AND CONTROL SYSTEMS

COSC 2007 Data Structures II Final Exam. Part 1: multiple choice (1 mark each, total 30 marks, circle the correct answer)

End-Term Examination Second Semester [MCA] MAY-JUNE 2006

Introduction to Computer Science Midterm 3 Fall, Points

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- MARCH, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours

BCS Higher Education Qualifications. Level 4 Certificate in IT. Computer Network Technology Syllabus

Computer Organisation IB Computer Science. Content developed by Dartford Grammar School Computer Science Department

Section 5.5. Left subtree The left subtree of a vertex V on a binary tree is the graph formed by the left child L of V, the descendents

INSTRUCTIONS TO CANDIDATES

National Quali cations 2017

Computer Science E-22 Practice Final Exam

Q1 Q2 Q3 Q4 Q5 Total 1 * 7 1 * 5 20 * * Final marks Marks First Question

Cpt S 122 Data Structures. Data Structures Trees

R13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 CS205: DATA STRUCTURES (CS, IT)

COURSE OUTLINE & WEEK WISE BREAKAGE

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

Binary Trees. Chapter 22

MIDTERM EXAMINATION - CS130 - Spring 2005

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

CSL 201 Data Structures Mid-Semester Exam minutes

Transcription:

Computer science Higher level Paper 1 Friday 4 November 2016 (afternoon) 2 hours 10 minutes Instructions to candidates ydo not open this examination paper until instructed to do so. ysection A: answer all questions. ysection B: answer all questions. ythe maximum mark for this examination paper is [100 marks]. 7 pages 8816 7011 International Baccalaureate Organization 2016

2 Section A Answer all questions. 1. State three potential usability issues with cell phones. [3] 2. (a) State the purpose of cache memory. [1] Draw a diagram to show the relationship between random access memory (RAM), the processor and cache memory. [1] 3. Outline one advantage and one disadvantage of wireless networks. [4] 4. Construct a truth table for the Boolean expression not (A xor B) and C. Use the following headings in your table. A B C A xor B NOT (A xor B) not (A xor B) and C [4] 5. Many different people and organizations upload scientific materials to the internet. A student uses data from the internet in a science project. Outline two ethical issues concerning this use of the internet. [4] 6. Consider the following recursive algorithm FUN(X, N), where X and N are two integers. FUN(X, N) if N<=0 then return 1 else return X*FUN(X, N-1) end if The return statement gives the value that the algorithm generates. (a) Determine how many times multiplication is performed when this algorithm is executed. [1] Determine the value of FUN(2,3), showing all of your working. [3] (c) State the purpose of this recursive algorithm. [1]

3 7. Consider the following binary tree. A B C D (a) Identify all leaf nodes in this binary tree. [1] For this binary tree, state the result of: (i) inorder tree traversal, [1] (ii) postorder tree traversal. [1] Turn over

4 Section B Answer all questions. 8. A book shop has a computer at each point of sale, and also a central computer. When a customer buys a book in the book shop, the salesperson at the point of sale uses a scanning device to input a barcode from the book. The barcode is sent to the central computer where the barcode of each book and the corresponding price are held in a database on a disk. When the price is found, it is sent to the point of sale computer where all necessary calculations are performed, details of the transaction are stored on a local disk and a receipt is printed out. (a) Construct a system flow chart for the system described above. [5] At the point of sale there are peripheral devices other than the scanning device and printer. Outline the purpose of one other possible peripheral device in this scenario. [2] The customers can also buy books online. A customer can select a book, and then enter their name, address and credit card number. This data is stored on the book shop s central computer in a database of customer orders. (c) Outline the purpose of protocols in transferring this data. [2] (d) (i) Identify two sources of risk to personal data in this online system. [2] (ii) State two measures that the book shop can take to address the risks identified in part (d)(i). [2] (iii) Outline the consequences to the customer if their data is not adequately protected. [2]

5 9. A new higher level programming language is being developed. (a) Identify two reasons why consistent grammar and syntax should be essential features of a higher level programming language. [2] Identify two features of a user interface that will allow application programmers to interact more easily with the programming language. [2] (c) State one method of providing user documentation. [1] Application programmers who use this programming language will be able to choose to use either an interpreter or a compiler. (d) (i) Outline the need for an interpreter or a compiler. [2] (ii) Describe one advantage to application programmers of having both an interpreter and a compiler available. [2] One of the predefined sub-programs in the new language is sumodd(). It accepts an integer N as input. If N<=0 it outputs -1, otherwise it outputs the sum of the first N odd numbers. For example: sumodd(4) outputs 16, because 4 is not less than 0, and 1 + 3 + 5 + 7 = 16. sumodd( 3) outputs 1, because 3 is less than 0. (e) Construct, in pseudocode, the algorithm for sumodd(). [4] (f) Outline the need for predefined sub-programs and collections. [2] 10. The temperature, humidity, light levels and automatic watering of plants inside the greenhouses (glasshouses) of a garden centre are centrally monitored and controlled. (a) Define the term analog data. [1] With reference to sensors, transducers and the processor, explain the control process that takes place in the greenhouse (glasshouses). [5] (c) Outline the role of the operating system specific to this scenario. [4] (d) Describe the difference between polling and interrupt in the event that some of the sensors malfunction. [3] (e) Compare a centrally controlled system with a distributed system. [2] Turn over

6 11. The diagram shows a list of names held in a circular linked list. The end of the list is pointed to by an external pointer, X. Peter Anna Boris (a) State the first name in this circular list. [1] Two operations are performed on the list in the following order: 1. A node containing the name Sarah is inserted at the beginning of the list. 2. A node containing the name Ken is inserted at the end of the list. X Sketch a diagram showing the resulting circular linked list. [3] (c) Describe how the number of names held in this list could be determined. [4] (d) Explain how a stack could be used to output, in reverse order, all names held in the linked list. [4] (e) Compare the use of static and dynamic data structures. [3] 12. A two-dimensional array, A, has N rows and N columns, where N is a positive integer. The following algorithm is written to fill array A with the numbers 1, 2, 3,, N 2. N=input( Enter an integer greater than zero ) K=N*N loop for ROW=0 to N-1 loop for COLUMN=0 to N-1 A[ROW][COLUMN]=K K=K-1 end loop end loop (a) Trace the algorithm, with an input of N=3, to show the contents of array A after the algorithm has been executed. [3] (This question continues on the following page)

7 (Question 12 continued) There are many different ways of placing the numbers 1 to N 2 into an N N two-dimensional array. The following two-dimensional array, with dimensions 5 5 has been filled in a circular (spiral) pattern with numbers 1 to 5 2. TOP [0] LEFT RIGHT [0] [1] [2] [3] [4] 1 2 3 4 5 [1] 16 17 18 19 6 [2] 15 24 25 20 7 [3] 14 23 22 21 8 BOTTOM [4] 13 12 11 10 9 The general process of filling an N N two-dimensional array, in a circular (spiral) pattern, with numbers from 1 to N 2 could be described as follows: initialize Z=1, initialize TOP, BOTTOM, LEFT and RIGHT, iterate until the whole array is filled, each time Z is placed correctly increase the value of Z by 1, fill the elements of the TOP row starting from LEFT to RIGHT, increase TOP by 1 before filling the elements of the RIGHT column, fill the elements of the RIGHT column starting from TOP to BOTTOM, decrease RIGHT by 1 before filling the elements of the BOTTOM row, and continue filling the BOTTOM row and LEFT column in a similar way, adjusting TOP, RIGHT, BOTTOM and LEFT accordingly. (i) State the initial values for TOP, BOTTOM, LEFT and RIGHT. [1] (ii) (iii) State the consequence of not increasing TOP by 1 before starting to fill the elements of the RIGHT column. [1] In the algorithm described above, state the indices (subscripts) of the first and the last element to be filled in the BOTTOM row. [1] (c) Construct, in pseudocode, an algorithm to fill an N N two-dimensional array, in a circular (spiral) pattern, with numbers from 1 to N 2 as described above. [9]