Review and Instructions

Slides:



Advertisements
Similar presentations
Chemistry 211 Final Examination. Final Exam Tips Exam will contain problems that you won’t have any clue how to solve. That is normal! You can miss about.
Advertisements

1-1 CMPT 225 Data Structures and Programming Instructor: Aaron Hunter Section: E300 Campus: Harbour Centre Semester: Spring 2007.
1. Introduction Fundamental English Writing Skills Dr. Hsin-Hsin Cindy Lee.
Midterm Exam Two Tuesday, November 25 st In class cumulative.
Today’s quiz on 8.2 A Graphing Worksheet 1 will be given at the end of class. You will have 12 minutes to complete this quiz, which will consist of one.
Data Structures and Programming.  John Edgar2.
Computer Science 102 Data Structures and Algorithms V Fall 2009 Lecture 1: administrative details Professor: Evan Korth New York University 1.
WEEK 1 CS 361: ADVANCED DATA STRUCTURES AND ALGORITHMS Dong Si Dept. of Computer Science 1.
Data Structures and Programming.  Today:  Administrivia  Introduction to 225, Stacks  Course website: 
Midterm Review CSE 2011 Winter October 2015.
DATA STRUCTURES (CS212D) Week # 1: Overview & Review.
COMP2012 Object-Oriented Programming and Data Structures Fall 2015.
Jongwook Woo CIS 520 Software Engineering (Syllabus) Jongwook Woo, PhD California State University, LA Computer and Information System.
Warm Up- #1 1. Take a seat. Assigned seats will be given in a few minutes. 2. Please follow all instructions given by teacher. Objective: Students will.
Introduction to ECE 2401 Data Structure Fall 2005 Chapter 0 Chen, Chang-Sheng
Jongwook Woo CIS 528 Introduction to Big Data Science (Syllabus) Jongwook Woo, PhD California State University, LA Computer and Information.
ICS202 Data Structures King Fahd University of Petroleum & Minerals College of Computer Science & Engineering Information & Computer Science Department.
Please CLOSE YOUR LAPTOPS, and turn off and put away your cell phones, and get out your note- taking materials.
90-723: Data Structures and Algorithms for Information Processing Copyright © 1999, Carnegie Mellon. All Rights Reserved. 1 Lecture 1: Introduction Data.
COMP6311D Hot Topics on Big Data Lei Chen. Course Info. Venue: Rm 3311 Time: Wed 1:30-4:20pm Instructors: Lei Chen and Ke Yi Course Webpage: –
Course Info Instructor U.T. Nguyen Office: CSEB Office hours: Tuesday, 14:30-15:30 Thursday, 12:00-12:45 By.
Data Structures and Algorithms in Java AlaaEddin 2012.
Exam 2 Review CS 3358 Data Structures. 90 Total Points – 50 Points Writing Programs – 25 Points Tracing Algorithms, determining results, and drawing pictures.
CMPT 238 Data Structures Instructor: Tina Tian. General Information Office: RLC 203A Office Hour: Tue and Fri 12:30 - 2:00PM.
Welcome to CMPT 225 Data Structures and Programming Anne Lavergne
AHS 2015 Pnewgent: Cell# Answer Booklet: – Used to write student responses – Used for unstructured exams Structured Exam – Write answers.
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.
Course Information EECS 2031 Fall Instructor Uyen Trang (U.T.) Nguyen Office: LAS Office hours: 
CSCE 210 Data Structures and Algorithms
CS-171, Intro to A.I. — Quiz Instructions
Computer Network Fundamentals CNT4007C
Course Information EECS 2031 – Section A Fall 2017.
Computer Engineering Department Islamic University of Gaza
Topic: Introduction to Computing Science and Programming + Algorithm
Topic: Functions – Part 1
CLOSE Please YOUR LAPTOPS, and get out your note-taking materials.
Level II Exam Issued July 2006.
WELCOME ! To Honors Chemistry with Mrs. Pross
Computer Networks CNT5106C
Topic: Introduction to Computing Science and Programming + Algorithm
CMSC201 Computer Science I for Majors Lecture 13 – Midterm Review
Midterm Review.
It’s called “wifi”! Source: Somewhere on the Internet!
EECE 315: Operating Systems
CMSC201 Computer Science I for Majors Lecture 13 – Midterm Review
Computer Science 102 Data Structures CSCI-UA
September 27 – Course introductions; Adts; Stacks and Queues
CMSC201 Computer Science I for Majors Lecture 27 – Final Exam Review
Exam 2 Review CS 3358 Data Structures.
Department of Mathematics
Exam 2 Review CS 3358 Data Structures.
Introduction to Data Structures
Exam 2 Review CS 3358 Data Structures.
Week # 1: Overview & Review
CMSC201 Computer Science I for Majors Lecture 25 – Final Exam Review
CS-171, Intro to A.I. — Exam Instructions
Course Information EECS 2031 Fall 2016.
CMSC201 Computer Science I for Majors Final Exam Information
EECE.2160 ECE Application Programming
Final Review B.Ramamurthy 5/8/2019 BR.
CMSC201 Computer Science I for Majors Lecture 12 – Midterm Review
CMPT 120 Lecture 15 – Unit 3 – Graphics and Animation
Midterm - 1 Instructions
Welcome to CMPT 225 Data Structures and Programming My name is Anne Lavergne Lecture 1 – Overview.
CMPT 225 Lecture 6 – Review of Complexity Analysis using the Big O notation + Comparing List ADT class implementations.
Lecture 3 – Data collection List ADT
CMPT 225 Lecture 7 – Stack.
CMPT 225 Lecture 8 – Queue.
CMPT 225 Lecture 16 – Heap Sort.
Presentation transcript:

