INTRODUCTION TO SOFTWARE SYSTEMS (COMP1110/COMP1140/COMP1510/COMP6710)
|
|
- Cora Young
- 5 years ago
- Views:
Transcription
1 Important notice: This document is a sample exam. The final exam will differ from this exam in numerous ways. The purpose of this sample exam is to provide students with access to an exam written in a similar style and with a similar structure to their final exam. Both this sample exam and the final exam sample material from the entire semester, but the selection will be different in the final exam to what is presented here. INTRODUCTION TO SOFTWARE SYSTEMS (COMP1110/COMP1140/COMP1510/COMP6710) Writing period: 3 Hours duration Study period: 15 Minutes duration Permitted materials: None You must attempt to answer all questions. Questions are not of equal value. All questions must be completed on this exam paper. This examination paper must not be taken out of the exam room. Student ID: Course Code: Please do not write in the grey boxes that appear throughout the exam paper. These are for use by markers. Q1 Q2 Q3 Q4 Q5 Q6 /10 /10 /35 /20 /15 /10 /100 Page 1 of 14 - INTRODUCTION TO SOFTWARE SYSTEMS ( COMP1110/COMP1140/COMP1510/COMP6710 )
2 Question 1. [10 Marks] Imperative Programming Given the following code: import java.util.arraylist; import java.util.list; public class Simple { private static String foo(int i) { String result = ""; if (i < 2) return result + i; else { for (int j = i; j >0; j--) { result += j; return result + foo(i-1) + foo(i-2); public static void main(string[] args) { List<Integer> list = new ArrayList<Integer>(); list.add(1); list.add(2); list.set(0, 0); System.out.println("A: "+list); list.remove(1); System.out.println("B: "+list); System.out.println("C: "+list.get(0)); System.out.println("D: "+foo(3)); Note: The tostring() method of ArrayList will print in the format [ 1, 2, 3 ] (for a list of 1, 2, and 3). Write in the box below exactly what the program will output when it is run. Q1 /10 Page 2 of 14 - INTRODUCTION TO SOFTWARE SYSTEMS ( COMP1110/COMP1140/COMP1510/COMP6710 )
3 Question 2. [10 Marks] Multiple choice Read the following carefully: Given the following 15 True/False questions, mark either True or False (but not both). Each question that is correctly answered gains you 1 mark, each question answered incorrectly loses you 1 mark, a question left unanswered neither loses nor gains marks. The final mark for this question is calculated by bounding the sum of marks between 0 and 10. For example, if you answered all questions correctly you would gain 10 (not 15) for this question. If you answer 8 correctly, 2 incorrectly and leave the remaining 5 unanswered you would gain 6/10 for this question. If you wish to change your answer then cross off both True and False and clearly state your answer in words. (e.g. I would like to leave this question unanswered. or My answer is True. ) Basic Java a) true false is equal to true. True False b) ((int) 2.4) / 2 is equal to 1.2. True False c) An if statement must always be followed by an else statement. True False Object Oriented Programming d) A Java class can inherit from multiple classes. True False e) An object is an instantiation of a class. True False f) An Interface cannot include method implementations. True False g) Anonymous inner classes are useful for passing code to methods. True False Abstract Data Types h) A binary search tree can be used to implement a set. True False i) A linked list is an efficient way to implement a map. True False j) An array can be used to implement a list. True False Complexity k) Finding an element in a well-designed hash table is O(1). True False l) Finding an element in a linked list is O(Log N). True False Software Engineering m) Test driven development begins with a test that fails. True False n) A mercurial changeset that has two children indicates a branch. True False o) Formal verification is important for safety critical software. True False Q2 /10 Page 3 of 14 - INTRODUCTION TO SOFTWARE SYSTEMS ( COMP1110/COMP1140/COMP1510/COMP6710 )
4 Question 3 [35 Marks] Software development This question concerns a small piece of software for keeping track of stock in a grocery store. The software will reduce stock each time stock is sold, increase stock each time new stock arrives, and correct stock levels every time a careful count is made of the actual stock on the store s shelves (this activity is called a stock take ). Each item for sale is called a product. Every product has: a string that uniquely identifies it called a stock-keeping unit or SKU (e.g. 473C2D ); a target stock level, a current stock level; and a name, a human-readable string that describes it (e.g. Vegemite, 500g, or Apple, Granny Smith ). There are two categories of item: unit items and bulk produce. Unit items are sold by count (e.g. 2 jars of jam), and stock is counted in units. Bulk items are sold by weight (e.g. 450g of apples), and stock is counted in kilograms (and may be fractions). Your client is a grocer who has asked you to write software that has the following public interface: public interface StockManager { * A new product has been introduced sku The product s sku name The product s name price The product s price (per unit for units or per kg for bulk) bulk True if the item is a bulk item, false if it is a unit item public void newitem(string sku, String name, double price, boolean bulk); * An product has been sold; reduce current stock accordingly. sku The product s sku sold The quantity sold public void sale(string sku, double sold); * New stock has arrived; increase current stock accordingly. sku The product s sku added The quantity newly arrived public void addstock(string sku, double added); * Set the target amount of stock for a product. sku The item s sku target The target quantity desired to be held in stock public void targetstock(string sku, double target); * Stock has been carefully counted. Set current stock correctly. sku The product s sku actual The quantity actually in the store The stock loss or gain (new current old current) public double stocktake(string sku, double actual); * Print one line for each item in the store with the SKU, the name, * and the amount needed to reach the target stock level. public void printorderreport(); Page 4 of 14 - INTRODUCTION TO SOFTWARE SYSTEMS ( COMP1110/COMP1140/COMP1510/COMP6710 )
5 3 i) [10 Marks] In the space below, draw a UML class diagram for your class MyStockManager (which implements the StockManager interface), and any other classes that your class will depend on, excepting those classes that are part of the standard Java library (e.g. String, etc). /10 Page 5 of 14 - INTRODUCTION TO SOFTWARE SYSTEMS ( COMP1110/COMP1140/COMP1510/COMP6710 )
6 3 ii) [5 Marks] In the space below, write a declaration of MyStockManager, including all of its fields, but excluding all methods. This should be consistent with the UML diagram for the class in 3i). /5 3 iii) [5 Marks] In the space below, write an implementation of the newitem() method. public void newitem(string sku, String name, double price, boolean bulk) { /5 3 iv) [5 Marks] In the space below, write an implementation of the sale() method. public void sale(string sku, double sold) { /5 Page 6 of 14 - INTRODUCTION TO SOFTWARE SYSTEMS ( COMP1110/COMP1140/COMP1510/COMP6710 )
7 3 v) [5 Marks] In the space below, write a unit test for the sale() method from 3 public void saletest() { /5 3 vi) [5 Marks] In the space below, write an implementation of the printorderreport() method. public void printorderreport() { /5 Q3 /35 Page 7 of 14 - INTRODUCTION TO SOFTWARE SYSTEMS ( COMP1110/COMP1140/COMP1510/COMP6710 )
8 Question 4. [20 Marks] Abstract data types Consider the following skeleton implementation of a simple list ADT based on an array. public class ArrayList<V> { static final int INITIAL_SIZE = 4; static final double GROWTH_FACTOR = 1.5; int elements = 0; // the number of elements in our list V[] values = (V[]) new Object[INITIAL_SIZE]; * Add a value to the tail of the list. value The value to be added. public void add(v value) { /* unimplemented * Remove the value at the specified index from the list. index public void remove(int index) { /* unimplemented index The value at the specified index. public V get(int index) { if (index >= elements index < 0) throw new IndexOutOfBoundsException(); return values[index]; * Reverse the order of the elements of the list. public void reverse() { /* unimplemented Page 8 of 14 - INTRODUCTION TO SOFTWARE SYSTEMS ( COMP1110/COMP1140/COMP1510/COMP6710 )
9 4 i) [7 Marks] In the space below, provide an implementation of the missing add(v value) method. /7 4 ii) [7 Marks] In the space below, provide an implementation of the missing remove(int index) method. /7 Page 9 of 14 - INTRODUCTION TO SOFTWARE SYSTEMS ( COMP1110/COMP1140/COMP1510/COMP6710 )
10 4 iii) [6 Marks] In the space below, provide an implementation of the missing reverse() method. /6 Q4 /20 Page 10 of 14 - INTRODUCTION TO SOFTWARE SYSTEMS ( COMP1110/COMP1140/COMP1510/COMP6710 )
11 Question 5 [15 Marks] Threads, Complexity, and Grammars 5 i) [5 Marks] Describe a situation in which a race condition is likely to arise. /5 5 ii) [5 Marks] Discuss the computational complexity of using a linked list to implement a set. Use big-o notation in your answer. /5 5 iii) [2 Marks] Define an EBNF grammar for four-digit binary numbers (e.g. 1010, 1111, 0001, 1000, etc). /2 5 iv) [3 Marks] Define an EBNF grammar for dates, in the format dd/mm/yy (e.g. 02/11/12, 31/10/11 etc). /3 Q5 /15 Page 11 of 14 - INTRODUCTION TO SOFTWARE SYSTEMS ( COMP1110/COMP1140/COMP1510/COMP6710 )
12 Question 6 [10 Marks] You must answer only one of 6a) or 6b), choosing according to your degree program. 6 a) (COMP1110, COMP1140, COMP6710 students only) Use the space below to discuss the strengths and weaknesses of Java as a general purpose programming language. Your discussion should contain five major points that you clearly identify. Draw comparisons with other languages where appropriate. 6 b) (COMP1510 students only) In 1996, a $500M Ariane rocket self-destructed on launch. A report concluded that a program segment for converting a floating point number to a signed 16 bit integer was executed with an input data value outside the range representable by a signed 16 bit integer. Use the space below to discuss what lessons this incident offers software engineers. Your discussion should structured around five clearly identified major points. Please circle your degree program: COMP1110 COMP1140 COMP1510 COMP6710 Q6 /10 Page 12 of 14 - INTRODUCTION TO SOFTWARE SYSTEMS ( COMP1110/COMP1140/COMP1510/COMP6710 )
13 You may use this box as extra space for completing answers to previous questions. Please indicate clearly which question(s) you are continuing. Q1 Q2 Q3 Q4 Q5 Q6 Page 13 of 14 - INTRODUCTION TO SOFTWARE SYSTEMS ( COMP1110/COMP1140/COMP1510/COMP6710 )
14 You may use this box as extra space for completing answers to previous questions. Please indicate clearly which question(s) you are continuing. Q1 Q2 Q3 Q4 Q5 Q6 Page 14 of 14 - INTRODUCTION TO SOFTWARE SYSTEMS ( COMP1110/COMP1140/COMP1510/COMP6710 )
Array Based Lists. Collections
Array Based Lists Reading: RS Chapter 15 1 Collections Data structures stores elements in a manner that makes it easy for a client to work with the elements Specific collections are specialized for particular
More informationLesson 2.4 Arraylist
Lesson 24 Arraylist Mimi Duong Rosalba Rodriguez Java Crash Course January 6th, 2015 Data Structure ArrayLists Live Coding Methods Searching Through ArrayLists Classwork Storing Items in Java How have
More informationData abstractions: ADTs Invariants, Abstraction function. Lecture 4: OOP, autumn 2003
Data abstractions: ADTs Invariants, Abstraction function Lecture 4: OOP, autumn 2003 Limits of procedural abstractions Isolate implementation from specification Dependency on the types of parameters representation
More informationModule Contact: Dr Geoff McKeown, CMP Copyright of the University of East Anglia Version 2
UNIVERSITY OF EAST ANGLIA School of Computing Sciences Main Series UG Examination 2012-13 PROGRAMMING 1 CMPC1M0Y Time allowed: 2 hours Section A (Attempt all questions: 80 marks) Section B (Attempt one
More information1. Which of the following is the correct expression of character 4? a. 4 b. "4" c. '\0004' d. '4'
Practice questions: 1. Which of the following is the correct expression of character 4? a. 4 b. "4" c. '\0004' d. '4' 2. Will System.out.println((char)4) display 4? a. Yes b. No 3. The expression "Java
More informationExam Duration: 2hrs and 30min Software Design
Exam Duration: 2hrs and 30min. 433-254 Software Design Section A Multiple Choice (This sample paper has less questions than the exam paper The exam paper will have 25 Multiple Choice questions.) 1. Which
More informationJAVA OPERATORS GENERAL
JAVA OPERATORS GENERAL Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups: Arithmetic Operators Relational Operators Bitwise Operators
More informationFinal Exam. COMP Summer I June 26, points
Final Exam COMP 14-090 Summer I 2000 June 26, 2000 200 points 1. Closed book and closed notes. No outside material allowed. 2. Write all answers on the test itself. Do not write any answers in a blue book
More informationCS165 Practice Final Exam
CS165 Practice Final Exam I, the undersigned, do hereby affirm that the work contained in this exam is solely my own, and that none of the results were achieved by cheating. This includes using automated
More informationCONCORDIA UNIVERSITY Summer 2005 Comp 248 /1 Section AA Introduction to Programming Final Examination/A
NAME: ID: CONCORDIA UNIVERSITY Summer 2005 Comp 248 /1 Section AA Introduction to Programming Final Examination/A Instructor: N. Acemian Monday June 27, 2005 Duration: 3 hours INSTRUCTIONS: - Answer all
More informationEXAMINATIONS 2011 Trimester 2, MID-TERM TEST. COMP103 Introduction to Data Structures and Algorithms SOLUTIONS
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW V I C T O R I A UNIVERSITY OF WELLINGTON Student ID:....................... EXAMINATIONS 2011 Trimester 2, MID-TERM TEST COMP103 Introduction
More informationObject- Oriented Analysis, Design and Programming
Object- Oriented Analysis, Design and Programming Medialogy, Semester 4 Monday 19 April 2010 9.00 12.00 You have 3 hours to complete this examination. Neither written material nor electronic equipment
More informationSummer Final Exam Review Session August 5, 2009
15-111 Summer 2 2009 Final Exam Review Session August 5, 2009 Exam Notes The exam is from 10:30 to 1:30 PM in Wean Hall 5419A. The exam will be primarily conceptual. The major emphasis is on understanding
More informationCSE 142, Spring 2009, Sample Final Exam #2. Good luck!
CSE 142, Spring 2009, Sample Final Exam #2 Name: Section: Student ID #: TA: Rules: You have 110 minutes to complete this exam. You will receive a deduction if you keep working after the instructor calls
More informationTHE UNIVERSITY OF WESTERN AUSTRALIA. School of Computer Science & Software Engineering CITS1001 OBJECT-ORIENTED PROGRAMMING AND SOFTWARE ENGINEERING
THE UNIVERSITY OF WESTERN AUSTRALIA School of Computer Science & Software Engineering CITS1001 OBJECT-ORIENTED PROGRAMMING AND SOFTWARE ENGINEERING MID-SEMESTER TEST Semester 1, 2012 CITS1001 This Paper
More informationPrelim 1. CS 2110, October 1, 2015, 5:30 PM Total Question Name True Short Testing Strings Recursion
Prelim 1 CS 2110, October 1, 2015, 5:30 PM 0 1 2 3 4 5 Total Question Name True Short Testing Strings Recursion False Answer Max 1 20 36 16 15 12 100 Score Grader The exam is closed book and closed notes.
More informationCS165 Practice Final Exam Answer Key
CS165 Practice Final Exam Answer Key I, the undersigned, do hereby affirm that the work contained in this exam is solely my own, and that none of the results were achieved by cheating. This includes using
More informationExam 1 CSCI 2600 Principles of Software October 6, 2015
NAME Exam 1 CSCI 2600 Principles of Software October 6, 2015 - DO NOT OPEN THIS EXAM UNTIL TOLD TO DO SO! - READ THROUGH THE ENTIRE EXAM BEFORE STARTING TO WORK. - YOU ARE ALLOWED ONLY 2 CHEAT PAGES. NO
More informationUniversity of Cape Town Department of Computer Science. Computer Science CSC115F
University of Cape Town Department of Computer Science Computer Science CSC115F June 2003 Final Exam Answer all questions. All questions that refer to elements of programming make reference to the Java
More informationInstructions. Definitions. Name: CMSC 341 Fall Question Points I. /12 II. /30 III. /10 IV. /12 V. /12 VI. /12 VII.
CMSC 341 Fall 2013 Data Structures Final Exam B Name: Question Points I. /12 II. /30 III. /10 IV. /12 V. /12 VI. /12 VII. /12 TOTAL: /100 Instructions 1. This is a closed-book, closed-notes exam. 2. You
More informationCS 151. Linked Lists, Recursively Implemented. Wednesday, October 3, 12
CS 151 Linked Lists, Recursively Implemented 1 2 Linked Lists, Revisited Recall that a linked list is a structure that represents a sequence of elements that are stored non-contiguously in memory. We can
More informationCSCI 136 Written Exam #0 Fundamentals of Computer Science II Spring 2015
CSCI 136 Written Exam #0 Fundamentals of Computer Science II Spring 2015 Name: This exam consists of 6 problems on the following 7 pages. You may use your single-sided handwritten 8 ½ x 11 note sheet during
More informationCSCI 201L Final Written SOLUTION. 13% of course grade
SOLUTION 13% of course grade 1. Generics C++ has had templates long before Java even existed as a language. When Java was created, there were no templates or generics. It wasn t until many years and many
More informationCS 146 Spring 2017 Homework 4 Sections 5 and 6. The homework assignment is available at:
The homework assignment is available at: http://www.jennylam.cc/courses/146-s17/homework04.html 1. Here is a working Java solution which runs in linear time in the total length of the input lists. /**
More informationCSI 1100 / 1500 Fall 2004 Introduction to Computer Science I Final Examination
CSI 1100 / 1500 Final Examination Page 1 of 13 CSI 1100 / 1500 Fall 2004 Introduction to Computer Science I Final Examination Duration : 3 hours 09:30 December 9, 2004 Professors: Alan Williams, Daniel
More informationCMPS 12A - Winter 2002 Midterm 2 March 5, Name: ID:
CMPS 12A - Winter 2002 Midterm 2 March 5, 2002 Name: ID: This is a closed note, closed book exam. Any place where you are asked to write code, you must declare all variables that you use. However, I just
More informationENGR 2710U Midterm Exam UOIT SOLUTION SHEET
SOLUTION SHEET ENGR 2710U: Object Oriented Programming & Design Midterm Exam October 19, 2012, Duration: 80 Minutes (9 Pages, 14 questions, 100 Marks) Instructor: Dr. Kamran Sartipi Name: Student Number:
More informationCS 200 Objects and ArrayList Jim Williams, PhD
CS 200 Objects and ArrayList Jim Williams, PhD This Week 1. Academic Integrity 2. BP1: Milestone 2 due this week 3. Team Lab: Multi-Dimensional Arrays a. Bring paper and pencil to draw diagrams. b. Code
More informationAP CS Unit 7: Interfaces Exercises 1. Select the TRUE statement(s).
AP CS Unit 7: Interfaces Exercises 1. Select the TRUE statement(s). a) This code will not compile because a method cannot specify an interface as a parameter. public class Testing { public static void
More informationPrelim 2. CS 2110, November 20, 2014, 7:30 PM Extra Total Question True/False Short Answer
Prelim 2 CS 2110, November 20, 2014, 7:30 PM 1 2 3 4 5 Extra Total Question True/False Short Answer Complexity Induction Trees Graphs Extra Credit Max 20 10 15 25 30 5 100 Score Grader The exam is closed
More informationJava Review: Objects
Outline Java review Abstract Data Types (ADTs) Interfaces Class Hierarchy, Abstract Classes, Inheritance Invariants Lists ArrayList LinkedList runtime analysis Iterators Java references 1 Exam Preparation
More informationUniversity of Cape Town ~ Department of Computer Science Computer Science 1015F ~ June Exam
Name: Please fill in your Student Number and Name. Student Number : Student Number: University of Cape Town ~ Department of Computer Science Computer Science 1015F ~ 2009 June Exam Question Max Internal
More informationJava Simple Data Types
Intro to Java Unit 1 Multiple Choice Test Key Java Simple Data Types This Test Is a KEY DO NOT WRITE ON THIS TEST This test includes program segments, which are not complete programs. Answer such questions
More informationCSCI 135 Exam #2 Fundamentals of Computer Science I Fall 2013
CSCI 135 Exam #2 Fundamentals of Computer Science I Fall 2013 Name: This exam consists of 6 problems on the following 6 pages. You may use your two-sided hand-written 8 ½ x 11 note sheet during the exam.
More informationCSE 201 JAVA PROGRAMMING I. Copyright 2016 by Smart Coding School
CSE 201 JAVA PROGRAMMING I Primitive Data Type Primitive Data Type 8-bit signed Two s complement Integer -128 ~ 127 Primitive Data Type 16-bit signed Two s complement Integer -32768 ~ 32767 Primitive Data
More informationFinal Score ID Extra Credit. 10% of course grade
Name Final Score ID Extra Credit Section (circle one): MW 8:30-9:50 TTh 9:30-10:50 TTh 11:00-12:20 10% of course grade 1. Inner Classes Anonymous inner classes are very commonly used with event-driven
More informationCS 231 Data Structures and Algorithms, Fall 2016
CS 231 Data Structures and Algorithms, Fall 2016 Dr. Bruce A. Maxwell Department of Computer Science Colby College Course Description Focuses on the common structures used to store data and the standard
More informationCS 110 Practice Final Exam originally from Winter, Instructions: closed books, closed notes, open minds, 3 hour time limit.
Name CS 110 Practice Final Exam originally from Winter, 2003 Instructions: closed books, closed notes, open minds, 3 hour time limit. There are 4 sections for a total of 49 points. Part I: Basic Concepts,
More informationCS 101 Spring 2007 Midterm 2 Name: ID:
You only need to write your name and e-mail ID on the first page. This exam is CLOSED text book, closed-notes, closed-calculator, closed-neighbor, etc. Questions are worth different amounts, so be sure
More informationBig O & ArrayList Fall 2018 Margaret Reid-Miller
Big O & ArrayList 15-121 Fall 2018 Margaret Reid-Miller Today Exam 1: Thursday, Oct 4, 2018 Exam 2 date: Currently Thur. Oct 25 th Move to Tues Oct 30 or Thur Nov 1? (Withdraw deadline Tues Nov 6.) Homework
More informationCSEN202: Introduction to Computer Science Spring Semester 2017 Midterm Exam
Page 0 German University in Cairo April 6, 2017 Media Engineering and Technology Faculty Prof. Dr. Slim Abdennadher CSEN202: Introduction to Computer Science Spring Semester 2017 Midterm Exam Bar Code
More informationJava provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups:
Basic Operators Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups: Arithmetic Operators Relational Operators Bitwise Operators
More informationCSCI 135 Exam #2 Fundamentals of Computer Science I Fall 2013
CSCI 135 Exam #2 Fundamentals of Computer Science I Fall 2013 Name: This exam consists of 6 problems on the following 6 pages. You may use your two-sided hand-written 8 ½ x 11 note sheet during the exam.
More informationINSTRUCTIONS TO CANDIDATES
NATIONAL UNIVERSITY OF SINGAPORE SCHOOL OF COMPUTING MIDTERM ASSESSMENT FOR Semester 2 AY2017/2018 CS2030 Programming Methodology II March 2018 Time Allowed 90 Minutes INSTRUCTIONS TO CANDIDATES 1. This
More informationSolution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring Instructions:
VIRG INIA POLYTECHNIC INSTITUTE AND STATE U T PROSI M UNI VERSI TY Instructions: Print your name in the space provided below. This examination is closed book and closed notes, aside from the permitted
More informationSelenium Class 9 - Java Operators
Selenium Class 9 - Java Operators Operators are used to perform Arithmetic, Comparison, and Logical Operations, Operators are used to perform operations on variables and values. public class JavaOperators
More informationCSE143 Summer 2008 Final Exam Part B KEY August 22, 2008
CSE143 Summer 2008 Final Exam Part B KEY August 22, 2008 Name : Section (eg. AA) : TA : This is an open-book/open-note exam. Space is provided for your answers. Use the backs of pages if necessary. The
More informationREAD AND OBSERVE THE FOLLOWING RULES:
This examination has 11 pages: check that you have a complete paper. Check that you have a complete paper. Each candidate should be prepared to produce, upon request, his or her SUNY/UB card. This is a
More informationFall CS 101: Test 2 Name UVA ID. Grading. Page 1 / 4. Page3 / 20. Page 4 / 13. Page 5 / 10. Page 6 / 26. Page 7 / 17.
Grading Page 1 / 4 Page3 / 20 Page 4 / 13 Page 5 / 10 Page 6 / 26 Page 7 / 17 Page 8 / 10 Total / 100 1. (4 points) What is your course section? CS 101 CS 101E Pledged Page 1 of 8 Pledged The following
More informationBuilding Java Programs
Building Java Programs Chapter 15 Lecture 15-1: Implementing ArrayIntList reading: 15.1-15.3 Recall: classes and objects class: A program entity that represents: A complete program or module, or A template
More informationFinal Exam May 21, 2003
1.00 Introduction to Computers and Engineering Problem Solving Final Exam May 21, 2003 Name: Email Address: TA: Section: You have three hours to complete this exam. For coding questions, you do not need
More informationExam 1 CSCI 2600 Principles of Software October 6, 2015
NAME Exam 1 CSCI 2600 Principles of Software October 6, 2015 - DO NOT OPEN THIS EXAM UNTIL TOLD TO DO SO! - READ THROUGH THE ENTIRE EXAM BEFORE STARTING TO WORK. - YOU ARE ALLOWED ONLY 2 CHEAT PAGES. NO
More informationCsci 102: Sample Exam
Csci 102: Sample Exam Duration: 65 minutes Name: NetID: Student to your left: Student to your right: DO NOT OPEN THIS EXAM UNTIL INSTRUCTED Instructions: Write your full name and your NetID on the front
More informationCOMP 250 Midterm #2 March 11 th 2013
NAME: STUDENT ID: COMP 250 Midterm #2 March 11 th 2013 - This exam has 6 pages - This is an open book and open notes exam. No electronic equipment is allowed. 1) Questions with short answers (28 points;
More information1.00 Introduction to Computers and Engineering Problem Solving Quiz 1 March 4, 2005
1.00 Introduction to Computers and Engineering Problem Solving Quiz 1 March 4, 2005 Name: E-mail Address: TA: Section: You have 80 minutes to complete this exam. For coding questions, you do not need to
More informationCSCI 136 Written Exam #1 Fundamentals of Computer Science II Spring 2012
CSCI 136 Written Exam #1 Fundamentals of Computer Science II Spring 2012 Name: This exam consists of 5 problems on the following 8 pages. You may use your double- sided hand- written 8 ½ x 11 note sheet
More informationIn addition to the correct answer, you MUST show all your work in order to receive full credit.
In addition to the correct answer, you MUST show all your work in order to receive full credit. Questions Mark: Question1) Multiple Choice Questions /10 Question 2) Binary Trees /15 Question 3) Linked
More informationPractice Questions for Final Exam: Advanced Java Concepts + Additional Questions from Earlier Parts of the Course
: Advanced Java Concepts + Additional Questions from Earlier Parts of the Course 1. Given the following hierarchy: class Alpha {... class Beta extends Alpha {... class Gamma extends Beta {... In what order
More informationProgramming Basics. Digital Urban Visualization. People as Flows. ia
Programming Basics Digital Urban Visualization. People as Flows. 28.09.2015 ia zuend@arch.ethz.ch treyer@arch.ethz.ch Programming? Programming is the interaction between the programmer and the computer.
More informationCSCI 136 Written Exam #1 Fundamentals of Computer Science II Spring 2013
CSCI 136 Written Exam #1 Fundamentals of Computer Science II Spring 2013 Name: This exam consists of 5 problems on the following 6 pages. You may use your double-sided hand-written 8 ½ x 11 note sheet
More informationCSCI 201L Written Exam #2. 10% of course grade
Name Final Score ID Extra Credit Section (circle one): MW 3:30-6:30 CSCI 201L Written Exam #2 10% of course grade 1. Anonymous Inner Classes In lecture we walked through the following: 1. Having two classes
More informationCOMP 401 Spring 2014 Midterm 1
COMP 401 Spring 2014 Midterm 1 I have not received nor given any unauthorized assistance in completing this exam. Signature: Name: PID: Please be sure to put your PID at the top of each page. This page
More informationComposite Pattern - Shapes Example - Java Sourcecode
Composite Pattern - Shapes Example - Java Sourcecode In graphics editors a shape can be basic or complex. An example of a simple shape is a line, where a complex shape is a rectangle which is made of four
More informationPrelim 2 Solutions. CS 2110, November 20, 2014, 7:30 PM Extra Total Question True/False Short Answer
Prelim 2 Solutions CS 2110, November 20, 2014, 7:30 PM 1 2 3 4 5 Extra Total Question True/False Short Answer Complexity Induction Trees Graphs Extra Credit Max 20 10 15 25 30 5 100 Score Grader The exam
More informationUniversity of Palestine. Mid Exam Total Grade: 100
First Question No. of Branches (5) A) Choose the correct answer: 1. If we type: system.out.println( a ); in the main() method, what will be the result? int a=12; //in the global space... void f() { int
More informationAP Computer Science A
2017 AP Computer Science A Sample Student Responses and Scoring Commentary Inside: RR Free Response Question 1 RR Scoring Guideline RR Student Samples RR Scoring Commentary 2017 The College Board. College
More informationIntroduction to Computing II (ITI 1121) Final Examination
Introduction to Computing II (ITI 1121) Final Examination Instructor: Marcel Turcotte April 2010, duration: 3 hours Identification Student name: Student number: Signature: Instructions 1. 2. 3. 4. 5. 6.
More informationComputer Science II (20082) Week 1: Review and Inheritance
Computer Science II 4003-232-08 (20082) Week 1: Review and Inheritance Richard Zanibbi Rochester Institute of Technology Review of CS-I Syntax and Semantics of Formal (e.g. Programming) Languages Syntax
More informationCS134 Spring 2005 Final Exam Mon. June. 20, 2005 Signature: Question # Out Of Marks Marker Total
CS134 Spring 2005 Final Exam Mon. June. 20, 2005 Please check your tutorial (TUT) section from the list below: TUT 101: F 11:30, MC 4042 TUT 102: M 10:30, MC 4042 TUT 103: M 11:30, MC 4058 TUT 104: F 10:30,
More informationCSE 143 Lecture 26. Advanced collection classes. (ADTs; abstract classes; inner classes; generics; iterators) read 11.1, 9.6, ,
CSE 143 Lecture 26 Advanced collection classes (ADTs; abstract classes; inner classes; generics; iterators) read 11.1, 9.6, 15.3-15.4, 16.4-16.5 slides created by Marty Stepp, adapted by Alyssa Harding
More informationCS 307 Midterm 2 Spring 2008
Points off 1 2 3 4 Total off Net Score Exam Number: CS 307 Midterm 2 Spring 2008 Name UTEID login name TA's Name: Mario Ruchica Vishvas (Circle One) Instructions: 1. Please turn off your cell phones and
More informationpublic static boolean isoutside(int min, int max, int value)
See the 2 APIs attached at the end of this worksheet. 1. Methods: Javadoc Complete the Javadoc comments for the following two methods from the API: (a) / @param @param @param @return @pre. / public static
More informationKey Java Simple Data Types
AP CS P w Java Unit 1 Multiple Choice Practice Key Java Simple Data Types This test includes program segments, which are not complete programs. Answer such questions with the assumption that the program
More informationFinal Score Name SOLUTION ID Extra Credit. 10% of course grade
Final Score Name SOLUTION ID Extra Credit Section (circle one): MW 8:30-9:50 TTh 9:30-10:50 TTh 11:00-12:20 10% of course grade 1. Inner Classes Anonymous inner classes are very commonly used with event-driven
More informationCSC 240 Computer Science III Spring 2018 Midterm Exam. Name
CSC 240 Computer Science III Spring 2018 Midterm Exam Name Page Points Score 2 9 4-6 53 7-10 38 Total 100 1 P age 1. Tracing programs (1 point each value): For each snippet of Java code on the left, write
More informationCSE331 Winter 2014, Midterm Examination February 12, 2014
CSE331 Winter 2014, Midterm Examination February 12, 2014 Please do not turn the page until 10:30. Rules: The exam is closed-book, closed-note, etc. Please stop promptly at 11:20. There are 100 points
More informationCMSC 331 Second Midterm Exam
1 20/ 2 80/ 331 First Midterm Exam 11 November 2003 3 20/ 4 40/ 5 10/ CMSC 331 Second Midterm Exam 6 15/ 7 15/ Name: Student ID#: 200/ You will have seventy-five (75) minutes to complete this closed book
More informationCsci 102: Sample Exam
Csci 102: Sample Exam Duration: 65 minutes Name: NetID: Student to your left: Student to your right: DO NOT OPEN THIS EXAM UNTIL INSTRUCTED Instructions: Write your full name and your NetID on the front
More informationJava Simple Data Types
Intro to Java Unit 1 Multiple Choice Java Simple Data Types DO NOT WRITE ON THIS TEST This test includes program segments, which are not complete programs. Answer such questions with the assumption that
More informationThe ArrayList class CSC 123 Fall 2018 Howard Rosenthal
The ArrayList class CSC 123 Fall 2018 Howard Rosenthal Lesson Goals Describe the ArrayList class Discuss important methods of this class Describe how it can be used in modeling Much of the information
More informationCSCI 136 Written Exam #1 Fundamentals of Computer Science II Spring 2012
CSCI 136 Written Exam #1 Fundamentals of Computer Science II Spring 2012 Name: This exam consists of 5 problems on the following 8 pages. You may use your double- sided hand- written 8 ½ x 11 note sheet
More informationUMBC CMSC 331 Final Exam Section 0101 December 17, 2002
0 / 0 1 / 20 UMBC CMSC 331 Final Exam Section 0101 December 17, 2002 Name: Student ID#: 2 / 25 3 / 20 4 / 25 5 / 20 6 /40 7 /40 You will have two hours to complete this closed book exam. We reserve the
More information1.00/1.001 Introduction to Computers and Engineering Problem Solving. Final Exam
1.00/1.001 Introduction to Computers and Engineering Problem Solving Final Exam Name: Email Address: TA: Section: You have three hours to complete this exam. For coding questions, you do not need to include
More informationStudent Number: Legibly write your name and student number on this page. Legibly write your name on the back page of this exam.
CSC207H1 S 2015 Midterm Test Duration 50 minutes Aids allowed: none Last Name: Student Number: First Name: Do not turn this page until you have received the signal to start. (Please fill out the identification
More informationComputer Science II (20073) Week 1: Review and Inheritance
Computer Science II 4003-232-01 (20073) Week 1: Review and Inheritance Richard Zanibbi Rochester Institute of Technology Review of CS-I Hardware and Software Hardware Physical devices in a computer system
More informationMidterm Exam 2 CS 455, Spring 2015
Name: USC NetId (e.g., ttrojan): Midterm Exam 2 CS 455, Spring 2015 April 7, 2015 There are 7 problems on the exam, with 60 points total available. There are 8 pages to the exam, including this one; make
More informationCMSC132, Practice Questions
CMSC132, Practice Questions Notice the final exam can include material not covered by the practice questions. You should practice beyond what is covered in this document. Although solutions will not be
More informationCSCI 136 Written Exam #0 Fundamentals of Computer Science II Spring 2013
CSCI 136 Written Exam #0 Fundamentals of Computer Science II Spring 2013 Name: This exam consists of 5 problems on the following 7 pages. You may use your single-side hand-written 8 ½ x 11 note sheet during
More informationPrelim 1. CS 2110, 13 March 2018, 5:30 PM Total Question Name Short answer
Prelim 1 CS 2110, 13 March 2018, 5:30 PM 1 2 3 4 5 6 Total Question Name Short answer Exception handling Recursion OO Loop invariants Max 1 30 11 14 30 14 100 Score Grader The exam is closed book and closed
More informationCS 2334: Programming Structures and Abstractions: Exam 1 October 3, 2016
General instructions: CS 2334: Programming Structures and Abstractions: Exam 1 October 3, 2016 Please wait to open this exam booklet until you are told to do so. This examination booklet has 13 pages.
More informationUniversity of Massachusetts Amherst, Electrical and Computer Engineering
University of Massachusetts Amherst, Electrical and Computer Engineering ECE 122 Midterm Exam 1 Makeup Answer key March 2, 2018 Instructions: Closed book, Calculators allowed; Duration:120 minutes; Write
More informationEXAMINATION INSTRUCTIONS
EXAMINATION INSTRUCTIONS This examination has 6 pages. Check that you have a complete paper. Each candidate should be prepared to produce, upon request, his or her SUNY/UB card. This examination has 5
More informationAlgorithm Efficiency and Big-O
+ Algorithm Efficiency and More List implementations + Algorithm Efficiency and Big-O Section 2.4 1 + Algorithm Efficiency and Big-O n Getting a precise measure of the performance of an algorithm is difficult
More informationCompuScholar, Inc. 9th - 12th grades
CompuScholar, Inc. Alignment to the College Board AP Computer Science A Standards 9th - 12th grades AP Course Details: Course Title: Grade Level: Standards Link: AP Computer Science A 9th - 12th grades
More informationModule Contact: Dr Geoff McKeown, CMP Copyright of the University of East Anglia Version 1
UNIVERSITY OF EAST ANGLIA School of Computing Sciences Main Series UG Examination 2015-16 PROGRAMMING 1 CMP-4008Y Time allowed: 2 hours Section A (Attempt all questions: 80 marks) Section B (Attempt one
More informationTeenCoder : Java Programming (ISBN )
TeenCoder : Java Programming (ISBN 978-0-9887070-2-3) and the AP * Computer Science A Exam Requirements (Alignment to Tennessee AP CS A course code 3635) Updated March, 2015 Contains the new 2014-2015+
More informationCSCI 135 Exam #0 Fundamentals of Computer Science I Fall 2013
CSCI 135 Exam #0 Fundamentals of Computer Science I Fall 2013 Name: This exam consists of 7 problems on the following 6 pages. You may use your single- side hand- written 8 ½ x 11 note sheet during the
More informationExamination Questions Midterm 1
CS1102s Data Structures and Algorithms 10/2/2010 Examination Questions Midterm 1 This examination question booklet has 9 pages, including this cover page, and contains 15 questions. You have 40 minutes
More informationCS 101 Exam 2 Spring Id Name
CS 101 Exam 2 Spring 2005 Email Id Name This exam is open text book and closed notes. Different questions have different points associated with them. Because your goal is to maximize your number of points,
More informationCS 455 Midterm Exam 1 Fall 2016 [Bono] Thursday, Sept. 29, 2016
Name: USC NetID (e.g., ttrojan): CS 455 Midterm Exam 1 Fall 2016 [Bono] Thursday, Sept. 29, 2016 There are 5 problems on the exam, with 56 points total available. There are 10 pages to the exam (5 pages
More information