Programming Project: ArrayFun
|
|
- Rudolph Fowler
- 6 years ago
- Views:
Transcription
1 Programming Project: ArrayFun Collaboration: Solo with help from classroom/online resources, Lane, and/or Rick. Anyone can also share thoughts about any specification and possible algorithm, but no sharing code or looking at another's Java code. This project asks you to solve ten problems requiring arrays. You are asked to write ten methods in one class named ArrayFun and one or more test methods for each of those ten methods in a unit test named ArrayFunTest. Highly recommended: code and test one method at a time. 1) public int numberofpairs(string[] array) Return the number of times a pair occurs in array. A pair is any two String values that are equal (case sensitive) in consecutive array elements. The array may be empty or have only one element. In both of these cases, return 0. (Note: these examples of behavior are written like the CodingBat problems) numberofpairs( {"a", "b", "c" ) returns 0 numberofpairs( {"a", "a", "a" ) returns 2 numberofpairs( {"a", "a", "b", "b" ) returns 2 numberofpairs( { ) returns 0 numberofpairs( {"a" ) returns 0 The following assertions must pass. These methods must be in ArrayFunTest.java. So feel free to begin with this unit test. /** * This class has many methods for testing the ten required * methods that must be in a file named ArrayFun.java. * YOUR NAME */ import static org.junit.assert.*; import java.util.scanner; import org.junit.test; public class ArrayFunTenTest { // If you include this variable myfun, you can use myfun in all s // to save repeating this construction in every method private ArrayFun myfun = new ArrayFun(); public void testfailednumberofpairswhenarrayisempty() { String[] strs = {; assertequals(0, myfun.numberofpairs(strs)); String[] strs = { "one" ; assertequals(0, myfun.numberofpairs(strs)); String[] strs1 = { "one", "two" ; assertequals(0, myfun.numberofpairs(strs1)); String[] strs2 = { "one", "one" ; assertequals(1, myfun.numberofpairs(strs2)); // Add many, many more methods with assertions here // Implement ONE method at a time in ArrayFun.java
2 2) public int numberofvowels(char[] array) Given a filled array of char array elements, return the number of vowels which could be the letters 'a', 'e', 'i', 'o', or 'u' in either upper case or lower case. If the array is empty as in char[] chars = new char[0];, return 0. numberofvowels( {'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U', 'x', 'z' ) returns 10 numberofvowels( {'y', 'Y' ) returns 0 numberofvowels( {'a', 'X', 'a' ) returns 2 numberofvowels( { ) returns 0 3) public boolean sumgreaterthan(double[] array, double sum) Given a filled array of double array elements, return true if the sum of all array elements is greater than sum. The array may be empty. If so, return false. Sum may be negative. sumgreaterthan( { 1.1, 2.2, 3.3, 4.0) returns true sumgreaterthan( { 1.1, 2.2, 3.3, 6.6) returns false sumgreaterthan( {, -1.0) returns false 4) // Precondition: scanner has valid doubles and there is at least one // Note: this is a new method from Spring 11 public double[] stats(scanner scanner) Given a Scanner of double values, return an array of capacity three that has the maximum value in the Scanner as the value in result[0], the minimum value as the second value in result[1], and the average as the third value in result[2]. The following assertions must pass: public void teststats() { Scanner scanner = new Scanner(" "); double[] result = myfun.stats(scanner); assertequals(3, result.length); // The capacity is always 3 assertequals(90.0, result[0], 0.1); // The maximum is at index 0 assertequals(68.0, result[1], 0.1); // The minimum is at index 1 assertequals(77.0, result[2], 0.1); // The average is at index 2 You may assume the Scanner contains only valid double literals and there is at least one double in the argument. Do not test for empty arrays (Rick doesn't).
3 5) // Precondition: scanner has only valid ints in the range of // Note: this is a new method from Spring 11 public int[] frequency(scanner scanner) Given a Scanner constructed with a String containing a stream of integers in the range of (like quiz scores), return an array of 11 integers where the first value (at index 0) is the number of 0s in the Scanner, the second value (at index 1) is the number of ones on the Scanner, and the 11th value (at index 10) is the number of tens in the Scanner. The following assertions must pass. public void testfrequencywithonezerotwoonestwotwostwofiveandnothreesorfours() { Scanner scanner = new Scanner(" "); int[] result = myfun.frequency(scanner); assertequals(11, result.length); assertequals(1, result[0]); // There was 1 zero assertequals(2, result[1]); assertequals(2, result[2]); assertequals(0, result[3]); assertequals(0, result[4]); assertequals(2, result[5]); // There were 2 5s for(int score = 6; score <= 10; score++) assertequals(0, result[score]); // There were zero 6s, 7s, 8s, 9s, 10s Assume the Scanner only has valid integers and they are in the range of 0 through 10 only. 6) public int howmany(string[] array, String valuetofind) Complete method howmany to return the number of elements in an array of Strings that equals valuetofind. The array may be empty. howmany( {"A", "a", "A", "a", "A" ) returns 2 howmany( {"And", "there", "goes", "another", "another" ) returns 1 howmany( {"And", "there", "goes", "another", "Not Here" ) returns 0 7) public void sortofsort(int[] array) Write method sortofsort that modifies the parameter array to place the largest integer at index n-1 and the smallest integer at array[0]. The others elements must still be in the array, but not in any particular order. You must modify the given array argument by changing array in method sortofsort. Original Array Modified Array (all elements except the first and last may differ in order) { 4, 3, 2, 0, 1, 2 { 0, 3, 2, 1, 2, 4 { 4, 3, 2, 1 { 1, 3, 2, 4 { 1, 3, 2, 4 { 1, 3, 2, 4 The following assertions must pass:
4 public void testsortofsort() { int[] x = { 4, 3, 2, 1 ; myfun.sortofsort(x); assertequals(1, x[0]); assertequals(4, x[3]); asserttrue(x[1] == 2 x[1] == 3); asserttrue(x[2] == 2 x[2] == 3); Tip: Get the min at index 0 before you put the max in the last index 8) public void evensleft(int[] array) (A Nick Parlante JavaBat problem) Modify the parameter array so it still contains the exact same numbers as the given array, but rearranged so that all the even numbers come before all the odd numbers. Other than that, the numbers can be in any order. You must modify the array arguments by changing array in method evensleft. The array may be empty or have only one element. In both cases, no change should be made. Original Array Modified Array {1, 0, 1, 0, 0, 1, 1 { 0, 0, 0, 1, 1, 1, 1 {3, 3, 2 { 2, 3, 3 {2, 2, 2 { 2, 2, 2 The following assertions must pass: public void testevensleft() { int[] a = { 1, 2, 3, 4, 5, 6, 7 ; myfun.evensleft(a); // left side of the array at indexes 0..2 is even for (int i = 0; i <= 2; i++) asserttrue(a[i] % 2 == 0); // right side of the array at indexes 3..6 is odd for (int i = 3; i <= 6; i++) asserttrue(a[i] % 2!= 0); _ 9) public void shiftntimes(int[] array, int numshifts) Modify array so it is "left shifted" n times -- so shiftntimes({6, 2, 5, 3, 1) changes the array argument to {2, 5, 3, 6 and shiftntimes({6, 2, 5, 3, 2) changes the array argument to {5, 3, 6, 2. You must modify the array argument by changing the parameter array inside method shiftntimes. Remember, a change to the parameter inside the method shiftntimes changes the argument inside the method. shiftntimes( { 1, 2, 3, 4, 5, 6, 7, 3 ) modifies array to { 4, 5, 6, 7, 1, 2, 3 shiftntimes( { 1, 2, 3, 4, 5, 6, 7, 0 ) does not modify the array, it remains { 1, 2, 3, 4, 5, 6, 7 shiftntimes( { 1, 2, 3, 5) modifies array to { 3, 1, 2 shiftntimes( { 3, 5) modifies array to { 3 The following assertions must pass.
5 public void testfailedshiftntimeswhennistwo() { int[] a = { 1, 2, 3 ; myfun.shiftntimes(a, 2); // Make a have this order: {3, 1, 2 assertequals(3, a[0]); assertequals(1, a[1]); assertequals(2, a[2]); 10) public char[] replaced(char[] array, char oldchar, char newchar) Return a new char[] that is a copy of array with all occurrences of oldchar replaced by newchar -- so replaced ({'A', 'B', 'C', 'D', 'B', 'B', '+') returns a new array {'A', '+', 'C', 'D', '+'. The original array argument must remain unchanged. The returned array must have exactly the same capacity as the array reference passed to the parameter referenced as array. replaced( { 'A', 'B', 'C', 'D', 'B', 'C', 'L' ) returns { 'A', 'B', 'L', 'D', 'B' replaced( { 'n', 'n', 'n', 'D', 'n', 'n', 'T' ) returns { 'T', 'T', 'T', 'D', 'T' replaced( { 'n', 'n', 'n', 'T', 'n' ) returns { 'n', 'n', 'n' The following assertions must pass public void testfailedreplacedwhilecheckingoriginalarrayisunchanged() { char[] a = { 'a', 'b' ; char[] result = myfun.replaced(a, 'a', 'X'); assertequals(2, result.length); assertequals('x', result[0]); assertequals('b', result[1]); // Ensure the original array has not changed assertequals('a', a[0]); assertequals('b', a[1]); Grading Criteria (100pts) When you have completely tested all 10 methods, turn in your project to WebCat. You will be graded as follows +100 Web-Cat correctness and code coverage. Your code must compile using the specified names o All method names must exactly match the 10 methods headings above o These methods must be in a file named ArrayFun.java You must include ArrayFunTest.java and all of the assertions therein must pass on WebCat You must have tested all of your methods with assertions in methods You must execute all statements in all 10 methods at least once All of Rick's tests must pass The final WebCat submission will be the one that is graded unless you inform us You must not have any infinite loops o You will see a timeout error and receive 0 points WebCat employs a multiplication feature that means 90% and 90% results in 0.81 * 80 or 64.8/80 points. This is only 81% rather than 90%.
There are several files including the start of a unit test and the method stubs in MindNumber.java. Here is a preview of what you will do:
Project MindNumber Collaboration: Solo. Complete this project by yourself with optional help from section leaders. Do not work with anyone else, do not copy any code directly, do not copy code indirectly
More informationProgramming Project: Game of Life
Programming Project: Game of Life Collaboration Solo: All work must be your own with optional help from UofA section leaders The Game of Life was invented by John Conway to simulate the birth and death
More informationAssignment: TwoMethods Submitted to WebCat
Assignment: TwoMethods Submitted to WebCat For this assignment, you are asked to Implement one class with two unrelated methods and a unit test for those two methods On your personal machine only: Set
More informationC Sc 127A Practice Test 2 SL Name 150pts
C Sc 127A Practice Test 2 SL Name 150pts 0. What is the capiatal of Canada? f (4pts) Just do not leave this blank, any answer would do a. Toronto b. Quebec c. Ottawa d. Vancouver e. Calgary f. Not sure
More informationImplement factorial to return n! that is defined as n * n-1 * n-2 * n-3 * 2 * 1. 1! And 0! Are both defined as 1. Use recursion, no loop.
RecursionFun Collaboration: Solo Work on this project alone. Do not copy any code from anywhere, other than from our website, book, or lecture notes. Do not look at another person's screen or printout.
More information0. What is the capital of Canada? (4pts) a. Toronto b. Quebec c. Ottawa d. Vancouver e. Calgary f. Not sure
150pts 0. What is the capital of Canada? (4pts) a. Toronto b. Quebec c. Ottawa d. Vancouver e. Calgary f. Not sure 1. Use this initialization to answer the questions that follow: int[] x = new int[100];
More informationThis midterm has about 4 questions more than the actual midterm of 200 pts will have
C Sc 227 Practice Midterm Name 246 points This midterm has about 4 questions more than the actual midterm of 200 pts will have 1. Write a checkmark to the right of any assertion in the following test method
More informationC Sc 227 Practice Test 2 Section Leader Your Name 100pts. a. 1D array b. PriorityList<E> c. ArrayPriorityList<E>
C Sc 227 Practice Test 2 Section Leader Your Name 100pts 1. Approximately how many lectures remain in C Sc 227 (give or take 2)? (2pts) 2. Determine the tightest upper bound runtimes of the following loops.
More informationCS108, Stanford Handout #3. HW1 CodeCamp
CS108, Stanford Handout #3 Fall, 2008-09 Osvaldo Jiménez HW1 CodeCamp Thanks to Nick Parlante for much of this handout For this first homework, you will run through a series of small coding problems to
More informationArrays. Chapter The Java Array Object. Goals
Chapter 7 Arrays Goals This chapter introduces the Java array for storing collections of many objects. Individual elements are referenced with the Java subscript operator []. After studying this chapter
More informationCIS 110 Introduction to Computer Programming Summer 2018 Midterm. Recitation ROOM :
CIS 110 Introduction to Computer Programming Summer 2018 Midterm Name: Recitation ROOM : Pennkey (e.g., paulmcb): My signature below certifies that I have complied with the University of Pennsylvania s
More informationInterfaces. Chapter Java Interfaces
Chapter 14 Interfaces Goals Understand what it means to implement a Java interface Use the Comparable interface to have any type of elements sorted and binary searched Show how a Java interface can specify
More informationSelec%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 informationAPS101- Midterm Sample Questions
APS101- Midterm Sample Questions Note: Java API descriptions similar to the following will be provided in the midterm. Short Java API descriptions (all methods are public): class Integer: Integer(int i)
More informationC Sc 127B Practice Test 2 Section Leader Your Name 100pts
C Sc 127B Practice Test 2 Section Leader Your Name 100pts Assume we have two collection class named Stack and Queue that have the appropriate messages: Stack public boolean isempty(); public void push(e
More informationC Sc 227 Practice Test 2 Section Leader Name 134pts
C Sc 227 Practice Test 2 Section Leader Name 134pts 1. Determine the tightest upper bound runtimes of the following loops. Express your answer in the Big-O notation we have been using in class (assume
More informationC Sc 227 Practice Test 2 Section Leader Name 134pts ANSWERS
C Sc 227 Practice Test 2 Section Leader Name 134pts ANSWERS 1. Determine the tightest upper bound runtimes of the following loops. Express your answer in the Big-O notation we have been using in class
More informationProvided Files that Are Fine
Fixing How to Play 2048 - Consists of a 4x4 grid of tiles with numbers on them - Use arrow keys to move tiles in a direction - Tiles will keep moving until they hit a wall or another tile - Every movement
More informationC Sc 227 Practice Final
C Sc 227 Practice Final Name 1. Use the Node class shown question 13 on this page below with data and next instance variables and this view of a linked structure to answer the questions a) through d) a)
More informationRepetition. Chapter 6
Chapter 6 Repetition Goals This chapter introduces the third major control structure repetition (sequential and selection being the first two). Repetition is discussed within the context of two general
More informationRepetition. Chapter 6
Chapter 6 Repetition Goals This chapter introduces the third major control structure repetition (sequential and selection being the first two). Repetition is discussed within the context of two general
More informationLAB 13: ARRAYS (ONE DIMINSION)
Statement Purpose: The purpose of this Lab. is to practically familiarize student with the concept of array and related operations performed on array. Activity Outcomes: As a second Lab on Chapter 7, this
More informationQuestion: 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 informationCAT.woa/wa/assignments/eclipse
King Saud University College of Computer & Information Science CSC111 Lab10 Arrays II All Sections ------------------------------------------------------------------- Instructions Web-CAT submission URL:
More informationChapter 6. Repetition. Asserting Java. Rick Mercer
Chapter 6 Repetition Asserting Java Rick Mercer Algorithmic Pattern: The Determinate loop We often need to perform some action a specific number of times: Produce 89 paychecks. Count down to 0 (take 1
More informationWeb-CAT submission URL: CAT.woa/wa/assignments/eclipse
King Saud University College of Computer & Information Science CSC111 Lab10 Arrays II All Sections ------------------------------------------------------------------- Instructions Web-CAT submission URL:
More informationC Sc 227 Practice Final Summer 13 Name 200 pts
C Sc 227 Practice Final Summer 13 Name 200 pts 1. Use our familiar Node class (shown below with data and next instance variables) and this view of a linked structure to answer the questions a) through
More informationChapter 6. Repetition. Asserting Java. Rick Mercer
Chapter 6 Repetition Asserting Java Rick Mercer Algorithmic Pattern: The Determinate loop We often need to perform some action a specific number of times: Produce 89 paychecks. Count down to 0 (take 1
More informationSTUDENT LESSON A12 Iterations
STUDENT LESSON A12 Iterations Java Curriculum for AP Computer Science, Student Lesson A12 1 STUDENT LESSON A12 Iterations INTRODUCTION: Solving problems on a computer very often requires a repetition of
More informationCOS 126 General Computer Science Spring Written Exam 1
COS 126 General Computer Science Spring 2017 Written Exam 1 This exam has 9 questions (including question 0) worth a total of 70 points. You have 50 minutes. Write all answers inside the designated spaces.
More informationCS2 Practical 1 CS2A 22/09/2004
CS2 Practical 1 Basic Java Programming The purpose of this practical is to re-enforce your Java programming abilities. The practical is based on material covered in CS1. It consists of ten simple programming
More informationSection 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 informationSelec%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 informationRecursion. Chapter Simple Recursion. Goals Trace recursive algorithms Implement recursive algorithms
Chapter 19 Recursion Goals Trace recursive algorithms Implement recursive algorithms 19.1 Simple Recursion One day, an instructor was having difficulties with a classroom s multimedia equipment. The bell
More informationCSE143 Exam with answers MIDTERM #1, 1/26/2001 Problem numbering may differ from the test as given.
CSE143 Exam with answers MIDTERM #1, 1/26/2001 Problem numbering may differ from the test as given. All multiple choice questions are equally weighted. You can generally assume that code shown in the questions
More informationPROBLEM 1 : (Vocabulary: 12 points) For each of the words/phrases below, circle the denition that is the best description as it pertains in the contex
Test 1: CPS 53.2 Owen Astrachan October 6, 1993 Name: Honor code acknowledgement (signature) Problem 1 value 12 pts. grade Problem 2 14 pts. Problem 3 5 pts. Problem 4 6 pts. Problem 5 9 pts. Problem 6
More informationExam 2. Programming I (CPCS 202) Instructor: M. G. Abbas Malik. Total Marks: 40 Obtained Marks:
كلية الحاسبات وتقنية المعلوما Exam 2 Programming I (CPCS 202) Instructor: M. G. Abbas Malik Date: November 22, 2015 Student Name: Student ID: Total Marks: 40 Obtained Marks: Instructions: Do not open this
More informationMidterm Examination (MTA)
M105: Introduction to Programming with Java Midterm Examination (MTA) Spring 2013 / 2014 Question One: [6 marks] Choose the correct answer and write it on the external answer booklet. 1. Compilers and
More informationArray. 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 informationC Programming for Engineers Structured Program
C Programming for Engineers Structured Program ICEN 360 Spring 2017 Prof. Dola Saha 1 Switch Statement Ø Used to select one of several alternatives Ø useful when the selection is based on the value of
More information1. Is it currently raining in Tucson (4pts) a) Yes b) No? c) Don't know d) Couldn't know (not in Tucson)
1. Is it currently raining in Tucson (4pts) a) Yes b) No? c) Don't know d) Couldn't know (not in Tucson) 2. Use our familiar Node class (shown below with data and next instance variables) and this view
More informationMethod OverLoading printf method Arrays Declaring and Using Arrays Arrays of Objects Array as Parameters
Outline Method OverLoading printf method Arrays Declaring and Using Arrays Arrays of Objects Array as Parameters Variable Length Parameter Lists split() Method from String Class Integer & Double Wrapper
More informationPractice Midterm 1. Problem Points Score TOTAL 50
CS 120 Software Design I Spring 2019 Practice Midterm 1 University of Wisconsin - La Crosse February 25 NAME: Do not turn the page until instructed to do so. This booklet contains 10 pages including the
More informationMore non-primitive types Lesson 06
CSC110 2.0 Object Oriented Programming Ms. Gnanakanthi Makalanda Dept. of Computer Science University of Sri Jayewardenepura More non-primitive types Lesson 06 1 2 Outline 1. Two-dimensional arrays 2.
More informationJAVA PROGRAMMING (340)
Page 1 of 8 JAVA PROGRAMMING (340) REGIONAL 2016 Production Portion: Program 1: Base K Addition (335 points) TOTAL POINTS (335 points) Judge/Graders: Please double check and verify all scores and answer
More informationTerm 1 Unit 1 Week 1 Worksheet: Output Solution
4 Term 1 Unit 1 Week 1 Worksheet: Output Solution Consider the following what is output? 1. System.out.println("hot"); System.out.println("dog"); Output hot dog 2. System.out.print("hot\n\t\t"); System.out.println("dog");
More informationUsing Java Classes Fall 2018 Margaret Reid-Miller
Using Java Classes 15-121 Fall 2018 Margaret Reid-Miller Today Strings I/O (using Scanner) Loops, Conditionals, Scope Math Class (random) Fall 2018 15-121 (Reid-Miller) 2 The Math Class The Math class
More informationObject Oriented Programming. Java-Lecture 6 - Arrays
Object Oriented Programming Java-Lecture 6 - Arrays Arrays Arrays are data structures consisting of related data items of the same type In Java arrays are objects -> they are considered reference types
More informationCIS 1068 Design and Abstraction Spring 2017 Midterm 1a
Spring 2017 Name: TUID: Page Points Score 1 28 2 18 3 12 4 12 5 15 6 15 Total: 100 Instructions The exam is closed book, closed notes. You may not use a calculator, cell phone, etc. i Some API Reminders
More informationCS 101, Spring 2016 March 22nd Exam 2
CS 101, Spring 2016 March 22nd Exam 2 Name: Question 1. [3 points] Which of the following loop statements would most likely cause the loop to execute exactly n times? You may assume that n will be set
More informationJava How to Program, 10/e. Copyright by Pearson Education, Inc. All Rights Reserved.
Java How to Program, 10/e Education, Inc. All Rights Reserved. Each class you create becomes a new type that can be used to declare variables and create objects. You can declare new classes as needed;
More informationCS 312 Midterm 2 Fall 2013
CS 312 Midterm 2 Fall 2013 SOLUTION SOLUTION SOLUTION SOLUTION SOLUTION Problem Number Topic Points Possible 1 code trace 28 2 arrays 14 3 strings 16 4 program logic 16 5 scanner 23 6 arrays and strings
More informationGeneric Collections. Chapter The Object class
Chapter 13 Generic Collections Goals Introduce class Object and inheritance Show how one collection can store any type of element using Object[] 13.1 The Object class The StringBag class shown of Chapter
More informationSection 004 Spring CS 170 Exam 1. Name (print): Instructions:
CS 170 Exam 1 Section 004 Spring 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 informationCSE 1223: Introduction to Computer Programming in Java Chapter 3 Branching
CSE 1223: Introduction to Computer Programming in Java Chapter 3 Branching 1 Flow of Control The order in which statements in a program are executed is called the flow of control So far we have only seen
More informationCS 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 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 informationCSE 1223: Exam II Autumn 2016
CSE 1223: Exam II Autumn 2016 Name: Instructions: Do not open the exam before you are told to begin. This exam is closed book, closed notes. You may not use any calculators or any other kind of computing
More informationgcc o driver std=c99 -Wall driver.c bigmesa.c
C Programming Simple Array Processing This assignment consists of two parts. The first part focuses on array read accesses and computational logic. The second part focuses on array read/write access and
More informationLargest Online Community of VU Students
WWW.VUPages.com http://forum.vupages.com WWW.VUTUBE.EDU.PK Largest Online Community of VU Students MIDTERM EXAMINATION SEMESTER FALL 2003 CS301-DATA STRUCTURE Total Marks:86 Duration: 60min Instructions
More informationAssertions, pre/postconditions
Programming as a contract Assertions, pre/postconditions Assertions: Section 4.2 in Savitch (p. 239) Specifying what each method does q Specify it in a comment before method's header Precondition q What
More informationFORM 2 (Please put your name and form # on the scantron!!!!)
CS 161 Exam 2: FORM 2 (Please put your name and form # on the scantron!!!!) True (A)/False(B) (2 pts each): 1. Recursive algorithms tend to be less efficient than iterative algorithms. 2. A recursive function
More informationComputational Expression
Computational Expression Variables, Primitive Data Types, Expressions Janyl Jumadinova 28-30 January, 2019 Janyl Jumadinova Computational Expression 28-30 January, 2019 1 / 17 Variables Variable is a name
More informationCSC 1051 Algorithms and Data Structures I. Midterm Examination October 11, Name: KEY
CSC 1051 Algorithms and Data Structures I Midterm Examination October 11, 2018 Name: KEY Question Value Score 1 20 2 20 3 20 4 20 5 20 TOTAL 100 Please answer questions in the spaces provided. If you make
More information1.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 informationCS/ENGRD 2110 SPRING Lecture 3: Fields, getters and setters, constructors, testing
1 CS/ENGRD 2110 SPRING 2019 Lecture 3: Fields, getters and setters, constructors, testing http://courses.cs.cornell.edu/cs2110 CS2110 Announcements 2 Take course S/U? OK with us. Check with your advisor/major.
More informationHandout 4 Conditionals. Boolean Expressions.
Handout 4 cs180 - Programming Fundamentals Fall 17 Page 1 of 8 Handout 4 Conditionals. Boolean Expressions. Example Problem. Write a program that will calculate and print bills for the city power company.
More informationChoose 3 of the 1 st 4 questions (#'s 1 through 4) to complete. Each question is worth 12 points.
Choose 3 of the 1 st 4 questions (#'s 1 through 4) to complete. Each question is worth 12 points. Use the remaining question as extra credit (worth 1/2 of the points earned). Specify which question is
More informationCIS 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 informationCOMP-202B - Introduction to Computing I (Winter 2011) - All Sections Example Questions for In-Class Quiz
COMP-202B - Introduction to Computing I (Winter 2011) - All Sections Example Questions for In-Class Quiz The in-class quiz is intended to give you a taste of the midterm, give you some early feedback about
More informationCOMP 202 Recursion. CONTENTS: Recursion. COMP Recursion 1
COMP 202 Recursion CONTENTS: Recursion COMP 202 - Recursion 1 Recursive Thinking A recursive definition is one which uses the word or concept being defined in the definition itself COMP 202 - Recursion
More informationCSE 143 Au03 Midterm 2 Page 1 of 7
CSE 143 Au03 Midterm 2 Page 1 of 7 Question 1. (4 points) (a) If a precondition is not true when a method is called, two possible ways to detect and handle the situation are to use an assert statement
More informationTutorial 11. Exercise 1: CSC111 Computer Programming I. A. Write a code snippet to define the following arrays:
College of Computer and Information Sciences CSC111 Computer Programming I Exercise 1: Tutorial 11 Arrays: A. Write a code snippet to define the following arrays: 1. An int array named nums of size 10.
More informationCSE413 Midterm. Question Max Points Total 100
CSE413 Midterm 05 November 2007 Name Student ID Answer all questions; show your work. You may use: 1. The Scheme language definition. 2. One 8.5 * 11 piece of paper with handwritten notes Other items,
More informationC Sc 227 Practice Final Summer 12 Name 200pt
C Sc 227 Practice Final Summer 12 Name 200pt 1. Is it currently raining in Tucson (4pts) a) Yes b) No? c) Don't know d) Couldn't know (I'm not in Tucson) 2. Use our familiar Node class (shown below with
More informationProject MineSweeper Collaboration: Solo Complete this Project by yourself or with help from Section Leaders and Rick You are asked to write the non-graphical user interface aspects of the popular game
More informationSt. Edmund Preparatory High School Brooklyn, NY
AP Computer Science Mr. A. Pinnavaia Summer Assignment St. Edmund Preparatory High School Name: I know it has been about 7 months since you last thought about programming. It s ok. I wouldn t want to think
More informationName CIS 201 Midterm II: Chapters 1-8
Name CIS 201 Midterm II: Chapters 1-8 December 15, 2010 Directions: This is a closed book, closed notes midterm. Place your answers in the space provided. The point value for each question is indicated.
More informationTutorial 3: Unit tests and JUnit
Tutorial 3: Unit tests and JUnit Runtime logic errors, such as contract violations, are among the more frequent in a poorly debugged program. Logic error should be fixed. However, to fix an error we need
More informationCS 305j Midterm 2 Fall 2006
Exam Number: Points off 1 2 3 4 5 6 Total off Net Score CS 305j Midterm 2 Fall 2006 Your Name Your UTEID Circle you TA's name: Brad Jacob Instructions: 1. Please turn off your cell phones 2. There are
More informationAP Computer Science A
2017 AP Computer Science A Scoring Guidelines College Board, Advanced Placement Program, AP, AP Central, and the acorn logo are registered trademarks of the College Board. AP Central is the official online
More informationC Sc 227 Project 1: Three Main Methods
C Sc 227 Project 1: Three Main Methods Collaboration Solo! Complete all four programs by yourself. Turnin: Print programs 1, 2, and 3 (Welcome.java not needed), staple them together (or lose points) and
More informationUse the scantron sheet to enter the answer to questions (pages 1-6)
Use the scantron sheet to enter the answer to questions 1-100 (pages 1-6) Part I. Mark A for True, B for false. (1 point each) 1. Abstraction allow us to specify an object regardless of how the object
More information/** * Tests for a class that converts scores to letter grades Merlin * */ public class PaperTest {
Here is a test class and you are going to write the class it tests. At the end of the tests, you ll find the javadocs for the class you are creating. You can use them to more fully understand the methods
More information1. a) What #include statement do you put at the top of a program that does uses cin, cout or endl?
Exercises with solutions. 1. a) What #include statement do you put at the top of a program that does uses cin, cout or endl? #include b) What using statement do you always put at the top of
More informationChapter 11 Paper Practice
Chapter 11 Paper Practice Scrambled Code For each method, rearrange the lines of code in order to build the functionality required by the specification and tests. To accomplish this, you are given three
More informationCSE 331 Midterm Exam 2/13/12
Name There are 10 questions worth a total of 100 points. Please budget your time so you get to all of the questions. Keep your answers brief and to the point. The exam is closed book, closed notes, closed
More informationMaximization and Minimization Problems. CSE 1310 Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington
Maximization and Minimization Problems CSE 1310 Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1 Maximization Problems Given a set of data, we want to find
More informationI. True/False: (2 points each)
CS 102 - Introduction to Programming Midterm Exam #2 - Prof. Reed Spring 2008 What is your name?: (2 points) There are three sections: I. True/False..............54 points; (27 questions, 2 points each)
More informationCSC 1051 Algorithms and Data Structures I. Final Examination May 2, Name:
CSC 1051 Algorithms and Data Structures I Final Examination May 2, 2015 Name: Question Value 1 10 Score 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 20 TOTAL 100 Please answer questions in the spaces provided.
More informationComp Intermediate Programming EXAM #1 February 16, 2004 Rice University - Instructors: Cox & Nguyen
Instructions 1. This exam is conducted under the Rice Honor Code. It is a closed-notes, closed-book exam. 2. Fill in your name on every page of the exam. 3. If you forget the name of a Java class or method,
More informationCS2141 Software Development using C/C++ C++ Basics
CS2141 Software Development using C/C++ C++ Basics Integers Basic Types Can be short, long, or just plain int C++ does not define the size of them other than short
More informationFundamental Java Syntax Summary Sheet for CISC101, Spring Java is Case - Sensitive!
Fundamental Java Syntax Summary Sheet for CISC101, Spring 2006 Notes: Items in italics are things that you must supply, either a variable name, literal value, or expression. Variable Naming Rules Java
More informationComputing Science 114 Solutions to Midterm Examination Tuesday October 19, In Questions 1 20, Circle EXACTLY ONE choice as the best answer
Computing Science 114 Solutions to Midterm Examination Tuesday October 19, 2004 INSTRUCTOR: I E LEONARD TIME: 50 MINUTES In Questions 1 20, Circle EXACTLY ONE choice as the best answer 1 [2 pts] What company
More information1 Short Answer (15 Points Each)
COSC 7 Exam # Solutions Spring 08 Short Answer (5 Points Each). Write a method called RollCount that takes in two integer parameters rolls and target. The method should simulate the rolling of two die,
More informationChapter 6 Arrays. Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved.
Chapter 6 Arrays 1 Opening Problem Read one hundred numbers, compute their average, and find out how many numbers are above the average. 2 Solution AnalyzeNumbers Run Run with prepared input 3 Objectives
More information9/19/12. Why Study Discrete Math? What is discrete? Sets (Rosen, Chapter 2) can be described by discrete math TOPICS
What is discrete? Sets (Rosen, Chapter 2) TOPICS Discrete math Set Definition Set Operations Tuples Consisting of distinct or unconnected elements, not continuous (calculus) Helps us in Computer Science
More informationCSCI 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 Lab 1 handout is online Prelab (should be completed before lab): Lab 1 design doc
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 informationProblem 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