CS 1428 Exam II Review.

Slides:



Advertisements
Similar presentations
Chapter 7: User-Defined Functions II
Advertisements

Computer Science 1620 Loops.
COMP1180 Review Date: 4 March, 2009 Time: 10:30am - 12:20pm Venue: –CS students -- FSC801C and FSC801D –IS and other students -- OEE1017 Remarks: – 1)
1 10/20/08CS150 Introduction to Computer Science 1 do/while and Nested Loops Section 5.5 & 5.11.
Review for midterm exam Dilshad M. Shahid Spring NYU.
1 Chapter 6 Looping Dale/Weems/Headington. 2 l Physical order vs. logical order l A loop is a repetition control structure based on a condition. l it.
1 Chapter 18-1 Recursion Dale/Weems. 2 Chapter 18 Topics l Meaning of Recursion l Base Case and General Case in Recursive Function Definitions l Writing.
Chapter 5: Control Structures II (Repetition)
EGR 2261 Unit 5 Control Structures II: Repetition  Read Malik, Chapter 5.  Homework #5 and Lab #5 due next week.  Quiz next week.
 200 Total Points ◦ 74 Points Writing Programs ◦ 60 Points Tracing Algorithms and determining results ◦ 36 Points Short Answer ◦ 30 Points Multiple Choice.
Project 1 Due Date: September 25 th Quiz 4 is due September 28 th Quiz 5 is due October2th 1.
Exam Format  130 Total Points  10 Points Short Answer  15 Points Fill in the Blank  25 Points T/F  60 Points Multiple Choice  20 Points Matching.
Exam Format  90 Total Points  60 Points Writing Programs  25 Points Tracing Code/Algorithms and determining results  5 Points Short Answer  Similar.
111/15/2015CS150 Introduction to Computer Science 1 Summary  Exam: Friday, October 17,  Assignment: Wednesday, October 15, 2003  We have completed.
Exam 1 Review CS Total Points – 60 Points Writing Programs – 20 Points Tracing Algorithms, determining results, and drawing pictures – 40 Points.
Final Exam Review CS Total Points – 60 Points Writing Programs – 50 Points Tracing Algorithms, determining results, and drawing pictures – 50.
Exam Format  105 Total Points  25 Points Short Answer  20 Points Fill in the Blank  15 Points T/F  45 Points Multiple Choice  The above are approximations.
 140 Total Points ◦ 100 Points Writing Programs ◦ 24 Points Tracing Algorithms and determining results ◦ 16 Points Short Answer  Similar to quizzes.
1 COMS 261 Computer Science I Title: Functions Date: October 12, 2005 Lecture Number: 17.
Functions: Part 2 of /11/10: Lecture 16 CMSC 104, Section 0101 John Y. Park 1.
 200 Total Points ◦ 75 Points Writing Programs ◦ 60 Points Tracing Algorithms and determining results ◦ 35 Points Short Answer ◦ 30 Points Multiple Choice.
Before we get started…. First, a few things… Weighted Grading System Programming Style Submitting your assignments… The char and string variable types.
Modular Programming – User Defined Functions. CSCE 1062 Outline  Modular programming – user defined functions  Value returning functions  return statement.
1 CS 1430: Programming in C++. Quiz Functions Function Prototype float sqrt(float x); Function name, type, parameter and parameter type Function.
CS 1308 Exam 2 Review. Exam Format 110 Total Points 24 Points Short Answer 28 Points Fill in the Blank 16 Points T/F 36 Points Multiple Choice The above.
Midterm Exam Topics (Prof. Chang's section) CMSC 201.
Final Exam Review CS Total Points – 20 Points Writing Programs – 65 Points Tracing Algorithms, determining results, and drawing pictures – 50.
Exam 2 Review CS 3358 Data Structures. 90 Total Points – 50 Points Writing Programs – 25 Points Tracing Algorithms, determining results, and drawing pictures.
Liang, Introduction to Programming with C++, Second Edition, (c) 2010 Pearson Education, Inc. All rights reserved Chapter 4 Loops.
Chapter 6 Looping. 2 l A loop is a repetition control structure. l it causes a single statement or block to be executed repeatedly What is a loop?
CS 1428 Exam I Review. Exam Format 130 Total Points – 40 Points Writing Programs – 30 Points Tracing Algorithms and determining results – 20 Points Short.
CS 1428 Final Exam Review. Exam Format 200 Total Points – 60 Points Writing Programs – 45 Points Tracing Algorithms and determining results – 20 Points.
Final Exam Review CS 3358.
Exam 2 Review.
CS 1308 Exam I Review.
Chapter 4 Loops DDC 2133 Programming II.
CS 1428 Exam I Review.
CS 1428 Exam II Review.
CS 1308 Exam 2 Review.
Exam 2 Review CS 3358 Data Structures.
CS 2308 Final Exam Review.
CS 2308 Exam I Review.
CS 2308 Exam II Review.
CS 2308 Exam II Review.
CS 2308 Exam II Review.
Exam 2 Review CS 3358 Data Structures.
CS 1428 Exam I Review.
Exam 1 Review CS 3358.
CS 2308 Exam I Review.
CS 2308 Exam I Review.
Exam 1 Review CS 3358.
Review for Final Exam.
Exam 2 Review CS 3358 Data Structures.
CS 2308 Exam II Review.
CS 1428 Final Exam Review.
EE 312 Software Design and Implementation I
Looping III (do … while statement)
Let’s all Repeat Together
CS 1428 Final Exam Review.
Review for Final Exam.
EE 312 Exam I Review.
Fundamental Programming
EE 312 Final Exam Review.
Types of loops definite loop: A loop that executes a known number of times. Examples: Repeat these statements 10 times. Repeat these statements k times.
EE 312 Software Design and Implementation I
EE 312 Exam I Review.
CS 1428 Exam I Review.
CS 1308 Exam 2 Review.
CS 2308 Final Exam Review.
EE 312 Exam I Review.
Presentation transcript:

CS 1428 Exam II Review

Exam Format 110 Total Points 60 Points Writing Programs 30 Points Tracing Algorithms and determining results 20 Points Short Answer Similar to quizzes and programming assignments

Example Programming Problem Write a function named getBigger that takes an integer parameter, prompts the user for a number, and then returns the higher of the two numbers.

Example Tracing Problem What will the EXACT output of the following program be? int foo = 9; string str = "Hey!"; float foo2 = 5.7; while (foo2 < foo) { if (foo2 > 3.14) { cout << str << “ bigger than PI!” << endl; foo -= 2; } else cout << foo << “loser” << endl;

Example Short Answer Why do we need function prototypes before the main function?

Everything from Ch1-4 Need to know everything from first exam

Chapter 5 45 points Definite vs. indefinite iteration while loops Body of the loop Loop guard Infinite loops for loops Initialization Condition Progression Reading from an input file Read until EOF sentinel value Known size

Chapter 5 (cont.) Nested loops Off-by-one errors Understand the MathStuff and ATM programs do-while statement will not be on exam

Chapter 6 55 Points Functions Prototypes Definitions Function calls Parameter lists Return types return statement Parameters Difference between “formal” and “actual” Pass by value and pass by reference

Machine Organization 20 Points Execution cycle von Neumann architecture Stored program concept Remember the diagram Execution cycle Fetch-decode-execute How is information represented? integer character floating point

How to Study Rewrite all the programs. Redo labs. Learn by doing and recognizing patterns. Don’t stay up late!! Get some sleep and eat a good breakfast.

What to bring Pencils and erasers We will provide scratch paper No calculators

Questions