CS 132 Midterm Exam Fall 2004

Size: px
Start display at page:

Download "CS 132 Midterm Exam Fall 2004"

Transcription

1 Date:1-Nov-2004 Time:7:00-9:00p.m. Permitted Aids:None CS 132 Midterm Exam Fall 2004 Please complete this page in ink. Last Name: Signature: First Name: ID: Please check off your Practicum Section: Dana Mohaplova 101, W 2:30 102, Th 10:30 unsure Instructions: (Read carefully before the exam begins): Question Max. Marks 1. Before you begin, make certain that you have one booklet with pages numbered 1-18 printed double-sided and a 1 page Reference Page of Selected Documentation. 2. The marks assigned to each question are shown at the beginning of the question; use this information to organize your time effectively. 3. Place all your answers in the spaces provided on these pages. Use the spaces as an indication of the length of answer expected. Use the last page for extra space if you need it, but clearly indicate this if you do so. Part I Marks Given Grader Initials 4. You do not need to document your code unless it is specifically required by the question. 5. Questions will not be interpreted. Proctors will only confirm or deny errors in the questions. If you consider the wording of a question to be ambiguous, state your assumptions clearly and proceed to answer the question to the best of your ability. You may not trivialize the problem in your assumptions. 6. Cheating is an academic offense. Your signature on this exam indicates that you understand and agree to the University s policies regarding cheating on exams Total 75

2 Part I: Multiple Choice Questions Answer the questions in Part I on the provided bubble card. For each question, select the single best answer. 1. Testing can only start after the implementation is complete. a) True b) False 2. Design Architecture and Integration Testing are parts of the Software Life Cycle. a) True b) False 3. An array is a sequence of values of the same type. a) True b) False 4. To store primitive type values in an array, you must use wrapper classes. a) True b) False 5. Two- dimensional arrays always have the same numbers of rows as columns. a) True b) False 6. When you throw an Error, the current method terminates immediately. a) True b) False Page 2 of 18

3 Name: 7. Which of the object diagrams illustrates the effect of the following statements? int[] grades = new int[5]; double lowest = 36; grades[0] = lowest; for(int i=1; i<5; i++) { grades[i] = 36; grades grades lowest lowest a) b) grades grades lowest lowest 36 c) d) e) None of the above pictures illustrates the statements. Page 3 of 18

4 8. Which set of statements represents the given object diagram? String name value Joe all String value Joe a) b) c) d) String name = new String( Joe ); String[] all = new String[3]; all[0] = name; all[1] = name; all[2] = name; String name = Joe ; String[] all; all[0] = Joe ; all[1] = Joe ; all[2] = Joe ; String name = Joe ; String[] all; all[0] = Joe ; all[1] = name; all[2] = all[0]; String name = new String( Joe ); String[] all = new String[3]; all[0] = new String( Joe ); all[1] = name; all[2] = all[0]; e) Both c) and d) are correct. Page 4 of 18

5 9. What is the output of the following program? Name: public class Exam extends Object { private String course = "noname"; private static int count = 0; private int courseid = 100; a) b) c) d) public Exam(String name) { super(); this.course = name; Exam.count++; this.courseid++; public void printexam() { System.out.println(courseID + ";" + course + ";" + count); public static void main(string[] args) { int numofstudents = 3; for(int i=0; i<numofstudents; i++) { Exam e = new Exam ("cs132_" + i); e.printexam(); 101;cs132_0;1 101;cs132_0;1 101;cs132_0;1 101;cs132_0;1 101;cs132_1;1 101;cs132_2;1 101;cs132_0;1 101;cs132_1;2 101;cs132_2;3 101;cs132_0;1 102;cs132_1;2 103;cs132_2;3 e) None of the above. Page 5 of 18

6 10. Consider the following Boolean expression where done is a boolean variable and x, y and z are integers (assume all variables are appropriately initialized): result =!((x<y && done) (x>0)) Which of the following expressions is/are equivalent to result? i. (!(x<y)!done) (x<=0) ii.!(x<y && done) &&!(x>0) iii.!(x<y)!done &&!(x>0) a) i b) ii c) iii d) Both b) and c) are correct. e) None of the above. 11. What is the output of the following code fragment? char[][] arrchar = new char[6][3]; for(int i=0; i<6; i++) { for(int j=0; j<3; j++) { arrchar[i][j] = 'A'; for(int k=0; k<arrchar.length; k++) { System.out.print(arrChar[k].length + " "); System.out.print("\n"); a) b) c) A A A A A A d) A A A e) None of the above. Page 6 of 18

