BUGCATCHER SITE REVIEW Version 1, Cassie Chin, 10/10/2014,
|
|
- Abel Greer
- 5 years ago
- Views:
Transcription
1 Page 1 of 14 BUGCATCHER SITE REVIEW Version 1, Cassie Chin, 10/10/2014, Table of Contents What is this document for?... 2 What does this document contain?... 2 Developer Suggestions... 2 Overall Comments... 2 AddTax... 3 Fruit Profits... 4 Rectangle... 5 Recursive Multiply... 6 Calculator... 7 Grade... 9 Averages SortNumbers Strings Cricle GCF... 14
2 Page 2 of 14 WHAT IS THIS DOCUMENT FOR? In a competition setting, the problem does not list the number of bugs that you are supposed to find, this document can be used as a reference for users to determine how many bugs there are in a problem. It can be used for admininstrations to view a summary of the problems before they add it to the competition. It can be used by the developer to view found bugs. WHAT DOES THIS DOCUMENT CONTAIN? For each problem on the Bug Catcher website I have provided: : Gives the level of the problem and the total number of bugs it claims to have. Also lists the problems in the code. The highlighted color can be matched with the corresponding highlighted section in the code. I ll also list any other comments or bugs related to specific browsers or operating systems. Answers Found: Every possible answer that I could find, in many cases, I cannot find the number of bugs that the problem is asking for. : A copy of the code that is correctly indented and uses syntax highlighting for readability. In addition the extra highlighting is used to link the code to the problem specified in the section. DEVELOPER SUGGESTIONS There should be a way for a user to reset a competition (delete all the bugs that they ve already found) Administrators need the abillity to edit and delete competitions Users should be able to leave a competition without logging out and logging back in OVERALL COMMENTS Teams are unnessary, it s an added step the decreases usabiltiy Syntax highlighting and proper code indentation would make the site look cleaner You should be able to know how many bugs are expected in a problem for the competitions with multiple problems
3 Page 3 of 14 ADDTAX Very Easy 5 Bugs Total Each bug that I find is the same type of bug and it will only let me enter 4 bugs. Problem: Tax should be the cost times the tax rate over 100 Problem: Tax should be added onto the cost Answers Found [4/5] $ $ $ $ public class addtax public static double calculatetotal(double taxrate, double cost) double tax = cost + taxrate; cost = cost*tax; return cost; public static void main(string[] args) try double cost = Double.parseDouble(args[0]); double taxrate= Double.parseDouble(args[1]); System.out.println("$"+ calculatetotal(taxrate, cost));
4 Page 4 of 14 FRUIT PROFITS Easy 5 Total Bugs Problem: (apple) The 2 should be a 1 Problem: (banana) The / should be a * Answers 1 and 2 are essentially the same $10.00 registers as no bug, and it should be registering this as a bug Firefox, Windows 8 and Ubuntu o I entered $1.00 o o o o The result was Test Status: No Bugs Found Yet the Bugs Found counter in the tool bar incremented I didn t realize that it had incremented and entered it again The result was Test Status: No Bugs Found, and the Bugs Found counter incremented Suggestion: Specify in the problem description whether you can buy unlimited fruit or not Answers Found [4/5] $1.00 (No animation) $2.00 (No animation) $ $ public class FruitProfits public static void main(string[] args) try double cost=0; int apples = Integer.parseInt(args[0]); int oranges= Integer.parseInt(args[1]); int bananas= Integer.parseInt(args[2]); cost=(2*apples)+(5*oranges)+(bananas/10); if((apples<=9)&&(oranges<=9)&&(bananas<=9)) System.out.printf("$%2.2f\n",cost); else
5 Page 5 of 14 RECTANGLE Easy 4 Total Bugs Problem: The print statement is syntactically incorrect, you can t call a function inbetween a string in a print statement, and the line is also missing a double quotation Answers Found [1/4] 4 5 area=20, perim=18 public class rectangle public static double area(double height, double width) return height*width; public static double perim(double height, double width) return (height*2)+(width*2); public static void main(string[] args) try double height = Double.parseDouble(args[1]); double width= Double.parseDouble(args[1]); System.out.println("are=+perim(height, width)+", perim="+area(height, width));
6 Page 6 of 14 RECURSIVE MULTIPLY Easy 3 Bugs Total Answers 1 and 2 are essentially the same answer Answers Found [2/3] public class multiplication public static int RecursiveMultiply(int n, int m) if(m==0) return 0; else return m + multiply(n,(m-1)); public static void main (String [] args) try int n = Integer.parseInt(args[0]); int m= Integer.parseInt(args[1]); if(m==100) System.out.println("Error"); else System.out.println(multiply(n,m));
7 Page 7 of 14 CALCULATOR Medium 4 Bugs Total Problem: (add) Should be num1 + num2 Problem: (subtract) Should be num1 num1 Problem: (subtract) Function call should use num1 and num2 as parameters Problem: (times) Should be num1 * num2 Problem: (divide) Should be a divide symbol instead of a mod symbol Problem: (divide) Should num1 is the dividend and num2 is the divisor Answers Found [4/4] 4 plus minus times over 2 2 public class Calculator public static double dothemath(double num1, double num2, String sign) double answer = 0; if (sign.equals("plus")) answer = doadd(num1, num2); if (sign.equals("minus")) answer = dosubtract(num1, num1); if (sign.equals("over")) answer = dodivide(num1, num2); if (sign.equals("times")) answer = domultiply(num1, num2); return answer; public static double doadd(double num1, double num2) double answer = num1 + num1; return answer; public static double dosubtract(double num1, double num2) return num1 - num1; public static double domultiply(double num1, double num2) return (num1 * num2 * num2); public static double dodivide(double num1, double num2) return num2 % num1; public static void main(string[] args) try double num1 = Double.parseDouble(args[0]);
8 Page 8 of 14 String sign = args[1]; double num2 = Double.parseDouble(args[2]); double answer = dothemath(num1, num2, sign); System.out.println(answer);
9 Page 9 of 14 GRADE Medium 4 Bugs Total Problem: (D) 61 should be 60 Problem: (A) symbol should be < not <= Problem: (A) The default condition should return A Answers 3 and 4 are essentially the same answer Answers Found [4/4] 60 D 90 A 95 A 100 A public class Grade public static String getlettergrade(double score) if ( score < 61 ) return ("F"); else if ( score < 70 ) return ("D"); else if ( score < 80 ) return ("C"); else if (score<=90) return("b"); else return("b"); public static void main(string[] args) try double numbergrade = Double.parseDouble(args[0]); if((numbergrade>0)&&(numbergrade<=100)) System.out.println(getLetterGrade(numberGrade)); else
10 Page 10 of 14 AVERAGES Medium 4 Bugs Total Problem: (mean) The sum needs to be divided by two Problem: (mode) The program never outputs the string No mode anywhere Problem: (mediam) The median is not necessarily the second number I cannot find the last bug Answers Found [3/4] mean mode No mode median 2 public class averages public static void main(string[] args) try double sum, average, retval=0; double[] values = new double[3]; values[0]= Double.parseDouble(args[0]); values[1]= Double.parseDouble(args[1]); values[2]= Double.parseDouble(args[2]); String type= args[3]; switch(type) case "mean": sum=values[0]+values[1]+values[2]; average=sum/2; retval = average; case "median": retval=values[1]; break; case "mode": if(values[1]==values[2]) retval=values[1]; else retval=values[0]; break; System.out.println(retVal);
11 Page 11 of 14 SORTNUMBERS Medium 4 Bugs Total Problem: The numbers aren t being swapped properly. Answers Found [1/4] , 4, 17 public class sort public static void main(string[] args) try double[] num = new double[3]; num[0] = Integer.parseInt(args[0]); num[1]= Integer.parseInt(args[1]); num[2]= Integer.parseInt(args[2]); for(int j=1; j<3; j++) if(num[j]>num[j-1]) num[j-1]=num[j]; num[j]=num[j-1]; System.out.println(num[0]+", "+ num[1] +", "+num[2]);
12 Page 12 of 14 STRINGS Medium 5 Bugs total Problem: The letter to cut out is just being added back onto the word Problem: The break statement should be taken out because there could be more than one occurrence of the word Answers Found [2/5] cassie s caie hqeqlqlqo hello public class Strings public static void main(string[] args) try String word; String letter; word = args[0]; letter= args[1]; for(int i=0; i < word.length(); i++) if((word.charat(i))==letter.charat(0) word=word.substring(0,i-1)+word.substring(i,word.length()); break; System.out.println(word);
13 Page 13 of 14 CRICLE Medium 4 Bugs Total Problem: (diameter) The diameter case should be d not b Problem: (circumference) Delete the +1 Problem: (area) The area formula is wrong Answers Found [3/4] 1 d 2 1 c a public class circle public static double area(double radius) return 3.14*radius; public static double diameter(double radius) return 2*radius; public static double circumference(double radius) return diameter(radius+1)*3.14; public static void main(string[] args) try double radius = Double.parseDouble(args[0]); String type= args[1]; switch(type) case "a": System.out.println(area(radius)); break; case "b": System.out.println(diameter(radius)); break; case "c": System.out.println(circumference(radius)); break;
14 Page 14 of 14 GCF Medium 3 Bugs Total Answers Found [1/3] public class gcd public static int gcd(int n, int m) if (n==0 && m==0) return 2; else if (n==m) return n; else if(m < n) return gcd(n-m, n); else return gcd(n, m-n); public static void main(string[] args) try int n = Integer.parseInt(args[0]); int m = Integer.parseInt(args[1]); if((n>100) (m>100)) else System.out.println(gcd(m, m));
Tasks for fmri-setting (Tasks of first and second pilot study at the end)
Tasks for fmri-setting (Tasks of first and second pilot study at the end) 1. Faculty int result = 1; int x = 4; while (x > 1) { result = result * x; x--; 7. Find max in list of numbers public static void
More informationCONDITIONAL EXECUTION
CONDITIONAL EXECUTION yes x > y? no max = x; max = y; logical AND logical OR logical NOT &&! Fundamentals of Computer Science I Outline Conditional Execution if then if then Nested if then statements Comparisons
More informationIntroduction to Computer Science Midterm 3 Fall, Points
Introduction to Computer Science Fall, 2001 100 Points Notes 1. Tear off this sheet and use it to keep your answers covered at all times. 2. Turn the exam over and write your name next to the staple. Do
More informationIntroduction to Java Unit 1. Using BlueJ to Write Programs
Introduction to Java Unit 1. Using BlueJ to Write Programs 1. Open up BlueJ. Click on the Project menu and select New Project. You should see the window on the right. Navigate to wherever you plan to save
More informationCOMP 202 Java in one week
CONTENTS: Basics of Programming Variables and Assignment Data Types: int, float, (string) Example: Implementing a calculator COMP 202 Java in one week The Java Programming Language A programming language
More informationConditionals, Loops, and Style
Conditionals, Loops, and Style yes x > y? no max = x; max = y; http://xkcd.com/292/ Fundamentals of Computer Science Keith Vertanen Copyright 2013 Control flow thus far public class ArgsExample public
More informationECE 2574: Data Structures and Algorithms - Recursion Part I. C. L. Wyatt
ECE 2574: Data Structures and Algorithms - Recursion Part I C. L. Wyatt Today we will introduce the notion of recursion, look at some examples, and see how to implement them in code. Introduction to recursion
More informationAP Computer Science Unit 1. Programs
AP Computer Science Unit 1. Programs Open DrJava. Under the File menu click on New Java Class and the window to the right should appear. Fill in the information as shown and click OK. This code is generated
More informationAP Computer Science Unit 1. Writing Programs Using BlueJ
AP Computer Science Unit 1. Writing Programs Using BlueJ 1. Open up BlueJ. Click on the Project menu and select New Project. You should see the window on the right. Navigate to wherever you plan to save
More informationCSCI 135 Exam #0 Fundamentals of Computer Science I Fall 2012
CSCI 135 Exam #0 Fundamentals of Computer Science I Fall 2012 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 informationConditionals, Loops, and Style. Control flow thus far. if statement. Control flow. Common branching statement Evaluate a boolean expression
Conditionals, Loops, and Style Control flow thus far yes no x > y? max = x; max = y; public class ArgsExample time 0 String product = args[0]; time 1 int qty = Integer.parseInt(args[1]); time 2 double
More informationNotes - Recursion. A geeky definition of recursion is as follows: Recursion see Recursion.
Notes - Recursion So far we have only learned how to solve problems iteratively using loops. We will now learn how to solve problems recursively by having a method call itself. A geeky definition of recursion
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 informationVariables and data types
Survivor: CSCI 135 Variables Variables and data types Stores information your program needs Each has a unique name Each has a specific type Java built-in type what it stores example values operations String
More informationAdministrativia. CS107 Introduction to Computer Science. Readings. Algorithms. Expressing algorithms
CS107 Introduction to Computer Science Lecture 2 An Introduction to Algorithms: and Conditionals Administrativia Lab access Searles 128: Mon-Friday 8-5pm (unless class in progress) and 6-10pm Sat, Sun
More informationChapter 3 Problem Solving and the Computer
Chapter 3 Problem Solving and the Computer An algorithm is a step-by-step operations that the CPU must execute in order to solve a problem, or to perform that task. A program is the specification of an
More informationCIS 110 Introduction to Computer Programming Spring 2016 Midterm
CIS 110 Introduction to Computer Programming Spring 2016 Midterm Name: Recitation # (e.g., 201): Pennkey (e.g., eeaton): My signature below certifies that I have complied with the University of Pennsylvania
More informationCW Middle School. Math RtI 7 A. 4 Pro cient I can add and subtract positive fractions with unlike denominators and simplify the result.
1. Foundations (14.29%) 1.1 I can add and subtract positive fractions with unlike denominators and simplify the result. 4 Pro cient I can add and subtract positive fractions with unlike denominators and
More informationA cipher is a type of secret code, where you swap the letters around so that noone can read your message.
Secret Messages Introduction: In this project, you ll learn how to make your own encryption program, to send and receive secret messages with a friend. This project ties in with the Earth to Principa activity
More informationNew York University Introduction to Computer Science Exam Sample Problems 2013 Andrew I. Case. Instructions:
Name: New York University Introduction to Computer Science Exam Sample Problems 2013 Andrew I. Case Instructions: KEEP TEST BOOKLET CLOSED UNTIL YOU ARE INSTRUCTED TO BEGIN. This exam is double sided (front
More informationAP Computer Science Unit 1. Writing Programs Using BlueJ
AP Computer Science Unit 1. Writing Programs Using BlueJ 1. Open up BlueJ. Click on the Project menu and select New Project. You should see the window on the right. Navigate to wherever you plan to save
More informationProfessor: Sana Odeh Lecture 3 Python 3.1 Variables, Primitive Data Types & arithmetic operators
1 Professor: Sana Odeh odeh@courant.nyu.edu Lecture 3 Python 3.1 Variables, Primitive Data Types & arithmetic operators Review What s wrong with this line of code? print( He said Hello ) What s wrong with
More informationData Types and the while Statement
Session 2 Student Name Other Identification Data Types and the while Statement In this laboratory you will: 1. Learn about three of the primitive data types in Java, int, double, char. 2. Learn about the
More informationNew York University Introduction to Computer Science Exam Sample Problems 2013 Andrew I. Case. Instructions:
Name: New York University Introduction to Computer Science Exam Sample Problems 2013 Andrew I. Case Instructions: KEEP TEST BOOKLET CLOSED UNTIL YOU ARE INSTRUCTED TO BEGIN. This exam is double sided (front
More informationCS Week 13. Jim Williams, PhD
CS 200 - Week 13 Jim Williams, PhD This Week 1. Team Lab: Instantiable Class 2. BP2 Strategy 3. Lecture: Classes as templates BP2 Strategy 1. M1: 2 of 3 milestone tests didn't require reading a file. 2.
More informationCourse Outline. Introduction to java
Course Outline 1. Introduction to OO programming 2. Language Basics Syntax and Semantics 3. Algorithms, stepwise refinements. 4. Quiz/Assignment ( 5. Repetitions (for loops) 6. Writing simple classes 7.
More informationIntroduction to Java Applications
2 Introduction to Java Applications OBJECTIVES In this chapter you will learn: To write simple Java applications. To use input and output statements. Java s primitive types. Basic memory concepts. To use
More informationOutline. Overview. Control statements. Classes and methods. history and advantage how to: program, compile and execute 8 data types 3 types of errors
Outline Overview history and advantage how to: program, compile and execute 8 data types 3 types of errors Control statements Selection and repetition statements Classes and methods methods... 2 Oak A
More informationGive one example where you might wish to use a three dimensional array
CS 110: INTRODUCTION TO COMPUTER SCIENCE SAMPLE TEST 3 TIME ALLOWED: 60 MINUTES Student s Name: MAXIMUM MARK 100 NOTE: Unless otherwise stated, the questions are with reference to the Java Programming
More informationCS 455 Midterm Exam 1 Spring 2015 [Bono] Thursday, Feb. 19, 2015
Name: USC username (e.g., ttrojan): CS 455 Midterm Exam 1 Spring 2015 [Bono] Thursday, Feb. 19, 2015 There are 5 problems on the exam, with 50 points total available. There are 7 pages to the exam, including
More informationMcGill 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 informationArea rectangles & parallelograms
Area rectangles & parallelograms Rectangles One way to describe the size of a room is by naming its dimensions. So a room that measures 12 ft. by 10 ft. could be described by saying its a 12 by 10 foot
More informationCOMP 202. Java in one week
COMP 202 CONTENTS: Basics of Programming Variables and Assignment Data Types: int, float, (string) Example: Implementing a calculator Java in one week The Java Programming Language A programming language
More informationCSCI 135 Exam #1 Fundamentals of Computer Science I Fall 2012
CSCI 135 Exam #1 Fundamentals of Computer Science I Fall 2012 Name: This exam consists of 6 problems on the following 7 pages. You may use your two-sided hand-written 8 ½ x 11 note sheet during the exam.
More informationCONDITIONAL EXECUTION
CONDITIONAL EXECUTION yes x > y? no max = x; max = y; logical AND logical OR logical NOT &&! Fundamentals of Computer Science I Outline Conditional Execution if then if then Nested if then statements Comparisons
More informationCS 170 Exam 2. Version: A Fall Name (as in OPUS) (print): Instructions:
CS 170 Exam 2 Version: A Fall 2015 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 informationLecture #6-7 Methods
Lecture #6-7 s 1. a. group of statements designed to perform a specific function b. may be reused many times i. in a particular program or ii. in multiple programs 2. Examples from the Java Library a.
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 informationQuestion: Total Points: Score:
CS 170 Exam 1 Section 000 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 informationCSc 2010 Principles of Computer Science, Fall 2013 Practice Problems for Midterm 3* * 3 17 % 9-20 % (26 / 7) "2"
CSc 2010 Principles of Computer Science, Fall 2013 Practice Problems for Midterm 1. For each Java expression in the left hand column, indicate its value in the right hand column. Be sure to show a constant
More informationChapter 1 Introduction to java
Chapter 1 Introduction to java History of java Java was created by by Sun Microsystems team led by James Gosling (1991) It was mainly used for home appliance, it later became a general purpose programming
More informationHelp File on C++ and Programming at CSUSM by Rika Yoshii
Help File on C++ and Programming at CSUSM by Rika Yoshii Compiler versus Editor empress.csusm.edu is a machine that you remotely log into from anywhere using putty, empress.csusm.edu uses the operating
More informationQuestion: Total Points: Score:
CS 170 Exam 1 Section 000 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 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 informationCS 106 Introduction to Computer Science I
CS 106 Introduction to Computer Science I 05 / 31 / 2017 Instructor: Michael Eckmann Today s Topics Questions / Comments? recap and some more details about variables, and if / else statements do lab work
More informationCIS133J. Working with Numbers in Java
CIS133J Working with Numbers in Java Contents: Using variables with integral numbers Using variables with floating point numbers How to declare integral variables How to declare floating point variables
More informationOpening Problem. Find the sum of integers from 1 to 10, from 20 to 30, and from 35 to 45, respectively.
Chapter 6 Methods 1 Opening Problem Find the sum of integers from 1 to 10, from 20 to 30, and from 35 to 45, respectively. 2 A Solution int sum = 0; for (int i = 1; i
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 informationCSE 1223: Introduction to Computer Programming in Java Chapter 2 Java Fundamentals
CSE 1223: Introduction to Computer Programming in Java Chapter 2 Java Fundamentals 1 Recall From Last Time: Java Program import java.util.scanner; public class EggBasketEnhanced { public static void main(string[]
More informationLast 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 informationChapter 3 Selection Statements
Chapter 3 Selection Statements 3.1 Introduction Java provides selection statements that let you choose actions with two or more alternative courses. Selection statements use conditions. Conditions are
More information204111: Computer and Programming
204111: Computer and Programming Week 4: Control Structures t Monchai Sopitkamon, Ph.D. Overview Types of control structures Using selection structure Using repetition structure Types of control ol structures
More informationIntroduction to the Java Basics: Control Flow Statements
Lesson 3: Introduction to the Java Basics: Control Flow Statements Repetition Structures THEORY Variable Assignment You can only assign a value to a variable that is consistent with the variable s declared
More informationBuilt-in data types. logical AND logical OR logical NOT &&! public static void main(string [] args)
Built-in data types logical AND logical OR logical NOT &&! public static void main(string [] args) Fundamentals of Computer Science Keith Vertanen Copyright 2013 Variables Variables and data types Stores
More informationCS 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 informationTitle. Java Just in Time. John Latham. October 25, October 25, 2017 Java Just in Time - John Latham Page 1(0/0)
List of Slides 1 Title 2 Chapter 6: Control statements nested in loops 3 Chapter aims 4 Section 2: Example:Film certificate age checking the whole queue 5 Aim 6 Statement: statements can be nested within
More informationPerimeter, Area, Surface Area, & Volume
Additional Options: Hide Multiple Choice Answers (Written Response) Open in Microsoft Word (add page breaks and/or edit questions) Generation Date: 11/25/2009 Generated By: Margaret Buell Copyright 2009
More informationBuilt-in data types. public static void main(string [] args) logical AND logical OR logical NOT &&! Fundamentals of Computer Science
Built-in data types logical AND logical OR logical NOT &&! public static void main(string [] args) Fundamentals of Computer Science Variables Overview Allows us to store and compute on data For now we'll
More informationLoops. CSE 114, Computer Science 1 Stony Brook University
Loops CSE 114, Computer Science 1 Stony Brook University http://www.cs.stonybrook.edu/~cse114 1 Motivation Suppose that you need to print a string (e.g., "Welcome to Java!") a user-defined times N: N?
More informationPROGRAMMING FUNDAMENTALS
PROGRAMMING FUNDAMENTALS Q1. Name any two Object Oriented Programming languages? Q2. Why is java called a platform independent language? Q3. Elaborate the java Compilation process. Q4. Why do we write
More informationSelections. CSE 114, Computer Science 1 Stony Brook University
Selections CSE 114, Computer Science 1 Stony Brook University http://www.cs.stonybrook.edu/~cse114 1 Motivation If you assigned a negative value for radius in ComputeArea.java, then you don't want the
More informationRepe$$on CSC 121 Fall 2015 Howard Rosenthal
Repe$$on CSC 121 Fall 2015 Howard Rosenthal Lesson Goals Learn the following three repetition methods, their similarities and differences, and how to avoid common errors when using them: while do-while
More informationChapter 3 Selections. Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved.
Chapter 3 Selections Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved. 0132130807 1 Motivations If you assigned a negative value for radius
More informationWrite a program which converts all lowercase letter in a sentence to uppercase.
Write a program which converts all lowercase letter in a sentence to uppercase. For Example: 1) Consider a sentence "welcome to Java Programming!" its uppercase conversion is " WELCOME TO JAVA PROGRAMMING!"
More informationCEN 414 Java Programming
CEN 414 Java Programming Instructor: H. Esin ÜNAL SPRING 2017 Slides are modified from original slides of Y. Daniel Liang WEEK 2 ELEMENTARY PROGRAMMING 2 Computing the Area of a Circle public class ComputeArea
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 informationSection 003 Fall CS 170 Exam 1. Name (print): Instructions:
CS 170 Exam 1 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 informationFull file at
Chapter 1 1. a. False; b. False; c. True; d. False; e. False; f; True; g. True; h. False; i. False; j. True; k. False; l. True. 2. Keyboard and mouse. 3. Monitor and printer. 4. Because programs and data
More informationCIRCLES ON TAKS NAME CLASS PD DUE
CIRCLES ON TAKS NAME CLASS PD DUE 1. On the calculator: Let s say the radius is 2. Find the area. Now let s double the radius to 4 and find the area. How do these two numbers relate? 2. The formula for
More informationFlow of Control. Chapter 3
Walter Savitch Frank M. Carrano Flow of Control Chapter 3 Outline The if-else statement The Type boolean The switch statement Flow of Control Flow of control is the order in which a program performs actions.
More informationCMPS 12A - Winter 2002 Final Exam A March 16, Name: ID:
CMPS 12A - Winter 2002 Final Exam A March 16, 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,
More informationCS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 3: SEP. 13TH INSTRUCTOR: JIAYIN WANG
CS/IT 114 Introduction to Java, Part 1 FALL 2016 CLASS 3: SEP. 13TH INSTRUCTOR: JIAYIN WANG 1 Notice Reading Assignment Chapter 1: Introduction to Java Programming Homework 1 It is due this coming Sunday
More informationComputer Programming, I. Laboratory Manual. Experiment #6. Loops
Think Twice Code Once The Islamic University of Gaza Engineering Faculty Department of Computer Engineering Fall 2017 ECOM 2005 Khaleel I. Shaheen Computer Programming, I Laboratory Manual Experiment #6
More informatione) Implicit and Explicit Type Conversion Pg 328 j) Types of errors Pg 371
Class IX HY 2013 Revision Guidelines Page 1 Section A (Power Point) Q1.What is PowerPoint? How are PowerPoint files named? Q2. Describe the 4 different ways of creating a presentation? (2 lines each) Q3.
More informationOpening Problem. Find the sum of integers from 1 to 10, from 20 to 30, and from 35 to 45, respectively.
Chapter 6 Methods 1 Opening Problem Find the sum of integers from 1 to 10, from 20 to 30, and from 35 to 45, respectively. 2 A Solution int sum = 0; for (int i = 1; i
More informationAP COMPUTER SCIENCE A
AP COMPUTER SCIENCE A CONTROL FLOW Aug 28 2017 Week 2 http://apcs.cold.rocks 1 More operators! not!= not equals to % remainder! Goes ahead of boolean!= is used just like == % is used just like / http://apcs.cold.rocks
More informationChapter 2: Data and Expressions
Chapter 2: Data and Expressions CS 121 Department of Computer Science College of Engineering Boise State University August 21, 2017 Chapter 2: Data and Expressions CS 121 1 / 51 Chapter 1 Terminology Review
More informationFinal Examination Semester 3 / Year 2010
Southern College Kolej Selatan 南方学院 Final Examination Semester 3 / Year 2010 COURSE : PROGRAMMING LOGIC AND DESIGN COURSE CODE : CCIS1003 TIME : 2 1/2 HOURS DEPARTMENT : COMPUTER SCIENCE LECTURER : LIM
More informationChapter 5 Lab Methods
Chapter 5 Lab Methods Lab Objectives Be able to write methods Be able to call methods Be able to write javadoc comments Be able to create HTML documentation using the javadoc utility Introduction Methods
More informationProgramming Constructs Overview. Method Call System.out.print( hello ); Method Parameters
Programming Constructs Overview Method calls More selection statements More assignment operators Conditional operator Unary increment and decrement operators Iteration statements Defining methods 27 October
More informationCSci 1113 Midterm 2. Name: Student ID:
CSci 1113 Midterm 2 Name: Student ID: Instructions: Please pick and answer any 6 of the 8 problems for a total of 90 points. If you answer more than 6 problems, only the first 6 will be graded. The time
More informationCONTENTS: What Is Programming? How a Computer Works Programming Languages Java Basics. COMP-202 Unit 1: Introduction
CONTENTS: What Is Programming? How a Computer Works Programming Languages Java Basics COMP-202 Unit 1: Introduction Announcements Did you miss the first lecture? Come talk to me after class. If you want
More informationRepetition Algorithms
Repetition Algorithms Repetition Allows a program to execute a set of instructions over and over. The term loop is a synonym for a repetition statement. A Repetition Example Suppose that you have been
More informationCCHAPTER SELECTION STATEMENTS HAPTER 3. Objectives
LIANMC03v3_0132221586.QXD 5/15/06 7:41 PM Page 67 CCHAPTER HAPTER 3 1 SELECTION STATEMENTS Objectives To declare boolean type and write Boolean expressions ( 3.2). To distinguish between conditional and
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 informationCMPS 12A Winter 2006 Prof. Scott A. Brandt Final Exam, March 21, Name:
CMPS 12A Winter 2006 Prof. Scott A. Brandt Final Exam, March 21, 2006 Name: Email: This is a closed note, closed book exam. There are II sections worth a total of 200 points. Plan your time accordingly.
More information1- Write a single C++ statement that: A. Calculates the sum of the two integrates 11 and 12 and outputs the sum to the consol.
1- Write a single C++ statement that: A. Calculates the sum of the two integrates 11 and 12 and outputs the sum to the consol. B. Outputs to the console a floating point number f1 in scientific format
More informationReview. Primitive Data Types & Variables. String Mathematical operators: + - * / % Comparison: < > <= >= == int, long float, double boolean char
Review Primitive Data Types & Variables int, long float, double boolean char String Mathematical operators: + - * / % Comparison: < > = == 1 1.3 Conditionals and Loops Introduction to Programming in
More informationQuestion: 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 informationChapter 2 Exercise Solutions
Chapter 2 Exercise Solutions EX 2.1. EX 2.2. EX 2.3. EX 2.4. EX 2.5. Explain the following programming statement in terms of objects and the services they provide. System.out.println ("I gotta be me!");
More informationCSCE Practice Midterm. Data Types
CSCE 2004 - Practice Midterm This midterm exam was given in class several years ago. Work each of the following questions on your own. Once you are done, check your answers. For any questions whose answers
More informationSequence structure. The computer executes java statements one after the other in the order in which they are written. Total = total +grade;
Control Statements Control Statements All programs could be written in terms of only one of three control structures: Sequence Structure Selection Structure Repetition Structure Sequence structure The
More informationCSC 1051 Algorithms and Data Structures I. Midterm Examination March 2, Name:
CSC 1051 Algorithms and Data Structures I Midterm Examination March 2, 2017 Name: Question Value Score 1 10 2 10 3 20 4 20 5 20 6 20 TOTAL 100 Please answer questions in the spaces provided. If you make
More informationSpring 2013 COMP Midterm Exam Solutions March 07, 2013
Spring 2013 COMP 110-003 Midterm Exam Solutions March 07, 2013 UNC Honor Pledge: I certify that no unauthorized assistance has been received or given in the completion of this work. Signature: Read this
More informationChapter 2: Data and Expressions
Chapter 2: Data and Expressions CS 121 Department of Computer Science College of Engineering Boise State University April 21, 2015 Chapter 2: Data and Expressions CS 121 1 / 53 Chapter 2 Part 1: Data Types
More informationSNS COLLEGE OF ENGINEERING
SNS COLLEGE OF ENGINEERING DEPARTMENT OF CSE Presented By Thillaiarasu.N SCRAMBLE 2 Solution 3 What is Pseudocode? 4 Consists of: Short Readable Formally styled English language Used for: Explaining the
More informationi.e.: n! = n (n 1)
Recursion and Java Recursion is an extremely powerful problemsolving technique. Problems that at first appear difficult often have simple recursive solutions. Recursion breaks a problems into several smaller
More informationCSE 20. SAMPLE FINAL Version A Time: 180 minutes. The following precedence table is provided for your use:
CSE 20 SAMPLE FINAL Version A Time: 180 minutes Name The following precedence table is provided for your use: Precedence of Operators ( ) - (unary),!, ++, -- *, /, % +, - (binary) = = =,!= &&
More informationObject-Oriented Programming
Object-Oriented Programming Java Syntax Program Structure Variables and basic data types. Industry standard naming conventions. Java syntax and coding conventions If Then Else Case statements Looping (for,
More informationGet JAVA. I will just tell you what I did (on January 10, 2017). I went to:
Get JAVA To compile programs you need the JDK (Java Development Kit). To RUN programs you need the JRE (Java Runtime Environment). This download will get BOTH of them, so that you will be able to both
More information