Review and Instructions CMPT 225 Midterm 1 Review and Instructions

Midterm When: Week 6 - Wed. Oct. 9, 2019 at 5:30pm Where: in our class room How long: 50 minutes

Midterm What: (i.e., what to study) Everything we covered up until (and including) our Lecture on Wed. Oct. 2 is subject to examination Partial lecture notes + your own lecture notes All code, examples and readings posted on our course web site Participation activities Labs 0 to 5 Assignments 1 and 2 Good Programming Style (GPS) on our course web site

Midterm review - 1 See Learning Outcomes at the beginning of each set of lecture notes -> Use them to check your understanding and to determine what you need to study Define and use the four steps of software development process In terms of the Testing step: know and use test cases, test drivers, expected and actual results Define (data) abstraction and abstract data type (ADT) Know how to achieve data abstraction Design a data collection ADT class (in general) Differentiate between a class that has been designed as an ADT and a class that has not Compare and contrast them Here are some of the topics we have covered so far:

Mid term review - 2 Stack ADT class List ADT class Queue ADT class Underlying data structures : Queue ADT class 1. 3. using another data Collection ADT class, e.g., List, as underlying data structure 2. When to use each of these data collections i.e., the kinds of problem each of them can solve And compare and contrast various implementations

Mid term review - 3 Sorting algorithms Selection sort Insertion sort Merge sort Quick sort How the algorithm functions Time efficiency of best/average/worst case scenarios What data looks like for best/average/worst case scenarios in terms of time efficiency Space efficiency How to improve time/space efficiency (if needed/possible)

Mid term review - 4 Big O notation to express time/space efficiency analysis Linux commands C++ code etc …

More tools to utilize when studying Resources web page on course web site Exercises and Programming Problems See link to Solutions for Selected Exercises from the 6th edition of Textbook 1 on our Resources web page

Midterm format First section: questions requiring short answers For example: “Yes/no” or “fill in the blank” or a few words etc… Second section: questions requiring written answers Drawing a data structure Writing an algorithm or code Writing an answer (in English)

Seating arrangement during midterm Each intersection represents a seat in the classroom Represents a student seated at a seat Represents a vacant seat Everything at front of classroom including cell phones, calculators and student card! Only keep pens, pencils and eraser with you!

Before the midterm starts … We distribute the midterm examination papers Once you have received yours, leave it face up on your table and read the instructions printed on its first page Please, do not touch, leaf through, or write your name on the midterm examination paper Why? Because it is unfair to all other students who have not yet received a midterm examination paper When all students have received a midterm examination paper, you will be instructed to start the midterm That is when you start touching the midterm like writing your name etc… 

During the midterm … If you have a question Have a look at the instructions on page 1 for an answer If the answer to your question is not on page 1, raise your hand and the instructor will attend to your question The instructor is the only one that will be answering questions during the midterm

When time is up … You will be instructed to stop writing! Please, do stop writing and hand in your midterm examination paper as instructed Why? Because, if you continue writing, it is unfair to all other students who have stopped writing

Questions?