Software Development Techniques. 26 November Marking Scheme

Size: px
Start display at page:

Download "Software Development Techniques. 26 November Marking Scheme"

Transcription

1 Software Development Techniques 26 November 2015 Marking Scheme This marking scheme has been prepared as a guide only to markers. This is not a set of model answers, or the exclusive answers to the questions, and there will frequently be alternative responses which will provide a valid answer. Markers are advised that, unless a question specifies that an answer be provided in a particular form, then an answer that is correct (factually or in practical terms) must be given the available marks. If there is doubt as to the correctness of an answer, the relevant NCC Education materials should be the first authority. Throughout the marking, please credit any valid alternative point. Where markers award half marks in any part of a question, they should ensure that the total mark recorded for the question is rounded up to a whole mark.

2 Answer ALL questions Question 1 a) Some programs written in high level programming languages are compiled. With the aid of a diagram, explain what is meant by the term compilation in relation to software development. Compilation is the process of taking a human readable (1 mark) representation of code (1 mark), and converting (1 mark) it into a form the computer can understand (1 mark). 7 Award up to 3 marks for a diagram. Award 1 mark for an illustration of a high level language and award 2 marks for multiple machine/code systems. b) Some languages are interpreted and not compiled. Briefly explain the purpose of an interpreter. An interpreter is a program (1 mark) that reads, analyses and then executes (1 mark) each instruction of the source code (1 mark). 3 Question 2 a) Briefly explain what is meant by an algorithm and state FOUR (4) features of a good algorithm. 6 An Algorithm is a series of instructions (1 mark) that manipulate data (1 mark). Award 1 mark for each feature up to a maximum of 4 marks: Complete Robust Efficient Readable Maintainable b) Briefly explain what is meant by pseudocode and provide TWO (2) reasons why pseudocode is used to write an algorithm. Pseudocode is an informal language (1) that helps us describe and design algorithms (1). 4 Award 1 mark for each feature up to a maximum of 2 marks: We are not committed to a specific programming language We can focus on the logic of an algorithm as opposed to the language specific features. We can formally check the correctness on paper. Page 2 of 15

3 Question 3 The following algorithm can be used to calculate the average of three scores in a game. Perform a desk-check on this algorithm using a table to show the values in each variable after the execution of each line. You should assume an input value of 150 for score1 and 100 for score2 and 200 for score data score1 as whole number 2. data score2 as whole number 3. data score3 as whole number 4. data average as whole number 5. output Welcome to the average score calculator 6. output What is the first score? 7. input score1 8. output What is the second score? 9. input score2 10. output What is the third score? 11. input score3 12. average = (score1 + score2 + score3)/3 13. output The average score is: 14. output average 15. output Thankyou for using this program. Question 3 continues on next page Page 3 of 15

4 The maximum number of marks awarded to this question is 10. Award 1 mark in total for correctly stating lines 1-4. Award 1 mark in total for correctly stating lines 5,6 and 15. Award 1 mark for each correct line from 7-14 (up to a maximum of 8 marks. Line score 1 score 2 score 3 score 4 notes score1 declared score2 declared score3 declared average declared Output Output User inputs Output User inputs Output User inputs Output Output Output Page 4 of 15

5 Question 4 a) State FOUR (4) considerations when choosing between a single precision and double precision floating point data type. 4 Award 1 mark for each bullet point up to a maximum of 4 marks: A single precision data type may not be large enough to store a high value A single precision data type may not be able to store the value accurately enough A double precision data type takes up more memory space and may not be necessary Converting form a double to a single may mean loss of data/accuracy and the effect of this on the program needs to be considered carefully. Data conversions from one type to another may be carried out implicitly by the chosen language. b) State what data types should be used for the following variables and explain your answer: i) The first name of an employee 2 ii) iii) Award 1 mark for a correct choice and 1 mark for a correct explanation: String because it is made up of characters The salary of an employee Award 1 mark for a correct choice and 1 mark for a correct explanation: Integer if we are going to use the minimum units of currency, real/float if we are going to count it as a decimal The phone number of an employee Award 1 mark for a correct choice and 1 mark for a correct explanation: String because it will have a leading zero 2 2 Page 5 of 15

6 Question 5 a) What the difference between a bounded loop and an unbounded loop? 2 With a bounded Loop, we know how many times we are going to repeat (1 mark). In contrast, an unbounded loop is when we do not know how many times we are going to repeat (1 mark) b) Write a short pseudocode program that will read in exactly 3 scores from the user and calculate the average, displaying the result. The scores should be whole numbers and the calculation should be completed using the appropriate type of loop. 8 The number of marks awarded to this question is 8. The code should be something similar to this: 1. data score as whole number 2. data counter as whole number 3. data total as whole number 4. data average as float 5. total = 0 6. counter = 0 7. loop until counter is equal to 3 8. input score 9. total = total + score 10. increment counter 11. next loop 12. average = total / counter 13. output average 14. output Goodbye! should be allocated as follows: 1 mark for using the loop; 1 mark for using a counter; 1 mark for ending at 3; 2 marks for choosing a bounded loop; 2 marks for correct loop contents; and 1 mark for clarity. The pseudocode does not need to be exact but it does need to clearly solve the problem. Page 6 of 15

7 Question 6 a) Write a pseudocode algorithm which tests to ensure that a given input value is a positive whole number. You should make appropriate use of variable names and data types. 5 The maximum number of marks awarded to this question is 5. An example solution is: 1 data usernumber as whole number 2 output "Please enter a whole number" 3 input usernumber 4 if usernumber > 0 then 5 output "That's a positive number!" 6 end if 7 output "Goodbye!" Award up to 2 marks for appropriate use of if statement; 1 mark for correct logical condition; 1 mark for appropriate variable names; and 1 mark for appropriate data type. b) Using an if statement, write pseudocode that implements the following rule: 5 If a student's score is greater than 70 the grade is 1, otherwise if the grade is greater than 60 the grade is 2:1, otherwise if the grade is greater than 50 the grade is 2:2. You should use the following variables: (1) data score as float/real; and (2) data grade as string. The maximum number of marks awarded to this question is 5. An example solution is: 1. If score >= 70 then 2. grade = 1 3. else if score >=60 then 4. grade = 2:1 5. else if score >=50 then 6. grade = 2:2 7. End if Award up to 3 marks for correct logic and award 2 marks for correct if/else structure. For full marks, structure is important, but not syntax. Page 7 of 15

