CS 1428 Final Exam Review.

Slides:



Advertisements
Similar presentations
Introduction to C Programming
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)
Wednesday, 12/11/02, Slide #1 CS 106 Intro to Comp. Sci. 1 Wednesday, 12/11/02  QUESTIONS??  Today: CLOSING CEREMONIES!  HW #5 – Back Monday (12/16)
Program Design and Development
Wednesday, 10/9/02, Slide #1 CS 106 Intro to CS 1 Wednesday, 10/9/02  QUESTIONS ??  Today:  Discuss HW #02  Discuss test question types  Review 
Review for midterm exam Dilshad M. Shahid Spring NYU.
16/27/ :53 PM6/27/ :53 PM6/27/ :53 PMLogic Control Structures Arithmetic Expressions Used to do arithmetic. Operations consist of +,
CS241 PASCAL I - Control Structures1 PASCAL I - Control Structures Philip Fees CS241.
1. Reference  2  Algorithm :- Outline the essence of a computational procedure, step by step instructions.  Program :- an.
 200 Total Points ◦ 74 Points Writing Programs ◦ 60 Points Tracing Algorithms and determining results ◦ 36 Points Short Answer ◦ 30 Points Multiple Choice.
Exam Format  90 Total Points  60 Points Writing Programs  25 Points Tracing Code/Algorithms and determining results  5 Points Short Answer  Similar.
Exam 1 Review CS Total Points – 60 Points Writing Programs – 20 Points Tracing Algorithms, determining results, and drawing pictures – 40 Points.
Review Binary Numbers Bit : 0 or 1 Byte: 8 bites 256 different values 2 8 KB : 1024 bytes 2 10 bytes MB : 1024 * 1024 bytes 2 10 * 2 10 (2 20 ) bytes GB.
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.
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.
CS241 PASCAL I - Control Structures1 PASCAL Control Structures Modified Slides of Philip Fees.
Before we get started…. First, a few things… Weighted Grading System Programming Style Submitting your assignments… The char and string variable types.
Review for Final Exam. Contents 5 questions (20 points each) + 1 bonus question (20 points) – Basic concepts in Chapters 1-4 – Chapters 5-9 – Bonus: Chapter.
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.
Higher Computing Science 2016 Prelim Revision. Topics to revise Computational Constructs parameter passing (value and reference, formal and actual) sub-programs/routines,
Final Exam Review CS Total Points – 20 Points Writing Programs – 65 Points Tracing Algorithms, determining results, and drawing pictures – 50.
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.
UMBC CMSC 104 – Section 01, Fall 2016
CS Computer Science IA: Procedural Programming
CS 1428 Exam I Review.
C++, OBJECT ORIENTED PROGRAMMING
Chapter 5 Function Basics
CS1010 Discussion Group 11 Week 7 – Two dimensional arrays.
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 1428 Exam II Review.
Chapter 5 Function Basics
CS 2308 Exam I Review.
Exam 1 Review CS 3358.
Review for Final Exam.
Counting Loops.
Exam 1 Material Study Guide
Exam 2 Review CS 3358 Data Structures.
CS 2308 Exam II Review.
CS 1428 Final Exam Review.
Review for Midterm Exam
Review for Final Exam.
EE 312 Exam I Review.
Final Review Bina Ramamurthy 4/5/2019 BR.
Summary of what we learned yesterday
Fundamental Programming
Final Review Bina Ramamurthy 4/15/2019 BR.
EE 312 Final Exam Review.
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 Final Exam Review

Exam Format 200 Total Points 60 Points Writing Programs 45 Points Tracing Algorithms and determining results 20 Points Short answer 75 Points Multiple choice Similar to prior exams, quizzes and programming assignments Material since last exam will have more weight

Example Programming Problem Write a function named findSmallest that takes an array of integers and the number of integers in the array and returns the smallest integer in the array.

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?

Example Multiple Choice To allow file access in a program, you must #include this header file: a. file b. fileaccess c. fstream d. cfile

Chapter 1 0 points Types of errors Binary numbers Terminology Conversions to/from base 10 Simple addition and subtraction Conversion to/from 2’s complement Terminology Bits, bytes kilo, mega, giga, tera What do they mean? Machine language, assembly language, high- level language Von Neumann architecture Problem solving process Types of errors

Chapter 2 ?? Points Variables and Identifiers Assignment Valid identifiers Data types Integer types Floating Point types Characters Boolean Assignment Arithmetic Operators

Chapter 3 10 Points cin Mathematical expressions static_cast Constants Order of precedence Combined operators (e.g. += and ++) static_cast Constants Formatted output Mixed mode operations (mixing floats and ints) File input and output

Chapter 4 35 Points Relational operators Truth tables if statements Logical operators && || ! if statements if-else if-else-if

Chapter 5 40 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 50 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 Overloading methods Look at the “signatures” Using arrays as parameters to functions

Chapter 7 50 Points One-dimensional arrays Printing all the elements Declaration Assignment Using arrays as parameters Printing all the elements Finding the average of numeric elements It’s Hot Out There! Searching and Sorting Know what they are. Linear search

Chapter 11 20 Points Structures Know how to declare a structure Know how to access the fields in a structure Arrays of structures Understand Are We There Yet? program

How to Study Rewrite all the programs. Redo labs. Exam programming questions will be similar to assignments. 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