M14/4/COMSC/HP1/ENG/TZ0/XX. Computer science. Paper 1. Friday 16 May 2014 (afternoon) 2 hours 10 minutes INSTRUCTIONS TO CANDIDATES

Size: px
Start display at page:

Download "M14/4/COMSC/HP1/ENG/TZ0/XX. Computer science. Paper 1. Friday 16 May 2014 (afternoon) 2 hours 10 minutes INSTRUCTIONS TO CANDIDATES"

Transcription

1 M14/4/COMSC/HP1/ENG/TZ0/XX Computer science HIGHER level Paper 1 Friday 16 May 2014 (afternoon) 2 hours 10 minutes INSTRUCTIONS TO CANDIDATES Do not open this examination paper until instructed to do so. Section A: answer all questions. Section B: answer all questions. The maximum mark for this examination paper is [100 marks]. 9 pages International Baccalaureate Organization 2014

2 2 M14/4/COMSC/HP1/ENG/TZ0/XX Blank page

3 3 M14/4/COMSC/HP1/ENG/TZ0/XX SECTION A Answer all questions. 1. Identify two features that need to be considered when planning a new computing system for an organization. [2] 2. Explain what is meant by beta testing. [2] 3. Describe one advantage and one disadvantage of using observations to gather information when planning a new system. [4] 4. Outline one usability issue associated with the design of mobile devices. [2] 5. Distinguish between the use of two types of primary memory. [2] 6. Consider the following linked list which is maintained in alphabetical order. Jean 9 Mario 7 Phoebe 2 Roman 6 Samira 8 With the aid of diagrams, explain how the node Joanna 16 would be inserted into the linked list. [3] 7. Outline how a colour can be represented in a computer. [2] 8. Identify two key features of a peer-to-peer (P2P) network. [2] 9. Outline the role of paging in the management of primary memory. [2] 10. Outline two distinct features of autonomous agents. [4] Turn over

4 4 M14/4/COMSC/HP1/ENG/TZ0/XX SECTION B Answer all questions. 11. A builder is renovating a series of apartments and is considering integrating a few electrical devices in each apartment into an automatic programmable system. One example is the integration of lighting, heating, ventilation and air conditioning. (a) (b) Identify two groups of users that might find this integrated technology particularly appealing. Discuss two advantages, offered by this technology, that could be used in an advertisement for the apartments. [2] [4] (c) Evaluate two ways users can access the functionality of the integrated system at home. [6] The same technology is adapted and used for intensive chicken farming; in this context a decentralized control is preferred. (d) Describe how this could be achieved. [3] 12. An international organization has offices located across several countries. For some of its activities, for example human resource management, it has been decided to adopt a Software-as-a-Service (SaaS) solution in order to keep the running costs low. (a) Describe the features of SaaS. [3] (b) Discuss the limitations of SaaS in relation to security. [6] Each office makes some data available to external customers through the use of an extranet and allows employees to work from home through a VPN. (c) Define the term extranet. [2] (d) Distinguish between a VPN and an extranet. [4]

5 5 M14/4/COMSC/HP1/ENG/TZ0/XX 13. The faceplate of a car stereo has six buttons for selecting one of six preferred radio stations. As part of the internal representation of a microprocessor there is an array with six positions, carrying the information about the radio frequencies, as follows. Radio [0] [1] [2] [3] [4] [5] (a) State the information at Radio[2]. [1] (b) Outline how a numerical frequency could be stored in a fixed-length string. [2] (c) Construct an algorithm in pseudocode that calculates the range of frequencies (ie the difference between the highest and lowest frequencies) of any set of six selected radio stations. [6] The two-dimensional array Stats provides an indication of how often a specific station is listened to by the user. For each button in the faceplate it records how often it has been clicked in the last 48 hours. Stats is ordered by the second column. Stats Both Radio and Stats are used by a procedure that allows the user to access the radio frequencies that are listened to most often, as recorded in Stats, by flicking a lever on the steering wheel. The frequencies are accessed cyclically, ie after the least used frequency the procedure returns to the most used. For this reason a queue Q is used. (d) Construct an algorithm in pseudocode that, by using the structures Radio and Stats, performs the following steps: it inserts the radio frequencies in the queue Q, following the actual order of preference; and then it uses the queue Q, cyclically, to output an element each time the lever is flicked. [6] Turn over

6 6 M14/4/COMSC/HP1/ENG/TZ0/XX 14. Consider the following diagram and pseudocode for drawing on a display screen. ENDPOINT CENTRE 2 SIZE SIZE ENDPOINTS = drawh(centre, SIZE) The method drawh(centre, SIZE) will draw an H located at CENTRE with width of SIZE and height of 2 SIZE, as shown. It returns an array containing the four endpoints of the vertical lines. In the following flowchart, POINTS1 is a stack. Is POINTS1 empty? no pop CENTRE from POINTS1 draw H at CENTRE yes (a) Construct pseudocode corresponding to the flowchart. [3] (This question continues on the following page)

7 7 M14/4/COMSC/HP1/ENG/TZ0/XX (Question 14 continued) (b) Construct the drawing that would be produced by the flowchart on page 6 if it is preceded by the following steps. SIZE = 20 CENTRE = the middle of the user s display POINTS1 is a stack, initially empty ENDPOINTS = drawh(centre, SIZE) loop COUNT from 0 to 3 POINTS1.push(ENDPOINTS[COUNT]) end loop SIZE = SIZE / 2 [2] The pattern of drawing a new set of H s, which have a SIZE value that is half the SIZE value of the previous H, can be repeated. Each set of H s of the same size is called a generation. (c) Construct an algorithm that will draw an initial H in the centre of the display and three generations after that. [6] (d) State how many endpoints there will be after the initial H and three generations have been drawn, without any consideration of the size. [1] (e) Suggest how drawing this pattern of H s could be done recursively. [3] Turn over