8 Question 7 Below is a partly complete truth table for the logical equation (A AND B) OR (C AND D). Complete the table. 10 A B C D A AND B C AND D (A AND B) OR (C AND D) False False False False False False False False False False True False False False False False True False False False False False True True False True False True False False False False False True False True False False False True True False False False False True True True False True True False False False False False True False False True False False True False True False True False True True True True False False True True False True True True True False True True True True Question 7 continues on next page Page 8 of 15

9 The maximum number of marks awarded to this question is 10. Award ½ marks for each cell in the last column (up to a maximum of 7 marks). Award ½ mark for each correct pair in columns 5 and 6 ( up to a maximum of 3 marks) A B C D A AND B C AND D (A AND B) OR (C AND D) False False False False False False False False False False True False False False False False True False False False False False False True True False True True False True False False False False False False True False True False False False False True True False False False False False True True True False True True True False False False False False False True False False True False False False True False True False False False False True False True True False True True True True False False True False True True True False True True False True True True True False True False True True True True True True True True Page 9 of 15

10 Question 8 a) State FOUR (4) advantages of using arrays in programming. 4 Award up to 1 mark for each bullet point up to a maximum of 4 marks: Can group a number of items of the same type together with a single name making them easier to manage, and code easier to read There are many functions for manipulating arrays making searching, sorting updating a relatively simple, and well understood task Accessing the elements of an array can be fast They are a logical representation of real world structures such as vectors and matrices. b) The following pseudocode program is used to find the largest value in an array of numbers that have been entered by the user. It uses two functions, CreateArray(), to get that array form the user and FindLargest(). FindLargest takes an array as input and returns the largest value in that array. Write a pseudocode algorithm that implements the FindLargest function. (Note: you should use the standard function sizeof() to find the size of the array that has been passed to your function) data nums as array of whole number 2. data usernum as whole number 3. data largest as whole number 4. output "Enter the size of the array? 5. input usernum; 6. nums = CreateArray (usernum) 7. largest = FindLargest (nums); 8. output "The largest number in the list you entered was " + largest Question 8 continues on next page Page 10 of 15

11 The maximum number of marks awarded to this question is 6. Answer should be similar to below although syntax does not need to be precise. function FindLargest (needs nums as array of whole numbers) returning whole number 1 data l as whole number 2 data c as whole number 3 loop while c is less than sizeof (array) 4 if nums[c] is greater than l 5 l = nums[counter] 6 end if 7 c = c end loop 9 return l End Function should be allocated as follows: 1 mark for correct use of function keyword; 1 mark for correct specification of input; 1 mark for correct specification of output; 1 mark for use of sizeof() function. Award 1 mark for appropriate structure of loop and 1 mark for appropriate structure of selection. Page 11 of 15

12 Question 9 a) Quicksort and bubblesort are two algorithms for sorting sets of data. Explain how the quicksort and bubblesort algorithms work. You should also identify which algorithm is most efficient for dealing with small and large sets of data. Quicksort Algorithm works by splitting an array into two sections (1 mark) and then sorts each sub-array (1 mark). It is recursive (1 mark). 7 Bubblesort It works by checking adjacent pairs and then swapping them when they are not in order (1 mark). It requires us to step over the whole array several times (1 mark). Bubblesort better for small data sets but slows down as the size increases (1 mark), while quicksort is more efficient as the size of the data set increases (1 mark) b) Software can be tested using Black Box testing. Briefly evaluate Black Box testing as a suitable approach for examining the different logical paths through an algorithm. Black box testing is functional testing and checks the output of the program based on a given input (1 mark). It does not examine the details of the code (1 mark) therefore it is not a suitable approach for testing the logical paths through an algorithm (1 mark). 3 Page 12 of 15

13 Question 10 a) In Object Oriented Programming, briefly explain the difference between a Class and an Object. 2 Award 1 mark for each bullet point up to a maximum of 2 marks. A class represents a collection of similar things, and specifies the common properties, and functions of those things. An object is an instance of a class and represents an actual thing that has data attached to its properties, and state associated with its functionality. b) The following class is used to describe objects of type Student. These objects would appear in an enrolment application for a University. The class is incomplete as it does not contain accessor functions. Write some pseudocode accessor functions for this class. 8 Class Student data name as String data age as whole number End Class // Accessor functions to be written here The maximum number of marks awarded to this question is 8. Award 2 marks per function - syntax can be approximate but must refer to correct member variables (1 mark) and getters must return correct values (1 mark). function setname (needs n as String) name = n end function function set (needs a as whole number) age = a end function function getname() returns String return name end function function getage() returns whole number return age end function End of Examination Paper Page 13 of 15

14 Learning Outcomes matrix Question Learning Outcomes assessed 1 1 Yes 2 1,2 Yes 3 2,5,6 Yes 4 2,3 Yes 5 2,3 Yes 6 3,6 Yes 7 3 Yes 8 4,7 Yes 9 5,6 Yes 10 7 Yes Marker can differentiate between varying levels of achievement Page 14 of 15

