CMSC201 Computer Science I for Majors Final Exam Information

Slides:



Advertisements
Similar presentations
Intro to CIT 594
Advertisements

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)
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.
Please open your laptops, log in to the MyMathLab course web site, and open Quiz 3.6B. IMPORTANT NOTE: If you have time left after you finish the problems.
Final Exams!. Where do I go/What do I do? After break, report to the gym. You will need to find your row and seat numbers. See below for Monday’s seating.
PLEASE GRAB A SEAT ANYWHERE FOR NOW. Welcome to the CMSC 201 Class!!! Mr. Lupoli ITE 207.
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
Synthesis ENGR 1181 MATLAB 11. Topics  No new material  Covers topics that will be on the Midterm 2 Exam MATLAB 01 – Program Design MATLAB 02 – Introduction.
Fall EE 333 Lillevik333f06-s1 University of Portland School of Engineering Computer Organization Study Guide 1 Exam 1 Thursday, September 28 Closed.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2003 Mr. Frey (0101 – 0104) Mr. Raouf (0201 – 0204)
BIT 143: Programming – Data Structures It is assumed that you will also be present for the slideshow for the first day of class. Between that slideshow.
REMINDER: If you haven’t yet passed the Gateway Quiz, make sure you take it this week! (You can find more practice quizzes online in the Gateway Info menu.
James Tam Introduction To CPSC 233 James Tam Java Object-Orientation Graphical-user interfaces.
BIT 143: Programming-Data Structures1 Before Class Begins: Sit in front of a computer Log in –IF you don’t yet have an account, you can use the guest account.
ANALYTIC GEOMETRY & ALGEBRA II MRS. CHAPMAN AND MS. STURDIVANT ROOM 304.
REMINDER: If you haven’t yet passed the Gateway Quiz, make sure you take it this week! (You can find more practice quizzes online in the Gateway Info menu.
IB Diploma Examinations May 2015 Final advice and explanation of conditions.
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.
All materials copyright UMBC unless otherwise noted CMSC201 Computer Science I for Majors Lecture 02 – Algorithmic Thinking.
CMSC201 Computer Science I for Majors Lecture 25 – Final Exam Review Prof. Katherine Gibson Prof. Jeremy Dixon.
CMSC201 Computer Science I for Majors Lecture 07 – While Loops
CSc 120 Introduction to Computer Programing II
CMSC201 Computer Science I for Majors Lecture 05 – Comparison Operators and Boolean (Logical) Operators Prof. Katherine Gibson Based on slides by Shawn.
CMSC201 Computer Science I for Majors Lecture 02 – Algorithmic Thinking Prof. Katherine Gibson Based on slides by Shawn Lupoli and Max Morawski at UMBC.
UMBC CMSC 104 – Section 01, Fall 2016
CompSci 101 Introduction to Computer Science
PROBLEM SOLVING AND PROGRAMMING
CMSC201 Computer Science I for Majors Lecture 13 – Midterm Review
CMSC201 Computer Science I for Majors Lecture 22 – Binary (and More)
Last Class We Covered Sorting algorithms Searching algorithms
Last Class We Covered Sorting algorithms “Run” time Selection Sort
CMSC201 Computer Science I for Majors Lecture 21 – Dictionaries
CMSC201 Computer Science I for Majors Lecture 22 – Searching
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
CompSci 101 Introduction to Computer Science
S4 – 6 Prelims Information Assembly.
CMSC201 Computer Science I for Majors Lecture 13 – Midterm Review
September 27 – Course introductions; Adts; Stacks and Queues
CMSC201 Computer Science I for Majors Lecture 27 – Final Exam Review
We’ll be spending minutes talking about Quiz 1 that you’ll be taking at the next class session before you take the Gateway Quiz today.
FINAL EXAM INFORMATION
FINAL EXAM INFORMATION
Welcome to CS 1010! Algorithmic Problem Solving.
Last Class We Covered Data representation Binary numbers ASCII values
Welcome to CS 1301! Principles of Programming I.
Exams – Getting the ‘simple’ bit’ right.
Last Class We Covered Dictionaries Hashing Dictionaries vs Lists
WELCOME TO TOWSON UNIVERSITY
CMSC201 Computer Science I for Majors Lecture 25 – Final Exam Review
Last Class We Covered Asymptotic Analysis Run “time” Big O
PHYS 202 Intro Physics II Catalog description: A continuation of PHYS 201 covering the topics of electricity and magnetism, light, and modern physics.
EECE.2160 ECE Application Programming
CS-171, Intro to A.I. — Exam Instructions
Tips for Success in Mathematics
Formal Geometry Ms. ramilo
BIT 115: Introduction To Programming
CMSC201 Computer Science I for Majors Lecture 24 – Sorting
Intro to CIT 594
EECE.2160 ECE Application Programming
Teaching Physics Labs.
EECE.2160 ECE Application Programming
CMSC201 Computer Science I for Majors Lecture 12 – Midterm Review
Welcome to AP Language and Composition
Midterm - 1 Instructions
Review and Instructions
Topics for Final Exam Lecture 26 Autumn Quarter.
Presentation transcript:

CMSC201 Computer Science I for Majors Final Exam Information

Time and Place Friday, December 14th from 6:00 to 8:00 PM Common Final Exam in 4 lecture halls MEYR 030 ITE 104 SHER 003 ENGR 027

Time and Place If you are in discussion section…. 2, 3, 4, 5, 6, 7, 20, or 21 Your exam will be in ENGR 027 9, 10, 11, 12, 13, 14, or 27 Your exam will be in ITE 104 16, 17, 18, 19, 30, 31, 32, 33, 34, or 35 Your exam will be in MEYR 030 23, 24, 25, 26, or 28 Your exam will be in SHER 003

Time and Place If you are in discussion section…. 2, 3, 4, 5, 6, 7, 20, or 21 Your exam will be in ENGR 027 9, 10, 11, 12, 13, 14, or 27 Your exam will be in ITE 104 16, 17, 18, 19, 30, 31, 32, 33, 34, or 35 Your exam will be in MEYR 030 23, 24, 25, 26, or 28 Your exam will be in SHER 003

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

Exam Rules Place your bag under your desk/chair NOT on the seat next to you You may have on your desk: Pencils, erasers You must use a pencil, not a pen 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 Your TA or instructor may ask you to move at any time during the test This doesn’t mean we think you’re cheating That being said, DO NOT CHEAT!!! Cheating will be dealt with severely and immediately There will be no retakes or partial credits

Exam Seating Space allowing, you will sit every other seat, so that you are not next to another student The instructor in the room may have specific instructions for their lecture hall seating arrangements Your exam might not be in your regular classroom – so arrive early!

Exam Format

Exam Format Questions are similar to the midterms The final is longer than any exam you’ve had 120 minutes instead of 75 minutes 200 points instead of 75 or 125 points No new types of questions

Exam Content

Exam Content The final is cumulative! The following is a non-exhaustive list of course topics: Variables Evaluating expressions Control structures While loops and For loops Functions (and Recursion!) If/Elif/Else

Exam Content Debugging Input and Output Syntax and Logic Errors Input and Output Terminal based File based Binary, Decimal, Hex, and ASCII Lists [indexing, appending, removing, etc.] Strings [indexing, slicing, splitting, joining, etc.] Dictionaries [creating, manipulating, etc.]

Exam Content You should be especially familiar with: Searching Sorting Linear Binary Sorting Bubble Selection Quick Run Time & Big Oh / Big Omega / Big Theta You don’t have to know how to code any search or sort, but you do have to know how each general algorithm works, and their corresponding Big Oh and Big Omega

Exam Advice

Exam Advice When you first get the exam... Write down your name Make sure your name is legible and on the line Circle your discussion section Read the Academic Integrity agreement Sign your name underneath

Exam Advice When the exam starts... Flip through the exam and get a feel for the length of it and the types of questions The programming problems are the last questions on the exam – don’t leave them until the last minute!

Exam Advice Most questions have partial credit You should at least attempt every problem If you don’t know how to do one part of a problem, skip it and do the rest You can use comments instead of code (like “# get user input”) if you know what you want a piece of code to do but not how to do it

Exam Advice After you are done coding the programming problems, try “running” your program with some input and making sure it works the way you think it does Trace (on paper or in your head) what the code is doing and what paths it is taking (loops, decisions) If a problem is unclear or you think there is an error on the exam, raise your hand

Advice and Other Info

Review Worksheets There are two review worksheets available on the website. We will not be releasing answers to either review sheet. Work with other students! Review the lecture slides! You’ll understand and retain the information better if you solve the problems yourself first, then check your answers with peers. Outside review sessions will be announced on Blackboard.

Advice on How to Study Just looking over the slides won’t be enough! Try some of the live-coding exercises and practice examples available in the slides Redo old labs or homeworks (without looking at them first!) Form study groups with other students Create and trade possible exam questions Do the entire review sheet (especially the hard parts!) Check your answers are correct by using Python, checking the notes, or talking to other students

Announcements Project 3 is due Tuesday, December 12th at 8:59:59PM Complete the course evaluation sent to your email Few more assignments out now, due at end of week Survey 2 and 3 Final exam is when? Friday December 14th 6:00 to 8:00 PM Where?

Time and Place If you are in discussion section…. 2, 3, 4, 5, 6, 7, 20, or 21 Your exam will be in ENGR 027 9, 10, 11, 12, 13, 14, or 27 Your exam will be in ITE 104 16, 17, 18, 19, 30, 31, 32, 33, 34, or 35 Your exam will be in MEYR 030 23, 24, 25, 26, or 28 Your exam will be in SHER 003