7 Name: 12. Assume that the 2D array of integers mystery has been initialized with the following values: mystery What is the output of the following code fragment? a) b) c) d) e) for(int m=0; m<3; m++) { System.out.print(mystery[m][m] + " "); System.out.print("\n"); Page 7 of 18

8 Part II: A Telephone Directory Program 1. [13] You have a client named Anne, who wants to store a simple phone directory in her computer. She wants to use it for storage and retrieval of names and numbers. A data file that contains the names and numbers of her friends already exists. Anne wants to be able to insert new numbers, change the number for an entry, and retrieve selected telephone numbers. She also wants to save any changes to her data file. a. [3] Identify and write three use cases for the telephone directory program. b. [2] Identify two classes (besides a UserInterface) that should be a part of the solution. Page 8 of 18

9 Name: c. [8] Draw a class diagram for the two classes you identified in part b. Identify a constructor, at least one instance variable and at least two services, including the return values and needed parameters, for each class. You do not need to show the relationship of these classes. Page 9 of 18

10 Part III: The DoubleList Class 2. [8] Consider a class DoubleList that stores doubles. The partially filled array elements is used to store the data. The array can be resized as necessary. DoubleList provides the following services: Service Purpose Usage Example get Returns the element at the specified index. int val = dlist.get(3); size Returns the number of elements in the list. if (dlist.size() > 10) isempty Returns true if the list has zero elements, if (dlist.isempty()) false otherwise. clear Removes all elements from the list. dlist.clear(); indexof Returns the first index where the given value int p = this. indexof(10.5); can be found, -1 if it isn t present. add Add the given element to the end of the list. dlist.add(9.8); delete Delete the data at the given position. The order of the array need not be preserved. dlist.delete(2); public class DoubleList extends Object { private static final int INITIAL_SIZE = 30; private double[] elements = new double[initial_size]; private int numelements = 0; public DoubleList() { super(); //all other methods are implemented here a. [2] Write a signature for a new method of the DoubleList class called allsmallerthan which addresses the following use case: Determine and return all numbers that are smaller than a given number. Page 10 of 18

11 Name: b. [6] Implement a helper method called resizelist (see the signature below) which increases or decreases the size of the array to a given size and keeps all its elements unchanged. If the number of valid elements in the array is bigger than newlength, the method throws an Error with the error message "Cannot resize the list". private void resizelist(int newlength) { Page 11 of 18

12 3. [11] John, a first year student, was asked to familiarize himself with the services of the DoubleList class. Inside the main method of DoubleList, he was instructed to write some code that prints out every second item in the list. public class DoubleList extends Object { // instance variables, constructor, and methods here public static void main(string[]args) { /* a */ DoubleList testlist = new DoubleList(); for (int i=0; i<10; i++) { testlist.add(i*10); /* b */ // John will put his code here a. [5] Draw an object diagram with the content of the testlist after the code between the comments /* a */ and /* b */ is executed. Page 12 of 18

13 Name: b. [6] The following two code fragments represent John s attempts in accomplishing the task outlined above. For each code fragment, state what the output is. If an error arises or the output does not match the expected output (10.0; 30.0; 50.0; 70.0; 90.0;), briefly explain how to fix the code fragment. Code Fragment 1 for (int i=0; i<testlist.numelements; i++) { int pos = i*2+1; System.out.print(testList.elements[pos] + "; "); Output of Code Fragment 1. Include errors and how to fix them, if any. Code Fragment 2 boolean done = false; int pos = 0; int i = 0; while(!done) { pos = i*2 + 1; if (pos >= testlist.numelements) { done = true; else { System.out.print(testList.elements[pos] + "; "); i++; Output of Code Fragment 2. Include errors and how to fix them, if any. Page 13 of 18

14 Part IV: Using DoubleList 4. [12] Assume your teacher uses DoubleList to store all marks for this exam. She uses it only for computing some statistics, so storing information about the students (other than their marks) is not necessary. She designed the following class: public class MyClass extends Object { DoubleList cs132 = new DoubleList(); public MyClass(String filename) { // constructor implementation here // other methods Input files containing exam marks are of the following format: each line contains a mark, followed by a space, followed by the student s userid. A sample file is shown below abraun 34.5 phsmith 98.1 c2morgan 0 dwhite 66.4 w7lu... One possible file. <mark> <userid> <mark> <userid> <mark> <userid> <mark> <userid> <mark> <userid>... File Format for all files. a. [8] Write the MyClass constructor. It reads all numbers from an input file as described above and stores them in the DoubleList object. Your solution must read the file once only. Assume that the file is properly formatted according to the format given above. public MyClass(String filename) { Page 14 of 18

15 Name: b. [2] Assume for a moment that the DoubleList class is not available. Can the teacher use ArrayList available in the Java package java.util instead? If yes, briefly explain i) if and how the instance variables in MyClass must change and ii) if and how the constructor must change. If no, explain why not. c. [2] If both ArrayList and DoubleList are not available, can she still implement MyClass? If yes, briefly explain i) if and how the instance variables in MyClass must change and ii) if and how the constructor must change. If no, explain why not. Page 15 of 18

16 5. [9] Let us suppose that the teacher wants to remove all zeros from the marks list, because they represent students who did not write the exam. Hence, she designed a method in MyClass called public int didnotwrite() that removes all zeros from the list and returns the number of zeros removed. The method preserves the existing order of the array. This method would be called as in the following (where m is a MyClass object): int numzeros = m.didnotwrite(); List three situations (different than the example below) which should be tested (and passed) to have reasonable evidence that an implemented version of didnotwrite works properly. Also include the type of the situation (i.e. boundary, typical, error) being tested in each call: Values in the list (description of the test) Example: (testing more than one 0 in the list) Expected Result Type of Test typical Page 16 of 18

17 Name: 6. [10] The teacher needs to implement a method of MyClass that will delete a specific item from the list of marks. The method returns true if the item was removed from the list and it returns false otherwise (i.e. the item to delete was not found in the list). The order of items in the list does not need to be preserved. a. [5] Write the pseudo-code for the method body. Use Stepwise Refinement as required. b. [5] Implement the delete method. public class MyClass extends Ojbect { // instance variables, constructor, and other methods here public boolean delete(double item) { Page 17 of 18

18 Extra Space for Rough Work Page 18 of 18

CS 132 Midterm Exam Spring 2004

CS 132 Midterm Exam Spring 2004 Date:22-Jun-2004 Time:7:00-9:00p.m. Permitted Aids:None CS 132 Midterm Exam Spring 2004 Please complete this page in ink. Last Name: Signature: First Name: ID: Please check off your Practicum Section:

More information

CS 122/132 Midterm Exam Winter 2003

CS 122/132 Midterm Exam Winter 2003 Date: 24-Feb-2003 Time: 7:00 pm - 9:00 pm Permitted Aids: None CS 122/132 Midterm Exam Winter 2003 Printed Last Initials: ID: Signature: Please check off your PRActicum section from the list below: Arnie

More information

CS 132 Midterm Exam Winter 2002

CS 132 Midterm Exam Winter 2002 Date: 18-Feb-2002 Time: 7:00 pm - 9:00 pm Permitted Aids: None CS 132 Midterm Exam Winter 2002 Printed Last Name: Initials: ID: Signature: Please check off your PRActicum section from the list below: Byron

More information

CS 132 Final Exam Winter 2005

CS 132 Final Exam Winter 2005 Date:20-April-2005 Time:9:00a.m. - 12:00p.m. Permitted Aids:None CS 132 Final Exam Winter 2005 Place sticker here. Signature: Last Name: First Name: ID: Instructions: (Read carefully before the exam begins):

More information

Section 003 Fall CS 170 Exam 2. Name (print): Instructions:

Section 003 Fall CS 170 Exam 2. Name (print): Instructions: CS 170 Exam 2 Section 003 Fall 2012 Name (print): Instructions: Keep your eyes on your own paper and do your best to prevent anyone else from seeing your work. Do NOT communicate with anyone other than

More information

CS 2334: Programming Structures and Abstractions: Exam 1 October 3, 2016

CS 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 information

CS 367: Introduction to Data Structures Midterm Sample Questions

CS 367: Introduction to Data Structures Midterm Sample Questions LAST NAME (PRINT): FIRST NAME (PRINT): CS 367: Introduction to Data Structures Midterm Sample Questions Friday, July 14 th 2017. 100 points (26% of final grade) Instructor: Meena Syamkumar 1. Fill in these

More information

CS 349 Midterm Exam Spring 2014

CS 349 Midterm Exam Spring 2014 Course Title: User Interfaces Sections: All Instructor: Byron Weber Becker Exam Date: 19-June-2014 Time: 7:00-9:00p.m. Duration: 2 hours Pages: 10 CS 349 Midterm Exam Exam Type: Closed Book Permitted Aids:

More information

CS134 Spring 2005 Final Exam Mon. June. 20, 2005 Signature: Question # Out Of Marks Marker Total

CS134 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 information

Array. Prepared By - Rifat Shahriyar

Array. Prepared By - Rifat Shahriyar Java More Details Array 2 Arrays A group of variables containing values that all have the same type Arrays are fixed length entities In Java, arrays are objects, so they are considered reference types

More information

Question: Total Points: Score:

Question: Total Points: Score: CS 170 Exam 2 Section 002 Fall 2013 Name (print): Instructions: Keep your eyes on your own paper and do your best to prevent anyone else from seeing your work. Do NOT communicate with anyone other than

More information

Write a program that prompts a user to enter the number of students and then, their names and grades. The program will then outputs the average.

Write a program that prompts a user to enter the number of students and then, their names and grades. The program will then outputs the average. Consider Write a program that prompts a user to enter the number of students and then, their names and grades. The program will then outputs the average. in addition, the program will prompt the user for

More information

CS246 Software Abstraction and Specification Final Examination

CS246 Software Abstraction and Specification Final Examination CS246 Software Abstraction and Specification ination Spring 2007 Date: 04-Aug-2007 Time: 4.00 6.30pm Permitted Aids: None 14 pages Student Name: UW Student ID: Instructions: (Read carefully before the

More information

CMSC 433 Section 0101 Fall 2012 Midterm Exam #1

CMSC 433 Section 0101 Fall 2012 Midterm Exam #1 Name: CMSC 433 Section 0101 Fall 2012 Midterm Exam #1 Directions: Test is closed book, closed notes. Answer every question; write solutions in spaces provided. Use backs of pages for scratch work. Good

More information

CSEN202: Introduction to Computer Science Spring Semester 2017 Midterm Exam

CSEN202: 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 information

Last Name: Circle One: OCW Non-OCW

Last Name: Circle One: OCW Non-OCW First Name: AITI 2004: Exam 1 June 30, 2004 Last Name: Circle One: OCW Non-OCW Read Instructions Carefully! This is a 3 hour closed book exam. No calculators are allowed. Please write clearly if we cannot

More information

CSI 1100 / 1500 Fall 2004 Introduction to Computer Science I Final Examination

CSI 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 information

McGill University School of Computer Science COMP-202A Introduction to Computing 1

McGill University School of Computer Science COMP-202A Introduction to Computing 1 McGill University School of Computer Science COMP-202A Introduction to Computing 1 Midterm Exam Thursday, October 26, 2006, 18:00-20:00 (6:00 8:00 PM) Instructors: Mathieu Petitpas, Shah Asaduzzaman, Sherif

More information

CS 110 Practice Final Exam originally from Winter, Instructions: closed books, closed notes, open minds, 3 hour time limit.

CS 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 information

CS 102/107 - Introduction to Programming Midterm Exam #2 - Prof. Reed Spring 2011

CS 102/107 - Introduction to Programming Midterm Exam #2 - Prof. Reed Spring 2011 CS 102/107 - Introduction to Programming Midterm Exam #2 - Prof. Reed Spring 2011 What is your name?: This test has the following sections: I. True/False... 60 points; (30 questions, 2 points each) II.

More information

CS 61B, Summer 2001 Midterm Exam II Professor Michael Olan

CS 61B, Summer 2001 Midterm Exam II Professor Michael Olan CS 61B, Summer 2001 Midterm Exam II Professor Michael Olan Problem 1 (8 points - 1 pt each parts a.-e., 2 pts part f.) a. Consider the following proof: Suppose f(n) is O(g(n)). From this we know that g(n)

More information

CS1083 Week 2: Arrays, ArrayList

CS1083 Week 2: Arrays, ArrayList CS1083 Week 2: Arrays, ArrayList mostly review David Bremner 2018-01-08 Arrays (1D) Declaring and using 2D Arrays 2D Array Example ArrayList and Generics Multiple references to an array d o u b l e prices

More information

The University of Western Ontario Department of Computer Science Computer Science 1026a Midterm Exam 2 hours

The University of Western Ontario Department of Computer Science Computer Science 1026a Midterm Exam 2 hours The University of Western Ontario Department of Computer Science Computer Science 1026a Midterm Exam 2 hours PRINT YOUR NAME: PRINT YOUR STUDENT NUMBER: Do not turn this page until instructed to do so!

More information

SAMPLE EXAM Second Exam Computer Programming 326 Dr. St. John Lehman College City University of New York Thursday, 11 November 2010

SAMPLE EXAM Second Exam Computer Programming 326 Dr. St. John Lehman College City University of New York Thursday, 11 November 2010 SAMPLE EXAM Second Exam Computer Programming 326 Dr. St. John Lehman College City University of New York Thursday, 11 November 2010 NAME (Printed) NAME (Signed) E-mail Exam Rules Show all your work. Your

More information

Midterm Exam 2 CS 455, Spring 2011

Midterm Exam 2 CS 455, Spring 2011 Name: USC loginid (e.g., ttrojan): Midterm Exam 2 CS 455, Spring 2011 March 31, 2011 There are 6 problems on the exam, with 50 points total available. There are 7 pages to the exam, including this one;

More information

York University AK/ITEC OBJECT-BASED PROGRAMMING. Midterm Test Sample. Examiner: S.Y. Chen Duration: One Hour and Fifteen Minutes

York University AK/ITEC OBJECT-BASED PROGRAMMING. Midterm Test Sample. Examiner: S.Y. Chen Duration: One Hour and Fifteen Minutes York University AK/ITEC 1620 3.0 OBJECT-BASED PROGRAMMING Midterm Test Sample Examiner: S.Y. Chen Duration: One Hour and Fifteen Minutes This exam is closed textbook(s) and closed notes. Use of any electronic

More information

I. True/False: (2 points each) On your bubble form fill out a for true and b for false.

I. True/False: (2 points each) On your bubble form fill out a for true and b for false. CS 102/107 - Introduction to Programming Midterm Exam #2 - Prof. Reed Fall 2010 What is your name?: There are three sections: I. True/False..............60 points; (30 questions, 2 points each) II. Multiple

More information

CSC Java Programming, Fall Java Data Types and Control Constructs

CSC Java Programming, Fall Java Data Types and Control Constructs CSC 243 - Java Programming, Fall 2016 Java Data Types and Control Constructs Java Types In general, a type is collection of possible values Main categories of Java types: Primitive/built-in Object/Reference

More information

Dalhousie University CSCI 2132 Software Development Winter 2018 Midterm Examination II March 12 15:37-16:24

Dalhousie University CSCI 2132 Software Development Winter 2018 Midterm Examination II March 12 15:37-16:24 Dalhousie University CSCI 2132 Software Development Winter 2018 Midterm Examination II March 12 15:37-16:24 Student Name: Student ID Number: FCS Username (CSID): Signature: Please Note: These solutions

More information

Arrays and Strings. Arrays - homogeneous indexed collections Selection sort as array example. String class, revisited

Arrays and Strings. Arrays - homogeneous indexed collections Selection sort as array example. String class, revisited Arrays and Strings Arrays - homogeneous indexed collections Selection sort as array example Introduction to complexity analysis String class, revisited 1 Arrays Homogeneous collections of elements of same

More information

Question: Total Points: Score:

Question: Total Points: Score: CS 170 Exam 1 Section 001 Fall 2014 Name (print): Instructions: Keep your eyes on your own paper and do your best to prevent anyone else from seeing your work. Do NOT communicate with anyone other than

More information

CS164: Midterm I. Fall 2003

CS164: Midterm I. Fall 2003 CS164: Midterm I Fall 2003 Please read all instructions (including these) carefully. Write your name, login, and circle the time of your section. Read each question carefully and think about what s being

More information

CS Introduction to Programming Midterm Exam #1 - Prof. Reed Fall 2009

CS Introduction to Programming Midterm Exam #1 - Prof. Reed Fall 2009 CS 102 - Introduction to Programming Midterm Exam #1 - Prof. Reed Fall 2009 What is your name?: There are two sections: I. True/False..................... 60 points; ( 30 questions, 2 points each) II.

More information

CS 455 Midterm Exam 2 Fall 2015 [Bono] Nov. 10, 2015

CS 455 Midterm Exam 2 Fall 2015 [Bono] Nov. 10, 2015 Name: USC NetID (e.g., ttrojan): CS 455 Midterm Exam 2 Fall 2015 [Bono] Nov. 10, 2015 There are 9 problems on the exam, with 54 points total available. There are 8 pages to the exam (4 pages double-sided),

More information

EXAMINATION INSTRUCTIONS

EXAMINATION 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 information

1.00 Introduction to Computers and Engineering Problem Solving. Quiz 1 March 7, 2003

1.00 Introduction to Computers and Engineering Problem Solving. Quiz 1 March 7, 2003 1.00 Introduction to Computers and Engineering Problem Solving Quiz 1 March 7, 2003 Name: Email Address: TA: Section: You have 90 minutes to complete this exam. For coding questions, you do not need to

More information

Lecture 14 CSE11 Fall 2013 For loops, Do While, Break, Continue

Lecture 14 CSE11 Fall 2013 For loops, Do While, Break, Continue Lecture 14 CSE11 Fall 2013 For loops, Do While, Break, Continue General Loops in Java Look at other loop constructions Very common while loop: do a loop a fixed number of times (MAX in the example) int

More information

CMSC 331 Second Midterm Exam

CMSC 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 information

Problem Grade Total

Problem Grade Total CS 101, Prof. Loftin: Final Exam, May 11, 2009 Name: All your work should be done on the pages provided. Scratch paper is available, but you should present everything which is to be graded on the pages

More information

Problem Points Score Grader Total 100

Problem Points Score Grader Total 100 University of Illinois at Urbana-Champaign Department of Computer Science Second Examination Fall 2011 CS 125 Introduction to Computer Science 90 minutes permitted First name: Last name: NetID: @ illinois.edu

More information

CSE 114 Midterm 1. Please leave one seat between yourself and each of your neighbors.

CSE 114 Midterm 1. Please leave one seat between yourself and each of your neighbors. CSE 114 Midterm 1 Please leave one seat between yourself and each of your neighbors. Please place ALL of your final answers on the answer sheet that you were given at the start of the exam. Answers and

More information

Introduction to Computer Science II (CSI 1101)

Introduction to Computer Science II (CSI 1101) Introduction to Computer Science II (CSI 1101) Professor: M. Turcotte February 2002, duration: 75 minutes Identification Student name: last name: Section: Student number: initials: Signature: Instructions

More information

Question: Total Points: Score:

Question: Total Points: Score: CS 170 Exam 2 Section 001 Fall 2014 Name (print): Instructions: Keep your eyes on your own paper and do your best to prevent anyone else from seeing your work. Do NOT communicate with anyone other than

More information

CS 101 Spring 2006 Final Exam Name: ID:

CS 101 Spring 2006 Final Exam Name:  ID: This exam is open text book but closed-notes, closed-calculator, closed-neighbor, etc. Unlike the midterm exams, you have a full 3 hours to work on this exam. Please sign the honor pledge here: Page 1

More information

CS 455 Midterm Exam 1 Fall 2016 [Bono] Thursday, Sept. 29, 2016

CS 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

CS 170 Exam 1. Version: B Fall Name (as on OPUS):

CS 170 Exam 1. Version: B Fall Name (as on OPUS): CS 170 Exam 1 Version: B Fall 2015 Name (as on OPUS): Section: Seat Assignment: Instructions: Keep your eyes on your own paper and do your best to prevent anyone else from seeing your work. Do NOT communicate

More information

CS61BL. Lecture 1: Welcome to CS61BL! Intro to Java and OOP Testing Error-handling

CS61BL. Lecture 1: Welcome to CS61BL! Intro to Java and OOP Testing Error-handling CS61BL Lecture 1: Welcome to CS61BL! Intro to Java and OOP Testing Error-handling About me Name: Edwin Liao Email: edliao@berkeley.edu Office hours: Thursday 3pm - 5pm Friday 11am - 1pm 611 Soda Or by

More information

CS170 Introduction to Computer Science Midterm 2

CS170 Introduction to Computer Science Midterm 2 CS170 Introduction to Computer Science Midterm 2 03/25/2009 Name: Solution You are to honor the Emory Honor Code. This is a closed book and closednotes exam, and you are not to use any other resource than

More information

CS 314 Exam 2 Spring

CS 314 Exam 2 Spring Points off 1 2 3 4 5 Total off CS 314 Exam 2 Spring 2017 Your Name Your UTEID Instructions: 1. There are 5 questions on this test. 100 points available. Scores will be scaled to 200 points. 2. You have

More information

Midterm Exam 2 CS 455, Spring 2015

Midterm 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 information

Practice Midterm Exam. Start with the ones that you consider to be easiest, then move to those that may take more time.

Practice Midterm Exam. Start with the ones that you consider to be easiest, then move to those that may take more time. CS 102 Fall 2008 Instructor: Audrey St. John Practice Midterm Exam General description There are 4 problems, some subdivided into smaller questions. Do as many as you can, or as much of a bigger problem

More information

CS 170 Exam 1. Version: C Fall Name (as on OPUS):

CS 170 Exam 1. Version: C Fall Name (as on OPUS): CS 170 Exam 1 Version: C Fall 2015 Name (as on OPUS): Section: Seat Assignment: Instructions: Keep your eyes on your own paper and do your best to prevent anyone else from seeing your work. Do NOT communicate

More information

CS 116 Week 8 Page 1

CS 116 Week 8 Page 1 CS 116 Week 8: Outline Reading: 1. Dale, Chapter 11 2. Dale, Lab 11 Objectives: 1. Mid-term exam CS 116 Week 8 Page 1 CS 116 Week 8: Lecture Outline 1. Mid-term Exam CS 116 Week 8 Page 2 CS 116 Week 8:

More information

EXAMINATION INSTRUCTIONS

EXAMINATION 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 information

CS 170 Exam 2. Version: A Spring Name (as in OPUS) (print): Instructions:

CS 170 Exam 2. Version: A Spring Name (as in OPUS) (print): Instructions: CS 170 Exam 2 Version: A Spring 2016 Name (as in OPUS) (print): Section: Seat Assignment: Instructions: Keep your eyes on your own paper and do your best to prevent anyone else from seeing your work. Do

More information

CSE 143 Section Handout #13 Practice Midterm #5

CSE 143 Section Handout #13 Practice Midterm #5 Practice Midterm #5 1. ArrayList Mystery. Consider the following method: public static void mystery5(arraylist list) { for (int i = 0; i < list.size(); i++) { int element = list.get(i); list.remove(i);

More information

Instructor: Yu Wang 11/16/2012

Instructor: Yu Wang 11/16/2012 CS170 SECTION 001 INTRODUCTION TO COMPUTER SCIENCE I, FALL 2012 Midterm Exam II Instructor: Yu Wang 11/16/2012 Name: Emory Alias: INSTRUCTIONS: Keep your eyes on your own paper and do your best to prevent

More information

F I N A L E X A M I N A T I O N

F I N A L E X A M I N A T I O N Faculty Of Computer Studies M257 Putting Java to Work F I N A L E X A M I N A T I O N Number of Exam Pages: (including this cover sheet( Spring 2011 April 4, 2011 ( 5 ) Time Allowed: ( 1.5 ) Hours Student

More information

CIS Introduction to Computer Programming Spring Exam 1

CIS Introduction to Computer Programming Spring Exam 1 CIS 110 - Introduction to Computer Programming Spring 2017 - Exam 1 Name: Recitation (e.g. 201): PennKey (e.g. eeaton): My signature below certifies that I have complied with the University of Pennsylvania

More information

CIS 110 Introduction To Computer Programming. February 29, 2012 Midterm

CIS 110 Introduction To Computer Programming. February 29, 2012 Midterm CIS 110 Introduction To Computer Programming February 29, 2012 Midterm Name: Recitation # (e.g. 201): Pennkey (e.g. bjbrown): My signature below certifies that I have complied with the University of Pennsylvania

More information

CS100M November 30, 2000

CS100M November 30, 2000 CS00M November 30, 2000 Makeup Solutions 7:30 PM 9:30 PM (Print last name, first name, middle initial/name) (Student ID) Statement of integrity: I did not, and will not, break the rules of academic integrity

More information

Chief Reader Report on Student Responses:

Chief Reader Report on Student Responses: Chief Reader Report on Student Responses: 2017 AP Computer Science A Free-Response Questions Number of Students Scored 60,519 Number of Readers 308 Score Distribution Exam Score N %At Global Mean 3.15

More information

CS 455 Midterm Exam 1 Fall 2013 [Bono] Wednesday, Oct. 2, 2013

CS 455 Midterm Exam 1 Fall 2013 [Bono] Wednesday, Oct. 2, 2013 Name: USC loginid (e.g., ttrojan): CS 455 Midterm Exam 1 Fall 2013 [Bono] Wednesday, Oct. 2, 2013 There are 5 problems on the exam, with 53 points total available. There are 8 pages to the exam, including

More information

CS 455 Midterm Exam 2 Fall 2016 [Bono] November 8, 2016

CS 455 Midterm Exam 2 Fall 2016 [Bono] November 8, 2016 Name: USC NetID (e.g., ttrojan): CS 455 Midterm Exam 2 Fall 2016 [Bono] November 8, 2016 There are 7 problems on the exam, with 50 points total available. There are 8 pages to the exam (4 pages double-sided),

More information

Exam Percentage: / 55 = %

Exam Percentage: / 55 = % 1/6 CS 1316 - Exam 1 - Spring 2010 Name: CS 1316 - Exam 1 - Spring 2010 Your Grading TA: Your Section : INTEGRITY: By taking this exam, you pledge that this is your work and you have neither given nor

More information

COS 126 Midterm 1 Written Exam, Fall 2009

COS 126 Midterm 1 Written Exam, Fall 2009 NAME: login ID: precept: COS 126 Midterm 1 Written Exam, Fall 2009 This test has 8 questions, weighted as indicated. The exam is closed book, except that you are allowed to use a one page cheatsheet. No

More information

CS 455 Midterm 2 Fall 2017 [Bono] Nov. 7, 2017

CS 455 Midterm 2 Fall 2017 [Bono] Nov. 7, 2017 Name: USC NetID (e.g., ttrojan): CS 455 Midterm 2 Fall 2017 [Bono] Nov. 7, 2017 There are 6 problems on the exam, with 62 points total available. There are 10 pages to the exam (5 pages double-sided),

More information

Student Number: Legibly write your name and student number on this page. Legibly write your name on the back page of this exam.

Student 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 information

Problem Points Score Grader Total 75

Problem Points Score Grader Total 75 University of Illinois at Urbana-Champaign Department of Computer Science First Examination Fall 2010 CS 125 Introduction to Computer Science 90 minutes permitted First name: Last name: NetID: @ illinois.edu

More information

Section 002 Spring CS 170 Exam 1. Name (print): Instructions:

Section 002 Spring CS 170 Exam 1. Name (print): Instructions: CS 170 Exam 1 Section 002 Spring 2015 Name (print): Instructions: Keep your eyes on your own paper and do your best to prevent anyone else from seeing your work. Do NOT communicate with anyone other than

More information

CS/B.TECH/CSE(New)/SEM-5/CS-504D/ OBJECT ORIENTED PROGRAMMING. Time Allotted : 3 Hours Full Marks : 70 GROUP A. (Multiple Choice Type Question)

CS/B.TECH/CSE(New)/SEM-5/CS-504D/ OBJECT ORIENTED PROGRAMMING. Time Allotted : 3 Hours Full Marks : 70 GROUP A. (Multiple Choice Type Question) CS/B.TECH/CSE(New)/SEM-5/CS-504D/2013-14 2013 OBJECT ORIENTED PROGRAMMING Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks. Candidates are required to give their answers

More information

First Exam Computer Programming 326 Dr. St. John Lehman College City University of New York Thursday, 7 October 2010

First Exam Computer Programming 326 Dr. St. John Lehman College City University of New York Thursday, 7 October 2010 First Exam Computer Programming 326 Dr. St. John Lehman College City University of New York Thursday, 7 October 2010 NAME (Printed) NAME (Signed) E-mail Exam Rules Show all your work. Your grade will be

More information

MIDTERM EXAMINATION - CS130 - Spring 2003

MIDTERM EXAMINATION - CS130 - Spring 2003 MIDTERM EXAMINATION - CS130 - Spring 2003 Your full name: Your UCSD ID number: This exam is closed book and closed notes Total number of points in this exam: 120 + 10 extra credit This exam counts for

More information

CIS 110 Introduction to Computer Programming Summer 2018 Final. Recitation # (e.g., 201):

CIS 110 Introduction to Computer Programming Summer 2018 Final. Recitation # (e.g., 201): CIS 110 Introduction to Computer Programming Summer 2018 Final Name: Recitation # (e.g., 201): Pennkey (e.g., paulmcb): My signature below certifies that I have complied with the University of Pennsylvania

More information

Practice exam for CMSC131-04, Fall 2017

Practice exam for CMSC131-04, Fall 2017 Practice exam for CMSC131-04, Fall 2017 Q1 makepalindrome - Relevant topics: arrays, loops Write a method makepalidrome that takes an int array, return a new int array that contains the values from the

More information

CIS 120 Midterm II November 8, 2013 SOLUTIONS

CIS 120 Midterm II November 8, 2013 SOLUTIONS CIS 120 Midterm II November 8, 2013 SOLUTIONS 1 1. Facts about OCaml and Java (15 points) For each part, circle true or false. a. T F The.equals method in Java is roughly similar to OCaml s = operator.

More information

Model Solutions. COMP 102: Test May, 2015

Model Solutions. COMP 102: Test May, 2015 Family Name:.............................. Other Names:............................. ID Number:............................... Signature.................................. Model Solutions COMP 102: Test

More information

CIS 120 Midterm II November 8, Name (printed): Pennkey (login id):

CIS 120 Midterm II November 8, Name (printed): Pennkey (login id): CIS 120 Midterm II November 8, 2013 Name (printed): Pennkey (login id): My signature below certifies that I have complied with the University of Pennsylvania s Code of Academic Integrity in completing

More information

CIS 110 Introduction to Computer Programming Summer 2016 Midterm. Recitation # (e.g., 201):

CIS 110 Introduction to Computer Programming Summer 2016 Midterm. Recitation # (e.g., 201): CIS 110 Introduction to Computer Programming Summer 2016 Midterm Name: Recitation # (e.g., 201): Pennkey (e.g., paulmcb): My signature below certifies that I have complied with the University of Pennsylvania

More information

CS 307 Midterm 2 Fall 2009

CS 307 Midterm 2 Fall 2009 Points off 1 2 3 4 5 Total off Net Score Exam Number: CS 307 Midterm 2 Fall 2009 Name UTEID login name TA's Name: Oswaldo Rashid Swati (Circle One) Instructions: 1. Please turn off your cell phones and

More information

Page 1 of 16. Proctors are unable to respond to queries about the interpretation of exam questions. Do your best to answer exam questions as written.

Page 1 of 16. Proctors are unable to respond to queries about the interpretation of exam questions. Do your best to answer exam questions as written. Page 1 of 16 SOLUTION HAND IN Answers Are Recorded on Question Paper QUEEN'S UNIVERSITY SCHOOL OF COMPUTING CISC212, FALL TERM, 2004 FINAL EXAMINATION 9am to 12noon, 22 DECEMBER 2004 Instructors: Alan

More information

University of Cape Town ~ Department of Computer Science Computer Science 1015F ~ Test 2. Question Max Mark Internal External

University of Cape Town ~ Department of Computer Science Computer Science 1015F ~ Test 2. Question Max Mark Internal External 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 Test 2 Question Max Mark Internal

More information

Midterm I - CSE11 Fall 2013 CLOSED BOOK, CLOSED NOTES 50 minutes, 100 points Total.

Midterm I - CSE11 Fall 2013 CLOSED BOOK, CLOSED NOTES 50 minutes, 100 points Total. Midterm I - CSE11 Fall 2013 CLOSED BOOK, CLOSED NOTES 50 minutes, 100 points Total. Name: ID: Problem 1) (8 points) For the following code segment, what are the values of i, j, k, and d, after the segment

More information

Computer Security Fall 2006 Joseph/Tygar Midterm 3

Computer Security Fall 2006 Joseph/Tygar Midterm 3 CS 161 Computer Security Fall 2006 Joseph/Tygar Midterm 3 PRINT your name:, (last) SIGN your name: (first) PRINT your Unix account name: PRINT your TA s name: READ ALL INSTRUCTIONS CAREFULLY. You are allowed

More information

(2½ hours) Total Marks: 75

(2½ hours) Total Marks: 75 (2½ hours) Total Marks: 75 N. B.: (1) All questions are compulsory. (2) Makesuitable assumptions wherever necessary and state the assumptions mad (3) Answers to the same question must be written together.

More information

CS 101 Exam 2 Spring Id Name

CS 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 information

CSCI 136 Data Structures & Advanced Programming. Fall 2018 Instructors Bill Lenhart & Bill Jannen

CSCI 136 Data Structures & Advanced Programming. Fall 2018 Instructors Bill Lenhart & Bill Jannen CSCI 136 Data Structures & Advanced Programming Fall 2018 Instructors Bill Lenhart & Bill Jannen Administrative Details Class roster: Who s here? And who s trying to get in? Handout: Class syllabus Lecture

More information

Queen s University Faculty of Arts and Science School of Computing CISC 124 Final Examination December 2004 Instructor: M. Lamb

Queen s University Faculty of Arts and Science School of Computing CISC 124 Final Examination December 2004 Instructor: M. Lamb Queen s University Faculty of Arts and Science School of Computing CISC 124 Final Examination December 2004 Instructor: M. Lamb HAND IN Answers recorded on Examination paper This examination is THREE HOURS

More information

CSCI 136 Written Exam #0 Fundamentals of Computer Science II Spring 2015

CSCI 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 information

CSE373 Fall 2013, Second Midterm Examination November 15, 2013

CSE373 Fall 2013, Second Midterm Examination November 15, 2013 CSE373 Fall 2013, Second Midterm Examination November 15, 2013 Please do not turn the page until the bell rings. Rules: The exam is closed-book, closed-note, closed calculator, closed electronics. Please

More information

COS 126 Midterm 1 Written Exam Fall 2011

COS 126 Midterm 1 Written Exam Fall 2011 NAME: login id: Precept: COS 126 Midterm 1 Written Exam Fall 2011 This test has 8 questions, weighted as indicated. The exam is closed book, except that you are allowed to use a one page cheatsheet. No

More information

Selected Questions from by Nageshwara Rao

Selected Questions from  by Nageshwara Rao Selected Questions from http://way2java.com by Nageshwara Rao Swaminathan J Amrita University swaminathanj@am.amrita.edu November 24, 2016 Swaminathan J (Amrita University) way2java.com (Nageshwara Rao)

More information

CS159 Midterm #1 Review

CS159 Midterm #1 Review Name: CS159 Midterm #1 Review 1. Choose the best answer for each of the following multiple choice questions. (a) What is the effect of declaring a class member to be static? It means that the member cannot

More information

Second Exam Computer Programming 326 Dr. St. John Lehman College City University of New York Thursday, 11 November 2010

Second Exam Computer Programming 326 Dr. St. John Lehman College City University of New York Thursday, 11 November 2010 Second Exam Computer Programming 326 Dr. St. John Lehman College City University of New York Thursday, 11 November 2010 NAME (Printed) NAME (Signed) E-mail Exam Rules Show all your work. Your grade will

More information

Specifications for the ADT List Ali list provides a way to organize data List of students List of sales List of lists

Specifications for the ADT List Ali list provides a way to organize data List of students List of sales List of lists Abstract Data Type List ADT List Specifications for the ADT List Ali list provides a way to organize data List of students List of sales List of lists A list has first, last, and in between items (the

More information

CIS 110 Introduction to Computer Programming. February 29, 2012 Midterm

CIS 110 Introduction to Computer Programming. February 29, 2012 Midterm CIS 110 Introduction to Computer Programming February 29, 2012 Midterm Name: Recitation # (e.g. 201): Pennkey (e.g. bjbrown): My signature below certifies that I have complied with the University of Pennsylvania

More information

CSCI 1226 Sample Midterm Exam

CSCI 1226 Sample Midterm Exam CSCI 1226 Test #1 February 2017 General Instructions CSCI 1226 Sample Midterm Exam (A bit long since it combines parts of three earlier tests) Read and follow all directions carefully. Name: Student #:

More information

CS 455 Midterm 2 Spring 2018 [Bono] Apr. 3, 2018

CS 455 Midterm 2 Spring 2018 [Bono] Apr. 3, 2018 Name: USC NetID (e.g., ttrojan): CS 455 Midterm 2 Spring 2018 [Bono] Apr. 3, 2018 There are 7 problems on the exam, with 59 points total available. There are 10 pages to the exam (5 pages double-sided),

More information

CS 314 Exam 2 Spring 2018

CS 314 Exam 2 Spring 2018 Points off 1 2 3 4 5 Total off CS 314 Exam 2 Spring 2018 Your Name Your UTEID Circle your TA's Name: Aish Anthony Chris Dayanny Hailey Ivan Jacob Joseph Lucas Shelby Instructions: 1. There are 5 questions

More information

CS 302: Introduction to Programming in Java. Lecture 12

CS 302: Introduction to Programming in Java. Lecture 12 CS 302: Introduction to Programming in Java Lecture 12 1 Review What is the 3-step processing for using Objects (think Scanner and Random)? Do objects use static methods or non-static (how do you know)?

More information