15 Grade descriptors Learning Outcome Identify and explain the key stages of software development lifecycles Express, design and evaluate algorithms Identify and use programming language constructs Identify and use common data structures Explain and use common algorithms Explain and use test strategies Explain how software is modularised Pass Merit Distinction Provide adequate ability to explain the subject matter ability to perform the task ability to perform the task ability to perform the task adequate ability to explain the subject matter; adequate and appropriate use adequate ability to explain the subject matter; adequate and appropriate use Provide adequate ability to explain the subject matter Provide detailed and coherent explanation of the subject matter ability to perform the task consistently well ability to perform the task consistently well ability to perform the task consistently well detailed and coherent explanation of the subject matter; appropriate and effective use detailed and coherent explanation of the subject matter; appropriate and effective use Provide detailed and coherent explanation of the subject matter Provide comprehensive, lucid explanation of the subject matter ability to perform the task to the highest standard ability to perform the task to the highest standard ability to perform the task to the highest standard comprehensive, lucid explanation of the subject matter; highly appropriate and effective use comprehensive, lucid explanation of the subject matter; highly appropriate and effective use Provide comprehensive, lucid explanation of the subject matter Page 15 of 15

Software Development Techniques. December Sample Exam Marking Scheme

Software Development Techniques. December Sample Exam Marking Scheme Software Development Techniques December 2015 Sample Exam Marking Scheme This marking scheme has been prepared as a guide only to markers. This is not a set of model answers, or the exclusive answers to

More information

Introduction to Programming. June Marking Scheme

Introduction to Programming. June Marking Scheme Introduction to Programming June 2015 Marking Scheme This marking scheme has been prepared as a guide only to markers. This is not a set of model answers, or the exclusive answers to the questions, and

More information

Software Development Techniques. December Sample Examination Paper. Time: 3 hours

Software Development Techniques. December Sample Examination Paper. Time: 3 hours Software Development Techniques December 2015 Sample Examination Paper Answer ALL questions. Clearly cross out surplus answers. Time: 3 hours The maximum mark for this paper is 100. Any reference material

More information

Fundamentals of Computing and Digital Literacy. Sample. Marking Scheme

Fundamentals of Computing and Digital Literacy. Sample. Marking Scheme Fundamentals of Computing and Digital Literacy Sample Marking Scheme This Marking Scheme has been prepared as a guide only to markers. This is not a set of model answers, nor is the Marking Scheme exclusive,

More information

Fundamentals of Computing and Digital Literacy. Sample. Assignment title: Develop a Wiki. Marking Scheme

Fundamentals of Computing and Digital Literacy. Sample. Assignment title: Develop a Wiki. Marking Scheme Fundamentals of Computing and Digital Literacy Sample Assignment title: Develop a Wiki Marking Scheme This Marking Scheme has been prepared as a guide only to markers. This is not a set of model answers,

More information

IT Skills. September Marking Scheme

IT Skills. September Marking Scheme IT Skills September 205 Marking Scheme This marking scheme has been prepared as a guide only to markers. This is not a set of model answers, or the exclusive answers to the questions, and there will frequently

More information

Network Security and Cryptography. 2 September Marking Scheme

Network Security and Cryptography. 2 September Marking Scheme Network Security and Cryptography 2 September 2015 Marking Scheme This marking scheme has been prepared as a guide only to markers. This is not a set of model answers, or the exclusive answers to the questions,

More information

Network Security and Cryptography. December Sample Exam Marking Scheme

Network Security and Cryptography. December Sample Exam Marking Scheme Network Security and Cryptography December 2015 Sample Exam Marking Scheme This marking scheme has been prepared as a guide only to markers. This is not a set of model answers, or the exclusive answers

More information

Mark Scheme. Additional Sample Assessment Materials. Pearson BTEC Level 3 - Computing. Unit 1: Principles of Computer Science

Mark Scheme. Additional Sample Assessment Materials. Pearson BTEC Level 3 - Computing. Unit 1: Principles of Computer Science Scheme Additional Sample Assessment Materials Pearson BTEC Level 3 - Computing Unit 1: Principles of Computer Science Edexcel and BTEC Qualifications Edexcel and BTEC qualifications come from Pearson,

More information

Course Outline. Introduction to java

