Midterm Review Session
|
|
- Randolf Summers
- 5 years ago
- Views:
Transcription
1 Midterm Review Session Programming Problems For more practice: Copyright 2009 by Pearson Education
2 Midterm Logistics Bring your UW Student ID card!! Will check your ID while you re leaving Bring your stuff with you while you exit (don t go back to seat) 60 minute exam -10 if you start early or try to write after time Any paper notes allowed, but NO ELECTRONICS Book OK, section handouts OK, past exams + solutions OK, etc. NO CALCULATORS! NO LAPTOPS! Aiming for a median of 80 Will be a curve if the exam is too hard, will not have a hurtful curve if exam is too easy Copyright 2009 by Pearson Education 2
3 About the Exam 100 pts, 20% of course grade Non-programming 61 pts Expressions (10), parameter mystery (12), if/else simulation (12), while loop simulation (12), assertions (15) Easy Programming 15 pts Medium Programming 15 pts Really Hard Programming 9 pts Topics covered: Chapters 1-5 Topics not covered: see website! Includes Graphics, printf, do/while, break Copyright 2009 by Pearson Education 3
4 More Exam Info Non-programming questions You do not need to show your work You are not allowed to use calculators (e.g. on expressions) Programming questions Are not graded on style, only external correctness Must write valid Java code that would compile Will not grade comments or pseudo-code Do NOT use abbreviations Do not have to write import statements Substantial partial credit is given for partially working solutions Write as much as you can: even a method header and the beginnings of a while loop could earn you partial points! More info on course website! Copyright 2009 by Pearson Education 4
5 General Tips BE AFRAID. Success on HW is not an indication of being prepared for the exam. Watch the clock! The hardest part about this exam will be the time limit. PRACTICE Q1-Q5 so that you can go through them fast and accurately! You want as much time as possible for the programming questions. Write as much as you can! A partial answer is better than none at all. Writing the correct method header will earn at least 1 point. Writing a partial loop, if statements, returns, etc. will points too Copyright 2009 by Pearson Education 5
6 General Tips Read the instructions now and learn the format so you won't be surprised tomorrow The format of the midterm will be the same as the samples For more practice, use Marty Stepp's Practice-it tool: Copyright 2009 by Pearson Education 6
7 Concepts Review Some essential topics from Ch1-5 Copyright 2009 by Pearson Education
8 For-loops Use to repeat stuff when you know exactly* how much you want to repeat * Could also have a variable or expression that tells you exactly how much you want to repeat Nested for-loops: loops within a loop When you want to do task multiple times, and that task has repetition to it E.g. multiplication table Cumulative sum: variable that keeps a sum in progress and is updated repeatedly until summing is finished In general: think about bounds, possible fencepost issues Copyright 2009 by Pearson Education 8
9 Conditionals and Tests If/else statement: Decide between several logical choices While loop: Repeat unknown number of times Sentinel loops: repeat until a certain signal is seen (e.g. prompt until you see a -1) boolean: primitive type with a true or false value When to return?? Boolean flag is helpful Copyright 2009 by Pearson Education 9
10 Strings length() to get length of a String indexof/contains to search for substring within String equals/equalsignorecase to test equality startswith/endswith to test beginning/end of word substring(index1, index2) to get a piece of a String index1 inclusive, index2 exclusive Index 0 for first letter, index length() -1 for last letter + to concatenate Strings together Copyright 2009 by Pearson Education 10
11 Other miscellaneous stuff Scanner to prompt for input hasnext, hasnextint, hasnextdouble, hasnextline Random to get a random value To generate random number between [min, max]: r.nextint(range) + min Where range: max min + 1 r.nextint(51) + 50; // produces random value Expressions stuff: % 10 and / 10 to get digits % 2 == 0 to test for even (!= for odd) Copyright 2009 by Pearson Education 11
12 Programming Practice Practice problems from previous exams Copyright 2009 by Pearson Education
13 Programming Tips Read the problems carefully: Does it want you to print a result, or return it? What values does the method use for computation? Are these values parameters, are they read from a Scanner, etc.? What type of value (if any) does the method return? Have you handled all special cases? What if the integer is 0, or negative? What if the string has no letters? What if there is only one word in the string? Many words? Copyright 2009 by Pearson Education 13
14 Practice Problem 1: Print Multiples Write a static method named printmultiples Takes two integers n and m as parameters and prints the first m multiples of n Assume m >= 1 Multiples are separated by commas printmultiples(3, 5); The first 5 multiples of 3 are 3, 6, 9, 12, 15 printmultiples(7, 3); The first 3 multiples of 7 are 7, 14, 21 Copyright 2009 by Pearson Education 14
15 Print Multiples Solution public static void printmultiples(int n, int times) { System.out.print("The first " + times + " multiples of " + n + " are " + n); for (int i = 2; i <= times; i++) { System.out.print(", " + i * n); System.out.println(); Copyright 2009 by Pearson Education 15
16 Practice Problem 2: Count Even Digits Write a static method named countevendigits Accepts an integer as its parameter and returns the number of even-valued digits in that number. Even digits: 0, 2, 4, 6, or 8 Assume value passed to your method is non-negative // 4 even digits: two 8s, the 4, and 6 int x = countevendigits( ) ; System.out.println("x is " + x); // x is 4 Copyright 2009 by Pearson Education 16
17 Count Even Digits Solution public static int countevendigits(int n) { int count = 0; while (n!= 0) { int digit = n % 10; n = n / 10; if (digit % 2 == 0) { count++; return count; Copyright 2009 by Pearson Education 17
18 Practice Problem 3: Cheerleader Write a static method named cheerleader Takes two params: number of lines of output number of "cheers" per line Cheer structure: 1 cheer: Go 2 cheers: Go Team Go 3 cheers: Go Team Go Team Go Each line indented by 3 spaces; first line at 0 spaces cheerleader(2, 1); Go Go cheerleader(4, 3); Go Team Go Team Go Go Team Go Team Go Go Team Go Team Go Go Team Go Team Go cheerleader(2, 4); Go Team Go Team Go Team Go Go Team Go Team Go Team Go Copyright 2009 by Pearson Education 18
19 Cheerleader Solution public static void cheerleader(int lines, int cheers) { for (int line = 1; line <= lines; line++) { for (int space = 1; space <= line - 1; space++) { System.out.print(" "); for (int cheer = 1; cheer <= cheers - 1; cheer++) { System.out.print("Go Team "); System.out.println("Go"); Copyright 2009 by Pearson Education 19
20 Practice Problem 4: Favorite Letter Write a static method named faveletter Accepts two parameters: Scanner for the console Favorite letter represented as a one-letter String Repeatedly prompt the user until two consecutive words are entered that start with that letter. Case sensitive (assume a Scanner named console was made earlier in code) faveletter(console, "y"); Looking for two "y" words. Type a word: hi Type a word: bye Type a word: yes Type a word: what? Type a word: yellow Type a word: yippee "y" is for "yippee" Print a message showing the last word typed. Copyright 2009 by Pearson Education 20
21 Favorite Letter Solution public static void faveletter(scanner console, String letter) { System.out.println("Looking for two \"" + letter + "\" words."); int count = 0; String word = ""; while (count < 2) { System.out.print("Type a word: "); word = console.next(); if (word.startswith(letter)) { count++; else { count = 0; System.out.println("\"" + letter + "\" is for \"" + word + "\""); Copyright 2009 by Pearson Education 21
22 Practice Problem 5: Random Rects Write a static method named randomrects Calculates and displays the area of randomly-generated rectangles. Each rectangle has random width and height btwn 1 and 10 inclusive Keep generating rectangles until an increasing sequence of four areas is printed. Stop when the last four rectangles generated have areas of a1, a2, a3 and a4 such that a1 < a2 < a3 < a4 randomrects(); w: 5, h: 6, area: 30 w: 10, h: 5, area: 50 w: 2, h: 8, area: 16 w: 4, h: 4, area: 16 w: 2, h: 9, area: 18 w: 8, h: 3, area: 24 w: 7, h: 2, area: 14 w: 3, h: 10, area: 30 w: 7, h: 9, area: 63 w: 9, h: 8, area: 72 End random rectangles. Copyright 2009 by Pearson Education 22
23 Random Rectangles Solution public static void randomrects() { Random r = new Random(); int last = 0; int count = 0; while (count!= 4) { int w = r.nextint(10) + 1; int h = r.nextint(10) + 1; int area = w * h; if (area <= last) { count = 1; // need to count first rect in sequence else { count++; System.out.println("w: " + w + ", h: " + h + ", area: " + area); last = area; System.out.println("End random rectangles."); Copyright 2009 by Pearson Education 23
24 Non-Programming Practice Tips on Questions 1-4 (For assertions help, see lecture 14) Copyright 2009 by Pearson Education
25 Expressions integer division and mod: quotient and remainder 14 / 3 is 4, 14 % 3 is 2 7 / 10 is 0, 7 % 10 is 7 precedence: ( ) before * / % before * 6 - (1 + 7) % * 6-8 % % Copyright 2009 by Pearson Education 25
26 Expressions 2 String concatenation: same precedence as integer + -, evaluated left-to-right with other + - operations "3" "3" "33" "334" + 5 "3345" type promotion: done as needed when int and double are mixed 50 / 6 / / Copyright 2009 by Pearson Education 26
27 Expression questions Evaluate the following expressions: 16 / * 2 8 / 7 + "5 / 4" + 8 / 3 88 % 10 % 3 * 16 / / 3 / 2 / * (3 + 2 * 6) / (8-14 / 3) * 2.2 Copyright 2009 by Pearson Education 27
28 Expression answers Correct answers: 16 / * / 7 + "5 / 4" + 8 / 3 "15 / 42" 88 % 10 % 3 * 16 / / 3 / 2 / * (3 + 2 * 6) / (8-14 / 3) * Copyright 2009 by Pearson Education 28
29 Parameter mystery question What is the output of the following program? public class Mystery { public static void main(string[] args) { String john = "skip"; String mary = "george"; String george = "mary"; String fun = "drive"; String work = "john"; speak(mary, john, fun); speak(george, work, john); speak(fun, "george", "work"); speak(george, mary, john); speak(george, "john", "dance"); public static void speak(string mary, String john, String fun) { System.out.println(john + " likes to " + fun + " with " + mary); Copyright 2009 by Pearson Education 29
30 Parameter mystery tips Try making a table of the parameters passed to each call: public class Mystery { public static void main(string[] args) { String john = "skip"; String mary = "george"; String george = "mary"; String fun = "drive"; String work = "john"; speak(mary, john, fun); speak(george, work, john); speak(fun, "george", "work"); speak(george, mary, john); speak(george, "john", "dance"); george skip drive mary john skip drive george work mary george skip mary john dance public static void speak(string mary, String john, String fun) { System.out.println(john + " likes to " + fun + " with " + mary); Copyright 2009 by Pearson Education 30
31 Parameter mystery answer What is the output of the following program? public class Mystery { public static void main(string[] args) { String john = "skip"; String mary = "george"; String george = "mary"; String fun = "drive"; String work = "john"; speak(mary, john, fun); speak(george, work, john); speak(fun, "george", "work"); speak(george, mary, john); speak(george, "john", "dance"); skip likes to drive with george john likes to skip with mary george likes to work with drive george likes to skip with mary john likes to dance with mary public static void speak(string mary, String john, String fun) { System.out.println(john + " likes to " + fun + " with " + mary); Copyright 2009 by Pearson Education 31
32 While loop mystery question Given the following program, public static void mystery(int y) { int x = 0; int z = 0; while (y > 0) { System.out.print(x + " " + z + " "); x++; z = z + y % 10; y = y / 10; System.out.println(x + " " + z); What is the output of the following sequence of calls? mystery(0); mystery(8); mystery(32); mystery(72); mystery(184); mystery(8239); Copyright 2009 by Pearson Education 32
33 While loop mystery tips Keep track of each variable's value as it changes: public static void mystery(int y) { int x = 0; int z = 0; while (y > 0) { System.out.print(x + " " + z + " "); x++; z = z + y % 10; y = y / 10; System.out.println(x + " " + z); What is the output of the following call? mystery(184); Sometimes, these problems are performing real computations in disguise. What is this problem really doing? x y z Copyright 2009 by Pearson Education 33
34 While loop mystery answers Given the following program, public static void mystery(int y) { int x = 0; int z = 0; while (y > 0) { System.out.print(x + " " + z + " "); x++; z = z + y % 10; y = y / 10; System.out.println(x + " " + z); What is the output of the following sequence of calls? mystery(0); 0 0 mystery(8); mystery(32); mystery(72); mystery(184); mystery(8239); Copyright 2009 by Pearson Education 34
CSE 142, Summer 2013 Midterm Exam, Friday, July 26, 2013
CSE 142, Summer 2013 Midterm Exam, Friday, July 26, 2013 Name: Section: TA: Student ID #: You have 60 minutes to complete this exam. You may receive a deduction if you keep working after the instructor
More informationCSE 142 Sample Midterm Exam #3
CSE 142 Sample Midterm Exam #3 1. Expressions (10 points) For each expression in the left-hand column, indicate its value in the right-hand column. Be sure to list a constant of appropriate type (e.g.,
More informationCS 1063 Introduction to Computer Programming Midterm Exam 2 Section 1 Sample Exam
Seat Number Name CS 1063 Introduction to Computer Programming Midterm Exam 2 Section 1 Sample Exam This is a closed book exam. Answer all of the questions on the question paper in the space provided. If
More informationCSE 142, Autumn 2010 Midterm Exam, Friday, November 5, 2010
CSE 142, Autumn 2010 Midterm Exam, Friday, November 5, 2010 Name: Section: TA: Student ID #: You have 50 minutes to complete this exam. You may receive a deduction if you keep working after the instructor
More informationTopic 12 more if/else, cumulative algorithms, printf
Topic 12 more if/else, cumulative algorithms, printf "We flew down weekly to meet with IBM, but they thought the way to measure software was the amount of code we wrote, when really the better the software,
More informationCSE 142 Sample Midterm Exam #3
CSE 142 Sample Midterm Exam #3 1. Expressions For each expression in the left-hand column, indicate its value in the right-hand column. Be sure to list a constant of appropriate type (e.g., 7.0 rather
More informationCS 112 Introduction to Programming
CS 112 Introduction to Programming Program Analysis Yang (Richard) Yang Computer Science Department Yale University 308A Watson, Phone: 432-6400 Email: yry@cs.yale.edu Admin q PS5 Walkthrough Thursday
More informationCSE 142, Autumn 2008 Midterm Exam, Friday, October 31, 2008
CSE 142, Autumn 2008 Midterm Exam, Friday, October 31, 2008 Name: Section: Student ID #: TA: You have 50 minutes to complete this exam. You may receive a deduction if you keep working after the instructor
More informationJava. Programming: Chapter Objectives. Why Is Repetition Needed? Chapter 5: Control Structures II. Program Design Including Data Structures
Chapter 5: Control Structures II Java Programming: Program Design Including Data Structures Chapter Objectives Learn about repetition (looping) control structures Explore how to construct and use count-controlled,
More informationBuilding Java Programs
Building Java Programs Chapter 5 Lecture 5-4: do/while loops, assertions reading: 5.1, 5.5 1 The do/while loop do/while loop: Performs its test at the end of each repetition. Guarantees that the loop's
More informationControl Structures in Java if-else and switch
Control Structures in Java if-else and switch Lecture 4 CGS 3416 Spring 2017 January 23, 2017 Lecture 4CGS 3416 Spring 2017 Selection January 23, 2017 1 / 26 Control Flow Control flow refers to the specification
More informationCS 112 Introduction to Programming
CS 112 Introduction to Programming (Spring 2012) Lecture #8: More on Conditional & Loop Zhong Shao Department of Computer Science Yale University Office: 314 Watson http://flint.cs.yale.edu/cs112 Acknowledgements:
More informationFlow of Control of Program Statements CS 112 Introduction to Programming. Basic if Conditional Statement Basic Test: Relational Operators
Flow of Control of Program Statements CS 112 Introduction to Programming (Spring 2012) q Java provides two types of program flow of control statements: decision statements, or conditional statements: decide
More information1. An operation in which an overall value is computed incrementally, often using a loop.
Practice Exam 2 Part I: Vocabulary (10 points) Write the terms defined by the statements below. 1. An operation in which an overall value is computed incrementally, often using a loop. 2. The < (less than)
More informationBuilding Java Programs
Building Java Programs Chapter 2 Lecture 2-1: Expressions and Variables reading: 2.1-2.2 Copyright 2009 by Pearson Education Data and expressions reading: 2.1 self-check: 1-4 videos: Ch. 2 #1 Copyright
More informationBuilding Java Programs
Building Java Programs Chapter 5 Lecture 5-4: do/while loops, assertions reading: 5.1, 5.5 1 The do/while loop do/while loop: Performs its test at the end of each repetition. Guarantees that the loop's
More informationCSE 142, Autumn 2011 Midterm Exam: Friday, November 4, 2011
CSE 142, Autumn 2011 Midterm Exam: Friday, November 4, 2011 Name: Section: Student ID #: TA: You have 50 minutes to complete this exam. You may receive a deduction if you keep working after the instructor
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 informationTopic 12 more if/else, cumulative algorithms, printf
Topic 12 more if/else, cumulative algorithms, printf "We flew down weekly to meet with IBM, but they thought the way to measure software was the amount of code we wrote, when really the better the software,
More informationBuilding Java Programs
Building Java Programs Chapter 4: Conditional Execution 1 loop techniques cumulative sum fencepost loops conditional execution Chapter outline the if statement and the if/else statement relational expressions
More informationBuilding Java Programs. Chapter 2: Primitive Data and Definite Loops
Building Java Programs Chapter 2: Primitive Data and Definite Loops Copyright 2008 2006 by Pearson Education 1 Lecture outline data concepts Primitive types: int, double, char (for now) Expressions: operators,
More informationSample Midterm Exam #2
Sample Midterm Exam #2 1. Expressions For each expression in the left-hand column, indicate its value in the right-hand column. Be sure to list a constant of appropriate type (e.g., 7.0 rather than 7 for
More informationCSE142 Sample Midterm Spring Name UW NetId (e.g. whitab) Section (e.g., AA) TA
CSE142 Sample Midterm Spring 2018 Name UW NetId (e.g. whitab) Section (e.g., AA) TA This exam is divided into nine questions with the following points: # Problem Area Points Score ---------------------------------------------
More informationBuilding Java Programs A Back to Basics Approach 4th Edition Reges TEST BANK Full download at:
Building Java Programs A Back to Basics Approach 4th Edition Reges TEST BANK Full download at: Building Java Programs A Back to Basics Approach 4th Edition Reges SOLUTIONS MANUAL https://testbankreal.com/download/building-java-programs-a-back-to-basicsapproach-4th-edition-reges-test-bank/
More informationC212 Early Evaluation Exam Mon Feb Name: Please provide brief (common sense) justifications with your answers below.
C212 Early Evaluation Exam Mon Feb 10 2014 Name: Please provide brief (common sense) justifications with your answers below. 1. What is the type (and value) of this expression: 5 * (7 + 4 / 2) 2. What
More informationCSE 142 Sample Midterm Exam #2
CSE 142 Sample Midterm Exam #2 1. Expressions For each expression in the left-hand column, indicate its value in the right-hand column. Be sure to list a constant of appropriate type (e.g., 7.0 rather
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 informationBuilding Java Programs
Building Java Programs Chapter 4 Lecture 4-1: if and if/else Statements reading: 4.2 self-check: #4-5, 7, 10, 11 exercises: #7 videos: Ch. 4 #2-4 The if/else statement Executes one block if a test is true,
More informationBuilding Java Programs
Building Java Programs Chapter 2 Lecture 2-1: Expressions and Variables reading: 2.1-2.2 1 Data and expressions reading: 2.1 self-check: 1-4 videos: Ch. 2 #1 2 Data types type: A category or set of data
More informationBuilding Java Programs
Building Java Programs Chapter 5 Lecture 5-1: while Loops, Fencepost Loops, and Sentinel Loops reading: 4.1, 5.1 self-check: Ch. 4 #2; Ch. 5 # 1-10 exercises: Ch. 4 #2, 4, 5, 8; Ch. 5 # 1-2 Copyright 2009
More informationassertion: A statement that is either true or false.
Logical assertions assertion: A statement that is either true or false. Examples: Java was created in 1995. The sky is purple. 23 is a prime number. 10 is greater than 20. x divided by 2 equals 7. (depends
More informationb. Suppose you enter input from the console, when you run the program. What is the output?
Part I. Show the printout of the following code: (write the printout next to each println statement if the println statement is executed in the program). a. Show the output of the following code: public
More informationAdvanced if/else & Cumulative Sum
Advanced if/else & Cumulative Sum Subset of the Supplement Lesson slides from: Building Java Programs, Chapter 4 by Stuart Reges and Marty Stepp (http://www.buildingjavaprograms.com/ ) Questions to consider
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 informationAssoc. Prof. Dr. Marenglen Biba. (C) 2010 Pearson Education, Inc. All rights reserved.
Assoc. Prof. Dr. Marenglen Biba (C) 2010 Pearson Education, Inc. All for repetition statement do while repetition statement switch multiple-selection statement break statement continue statement Logical
More information1 Short Answer (10 Points Each)
1 Short Answer (10 Points Each) 1. Write a for loop that will calculate a factorial. Assume that the value n has been input by the user and have the loop create n! and store it in the variable fact. Recall
More informationNoSuchElementException 5. Name of the Exception that occurs when you try to read past the end of the input data in a file.
CSC116 Practice Exam 2 - KEY Part I: Vocabulary (10 points) Write the terms defined by the statements below. Cumulative Algorithm 1. An operation in which an overall value is computed incrementally, often
More informationBuilding Java Programs
Building Java Programs Chapter 2 Lecture 2-1: Expressions and Variables reading: 2.1-2.2 1 2 Data and expressions reading: 2.1 3 The computer s view Internally, computers store everything as 1 s and 0
More informationChapter 5 Control Statements: Part 2 Section 5.2 Essentials of Counter-Controlled Repetition
Chapter 5 Control Statements: Part 2 Section 5.2 Essentials of Counter-Controlled Repetition 5.2 Q1: Counter-controlled repetition requires a. A control variable and initial value. b. A control variable
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 informationMenu Driven Systems. While loops, menus and the switch statement. Mairead Meagher Dr. Siobhán Drohan. Produced by:
Menu Driven Systems While loops, menus and the switch statement Produced by: Mairead Meagher Dr. Siobhán Drohan Department of Computing and Mathematics http://www.wit.ie/ Topics list while loops recap
More informationBuilding Java Programs
Building Java Programs Chapter 5 Lecture 5-1: while Loops, Fencepost Loops, and Sentinel Loops reading: 5.1 5.2 1 2 A deceptive problem... Write a method printletters that prints each letter from a word
More informationRepe$$on CSC 121 Spring 2017 Howard Rosenthal
Repe$$on CSC 121 Spring 2017 Howard Rosenthal Lesson Goals Learn the following three repetition structures in Java, their syntax, their similarities and differences, and how to avoid common errors when
More informationCMPT 125: Lecture 4 Conditionals and Loops
CMPT 125: Lecture 4 Conditionals and Loops Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University January 17, 2009 1 Flow of Control The order in which statements are executed
More informationCS 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 informationBuilding Java Programs Chapter 2
Building Java Programs Chapter 2 Primitive Data and Definite Loops Copyright (c) Pearson 2013. All rights reserved. Data types type: A category or set of data values. Constrains the operations that can
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 informationTopic 14 while loops and loop patterns
Topic 14 while loops and loop patterns "Given enough eyeballs, all bugs are shallow (e.g., given a large enough beta-tester and co-developer base, almost every problem will be characterized quickly and
More informationTopic 4 Expressions and variables
Topic 4 Expressions and variables "Once a person has understood the way variables are used in programming, he has understood the quintessence of programming." -Professor Edsger W. Dijkstra Based on slides
More informationBuilding Java Programs
Building Java Programs Chapter 4 Lecture 4-2: Advanced if/else; Cumulative sum; reading: 4.2, 4.4-4.5 2 Advanced if/else reading: 4.4-4.5 Factoring if/else code factoring: Extracting common/redundant code.
More informationCSE142 Sample Midterm, Winter 2018
CSE142 Sample Midterm, Winter 2018 1. Expressions, 10 points. For each expression in the left-hand column, indicate its value in the right-hand column. Be sure to list a constant of appropriate type (e.g.,
More informationControl Structures in Java if-else and switch
Control Structures in Java if-else and switch Lecture 4 CGS 3416 Spring 2016 February 2, 2016 Control Flow Control flow refers to the specification of the order in which the individual statements, instructions
More informationCSE 142, Autumn 2007 Midterm Exam, Friday, November 2, 2007
CSE 142, Autumn 2007 Midterm Exam, Friday, November 2, 2007 Name: Section: Student ID #: TA: Rules: You have 50 minutes to complete this exam. You may receive a deduction if you keep working after the
More informationYEAH 2: Simple Java! Avery Wang Jared Bitz 7/6/2018
YEAH 2: Simple Java! Avery Wang Jared Bitz 7/6/2018 What are YEAH Hours? Your Early Assignment Help Only for some assignments Review + Tips for an assignment Lectures are recorded, slides are posted on
More informationJava provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups:
JAVA OPERATORS GENERAL Java provides a rich set of operators to manipulate variables. We can divide all the Java operators into the following groups: Arithmetic Operators Relational Operators Bitwise Operators
More informationStructured Program Development in C
1 3 Structured Program Development in C 3.2 Algorithms 2 Computing problems All can be solved by executing a series of actions in a specific order Algorithm: procedure in terms of Actions to be executed
More informationCSEN202: Introduction to Computer Science Spring Semester 2017 Midterm Exam
Page 0 German University in Cairo April 6, 2017 Media Engineering and Technology Faculty Prof. Dr. Slim Abdennadher CSEN202: Introduction to Computer Science Spring Semester 2017 Midterm Exam Bar Code
More informationChapter 4: Control structures. Repetition
Chapter 4: Control structures Repetition Loop Statements After reading and studying this Section, student should be able to Implement repetition control in a program using while statements. Implement repetition
More informationBuilding Java Programs Chapter 2. bug. Primitive Data and Definite Loops. Copyright (c) Pearson All rights reserved. Software Flaw.
Building Java Programs Chapter 2 bug Primitive Data and Definite Loops Copyright (c) Pearson 2013. All rights reserved. 2 An Insect Software Flaw 3 4 Bug, Kentucky Bug Eyed 5 Cheesy Movie 6 Punch Buggy
More informationBuilding Java Programs Chapter 2
Building Java Programs Chapter 2 Primitive Data and Definite Loops Copyright (c) Pearson 2013. All rights reserved. bug 2 An Insect 3 Software Flaw 4 Bug, Kentucky 5 Bug Eyed 6 Cheesy Movie 7 Punch Buggy
More informationCIS 110 Introduction To Computer Programming. November 21st, 2011 Exam 2
CIS 110 Introduction To Computer Programming November 21st, 2011 Exam 2 Name and section # Pennkey (# and username): My signature below certifies that I have complied with the University of Pennsylvania
More information-Alfred North Whitehead. Copyright Pearson Education, 2010 Based on slides by Marty Stepp and Stuart Reges from
Copyright Pearson Education, 2010 Based on slides by Marty Stepp and Stuart Reges from http://www.buildingjavaprograms.com/ Topic 15 boolean methods and random numbers "It is a profoundly erroneous truism,
More informationGetting started with Java
Getting started with Java Magic Lines public class MagicLines { public static void main(string[] args) { } } Comments Comments are lines in your code that get ignored during execution. Good for leaving
More informationIntroduction to Computer Programming
Introduction to Computer Programming Lecture 2- Primitive Data and Stepwise Refinement Data Types Type - A category or set of data values. Constrains the operations that can be performed on data Many languages
More informationOct Decision Structures cont d
Oct. 29 - Decision Structures cont d Programming Style and the if Statement Even though an if statement usually spans more than one line, it is really one statement. For instance, the following if statements
More informationChapter 4: Control structures
Chapter 4: Control structures Repetition Loop Statements After reading and studying this Section, student should be able to Implement repetition control in a program using while statements. Implement repetition
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 informationCSCI 131, Midterm Exam 1 Review Questions This sheet is intended to help you prepare for the first exam in this course. The following topics have
CSCI 131, Midterm Exam 1 Review Questions This sheet is intended to help you prepare for the first exam in this course. The following topics have been covered in the first 5 weeks of the course. The exam
More informationControl Statements: Part 1
4 Let s all move one place on. Lewis Carroll Control Statements: Part 1 The wheel is come full circle. William Shakespeare How many apples fell on Newton s head before he took the hint! Robert Frost All
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 informationCS 112 Introduction to Programming
CS 112 Introduction to Programming Conditional Statements Boolean Expressions and Methods Yang (Richard) Yang Computer Science Department Yale University 308A Watson, Phone: 432-6400 Email: yry@cs.yale.edu
More informationCS 112 Introduction to Programming
CS 112 Introduction to Programming Conditional Statements Boolean Expressions and Methods Yang (Richard) Yang Computer Science Department Yale University 308A Watson, Phone: 432-6400 Email: yry@cs.yale.edu
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 informationType boolean. Building Java Programs. Recap: Type boolean. "Short-circuit" evaluation. De Morgan's Law. Boolean practice questions.
Building Java Programs Chapter 5 Lecture 5-4: More boolean, Assertions, do/while loops Type boolean reading: 5.3 reading: 5.3, 5.4, 5.1 1 Recap: Type boolean boolean: A logical type whose values are true
More informationFinal Exam. COMP Summer I June 26, points
Final Exam COMP 14-090 Summer I 2000 June 26, 2000 200 points 1. Closed book and closed notes. No outside material allowed. 2. Write all answers on the test itself. Do not write any answers in a blue book
More 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 informationRepetition, Looping. While Loop
Repetition, Looping Last time we looked at how to use if-then statements to control the flow of a program. In this section we will look at different ways to repeat blocks of statements. Such repetitions
More informationCompSci 125 Lecture 09. Chapter 5: while, break and continue statements Iterators and the ArrayList Class
CompSci 125 Lecture 09 Chapter 5: while, break and continue statements Iterators and the ArrayList Class Homework Update HW3 Due 9/20 HW4 Due 9/27 Exam-1 10/2 Programming Assignment Update p1: Traffic
More informationCompSci 125 Lecture 11
CompSci 125 Lecture 11 switch case The? conditional operator do while for Announcements hw5 Due 10/4 p2 Due 10/5 switch case! The switch case Statement Consider a simple four-function calculator 16 buttons:
More informationLecture 2: Operations and Data Types
Lecture 2: Operations and Data Types Building Java Programs: A Back to Basics Approach by Stuart Reges and Marty Stepp Copyright (c) Pearson 2013. All rights reserved. Data types type: A category or set
More informationConditionals and Loops
Conditionals and Loops Conditionals and Loops Now we will examine programming statements that allow us to: make decisions repeat processing steps in a loop Chapter 5 focuses on: boolean expressions conditional
More informationCSE 142, Summer 2010 Midterm Exam, Friday, July 30, 2010
CSE 142, Summer 2010 Midterm Exam, Friday, July 30, 2010 Name: Section: TA: Student ID #: You have 60 minutes to complete this exam. You may receive a deduction if you keep working after the instructor
More informationData and Variables. Data Types Expressions. String Concatenation Variables Declaration Assignment Shorthand operators. Operators Precedence
Data and Variables Data Types Expressions Operators Precedence String Concatenation Variables Declaration Assignment Shorthand operators Review class All code in a java file is written in a class public
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 informationCSC 1051 Data Structures and Algorithms I
Repetition CSC 1051 Data Structures and Algorithms I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website: www.csc.villanova.edu/~map/1051/ Some slides in this
More informationCS Introduction to Programming Midterm Exam #1 - Prof. Reed Spring 2010
CS 102 - Introduction to Programming Midterm Exam #1 - Prof. Reed Spring 2010 What is your name?: There are two sections: I. True/False..................... 60 points; ( 30 questions, 2 points each) II.
More informationBuilding Java Programs
Building Java Programs Chapter 4 Lecture 4-1: if and if/else Statements reading: 4.2 self-check: #4-5, 7, 10, 11 exercises: #7 videos: Ch. 4 #2-4 Loops with if/else if/else statements can be used with
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 informationMidterm Exam 2 CS 455, Fall 2013
Name: USC loginid (e.g., ttrojan): Midterm Exam 2 CS 455, Fall 2013 Wednesday, November 6, 2013 There are 9 problems on the exam, with 58 points total available. There are 8 pages to the exam, including
More informationBasic computer skills such as using Windows, Internet Explorer, and Microsoft Word. Chapter 1 Introduction to Computers, Programs, and Java
Basic computer skills such as using Windows, Internet Explorer, and Microsoft Word Chapter 1 Introduction to Computers, Programs, and Java Chapter 2 Primitive Data Types and Operations Chapter 3 Selection
More informationCSC 1051 Villanova University. CSC 1051 Data Structures and Algorithms I. Course website:
Repetition CSC 1051 Data Structures and Algorithms I Dr. Mary-Angela Papalaskari Department of Computing Sciences Villanova University Course website: www.csc.villanova.edu/~map/1051/ Some slides in this
More informationChapter 3 Structured Program Development
1 Chapter 3 Structured Program Development Copyright 2007 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. Chapter 3 - Structured Program Development Outline 3.1 Introduction
More informationCOE 211/COE 212 Computer/Engineering Programming. Welcome to Exam II Thursday December 20, 2012
1 COE 211/COE 212 Computer/Engineering Programming Welcome to Exam II Thursday December 20, 2012 Instructor: Dr. George Sakr Dr. Wissam F. Fawaz Dr. Maurice Khabbaz Name: Student ID: Instructions: 1. This
More informationIslamic University of Gaza Computer Engineering Dept. C++ Programming. For Industrial And Electrical Engineering By Instructor: Ruba A.
Islamic University of Gaza Computer Engineering Dept. C++ Programming For Industrial And Electrical Engineering By Instructor: Ruba A. Salamh Chapter Four: Loops 2 Chapter Goals To implement while, for
More informationIntroduction. C provides two styles of flow control:
Introduction C provides two styles of flow control: Branching Looping Branching is deciding what actions to take and looping is deciding how many times to take a certain action. Branching constructs: if
More informationCS 112 Introduction to Programming. Exercise: MatchDB. match1. Removing break. Solution I: Using break. Loop Patterns: break; Fencepost.
CS 112 Introduction to Programming CS112@Yale Loop Patterns: Fencepost Yang (Richard) Yang Computer Science Department Yale University 308A Watson, Phone: 432-6400 Email: yry@cs.yale.edu http://www.ultimateecards.com/image/772-jan-29-national-puzzle-day-card
More informationCS110D: PROGRAMMING LANGUAGE I
CS110D: PROGRAMMING LANGUAGE I Computer Science department Lecture 5&6: Loops Lecture Contents Why loops?? While loops for loops do while loops Nested control structures Motivation Suppose that you need
More informationJava Coding 3. Over & over again!
Java Coding 3 Over & over again! Repetition Java repetition statements while (condition) statement; do statement; while (condition); where for ( init; condition; update) statement; statement is any Java
More informationCS 102 / CS Introduction to Programming Midterm Exam #1 - Prof. Reed Fall 2010
CS 102 / CS 107 - Introduction to Programming Midterm Exam #1 - Prof. Reed Fall 2010 What is your name?: There are two sections: I. True/False..................... 60 points; ( 30 questions, 2 points each)
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 information