Monday, 11/18/02, Slide #1 CS 106 Intro to CS 1 Monday, 11/18/02  QUESTIONS??  Today:  Hand back, discuss HW #4  Discussion of Lab 10  Exam #2 Friday.

Slides:

Advertisements

Similar presentations

Introduction to C Programming

Advertisements

Monday, 11/11/02, Slide #1 CS 106 Intro to Comp. Sci. 1 Monday, 11/11/02  Questions? HW 04 due today at 5.  Today – Lists and an introduction to searching.

 Monday, 10/28/02, Slide #1 CS106 Introduction to CS1 Monday, 10/28/02  QUESTIONS on HW 03??  Today: Generating random numbers  Reading & exercises:

Wednesday, 12/4/02, Slide #1 CS 106 Intro to Comp. Sci. 1 Wednesday, 12/4/02  Questions?  Return Test #2  General discussion of HW #05  Introduction.

Engineering H192 - Computer Programming The Ohio State University Gateway Engineering Education Coalition Lect FXP. 1Winter Quarter Course Wrap Up and.

Wednesday, 10/2/02, Slide #1 CS 106 Intro to CS 1 Wednesday, 10/2/02  QUESTIONS (on HW02 – due at 5 pm)??  Today:  Review of parameters  Introduction.

Wednesday, 10/23/02, Slide #1 CS 106 Intro to CS 1 Wednesday, 10/23/02  QUESTIONS??  Today:  Discussion of HW #3  The const modifier for functions.

1 Chapter 11 Structured Types, Data Abstraction and Classes Dale/Weems/Headington.

Monday, 12/9/02, Slide #1 CS 106 Intro to CS 1 Monday, 12/9/02  QUESTIONS??  On HW #5 (Due 5 pm today)  Today:  Recursive functions  Reading: Chapter.

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)

Arrays Hanly - Chapter 7 Friedman-Koffman - Chapter 9.

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 

COMS W1004 Introduction to Computer Science June 1, 2009.

1 Data Structures Data Structures Topic #2. 2 Today’s Agenda Data Abstraction –Given what we talked about last time, we need to step through an example.

Topic R3 – Review for the Final Exam. CISC 105 – Review for the Final Exam Exam Date & Time and Exam Format The final exam is 120-minutes, closed- book,

CS 117 Spring 2002 April 5, Exam 3 April 10 –files, arrays, strings, classes –practice exams are up –review on Monday.

Computer Science II Exam I Review Monday, February 6, 2006.

Chapter 8 Arrays and Strings

CSE1301 Computer Programming: Revision. Topics Type of questions What do you need to know? About the exam Exam technique Sample questions.

Wednesday, 11/6/02, Slide #1 CS 106 Intro to CS 1 Wednesday, 11/6/02  QUESTIONS?? – HW # 4 due Monday  Today:  Return HW #3  Arrays (Chap. 10)  Reading:

Engineering H192 - Computer Programming The Ohio State University Gateway Engineering Education Coalition Lect FXP. 1Winter Quarter Course Wrap Up and.

CS 117 Spring 2002 Review for Exam 3 arrays strings files classes.

1 CSC241: Object Oriented Programming Lecture No 07.

Instructor: Alexander Stoytchev CprE 185: Intro to Problem Solving (using C)

1 Chapter 3 Data Representation Part 1. 2 Goals Introduce the different ways in which data may be represented Concepts –Abstract data types –Formula-based,

CMPSC 16 Problem Solving with Computers I Spring 2014 Instructor: Lucas Bang Lecture 7: One More Loop Problem, Generating “random” values, Midterm Review.

 200 Total Points ◦ 74 Points Writing Programs ◦ 60 Points Tracing Algorithms and determining results ◦ 36 Points Short Answer ◦ 30 Points Multiple Choice.