Course Outline. Introduction to java Course Outline 1. Introduction to OO programming 2. Language Basics Syntax and Semantics 3. Algorithms, stepwise refinements. 4. Quiz/Assignment ( 5. Repetitions (for loops) 6. Writing simple classes 7.

More information

Designing and Developing a Website. 6 August Marking Scheme

Designing and Developing a Website. 6 August Marking Scheme Designing and Developing a Website 6 August 015 Marking Scheme This marking scheme has been prepared as a guide only to markers. This is not a set of model answers, or the exclusive answers to the questions,

More information

Algorithms. Chapter 8. Objectives After studying this chapter, students should be able to:

Algorithms. Chapter 8. Objectives After studying this chapter, students should be able to: Objectives After studying this chapter, students should be able to: Chapter 8 Algorithms Define an algorithm and relate it to problem solving. Define three construct and describe their use in algorithms.

More information

Definition: A data structure is a way of organizing data in a computer so that it can be used efficiently.

Definition: A data structure is a way of organizing data in a computer so that it can be used efficiently. The Science of Computing I Lesson 4: Introduction to Data Structures Living with Cyber Pillar: Data Structures The need for data structures The algorithms we design to solve problems rarely do so without

More information

Chapter 8 Algorithms 1

Chapter 8 Algorithms 1 Chapter 8 Algorithms 1 Objectives After studying this chapter, the student should be able to: Define an algorithm and relate it to problem solving. Define three construct and describe their use in algorithms.

More information

In Fig. 3.5 and Fig. 3.7, we include some completely blank lines in the pseudocode for readability. programs into their various phases.

In Fig. 3.5 and Fig. 3.7, we include some completely blank lines in the pseudocode for readability. programs into their various phases. Formulating Algorithms with Top-Down, Stepwise Refinement Case Study 2: Sentinel-Controlled Repetition In Fig. 3.5 and Fig. 3.7, we include some completely blank lines in the pseudocode for readability.

More information

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR

SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR SRM ARTS AND SCIENCE COLLEGE SRM NAGAR, KATTANKULATHUR 603203 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS QUESTION BANK (2017-2018) Course / Branch : M.Sc CST Semester / Year : EVEN / II Subject Name

More information

Cambridge Assessment International Education Cambridge International General Certificate of Secondary Education. Published

Cambridge Assessment International Education Cambridge International General Certificate of Secondary Education. Published Cambridge Assessment International Education Cambridge International General Certificate of Secondary Education COMPUTER SCIENCE 0478/21 Paper 2 MARK SCHEME Maximum Mark: 50 Published This mark scheme

More information

A Beginner s Guide to Programming Logic, Introductory. Chapter 6 Arrays

A Beginner s Guide to Programming Logic, Introductory. Chapter 6 Arrays A Beginner s Guide to Programming Logic, Introductory Chapter 6 Arrays Objectives In this chapter, you will learn about: Arrays and how they occupy computer memory Manipulating an array to replace nested

More information

Course Text. Course Description. Course Objectives. StraighterLine Introduction to Programming in C++

Course Text. Course Description. Course Objectives. StraighterLine Introduction to Programming in C++ Introduction to Programming in C++ Course Text Programming in C++, Zyante, Fall 2013 edition. Course book provided along with the course. Course Description This course introduces programming in C++ and

More information

8 Algorithms 8.1. Foundations of Computer Science Cengage Learning

8 Algorithms 8.1. Foundations of Computer Science Cengage Learning 8 Algorithms 8.1 Foundations of Computer Science Cengage Learning 8.2 Objectives After studying this chapter, the student should be able to: Define an algorithm and relate it to problem solving. Define

More information

COURSE OF STUDY UNIT PLANNING GUIDE COMPUTER SCIENCE 1 FOR: 5 CREDITS GRADE LEVEL: 9-12 FULL-YEAR COURSE PREPARED BY: SUSIE EISEN

COURSE OF STUDY UNIT PLANNING GUIDE COMPUTER SCIENCE 1 FOR: 5 CREDITS GRADE LEVEL: 9-12 FULL-YEAR COURSE PREPARED BY: SUSIE EISEN COURSE OF STUDY UNIT PLANNING GUIDE FOR: COMPUTER SCIENCE 1 5 CREDITS GRADE LEVEL: 9-12 FULL-YEAR COURSE PREPARED BY: SUSIE EISEN SHANNON WARNOCK, SUPERVISOR OF MATHEMATICS AND SCIENCE JULY 2017 DUMONT

More information

Programming Logic and Design Sixth Edition

Programming Logic and Design Sixth Edition Objectives Programming Logic and Design Sixth Edition Chapter 6 Arrays In this chapter, you will learn about: Arrays and how they occupy computer memory Manipulating an array to replace nested decisions

More information

Example Candidate Responses. Cambridge International AS & A Level Computer Science. Paper 2

Example Candidate Responses. Cambridge International AS & A Level Computer Science. Paper 2 Example Candidate Responses Cambridge International AS & A Level Computer Science 9608 Paper 2 Cambridge International Examinations retains the copyright on all its publications. Registered Centres are

More information

2015 HSC Software Design and Development Marking Guidelines

2015 HSC Software Design and Development Marking Guidelines 2015 HSC Software Design and Development Marking Guidelines Section I Multiple-choice Answer Key Question Answer 1 C 2 A 3 B 4 D 5 B 6 C 7 B 8 C 9 C 10 A 11 B 12 D 13 A 14 A 15 C 16 D 17 B 18 D 19 B 20

More information

Higher Software Development - Section 1a

Higher Software Development - Section 1a Higher Software Development - Section 1a _ 1. List the stages involved in the development of a program in the correct order? (7) 2. In the software development process, what happens at the analysis stage?

More information

Introduction to Computer Science Midterm 3 Fall, Points

Introduction to Computer Science Midterm 3 Fall, Points Introduction to Computer Science Fall, 2001 100 Points Notes 1. Tear off this sheet and use it to keep your answers covered at all times. 2. Turn the exam over and write your name next to the staple. Do

More information

Selec%on and Decision Structures in Java: If Statements and Switch Statements CSC 121 Fall 2016 Howard Rosenthal

Selec%on and Decision Structures in Java: If Statements and Switch Statements CSC 121 Fall 2016 Howard Rosenthal Selec%on and Decision Structures in Java: If Statements and Switch Statements CSC 121 Fall 2016 Howard Rosenthal Lesson Goals Understand Control Structures Understand how to control the flow of a program

More information

Kadi Sarva Vishwavidyalaya, Gandhinagar

Kadi Sarva Vishwavidyalaya, Gandhinagar Kadi Sarva Vishwavidyalaya, Gandhinagar MASTERS OF COMPUTER APPLICATION (MCA) Semester I (First Year) Subject: MCA-101 Programming for Logic Building (LDPL) SUB Teaching scheme Examination scheme Total

More information

State two analytical tools used to understand feasibility of a proposed application. Acceptable answer(s) Guidance Max mks

State two analytical tools used to understand feasibility of a proposed application. Acceptable answer(s) Guidance Max mks Qualification: 50 3 035/535 Level 3 Advanced Technical Extended Diploma in Digital Technologies (Application Development) Theory Exam Exam date: June 018 1a State two analytical tools used to understand

More information

NOTE: Answer ANY FOUR of the following 6 sections:

NOTE: Answer ANY FOUR of the following 6 sections: A-PDF MERGER DEMO Philadelphia University Lecturer: Dr. Nadia Y. Yousif Coordinator: Dr. Nadia Y. Yousif Internal Examiner: Dr. Raad Fadhel Examination Paper... Programming Languages Paradigms (750321)

More information

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

Scheme of work Cambridge International AS & A Level Computing (9691) Scheme of work Cambridge International AS & A Level Computing (9691) Unit 2: Practical programming techniques Recommended prior knowledge Students beginning this course are not expected to have studied

More information

These are notes for the third lecture; if statements and loops.

These are notes for the third lecture; if statements and loops. These are notes for the third lecture; if statements and loops. 1 Yeah, this is going to be the second slide in a lot of lectures. 2 - Dominant language for desktop application development - Most modern

More information

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

BCS THE CHARTERED INSTITUTE FOR IT. BCS HIGHER EDUCATION QUALIFICATIONS BCS Level 4 Certificate in IT SOFTWARE DEVELOPMENT BCS THE CHARTERED INSTITUTE FOR IT BCS HIGHER EDUCATION QUALIFICATIONS BCS Level 4 Certificate in IT SOFTWARE DEVELOPMENT Wednesday 25th March 2015 - Afternoon Time: TWO hours Section A and Section B each

More information

Compiler Theory. (Semantic Analysis and Run-Time Environments)

Compiler Theory. (Semantic Analysis and Run-Time Environments) Compiler Theory (Semantic Analysis and Run-Time Environments) 005 Semantic Actions A compiler must do more than recognise whether a sentence belongs to the language of a grammar it must do something useful

More information

BASIC ELEMENTS OF A COMPUTER PROGRAM

BASIC ELEMENTS OF A COMPUTER PROGRAM BASIC ELEMENTS OF A COMPUTER PROGRAM CSC128 FUNDAMENTALS OF COMPUTER PROBLEM SOLVING LOGO Contents 1 Identifier 2 3 Rules for naming and declaring data variables Basic data types 4 Arithmetic operators

More information

PLD Semester Exam Study Guide Dec. 2018

PLD Semester Exam Study Guide Dec. 2018 Covers material from Chapters 1-8. Semester Exam will be built from these questions and answers, though they will be re-ordered and re-numbered and possibly worded slightly differently than on this study

More information

ECE368 Exam 2 Spring 2016

ECE368 Exam 2 Spring 2016 ECE368 Exam 2 Spring 2016 Thursday, April 7, 2016 15:00-16:15pm ARMS 1010 READ THIS BEFORE YOU BEGIN This is a closed-book, closed-notes exam. Electronic devices are not allowed. The time allotted for

More information

Cambridge Assessment International Education Cambridge International Advanced Subsidiary and Advanced Level. Published

Cambridge Assessment International Education Cambridge International Advanced Subsidiary and Advanced Level. Published Cambridge Assessment International Education Cambridge International Advanced Subsidiary and Advanced Level COMPUTER SCIENCE 9608/21 Paper 1 Written Paper MARK SCHEME Maximum Mark: 75 Published This mark

More information

Designing and Developing a Website. December Sample Exam Marking Scheme

Designing and Developing a Website. December Sample Exam Marking Scheme Designing and Developing a Website December 2015 Sample Exam Marking Scheme This marking scheme has been prepared as a guide only to markers. This is not a set of model answers, or the exclusive answers

More information

Unit 7. Functions. Need of User Defined Functions

Unit 7. Functions. Need of User Defined Functions Unit 7 Functions Functions are the building blocks where every program activity occurs. They are self contained program segments that carry out some specific, well defined task. Every C program must have

More information

Code No: R Set No. 1

Code No: R Set No. 1 Code No: R05010106 Set No. 1 1. (a) Draw a Flowchart for the following The average score for 3 tests has to be greater than 80 for a candidate to qualify for the interview. Representing the conditional

More information

To become familiar with array manipulation, searching, and sorting.

To become familiar with array manipulation, searching, and sorting. ELECTRICAL AND COMPUTER ENGINEERING 06-88-211: COMPUTER AIDED ANALYSIS LABORATORY EXPERIMENT #2: INTRODUCTION TO ARRAYS SID: OBJECTIVE: SECTIONS: Total Mark (out of 20): To become familiar with array manipulation,

More information

UNIT I : OVERVIEW OF COMPUTERS AND C-PROGRAMMING

UNIT I : OVERVIEW OF COMPUTERS AND C-PROGRAMMING SIDDARTHA INSTITUTE OF SCIENCE AND TECHNOLOGY:: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : PROGRAMMING FOR PROBLEM SOLVING (18CS0501) Course & Branch

More information

Computer Science Foundation Exam

Computer Science Foundation Exam Computer Science Foundation Exam August 6, 017 Section I A DATA STRUCTURES SOLUTIONS NO books, notes, or calculators may be used, and you must work entirely on your own. Question # Max Pts Category Passing

More information

Cambridge Assessment International Education Cambridge International Advanced Subsidiary and Advanced Level. Published

Cambridge Assessment International Education Cambridge International Advanced Subsidiary and Advanced Level. Published Cambridge Assessment International Education Cambridge International Advanced Subsidiary and Advanced Level COMPUTER SCIENCE 9608/23 Paper 2 Written Paper MARK SCHEME Maximum Mark: 75 Published This mark

More information

Selec%on and Decision Structures in Java: If Statements and Switch Statements CSC 121 Spring 2016 Howard Rosenthal

Selec%on and Decision Structures in Java: If Statements and Switch Statements CSC 121 Spring 2016 Howard Rosenthal Selec%on and Decision Structures in Java: If Statements and Switch Statements CSC 121 Spring 2016 Howard Rosenthal Lesson Goals Understand Control Structures Understand how to control the flow of a program

More information

BRANCHING if-else statements

BRANCHING if-else statements BRANCHING if-else statements Conditional Statements A conditional statement lets us choose which statement t t will be executed next Therefore they are sometimes called selection statements Conditional

More information

Chapter-8 DATA TYPES. Introduction. Variable:

Chapter-8 DATA TYPES. Introduction. Variable: Chapter-8 DATA TYPES Introduction To understand any programming languages we need to first understand the elementary concepts which form the building block of that program. The basic building blocks include

More information

Microsoft Visual Basic 2005: Reloaded

Microsoft Visual Basic 2005: Reloaded Microsoft Visual Basic 2005: Reloaded Second Edition Chapter 4 Making Decisions in a Program Objectives After studying this chapter, you should be able to: Include the selection structure in pseudocode

More information

Cambridge International Examinations Cambridge International Advanced Level

Cambridge International Examinations Cambridge International Advanced Level Cambridge International Examinations Cambridge International Advanced Level *6550085963* COMPUTER SCIENCE 9608/32 Paper 3 Advanced Theory October/November 2015 1 hour 30 minutes Candidates answer on the

More information

Unit-II Programming and Problem Solving (BE1/4 CSE-2)

Unit-II Programming and Problem Solving (BE1/4 CSE-2) Unit-II Programming and Problem Solving (BE1/4 CSE-2) Problem Solving: Algorithm: It is a part of the plan for the computer program. An algorithm is an effective procedure for solving a problem in a finite

More information

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level *4137415794* COMPUTER SCIENCE 9608/31 Paper 3 Advanced Theory October/November 2018 1 hour 30 minutes

More information

Outline. Program development cycle. Algorithms development and representation. Examples.

Outline. Program development cycle. Algorithms development and representation. Examples. Outline Program development cycle. Algorithms development and representation. Examples. 1 Program Development Cycle Program development cycle steps: Problem definition. Problem analysis (understanding).

More information

CS 142 Style Guide Grading and Details

CS 142 Style Guide Grading and Details CS 142 Style Guide Grading and Details In the English language, there are many different ways to convey a message or idea: some ways are acceptable, whereas others are not. Similarly, there are acceptable

More information

COP 1220 Introduction to Programming in C++ Course Justification

COP 1220 Introduction to Programming in C++ Course Justification Course Justification This course is a required first programming C++ course in the following degrees: Associate of Arts in Computer Science, Associate in Science: Computer Programming and Analysis; Game

More information

Logic & Algorithms Foundations of Computer Science Behrouz A. Forouzan, Brooks/Cole Thomson Learning, Pacific Grove, USA, 2003.

Logic & Algorithms Foundations of Computer Science Behrouz A. Forouzan, Brooks/Cole Thomson Learning, Pacific Grove, USA, 2003. OVERVIEW Logic & Algorithms Foundations of Computer Science Behrouz A. Forouzan, Brooks/Cole Thomson Learning, Pacific Grove, USA, 2003. OBJECTIVES After reading this chapter, the reader should be able

More information

C A R I B B E A N E X A M I N A T I O N S C O U N C I L REPORT ON CANDIDATES WORK IN THE SECONDARY EDUCATION CERTIFICATE EXAMINATIONS MAY/JUNE 2010

C A R I B B E A N E X A M I N A T I O N S C O U N C I L REPORT ON CANDIDATES WORK IN THE SECONDARY EDUCATION CERTIFICATE EXAMINATIONS MAY/JUNE 2010 C A R I B B E A N E X A M I N A T I O N S C O U N C I L REPORT ON CANDIDATES WORK IN THE SECONDARY EDUCATION CERTIFICATE EXAMINATIONS MAY/JUNE 2010 INFORMATION TECHNOLOGY GENERAL PROFICIENCY Copyright

More information

Excel VBA Variables, Data Types & Constant

Excel VBA Variables, Data Types & Constant Excel VBA Variables, Data Types & Constant Variables are used in almost all computer program and VBA is no different. It's a good practice to declare a variable at the beginning of the procedure. It is

More information

Unit 2: Collaborative Working

Unit 2: Collaborative Working Candidate MW Unit 2: Collaborative Working Assessment AO1 The focus of this unit is for candidates to work collaboratively with a small group of their peers to produce a final product (possibly a magazine

More information

PART A : MULTIPLE CHOICE Circle the letter of the best answer (1 mark each)

PART A : MULTIPLE CHOICE Circle the letter of the best answer (1 mark each) PART A : MULTIPLE CHOICE Circle the letter of the best answer (1 mark each) 1. An example of a narrowing conversion is a) double to long b) long to integer c) float to long d) integer to long 2. The key