8 8 M14/4/COMSC/HP1/ENG/TZ0/XX 15. A suburban railway system for a large city in Southern Europe consists of two lines L1 and L2, which meet at the station Centro, where passengers can change from one line to the other. The system is shown below. ZONE 4 ZONE 3 ZONE 2 ZONE 1 ZONE 0 Pizarra L1 Alora Alamo Lomas Torrox L2 Fuengirola Prados Lima Plaza Mayor David Col Centro Each station is located in a particular zone, and the total number of zones in which the journey takes place determines the train fare. Note, if a passenger starts in Zone 1, goes to Zone 0 and then back to Zone 1, the journey has taken place in three zones. Examples of the number of zones are shown below for different journeys. Travelling from Travelling to Number of zones Lima Plaza Mayor 1 Alora Plaza Mayor 7 Lomas Col 4 (a) State the number of zones in which the journey takes place when travelling from Alora to Fuengirola. [1] The data for each station (station name, line, zone) is stored on the system s server in the collection TRAIN_DATA. There are 12 stations in total. The first part of the collection is shown below. Centro, L1, 0, Alora, L1, 3, Torrox, L1, 1, Col, L2, 1,... From this we can see that Alora is part of line L1 and is located in Zone 3. At the start of each day, the data in TRAIN_DATA is read in to the binary tree TREE, in which each node will hold the data for one station. The binary tree will be used to search for a specific station s name. (b) Sketch the binary tree after the station data from the first part of the collection, given above, has been added. [3] (This question continues on the following page)

9 9 M14/4/COMSC/HP1/ENG/TZ0/XX (Question 15 continued) The TRAIN_DATA collection is also used to construct the one-dimensional array STATIONS (which only contains the list of station names sorted into alphabetical order), where STATIONS[0] = Alamo. (c) State the value of STATIONS[4]. [1] The two data structures (STATIONS and TREE) are now used to construct the two dimensional array FARES containing the fares between stations, partly shown below. Note that the fare for travelling in each zone is FARES Alamo Alora Centro Col... Alamo Alora Centro Col etc (d) Calculate the fare for travelling from Torrox to Lima. [1] (e) Construct the algorithm that would calculate the fares for this two-dimensional array. You can make use of the following two sub-procedures: TREE.getZone(STATION) // which returns the zone in which the // station is located TREE.getLine(STATION) // which returns the line on which the // station is located Your algorithm should make as few calculations as possible. [9]

A Level Computer Science H446/02 Algorithms and programming. Practice paper - Set 1. Time allowed: 2 hours 30 minutes

A Level Computer Science H446/02 Algorithms and programming. Practice paper - Set 1. Time allowed: 2 hours 30 minutes A Level Computer Science H446/02 Algorithms and programming Practice paper - Set 1 Time allowed: 2 hours 30 minutes Do not use: a calculator First name Last name Centre number Candidate number INSTRUCTIONS

More information

West Windsor-Plainsboro Regional School District Advanced Topics in Computer Science Grades 9-12

West Windsor-Plainsboro Regional School District Advanced Topics in Computer Science Grades 9-12 West Windsor-Plainsboro Regional School District Advanced Topics in Computer Science Grades 9-12 Unit 1: Recursion Content Area: Technology Course & Grade Level: Advanced Topics in Computer Science, 9

More information

Cambridge International Examinations Cambridge Ordinary Level

Cambridge International Examinations Cambridge Ordinary Level Cambridge International Examinations Cambridge Ordinary Level *8850416585* COMPUTER STUDIES 7010/12 Paper 1 October/November 2014 2 hours 30 minutes Candidates answer on the Question Paper. No Additional

More information

COS 226 Algorithms and Data Structures Fall Midterm Exam

COS 226 Algorithms and Data Structures Fall Midterm Exam COS 226 lgorithms and Data Structures Fall 2015 Midterm Exam This exam has 8 questions worth a total of 100 points. You have 80 minutes. The exam is closed book, except that you are allowed to use one

More information

COS 226 Algorithms and Data Structures Fall Midterm Exam