Hello.java Program Output 1 public class Hello { 2 public static void main( String [] args ) 3 { 4 System.out.println( “Hello!" ); 5 } // end method main.

Instructor: Alexander Stoytchev CprE 185: Intro to Problem Solving (using C)

CS Midterm Study Guide Fall General topics Definitions and rules Technical names of things Syntax of C++ constructs Meaning of C++ constructs.

Exam Format  90 Total Points  60 Points Writing Programs  25 Points Tracing Code/Algorithms and determining results  5 Points Short Answer  Similar.

Chapter 13 – C++ String Class. String objects u Do not need to specify size of string object –C++ keeps track of size of text –C++ expands memory region.

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.

EGR 2261 Unit 11 Classes and Data Abstraction  Read Malik, Chapter 10.  Homework #11 and Lab #11 due next week.  Quiz next week.

 2003 Prentice Hall, Inc. All rights reserved. 1 IS 0020 Program Design and Software Tools Preprocessor Midterm Review Lecture 7 Feb 17, 2004.

C++ Programming: From Problem Analysis to Program Design, Second Edition Chapter 14: Overloading and Templates Overloading will not be covered.

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.

CS1101 Group1 Discussion 10 Lek Hsiang Hui comp.nus.edu.sg

1 Objectives ❏ To understand the differences between text and binary files ❏ To write programs that read, write, and/or append binary files ❏ To be able.

CS 162 Introduction to Computer Science II Winter, 2014: 60 Spring, 2014: 60 Summer, 2014: 71.

1 Classes II Chapter 7 2 Introduction Continued study of –classes –data abstraction Prepare for operator overloading in next chapter Work with strings.

STL CSSE 250 Susan Reeder. What is the STL? Standard Template Library Standard C++ Library is an extensible framework which contains components for Language.

Midterm Exam Topics (Prof. Chang's section) CMSC 201.

Instructor: Alexander Stoytchev CprE 185: Intro to Problem Solving (using C)

Structured Programming (COIT 29222) Term 2, 2009, Final Exam Date And Time  As advised by the university Open/Closed Book (3 hours)  Structured Programming,

Chapter 3 Part II. 3.8 Placing a Class in a Separate File for Reusability.cpp file is known as a source-code file. Header files ◦ Separate files in which.

CS 1430: Programming in C++ 1. File Input in VS Project Properties Debugging Command Arguments quiz8-1.out We want to know how to do it ourselves, right?

CS 1428 Final Exam Review. Exam Format 200 Total Points – 60 Points Writing Programs – 45 Points Tracing Algorithms and determining results – 20 Points.

Defining Data Types in C++ Part 2: classes. Quick review of OOP Object: combination of: –data structures (describe object attributes) –functions (describe.

1 Chapter 12 Classes and Abstraction. 2 Chapter 12 Topics Meaning of an Abstract Data Type Declaring and Using a class Data Type Using Separate Specification.

Chapter 12 Classes and Abstraction

Test 2 Review Outline.

UMBC CMSC 104 – Section 01, Fall 2016

CS Computer Science IA: Procedural Programming

CMSC202 Computer Science II for Majors Lecture 08 – Overloaded Constructors Dr. Katherine Gibson Based on slides by Chris Marron at UMBC.

CS1010 Discussion Group 11 Week 7 – Two dimensional arrays.

CS 2308 Final Exam Review.

CS 2308 Exam I Review.

Review for Midterm Exam

Review for Final Exam.

CS 1428 Final Exam Review.

Review for Midterm Exam

Review for Midterm Exam

CS 1428 Final Exam Review.

Review for Final Exam.

Review for Midterm Exam

Review for Midterm Exam

CMSC201 Computer Science I for Majors Final Exam Information

Instructor: Dr. Michael Geiger Spring 2019 Lecture 13: Exam 1 Preview

Presentation transcript:

Monday, 11/18/02, Slide #1 CS 106 Intro to CS 1 Monday, 11/18/02  QUESTIONS??  Today:  Hand back, discuss HW #4  Discussion of Lab 10  Exam #2 Friday  General review  Handout: A practice exam. Do for Wednesday as part of your studying!

Monday, 11/18/02, Slide #2 Types of questions on exam  Exam covers all material we’ve studied through searching and sorting.  There may be questions of any of the following types:  Define or describe basic terms  Give examples  Evaluate expressions  Trace programs: Show output and/or contents of memory  Debug programs: Find and/or correct syntax and logical errors  Write short programs or program segments.   You may bring to the exam a reference sheet: a single, 8.5 by 11 piece of paper, on which you may write any information you wish (both sides OK).

Monday, 11/18/02, Slide #3 Exam Topics: Classes  Chapter 12 ( , ): Basic syntax and concepts of OOP and classes; principles of OOP, ADTs, objects; Client use of classes, declaring instances of class objects, the member access operator (dot); the header file: client interface, class definition, function prototypes, data members, public v. private; the implementation file: prefix of function names with class name and scope operator, defining member functions, when member access operator is needed to refer to class members, overloading functions

Monday, 11/18/02, Slide #4 Exam topics: Files, strings, char objects  Sections 5.5, 8.1-3; 8.6: File input/output; ; ofstream and ifstream types; end-of-file loops; declaring/opening/using/closing files  Chapter 9 (all): string objects; ; string constants; whitespace; string constructors and operators (input/output, comparison, index [ ], concatenation +); member functions (size(), length(), max_size())  Section 6.3: Char objects, char constants, ASCII codes, char library functions (isalpha(), etc., in )

Monday, 11/18/02, Slide #5 Exam topics: random numbers, logical & integer operators, type bool, for and do-loops  Sections 7.2-4: Logical operators &&, ||, !; precedence of operators; short-circuit evaluation; type bool; for-loops; nested loops; do-loops; Integer operators %, ++, --, +=, -=, *=, /=  From slides and lab: Random numbers in C++; ; rand(); RAND_MAX; srand(time(0)); ; random probabilities, random integers in a range

Monday, 11/18/02, Slide #6 Exam topics: Arrays, lists, searching and sorting, complexity  Chapter 10: Simple arrays, declaring and initializing arrays, processing arrays with loops, two-dimensional arrays. Lists, searching a list, linear search, binary search, sorting a list, selection sort. Time complexity of an algorithm.