More information

CS143 Final Spring 2016

CS143 Final Spring 2016 CS143 Final Spring 2016 Please read all instructions (including these) carefully. There are 5 questions on the exam, all with multiple parts. This exam is designed to take 2 hours, but you have the full

More information

[Page 177 (continued)] a. if ( age >= 65 ); cout << "Age is greater than or equal to 65" << endl; else cout << "Age is less than 65 << endl";

[Page 177 (continued)] a. if ( age >= 65 ); cout << Age is greater than or equal to 65 << endl; else cout << Age is less than 65 << endl; Page 1 of 10 [Page 177 (continued)] Exercises 4.11 Identify and correct the error(s) in each of the following: a. if ( age >= 65 ); cout

More information

Post Graduate Diploma in Computer Applications I Semester INTERNAL ASSIGNMENT QUESTIONS (November, 2017)

Post Graduate Diploma in Computer Applications I Semester INTERNAL ASSIGNMENT QUESTIONS (November, 2017) Post Graduate Diploma in Computer Applications I Semester INTERNAL ASSIGNMENT QUESTIONS (November, 2017) DIRECTOR Prof. SHIVARAJ PROF. G. RAM REDDY CENTRE FOR DISTANCE EDUCATION (RECOGNISED BY THE DISTANCE

More information

MPATE-GE 2618: C Programming for Music Technology. Unit 4.2

MPATE-GE 2618: C Programming for Music Technology. Unit 4.2 MPATE-GE 2618: C Programming for Music Technology Unit 4.2 Quiz 1 results (out of 25) Mean: 19.9, (standard deviation = 3.9) Equivalent to 79.1% (SD = 15.6) Median: 21.5 High score: 24 Low score: 13 Pointer

More information

CS 2505 Computer Organization I

CS 2505 Computer Organization I Instructions: Print your name in the space provided below. This examination is closed book and closed notes, aside from the permitted one-page formula sheet. No calculators or other computing devices may

More information

Midterm Exam Answers Instructor: Randy Shepherd CSCI-UA.0201 Spring 2017

Midterm Exam Answers Instructor: Randy Shepherd CSCI-UA.0201 Spring 2017 Section 1: Multiple choice (select any that apply) - 20 points 01. Representing 10 using the 4 byte unsigned integer encoding and using 4 byte two s complements encoding yields the same bit pattern. (a)

More information

Variables and Constants

Variables and Constants HOUR 3 Variables and Constants Programs need a way to store the data they use. Variables and constants offer various ways to work with numbers and other values. In this hour you learn: How to declare and

More information

University of the Western Cape Department of Computer Science

University of the Western Cape Department of Computer Science University of the Western Cape Department of Computer Science Algorithms and Complexity CSC212 Paper II Final Examination 13 November 2015 Time: 90 Minutes. Marks: 100. UWC number Surname, first name Mark

More information

4. Structure of a C++ program

4. Structure of a C++ program 4.1 Basic Structure 4. Structure of a C++ program The best way to learn a programming language is by writing programs. Typically, the first program beginners write is a program called "Hello World", which

More information

Cambridge Assessment International Education Cambridge International Advanced Subsidiary and Advanced Level. Published

Cambridge Assessment International Education Cambridge International Advanced Subsidiary and Advanced Level. Published Cambridge Assessment International Education Cambridge International Advanced Subsidiary and Advanced Level COMPUTER SCIENCE 9608/21 Paper 2 Written Paper MARK SCHEME Maximum Mark: 75 Published This mark

More information

Intro to Programming. Unit 7. What is Programming? What is Programming? Intro to Programming

Intro to Programming. Unit 7. What is Programming? What is Programming? Intro to Programming Intro to Programming Unit 7 Intro to Programming 1 What is Programming? 1. Programming Languages 2. Markup vs. Programming 1. Introduction 2. Print Statement 3. Strings 4. Types and Values 5. Math Externals

More information

Syllabus of Diploma Engineering. Computer Engineering. Semester: II. Subject Name: Computer Programming. Subject Code: 09CE1104

Syllabus of Diploma Engineering. Computer Engineering. Semester: II. Subject Name: Computer Programming. Subject Code: 09CE1104 Semester: II Subject Name: Computer Programming Subject Code: 09CE1104 Objective: This Course will help to develop programming skills in the students, using a structured programming language `C'. Students

More information

Cambridge Assessment International Education Cambridge Ordinary Level. Published

Cambridge Assessment International Education Cambridge Ordinary Level. Published Cambridge Assessment International Education Cambridge Ordinary Level COMPUTER SCIENCE 2210/22 Paper 2 MARK SCHEME Maximum Mark: 50 Published This mark scheme is published as an aid to teachers and candidates,

More information

HALF-YEARLY EXAMINATIONS FEBRUARY Subject: Computing Form: 4 Time: 1 ½ hours MARKING SCHEME

HALF-YEARLY EXAMINATIONS FEBRUARY Subject: Computing Form: 4 Time: 1 ½ hours MARKING SCHEME HALF-YEARLY EXAMINATIONS FEBRUARY 2017 Subject: Computing Form: 4 Time: 1 ½ hours MARKING SCHEME 1 Section A Answer all the questions in the space provided. 1. Use 5 (five) of the following terms to identify

More information

UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING

UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING APS 105 Computer Fundamentals Final Examination December 16, 2013 2:00 p.m. 4:30 p.m. (150 minutes) Examiners: J. Anderson, B. Korst, J.

More information

(Subroutines in Visual Basic)

(Subroutines in Visual Basic) Ch 7 Procedures (Subroutines in Visual Basic) Visual Basic Procedures Structured Programs To simplify writing complex programs, most Programmers (Designers/Developers) choose to split the problem into

More information

AP Computer Science A 2003 Scoring Guidelines

AP Computer Science A 2003 Scoring Guidelines AP Computer Science A 2003 Scoring Guidelines The materials included in these files are intended for use by AP teachers for course and exam preparation; permission for any other use must be sought from

More information

a b c d a b c d e 5 e 7

a b c d a b c d e 5 e 7 COMPSCI 230 Homework 9 Due on April 5, 2016 Work on this assignment either alone or in pairs. You may work with different partners on different assignments, but you can only have up to one partner for

More information

Concurrent & Distributed Systems Supervision Exercises

Concurrent & Distributed Systems Supervision Exercises Concurrent & Distributed Systems Supervision Exercises Stephen Kell Stephen.Kell@cl.cam.ac.uk November 9, 2009 These exercises are intended to cover all the main points of understanding in the lecture

More information

Chapter 5. Repetition. Contents. Introduction. Three Types of Program Control. Two Types of Repetition. Three Syntax Structures for Looping in C++

Chapter 5. Repetition. Contents. Introduction. Three Types of Program Control. Two Types of Repetition. Three Syntax Structures for Looping in C++ Repetition Contents 1 Repetition 1.1 Introduction 1.2 Three Types of Program Control Chapter 5 Introduction 1.3 Two Types of Repetition 1.4 Three Structures for Looping in C++ 1.5 The while Control Structure

More information

Chapter 3: Operators, Expressions and Type Conversion

Chapter 3: Operators, Expressions and Type Conversion 101 Chapter 3 Operators, Expressions and Type Conversion Chapter 3: Operators, Expressions and Type Conversion Objectives To use basic arithmetic operators. To use increment and decrement operators. To

More information

Computer Science & Engineering 150A Problem Solving Using Computers

Computer Science & Engineering 150A Problem Solving Using Computers Computer Science & Engineering 150A Problem Solving Using Computers Lecture 06 - Stephen Scott Adapted from Christopher M. Bourke 1 / 30 Fall 2009 Chapter 8 8.1 Declaring and 8.2 Array Subscripts 8.3 Using

More information

Unit 3. Operators. School of Science and Technology INTRODUCTION

Unit 3. Operators. School of Science and Technology INTRODUCTION INTRODUCTION Operators Unit 3 In the previous units (unit 1 and 2) you have learned about the basics of computer programming, different data types, constants, keywords and basic structure of a C program.

More information

I BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination. June, 2015 BCS-031 : PROGRAMMING IN C ++

I BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination. June, 2015 BCS-031 : PROGRAMMING IN C ++ No. of Printed Pages : 3 I BCS-031 BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination 05723. June, 2015 BCS-031 : PROGRAMMING IN C ++ Time : 3 hours Maximum Marks : 100 (Weightage 75%)

More information

Programming Fundamentals - A Modular Structured Approach using C++ By: Kenneth Leroy Busbee

Programming Fundamentals - A Modular Structured Approach using C++ By: Kenneth Leroy Busbee 1 0 1 0 Foundation Topics 1 0 Chapter 1 - Introduction to Programming 1 1 Systems Development Life Cycle N/A N/A N/A N/A N/A N/A 1-8 12-13 1 2 Bloodshed Dev-C++ 5 Compiler/IDE N/A N/A N/A N/A N/A N/A N/A

More information

CS 6353 Compiler Construction Project Assignments

CS 6353 Compiler Construction Project Assignments CS 6353 Compiler Construction Project Assignments In this project, you need to implement a compiler for a language defined in this handout. The programming language you need to use is C or C++ (and the

More information

VALLIAMMAI ENGINEERING COLLEGE SRM NAGAR, KATTANGULATHUR

VALLIAMMAI ENGINEERING COLLEGE SRM NAGAR, KATTANGULATHUR VALLIAMMAI ENGINEERING COLLEGE SRM NAGAR, KATTANGULATHUR 603 203 FIRST SEMESTER B.E / B.Tech., (Common to all Branches) QUESTION BANK - GE 6151 COMPUTER PROGRAMMING UNIT I - INTRODUCTION Generation and

More information

GCE. Computing. Mark Scheme for January Advanced Subsidiary GCE Unit F452: Programming Techniques and Logical Methods

GCE. Computing. Mark Scheme for January Advanced Subsidiary GCE Unit F452: Programming Techniques and Logical Methods GCE Computing Advanced Subsidiary GCE Unit F45: Programming Techniques and Logical Methods Mark Scheme for January 013 Oxford Cambridge and RSA Examinations OCR (Oxford Cambridge and RSA) is a leading

More information

VISUAL GUIDE to. RX Scripting. for Roulette Xtreme - System Designer 2.0. L J Howell UX Software Ver. 1.0

VISUAL GUIDE to. RX Scripting. for Roulette Xtreme - System Designer 2.0. L J Howell UX Software Ver. 1.0 VISUAL GUIDE to RX Scripting for Roulette Xtreme - System Designer 2.0 L J Howell UX Software 2009 Ver. 1.0 TABLE OF CONTENTS INTRODUCTION...ii What is this book about?... iii How to use this book... iii

More information

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

Cambridge International General Certificate of Secondary Education 0478 Computer Science June 2015 Principal Examiner Report for Teachers COMPUTER SCIENCE Paper 0478/11 Paper 1 Key Messages This is a new syllabus and the standard of candidates work was mostly very good. There is a continued move to provide questions where candidates have

More information

https://asd-pa.perfplusk12.com/admin/admin_curric_maps_display.aspx?m=5507&c=618&mo=18917&t=191&sy=2012&bl...

https://asd-pa.perfplusk12.com/admin/admin_curric_maps_display.aspx?m=5507&c=618&mo=18917&t=191&sy=2012&bl... Page 1 of 13 Units: - All - Teacher: ProgIIIJavaI, CORE Course: ProgIIIJavaI Year: 2012-13 Intro to Java How is data stored by a computer system? What does a compiler do? What are the advantages of using

More information

Programming Paradigms Written Exam

Programming Paradigms Written Exam Programming Paradigms Written Exam 17.06.2014 First name Student number Last name Signature Instructions for Students Write your name and student number on the exam sheet and on every solution sheet you

More information

Fundamentals of Programming Session 7

Fundamentals of Programming Session 7 Fundamentals of Programming Session 7 Instructor: Reza Entezari-Maleki Email: entezari@ce.sharif.edu 1 Fall 2014 These slides have been created using Deitel s slides Sharif University of Technology Outlines

More information

Objectives. Chapter 2: Basic Elements of C++ Introduction. Objectives (cont d.) A C++ Program (cont d.) A C++ Program

Objectives. Chapter 2: Basic Elements of C++ Introduction. Objectives (cont d.) A C++ Program (cont d.) A C++ Program Objectives Chapter 2: Basic Elements of C++ In this chapter, you will: Become familiar with functions, special symbols, and identifiers in C++ Explore simple data types Discover how a program evaluates

More information

MS Office for Engineers

MS Office for Engineers MS Office for Engineers Lesson 4 Excel 2 Pre-reqs/Technical Skills Basic knowledge of Excel Completion of Excel 1 tutorial Basic computer use Expectations Read lesson material Implement steps in software

More information

Chapter 2: Basic Elements of C++

Chapter 2: Basic Elements of C++ Chapter 2: Basic Elements of C++ Objectives In this chapter, you will: Become familiar with functions, special symbols, and identifiers in C++ Explore simple data types Discover how a program evaluates

More information

Chapter 2: Basic Elements of C++ Objectives. Objectives (cont d.) A C++ Program. Introduction

Chapter 2: Basic Elements of C++ Objectives. Objectives (cont d.) A C++ Program. Introduction Chapter 2: Basic Elements of C++ C++ Programming: From Problem Analysis to Program Design, Fifth Edition 1 Objectives In this chapter, you will: Become familiar with functions, special symbols, and identifiers

More information

CS 415 Midterm Exam Spring SOLUTION

CS 415 Midterm Exam Spring SOLUTION CS 415 Midterm Exam Spring 2005 - SOLUTION Name Email Address Student ID # Pledge: This exam is closed note, closed book. Questions will be graded on quality of answer. Please supply the best answer you

More information

Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks Marks

Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks Marks Subject Code: CC103-N Subject Title: FUNDAMENTALS OF PROGRAMMING Teaching scheme Total L T P Total Theory Credit Evaluation Scheme Mid Sem Exam CIA Pract. Total Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks

More information

CMSC330 Fall 2016 Midterm #2 2:00pm/3:30pm

CMSC330 Fall 2016 Midterm #2 2:00pm/3:30pm CMSC330 Fall 2016 Midterm #2 2:00pm/3:30pm Gradescope ID: (Gradescope ID is the First letter of your last name and last 5 digits of your UID) (If you write your name on the test, or your gradescope ID

More information