COS 226 Algorithms and Data Structures Fall Midterm Exam COS 226 lgorithms and Data Structures Fall 2015 Midterm Exam You have 80 minutes for this exam. The exam is closed book, except that you are allowed to use one page of notes (8.5-by-11, one side, in your

More information

Getting Started. Right click on Lateral Workplane. Left Click on New Sketch

Getting Started. Right click on Lateral Workplane. Left Click on New Sketch Getting Started 1. Open up PTC Pro/Desktop by either double clicking the icon or through the Start button and in Programs. 2. Once Pro/Desktop is open select File > New > Design 3. Close the Pallet window

More information

Algorithms and Data Structures CS 372. The Sorting Problem. Insertion Sort - Summary. Merge Sort. Input: Output:

Algorithms and Data Structures CS 372. The Sorting Problem. Insertion Sort - Summary. Merge Sort. Input: Output: Algorithms and Data Structures CS Merge Sort (Based on slides by M. Nicolescu) The Sorting Problem Input: A sequence of n numbers a, a,..., a n Output: A permutation (reordering) a, a,..., a n of the input

More information

MA/CSSE 473 Day 13. Student Questions. Permutation Generation. HW 6 due Monday, HW 7 next Thursday, Tuesday s exam. Permutation generation

MA/CSSE 473 Day 13. Student Questions. Permutation Generation. HW 6 due Monday, HW 7 next Thursday, Tuesday s exam. Permutation generation MA/CSSE 473 Day 13 Permutation Generation MA/CSSE 473 Day 13 HW 6 due Monday, HW 7 next Thursday, Student Questions Tuesday s exam Permutation generation 1 Exam 1 If you want additional practice problems

More information

Algorithms for Data Structures: Search for Games. Phillip Smith 27/11/13

Algorithms for Data Structures: Search for Games. Phillip Smith 27/11/13 Algorithms for Data Structures: Search for Games Phillip Smith 27/11/13 Search for Games Following this lecture you should be able to: Understand the search process in games How an AI decides on the best

More information

School of Computing and Information Technology. ASSIGNMENT 1 (Individual) CSCI 103 Algorithms and Problem Solving. Session 2, April - June 2017

School of Computing and Information Technology. ASSIGNMENT 1 (Individual) CSCI 103 Algorithms and Problem Solving. Session 2, April - June 2017 ASSIGNMENT 1 (Individual) CSCI 103 Algorithms and Problem Solving Session 2, April - June 2017 UOW Moderator: Dr. Luping Zhou (lupingz@uow.edu.au) Lecturer: Mr. Chung Haur KOH (chkoh@uow.edu.au) Total

More information

Answer all questions. No marks will be awarded for using brand names of software packages or hardware.

Answer all questions. No marks will be awarded for using brand names of software packages or hardware. Cambridge International Examinations Cambridge Ordinary Level *8259318641* COMPUTER SCIENCE 2210/13 Paper 1 Theory October/November 2015 1 hour 45 minutes Candidates answer on the Question Paper. No Additional

More information

Link State Routing. Brad Karp UCL Computer Science. CS 3035/GZ01 3 rd December 2013

Link State Routing. Brad Karp UCL Computer Science. CS 3035/GZ01 3 rd December 2013 Link State Routing Brad Karp UCL Computer Science CS 33/GZ 3 rd December 3 Outline Link State Approach to Routing Finding Links: Hello Protocol Building a Map: Flooding Protocol Healing after Partitions:

More information

Creo Extrude Tutorial 3: Hole, Fillets and Rounds

Creo Extrude Tutorial 3: Hole, Fillets and Rounds Creo Extrude Tutorial 3: Hole, Fillets and Rounds By: Matthew Jourden Brighton High School 1. Open Creo Parametric 2. File > Open > extrudetutorial (From Creo Extrude Tutorial 1) NOTE: Minimum of 2 other

More information

Problem A. Worst Locations

Problem A. Worst Locations Problem A Worst Locations Two pandas A and B like each other. They have been placed in a bamboo jungle (which can be seen as a perfect binary tree graph of 2 N -1 vertices and 2 N -2 edges whose leaves

More information

mywbut.com Two agent games : alpha beta pruning

mywbut.com Two agent games : alpha beta pruning Two agent games : alpha beta pruning 1 3.5 Alpha-Beta Pruning ALPHA-BETA pruning is a method that reduces the number of nodes explored in Minimax strategy. It reduces the time required for the search and

More information

MAT 409 Semester Exam: 80 points

MAT 409 Semester Exam: 80 points MAT 409 Semester Exam: 80 points Name Email Text # Impact on Course Grade: Approximately 25% Score Solve each problem based on the information provided. It is not necessary to complete every calculation.

More information

Divide & conquer. Which works better for multi-cores: insertion sort or merge sort? Why?

Divide & conquer. Which works better for multi-cores: insertion sort or merge sort? Why? 1 Sorting... more 2 Divide & conquer Which works better for multi-cores: insertion sort or merge sort? Why? 3 Divide & conquer Which works better for multi-cores: insertion sort or merge sort? Why? Merge

More information

Series and parallel resistances

Series and parallel resistances Series and parallel resistances Objectives Calculate the equivalent resistance for resistors connected in both series and parallel combinations. Construct series and parallel circuits of lamps (resistors).

More information

CSI33 Data Structures

CSI33 Data Structures Department of Mathematics and Computer Science Bronx Community College Outline Chapter 7: Trees 1 Chapter 7: Trees Uses Of Trees Chapter 7: Trees Taxonomies animal vertebrate invertebrate fish mammal reptile

More information

Section Marks Agents / 8. Search / 10. Games / 13. Logic / 15. Total / 46

Section Marks Agents / 8. Search / 10. Games / 13. Logic / 15. Total / 46 Name: CS 331 Midterm Spring 2017 You have 50 minutes to complete this midterm. You are only allowed to use your textbook, your notes, your assignments and solutions to those assignments during this midterm.

More information

Past questions from the last 6 years of exams for programming 101 with answers.

Past questions from the last 6 years of exams for programming 101 with answers. 1 Past questions from the last 6 years of exams for programming 101 with answers. 1. Describe bubble sort algorithm. How does it detect when the sequence is sorted and no further work is required? Bubble

More information

Homework Assignment #1

Homework Assignment #1 CS 540-2: Introduction to Artificial Intelligence Homework Assignment #1 Assigned: Thursday, February 1, 2018 Due: Sunday, February 11, 2018 Hand-in Instructions: This homework assignment includes two

More information

Computer Graphics (CS/ECE 545) Lecture 7: Morphology (Part 2) & Regions in Binary Images (Part 1)

Computer Graphics (CS/ECE 545) Lecture 7: Morphology (Part 2) & Regions in Binary Images (Part 1) Computer Graphics (CS/ECE 545) Lecture 7: Morphology (Part 2) & Regions in Binary Images (Part 1) Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Recall: Dilation Example

More information

Examination paper for TDT4120 Algorithms and Data Structures

Examination paper for TDT4120 Algorithms and Data Structures Department of Computer and Information Science Examination paper for TDT0 Algorithms and Data Structures Academic contact during examination Magnus Lie Hetland Phone 98 5 99 Examination date Dec 0, 08

More information

Topic 23 Red Black Trees

Topic 23 Red Black Trees Topic 23 "People in every direction No words exchanged No time to exchange And all the little ants are marching Red and Black antennas waving" -Ants Marching, Dave Matthew's Band "Welcome to L.A.'s Automated

More information

Decision Mathematics D1 Advanced/Advanced Subsidiary. Friday 17 May 2013 Morning Time: 1 hour 30 minutes

Decision Mathematics D1 Advanced/Advanced Subsidiary. Friday 17 May 2013 Morning Time: 1 hour 30 minutes Paper Reference(s) 6689/01R Edexcel GCE Decision Mathematics D1 Advanced/Advanced Subsidiary Friday 17 May 2013 Morning Time: 1 hour 30 minutes Materials required for examination Nil Items included with

More information

Simple Search Algorithms

Simple Search Algorithms Lecture 3 of Artificial Intelligence Simple Search Algorithms AI Lec03/1 Topics of this lecture Random search Search with closed list Search with open list Depth-first and breadth-first search again Uniform-cost

More information

Computer Progression Pathways statements for KS3 & 4. Year 7 National Expectations. Algorithms

Computer Progression Pathways statements for KS3 & 4. Year 7 National Expectations. Algorithms Year 7 National Expectations can show an awareness of tasks best completed by humans or computers. can designs solutions by decomposing a problem and creates a sub-solution for each of these parts (decomposition).

More information

Algorithm. Algorithms in Everyday Life. Language in Algorithms. Five Essential Properties (cont'd) Chapter 10: What's The Plan?: Algorithmic Thinking

Algorithm. Algorithms in Everyday Life. Language in Algorithms. Five Essential Properties (cont'd) Chapter 10: What's The Plan?: Algorithmic Thinking Chapter 10: What's The Plan?: Algorithmic Thinking Fluency with Information Technology Third Edition by Lawrence Snyder Algorithm A precise, systematic method for producing a specified result We have already

More information

Algorithm. Algorithms in Everyday Life. Chapter 10: What's The Plan?: Algorithmic Thinking

Algorithm. Algorithms in Everyday Life. Chapter 10: What's The Plan?: Algorithmic Thinking Chapter 10: What's The Plan?: Algorithmic Thinking Fluency with Information Technology Third Edition by Lawrence Snyder Algorithm A precise, systematic method for producing a specified result We have already

More information

ACTIVITY 1: Measuring Speed

ACTIVITY 1: Measuring Speed CYCLE 1 Developing Ideas ACTIVITY 1: Measuring Speed Purpose In the first few cycles of the PET course you will be thinking about how the motion of an object is related to how it interacts with the rest

More information

Module 3 Greedy Strategy

Module 3 Greedy Strategy Module 3 Greedy Strategy Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu Introduction to Greedy Technique Main

More information

FOR OFFICIAL USE Centre No. Subject No. Level Paper No. Group No. Marker's No. Time: 3 hours. Full name of centre

FOR OFFICIAL USE Centre No. Subject No. Level Paper No. Group No. Marker's No. Time: 3 hours. Full name of centre STAPLE HERE FOR OFFICIAL USE Centre No. Subject No. Level Paper No. Group No. Marker's No. [C033/SQP173] Advanced Higher Graphic Communication Specimen Question Paper Time: 3 hours NATIONAL QUALIFICATIONS

More information

CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims. Lecture 17: Heaps and Priority Queues

CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims. Lecture 17: Heaps and Priority Queues CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims Lecture 17: Heaps and Priority Queues Stacks and Queues as Lists Stack (LIFO) implemented as list insert (i.e.

More information

Perspective Sketching

Perspective Sketching Perspective Sketching Perspective Drawings A perspective drawing offers the most realistic three-dimensional view of all the pictorial methods, because it portrays the object in a manner that is most similar

More information

Lecture5: Lossless Compression Techniques

Lecture5: Lossless Compression Techniques Fixed to fixed mapping: we encoded source symbols of fixed length into fixed length code sequences Fixed to variable mapping: we encoded source symbols of fixed length into variable length code sequences

More information

Coimisiún na Scrúduithe Stáit. State Examinations Commission. Junior Certificate Examination, Section B and Section C

Coimisiún na Scrúduithe Stáit. State Examinations Commission. Junior Certificate Examination, Section B and Section C Coimisiún na Scrúduithe Stáit State Examinations Commission 2016. S69BC Junior Certificate Examination, 2016 Technology Higher Level Wednesday, 22 June Afternoon, 2:00-4:00 Section B and Section C Section

More information

Engineering Diploma Resource Guide ST150 ETP Research & Design (Engineering)

Engineering Diploma Resource Guide ST150 ETP Research & Design (Engineering) Engineering Diploma Resource Guide ST50 ETP Research & Design (Engineering) Introduction Whether we are looking to improve a current system or design a completely new product for the market place, we have

More information

ACM International Collegiate Programming Contest 2004 Brazil Sub-Regional

ACM International Collegiate Programming Contest 2004 Brazil Sub-Regional International Collegiate acm Programming Contest 2004 event sponsor ACM International Collegiate Programming Contest 2004 Brazil Sub-Regional October 2rd, 2004 (This problem set contains 7 problems; pages

More information

CSE 573 Problem Set 1. Answers on 10/17/08

CSE 573 Problem Set 1. Answers on 10/17/08 CSE 573 Problem Set. Answers on 0/7/08 Please work on this problem set individually. (Subsequent problem sets may allow group discussion. If any problem doesn t contain enough information for you to answer

More information

DESIGN AND TECHNOLOGY 9705/01

DESIGN AND TECHNOLOGY 9705/01 CAMBRIDGE INTERNATIONAL EXAMINATIONS General Certificate of Education Advanced Subsidiary Level and Advanced Level DESIGN AND TECHNOLOGY 9705/01 Paper 1 Additional Materials: Answer Booklet/Paper May/June

More information

UNIVERSITY OF CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Secondary Education. Paper 1 May/June hours 30 minutes

UNIVERSITY OF CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Secondary Education. Paper 1 May/June hours 30 minutes www.xtremepapers.com UNIVERSITY OF CAMBRIDGE INTERNATIONAL EXAMINATIONS International General Certificate of Secondary Education *4670938493* COMPUTER STUDIES 0420/11 Paper 1 May/June 2012 2 hours 30 minutes

More information

EXERCISE ONE: BEACH BUGGY.

EXERCISE ONE: BEACH BUGGY. EXERCISE ONE: BEACH BUGGY. Prerequisite knowledge Students should have completed Exercises from the file: Introduction to Assemblies Concept Mates Focus of lesson Commands Used This lesson will focus on

More information

Lectures: Feb 27 + Mar 1 + Mar 3, 2017

Lectures: Feb 27 + Mar 1 + Mar 3, 2017 CS420+500: Advanced Algorithm Design and Analysis Lectures: Feb 27 + Mar 1 + Mar 3, 2017 Prof. Will Evans Scribe: Adrian She In this lecture we: Summarized how linear programs can be used to model zero-sum

More information

Project #3 Seam Carving

Project #3 Seam Carving 15-463 Project #3 Seam Carving Caroline Hermans For this project, I implemented a Seam Carving algorithm that reduces the size of images without losing important details. Rather than scaling the image,

More information

CADET SAMPLE QUESTIONS

CADET SAMPLE QUESTIONS CADET SAMPLE QUESTIONS www.beaver.my 01 Necklace (Easy) Beaver Pam made a necklace for herself. Now that it's finished, she's not sure that it will fit around her neck. The numbers tell the lengths of

More information

Edexcel GCSE Mathematics

Edexcel GCSE Mathematics Centre No. Paper Reference Surname Initial(s) Candidate No. Signature Paper Reference(s) Edexcel GCSE Mathematics Paper 2 (Calculator) Foundation Tier Specimen paper Time: 1 hour and 30 minutes Examiner

More information

Science in the Classroom. Actin Network Architecture can determine Myosin Motor Activity Student Activity

Science in the Classroom. Actin Network Architecture can determine Myosin Motor Activity Student Activity Science in the Classroom Actin Network Architecture can determine Myosin Motor Activity Student Activity Learning objective In this activity, students will learn how to extract quantitative information

More information

Architect. Architect.

Architect. Architect. The The line line sketch sketch with with modified modified height height for for plinth plinth floor floor is is displayed. displayed. Open Open Architectural Architectural plan plan file, file, which

More information

Vision Ques t. Vision Quest. Use the Vision Sensor to drive your robot in Vision Quest!

Vision Ques t. Vision Quest. Use the Vision Sensor to drive your robot in Vision Quest! Vision Ques t Vision Quest Use the Vision Sensor to drive your robot in Vision Quest! Seek Discover new hands-on builds and programming opportunities to further your understanding of a subject matter.

More information

Name: Date: Period: IB Physics SL Y2 Option A (Sight and Wave Phenomena Part 1) Midterm Exam Study Guide Exam Date: Thursday, March 12, 2015

Name: Date: Period: IB Physics SL Y2 Option A (Sight and Wave Phenomena Part 1) Midterm Exam Study Guide Exam Date: Thursday, March 12, 2015 Name: Date: Period: Objectives: IB Physics SL Y2 Option A (Sight and Wave Phenomena Part 1) Midterm Exam Study Guide Exam Date: Thursday, March 12, 2015 A.1.1 Describe the basic structure of the human

More information

CS 188 Fall Introduction to Artificial Intelligence Midterm 1

CS 188 Fall Introduction to Artificial Intelligence Midterm 1 CS 188 Fall 2018 Introduction to Artificial Intelligence Midterm 1 You have 120 minutes. The time will be projected at the front of the room. You may not leave during the last 10 minutes of the exam. Do

More information

Indiana K-12 Computer Science Standards

Indiana K-12 Computer Science Standards Indiana K-12 Computer Science Standards What is Computer Science? Computer science is the study of computers and algorithmic processes, including their principles, their hardware and software designs,

More information

CONTENTS INTRODUCTION ACTIVATING VCA LICENSE CONFIGURATION...

CONTENTS INTRODUCTION ACTIVATING VCA LICENSE CONFIGURATION... VCA VCA Installation and Configuration manual 2 Contents CONTENTS... 2 1 INTRODUCTION... 3 2 ACTIVATING VCA LICENSE... 6 3 CONFIGURATION... 10 3.1 VCA... 10 3.1.1 Camera Parameters... 11 3.1.2 VCA Parameters...

More information

UW-Madison ACM ICPC Individual Contest

UW-Madison ACM ICPC Individual Contest UW-Madison ACM ICPC Individual Contest October th, 2015 Setup Before the contest begins, log in to your workstation and set up and launch the PC2 contest software using the following instructions. You

More information

CSC 380 Final Presentation. Connect 4 David Alligood, Scott Swiger, Jo Van Voorhis

CSC 380 Final Presentation. Connect 4 David Alligood, Scott Swiger, Jo Van Voorhis CSC 380 Final Presentation Connect 4 David Alligood, Scott Swiger, Jo Van Voorhis Intro Connect 4 is a zero-sum game, which means one party wins everything or both parties win nothing; there is no mutual

More information

Module 3 Greedy Strategy

Module 3 Greedy Strategy Module 3 Greedy Strategy Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu Introduction to Greedy Technique Main

More information

A short antenna optimization tutorial using MMANA-GAL

A short antenna optimization tutorial using MMANA-GAL A short antenna optimization tutorial using MMANA-GAL Home MMANA Quick Start part1 part2 part3 part4 Al Couper NH7O These pages will present a short guide to antenna optimization using MMANA-GAL. This

More information

SudokuSplashZone. Overview 3

SudokuSplashZone. Overview 3 Overview 3 Introduction 4 Sudoku Game 4 Game grid 4 Cell 5 Row 5 Column 5 Block 5 Rules of Sudoku 5 Entering Values in Cell 5 Solver mode 6 Drag and Drop values in Solver mode 6 Button Inputs 7 Check the

More information

FACTFILE: GCE TECHNOLOGY & DESIGN

FACTFILE: GCE TECHNOLOGY & DESIGN FACTFILE: GCE TECHNOLOGY & DESIGN 1.8, 1.26, 1.56 DESIGN AND COMMUNICATION Design and Communication Learning outcomes Students should be able to: communicate designs using 2D methods, to include freehand

More information

DeltaCad and Your Cylinder (Shepherd s) Sundial Carl Sabanski

DeltaCad and Your Cylinder (Shepherd s) Sundial Carl Sabanski 1 The Sundial Primer created by In the instruction set SONNE and Your Cylinder Shepherd s Sundial we went through the process of designing a cylinder sundial with SONNE and saving it as a dxf file. In

More information

Coding for Efficiency

Coding for Efficiency Let s suppose that, over some channel, we want to transmit text containing only 4 symbols, a, b, c, and d. Further, let s suppose they have a probability of occurrence in any block of text we send as follows

More information

User Guide V10 SP1 Addendum

User Guide V10 SP1 Addendum Alibre Design User Guide V10 SP1 Addendum Copyrights Information in this document is subject to change without notice. The software described in this document is furnished under a license agreement or

More information

What you'll need A measuring cup, 4 glasses of equal size, and water

What you'll need A measuring cup, 4 glasses of equal size, and water Maths at Home Your home is full of opportunities to explore maths with your child and, at the same time, build his or her self-confidence and understanding of mathematical ideas. This is a chance for you

More information

RGB COLORS. Connecting with Computer Science cs.ubc.ca/~hoos/cpsc101

RGB COLORS. Connecting with Computer Science cs.ubc.ca/~hoos/cpsc101 RGB COLORS Clicker Question How many numbers are commonly used to specify the colour of a pixel? A. 1 B. 2 C. 3 D. 4 or more 2 Yellow = R + G? Combining red and green makes yellow Taught in elementary

More information

Collectives Pattern. Parallel Computing CIS 410/510 Department of Computer and Information Science. Lecture 8 Collective Pattern

Collectives Pattern. Parallel Computing CIS 410/510 Department of Computer and Information Science. Lecture 8 Collective Pattern Collectives Pattern Parallel Computing CIS 410/510 Department of Computer and Information Science Outline q What are Collectives? q Reduce Pattern q Scan Pattern q Sorting 2 Collectives q Collective operations

More information

Engineering Graphics Essentials with AutoCAD 2015 Instruction

Engineering Graphics Essentials with AutoCAD 2015 Instruction Kirstie Plantenberg Engineering Graphics Essentials with AutoCAD 2015 Instruction Text and Video Instruction Multimedia Disc SDC P U B L I C AT I O N S Better Textbooks. Lower Prices. www.sdcpublications.com

More information

Link State Routing. Stefano Vissicchio UCL Computer Science CS 3035/GZ01

Link State Routing. Stefano Vissicchio UCL Computer Science CS 3035/GZ01 Link State Routing Stefano Vissicchio UCL Computer Science CS 335/GZ Reminder: Intra-domain Routing Problem Shortest paths problem: What path between two vertices offers minimal sum of edge weights? Classic

More information

0420 COMPUTER STUDIES

0420 COMPUTER STUDIES CAMBRIDGE INTERNATIONAL EXAMINATIONS Cambridge International General Certificate of Secondary Education www.xtremepapers.com MARK SCHEME for the October/November 24 series 42 COMPUTER STUDIES 42/3 Paper,

More information

DeltaCad and Your Horizontal Altitude Sundial Carl Sabanski

DeltaCad and Your Horizontal Altitude Sundial Carl Sabanski 1 The Sundial Primer created by In the instruction set SONNE and Your Horizontal Altitude Sundial we went through the process of designing a horizontal altitude sundial with SONNE and saving it as a dxf

More information

BC Nephrology Days PROMIS. Acuity Assessment and Comorbidities. November 5, 2009 Amy E. Majeski

BC Nephrology Days PROMIS. Acuity Assessment and Comorbidities. November 5, 2009 Amy E. Majeski BC Nephrology Days PROMIS Acuity Assessment and Comorbidities November 5, 2009 Amy E. Majeski Acuity Assessment Where to Find It Main Menu: Monitoring Sub-Menu: Acuity Assessment Purpose PROMIS users can

More information

Design of Parallel Algorithms. Communication Algorithms

Design of Parallel Algorithms. Communication Algorithms + Design of Parallel Algorithms Communication Algorithms + Topic Overview n One-to-All Broadcast and All-to-One Reduction n All-to-All Broadcast and Reduction n All-Reduce and Prefix-Sum Operations n Scatter

More information

SCRAPENDIPITY Designs. Electric Quilt 7 Tutorial. Building a Quilt

SCRAPENDIPITY Designs. Electric Quilt 7 Tutorial. Building a Quilt Electric Quilt 7 Tutorial Building a Quilt When you start Electric Quilt up, you will see this screen. Type the name of your quilt and hit OK Now we need to make sure we have the correct layout. Go to

More information

Decision Mathematics D1

Decision Mathematics D1 Pearson Edexcel International Advanced Level Decision Mathematics D1 Advanced/Advanced Subsidiary Friday 16 June 2017 Afternoon Time: 1 hour 30 minutes Paper Reference WDM01/01 You must have: D1 Answer

More information

Problem Solving and Search

Problem Solving and Search Artificial Intelligence Topic 3 Problem Solving and Search Problem-solving and search Search algorithms Uninformed search algorithms breadth-first search uniform-cost search depth-first search iterative

More information

Outlined with fine liner. Ruler used for straight lines. Circle stencil used for curves. Outlined with fine liner. Ruler used for straight lines.

Outlined with fine liner. Ruler used for straight lines. Circle stencil used for curves. Outlined with fine liner. Ruler used for straight lines. Equipment Sketch Outline Erase Colour Skill: Sketching Pencil Fine liner Rubber Circle stencil Ruler Coloured pencils Sketched in pencil. Outlined with fine liner. No visible pencil lines. Coloured inside

More information

CSE101: Design and Analysis of Algorithms. Ragesh Jaiswal, CSE, UCSD

CSE101: Design and Analysis of Algorithms. Ragesh Jaiswal, CSE, UCSD Course Overview Graph Algorithms Algorithm Design Techniques: Greedy Algorithms Divide and Conquer Dynamic Programming Network Flows Computational Intractability Main Ideas Main idea: Break the given

More information

RBT Operations. The basic algorithm for inserting a node into an RBT is:

RBT Operations. The basic algorithm for inserting a node into an RBT is: RBT Operations The basic algorithm for inserting a node into an RBT is: 1: procedure RBT INSERT(T, x) 2: BST insert(t, x) : colour[x] red 4: if parent[x] = red then 5: RBT insert fixup(t, x) 6: end if

More information

Solving Problems by Searching

Solving Problems by Searching Solving Problems by Searching Berlin Chen 2005 Reference: 1. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Chapter 3 AI - Berlin Chen 1 Introduction Problem-Solving Agents vs. Reflex

More information

CS188: Section Handout 1, Uninformed Search SOLUTIONS

CS188: Section Handout 1, Uninformed Search SOLUTIONS Note that for many problems, multiple answers may be correct. Solutions are provided to give examples of correct solutions, not to indicate that all or possible solutions are wrong. Work on following problems

More information

Stratigraphy Modeling Boreholes and Cross Sections

Stratigraphy Modeling Boreholes and Cross Sections GMS TUTORIALS Stratigraphy Modeling Boreholes and Cross Sections The Borehole module of GMS can be used to visualize boreholes created from drilling logs. Also three-dimensional cross sections between

More information

1 Permutations. 1.1 Example 1. Lisa Yan CS 109 Combinatorics. Lecture Notes #2 June 27, 2018

1 Permutations. 1.1 Example 1. Lisa Yan CS 109 Combinatorics. Lecture Notes #2 June 27, 2018 Lisa Yan CS 09 Combinatorics Lecture Notes # June 7, 08 Handout by Chris Piech, with examples by Mehran Sahami As we mentioned last class, the principles of counting are core to probability. Counting is

More information

Building a Chart Using Trick or Treat Data a step by step guide By Jeffrey A. Shaffer

Building a Chart Using Trick or Treat Data a step by step guide By Jeffrey A. Shaffer Building a Chart Using Trick or Treat Data a step by step guide By Jeffrey A. Shaffer Each year my home is bombarded on Halloween with an incredible amount of Trick or Treaters. So what else would an analytics

More information

2. Advanced Image Editing

2. Advanced Image Editing 2. Advanced Image Editing Aim: In this lesson, you will learn: The different options and tools to edit an image. The different ways to change and/or add attributes of an image. Jyoti: I want to prepare

More information

DESN2270 Final Project Plan

DESN2270 Final Project Plan DESN2270 Final Project Plan Contents Website Content... 1 Theme... 1 Narrative... 1 Intended Audience... 2 Audio/ Animation Sequences... 2 Banner... 2 Main Story... 2 Interactive Elements... 4 Game...

More information

Arrays. Independent Part. Contents. Programming with Java Module 3. 1 Bowling Introduction Task Intermediate steps...

Arrays. Independent Part. Contents. Programming with Java Module 3. 1 Bowling Introduction Task Intermediate steps... Programming with Java Module 3 Arrays Independent Part Contents 1 Bowling 3 1.1 Introduction................................. 3 1.2 Task...................................... 3 1.3 Intermediate steps.............................

More information

Hello, my name is and I will be interviewing you today. Can you please tell me your name and candidate number.

Hello, my name is and I will be interviewing you today. Can you please tell me your name and candidate number. London Examinations IGCSE in English as a Second Language INTRODUCTION FRAME 0 Hello, my name is and I will be interviewing you today. Can you please tell me your name and candidate number. [Repeat candidate

More information

Geometer s Sketchpad Version 4

Geometer s Sketchpad Version 4 Geometer s Sketchpad Version 4 For PC Name: Date: INVESTIGATION: The Pythagorean Theorem Directions: Use the steps below to lead you through the investigation. After each step, be sure to click in the

More information

CSE101: Algorithm Design and Analysis. Ragesh Jaiswal, CSE, UCSD

CSE101: Algorithm Design and Analysis. Ragesh Jaiswal, CSE, UCSD Longest increasing subsequence Problem Longest increasing subsequence: You are given a sequence of integers A[1], A[2],..., A[n] and you are asked to find a longest increasing subsequence of integers.

More information

MiVoice Office Real-Time Wallboard

MiVoice Office Real-Time Wallboard MiVoice Office Real-Time Wallboard MiVoice Office Real-Time Wallboard Quick Reference Guide APRIL 2018 DOCUMENT RELEASE 5.1 QUICK REFERENCE GUIDE Page 1 Quick Reference Guide NOTICE The information contained

More information

Hosted Web-Access Control

Hosted Web-Access Control Hosted Web-Access Control 1 P a g e Table of Contents Introduction... 3 Loading Cards and Keyfobs... 4 Adding a New Employee/Card Holder... 5 Employee Has Lost/Broken Their Card... 6 Changing a Timezone

More information

ENGR170 Assignment Problem Solving with Recursion Dr Michael M. Marefat

ENGR170 Assignment Problem Solving with Recursion Dr Michael M. Marefat ENGR170 Assignment Problem Solving with Recursion Dr Michael M. Marefat Overview The goal of this assignment is to find solutions for the 8-queen puzzle/problem. The goal is to place on a 8x8 chess board

More information

Problem A. Vera and Outfits

Problem A. Vera and Outfits Problem A. Vera and Outfits file: file: Vera owns N tops and N pants. The i-th top and i-th pants have colour i, for 1 i N, where all N colours are different from each other. An outfit consists of one

More information

PV-ezDesign Introduction training for ground mount project

PV-ezDesign Introduction training for ground mount project PV-ezDesign Introduction training for ground mount project Ground Mount Training Page 1 of 32 Open the following link to access your account: www.clenergy.com/pvezdesign Ground Mount Training Page 2 of

More information

At the conclusion of this unit you should be able to accomplish the following with a 70% accuracy

At the conclusion of this unit you should be able to accomplish the following with a 70% accuracy 7 Multiview Drawing OBJECTIVES At the conclusion of this unit you should be able to accomplish the following with a 70% accuracy 1. explain the importance of mulitview drawing as a communication tool far

More information

TECHNICAL DRAWING HIGHER LEVEL PAPER II(A) ENGINEERING APPLICATIONS

TECHNICAL DRAWING HIGHER LEVEL PAPER II(A) ENGINEERING APPLICATIONS M. 84 AN ROINN OIDEACHAIS AGUS EOLAÍOCHTA LEAVING CERTIFICATE EXAMINATION, 2001 TECHNICAL DRAWING HIGHER LEVEL PAPER II(A) ENGINEERING APPLICATIONS Friday, 15 June, Afternoon 2.00 5.00 p.m. 200 Marks INSTRUCTIONS

More information

Introduction to Spring 2009 Artificial Intelligence Final Exam

Introduction to Spring 2009 Artificial Intelligence Final Exam CS 188 Introduction to Spring 2009 Artificial Intelligence Final Exam INSTRUCTIONS You have 3 hours. The exam is closed book, closed notes except a two-page crib sheet, double-sided. Please use non-programmable

More information

AutoCAD 2D. Table of Contents. Lesson 1 Getting Started

AutoCAD 2D. Table of Contents. Lesson 1 Getting Started AutoCAD 2D Lesson 1 Getting Started Pre-reqs/Technical Skills Basic computer use Expectations Read lesson material Implement steps in software while reading through lesson material Complete quiz on Blackboard

More information

Artificial Intelligence Lecture 3

Artificial Intelligence Lecture 3 Artificial Intelligence Lecture 3 The problem Depth first Not optimal Uses O(n) space Optimal Uses O(B n ) space Can we combine the advantages of both approaches? 2 Iterative deepening (IDA) Let M be a

More information