CMSC201 Computer Science I for Majors Lecture 25 – Final Exam Review

Slides:



Advertisements
Similar presentations
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)
Advertisements

Class 1: What this course is about. Assignments Reading: Chapter 1, pp 1-33 Do in Class 1: –Exercises on pages 13, 14, 22, 28 To hand in in Class 2: –Exercises.
Midterm Exam Topics (Prof. Chang's section) CMSC 201.
IB Exams May 2016 It’s GO time!. Testing Calendar.
CMSC201 Computer Science I for Majors Lecture 12 – Midterm Review Prof. Katherine Gibson.
CMSC201 Computer Science I for Majors Lecture 25 – Final Exam Review Prof. Katherine Gibson.
CMSC201 Computer Science I for Majors Lecture 05 – Comparison Operators and Boolean (Logical) Operators Prof. Katherine Gibson Prof. Jeremy.
CMSC201 Computer Science I for Majors Lecture 23 – Algorithms and Analysis Prof. Katherine Gibson Based on slides from previous iterations.
CMSC201 Computer Science I for Majors Lecture 25 – Final Exam Review Prof. Katherine Gibson Prof. Jeremy Dixon.
CS-171, Intro to A.I. — Quiz Instructions
Software Specification
Teacher Contact Information address - Phone number – 215 – 944 – 1154 Website is always available for you.
Computer Engineering Department Islamic University of Gaza
UMBC CMSC 104 – Section 01, Fall 2016
JOB APPLICATION DOS AND DON’TS
Introduction to Programming
CompSci 101 Introduction to Computer Science
PROBLEM SOLVING AND PROGRAMMING
CMSC201 Computer Science I for Majors Lecture 23 – Sorting
CMSC201 Computer Science I for Majors Lecture 13 – Midterm Review
Last Class We Covered Sorting algorithms “Run” time Selection Sort
SAT PREP OLD vs NEW.
Mr. Rau's Classroom Rules/Procedures
CMSC202 Computer Science II for Majors Lecture 08 – Overloaded Constructors Dr. Katherine Gibson Based on slides by Chris Marron at UMBC.
CMSC201 Computer Science I for Majors Lecture 13 – Program Design
CMPT 238 Data Structures Instructor: Tina Tian.
S4 – 6 Prelims Information Assembly.
CMSC201 Computer Science I for Majors Lecture 13 – Midterm Review
Intro to Computer Science CS1510, Section 2 Dr. Sarah Diesburg
Prepared by Stephen M. Thebaut, Ph.D. University of Florida
CMSC201 Computer Science I for Majors Lecture 24 – Sorting
CMSC201 Computer Science I for Majors Lecture 27 – Final Exam Review
Tuesday, April 10, 2018 Arrive At 8:30
FINAL EXAM INFORMATION
FINAL EXAM INFORMATION
Welcome to CS 1010! Algorithmic Problem Solving.
Last Class We Covered Data representation Binary numbers ASCII values
Midterm Exam Preperation
CS 2308 Exam I Review.
Sorting October 20, 2006 ComS 207: Programming I (in Java)
Welcome to CS 1301! Principles of Programming I.
Software Specification
Last Class We Covered Dictionaries Hashing Dictionaries vs Lists
Intro to Computer Science CS1510, Section 2 Dr. Sarah Diesburg
Quick Guide to the 2017 AP Biology Exam
Welcome to English Language Arts with Mr. Duyck and Maybe Mrs
WELCOME TO TOWSON UNIVERSITY
Last Class We Covered Asymptotic Analysis Run “time” Big O
Classroom Rules and Procedures
Intro to Computer Science CS1510, Section 2 Dr. Sarah Diesburg
EECE.2160 ECE Application Programming
CS-171, Intro to A.I. — Exam Instructions
Exam Directions * Leave a seat between you and your neighbor.
Tips for Success in Mathematics
Formal Geometry Ms. ramilo
CMSC201 Computer Science I for Majors Final Exam Information
CMSC201 Computer Science I for Majors Lecture 24 – Sorting
Please Write on Index Card:
Intro to CIT 594
EECE.2160 ECE Application Programming
Intro to CIT 594
REVIEW for the FINAL EXAM
Announcements – all about Exam 2
CMSC201 Computer Science I for Majors Lecture 12 – Midterm Review
Final Exam Directions * Leave a seat between you and your neighbor.
Midterm - 1 Instructions
CS 232 Geometric Algorithms: Lecture 1
CMPT 238 Data Structures Instructor: Tina Tian.
Review and Instructions
Topics for Final Exam Lecture 26 Autumn Quarter.
Presentation transcript:

CMSC201 Computer Science I for Majors Lecture 25 – Final Exam Review

Office Hours Tuesday (December 13th) is the last day office hours will be held Study Day is Wednesday (December 14th)

Exam Rules The final is closed everything: No books No notes No cheat sheets No laptops No calculators No phones

Exam Rules Place your bookbag under your desk/chair NOT on the seat next to you You may have on your desk: Pens, pencils, erasers Water bottle UMBC ID You must bring your UMBC ID with you to the exam! We won’t accept your test without it.

Exam Rules DO NOT CHEAT!!! Cheating will be dealt with severely and immediately If a TA or instructor sees you looking at another student’s paper they may take your test from you Your TA or instructor may ask you to move at any time during the test This doesn’t mean we think you’re cheating

Exam Time Final Exam will held be on Thursday, December 15th from 3:30 PM to 5:30 PM If you need SDS accommodations, you must request them and notify us ASAP

Exam Locations Being held in five separate rooms FA 215 - Sections 9, 15, 18 FA 306 - Sections 12, 17, 20, 24 ENGR 027 - Sections 2, 4, 6, 8, 14, 16, 22, 23, 27, 30 PAHB 132 - Sections 3, 10, 21, 26 PUP 105 - Sections 5, 11, 28, 29 Make sure you go to the correct room!

Exam Seating Space allowing, you will sit every other seat, so that you are not next to another student The proctor may have specific instructions for the seating arrangement in your room Make sure you know how to get to your exam room location – arrive early if possible! Locate your room ahead of time

Questions about Exam Rules?

Exam Format Similar to the midterm Going over the slides and making sure you are comfortable with the material would be a good idea Try some of the exercises and practice examples available in the slides

Exam Format Multiple Choice True/False Code evaluation Given code, what does it do?

Exam Format Debugging Fill in the blank Programming problems Find and fix errors Fill in the blank Complete a piece of partially-written code Programming problems Similar to work from assignments and labs

Questions about Exam Format?

Exam Content Everything we covered at the beginning! From the midterm, you should be familiar with: Evaluating expressions Control structures For Loops While Loops (including Interactive loops) If/Elif/Else Decimal <-> Binary conversion

Exam Content From the midterm, you should be familiar with: Lists Indexing (including negative indexing) Appending Debugging Strings String functions like split() and strip() Functions Passing and returning variables

Exam Content Everything else we’ve covered so far! You should be especially familiar with: File I/O Data structures Tuples Dictionaries Recursion

Exam Content You should be especially familiar with: Algorithms and analysis Searching algorithms Linear & Binary Sorting algorithms Selection Sort, Bubble Sort, & Quicksort Multi-dimensional lists 2D and 3D lists Printing, creating, copying You should understand how they work, and know their run times.

Questions about Exam Content?

Exam Advice Write down your name and circle your section Flip through the exam and get a feel for the length of it and the types of questions If a problem is unclear or you think there is an error on the exam, raise your hand

Exam Advice Some questions have partial credit You should at least attempt every problem If you don’t know how to do one part of the problem, skip it and do the rest Make sure to pace yourself – this exam is longer than the midterm!

Any Other Questions?

Announcements Project 2 out now Due on Tuesday, December 13th Survey #4 will come out on Friday evening Will be due Wed, December 21st @ 11:59 PM Similar to Survey #1, which asked about your performance on and prep for the midterm exam