EE 422C Final Exam Review.

Slides:



Advertisements
Similar presentations
Data Structures Data Structures Topic #13. Today’s Agenda Sorting Algorithms: Recursive –mergesort –quicksort As we learn about each sorting algorithm,
Advertisements

Review. What to know You are responsible for all material covered in lecture, the readings, or the programming assignments There will also be some questions.
 Exam Date: Next Tuesday, December 15 th  This room, Same time.
Final Exam TAs will Proctor 15% 9-11am, Dec 19 DELAYING START TIME BY 1 HOUR Get a Good Night’s Sleep! 90 points 1 min per point Allocate time proportional.
1 Advanced Data Structures. 2 Topics Data structures (old) stack, list, array, BST (new) Trees, heaps, union-find, hash tables, spatial, string Algorithm.
CSIS-385: Analysis of Algorithms Dr. Eric Breimer.
ITC242 – Introduction to Data Communications ITC431 – Computer Networks Week 13 Exam Preparation.
COMS S1007 Object-Oriented Programming and Design in Java August 12, 2008.
Midterm Exam Two Tuesday, November 25 st In class cumulative.
EXAM REVIEW CSC 172 SPRING 2004 LECTURE 26. Want to TA for next semester?
Instructor: Dr. Sahar Shabanah Fall Lectures ST, 9:30 pm-11:00 pm Text book: M. T. Goodrich and R. Tamassia, “Data Structures and Algorithms in.
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
CSCA48 Course Summary.
Final Review Dr. Yingwu Zhu. Goals Use appropriate data structures to solve real- world problems –E.g., use stack to implement non-recursive BST traversal,
A Binary Search Tree Binary Search Trees.
BIT 142:Programming & Data Structures in C#. BIT 143  Offered next term  Continues where this leaves off  A couple of weeks to review OOP, object composition,
BIT 142:Programming & Data Structures in C#. A2 due date  A2 is due this Friday, June 12 th, by 11:30am BIT 142: Intermediate Programming2.
Review for Final Andy Wang Data Structures, Algorithms, and Generic Programming.
EDIT 202 Midterm Exam Details Exam Information  July 19 th in N2 – 115  Anyone with SSDS forms please make sure Felix has those in advance.  Exam.
CSE 3358 NOTE SET 1 Data Structures and Algorithms.
CS Data Structures II Review & Final Exam. 2 Topics Review Final Exam.
Exam 1 Review CS Total Points – 60 Points Writing Programs – 20 Points Tracing Algorithms, determining results, and drawing pictures – 40 Points.
Final Exam Review CS Total Points – 60 Points Writing Programs – 50 Points Tracing Algorithms, determining results, and drawing pictures – 50.
Final Exam Tuesday, December 22nd 2:00 - 3:50pm room 102 Warren Weaver Hall.
FINAL EXAM BREAKDOWN KCI SBI3U 10-pages exam; double sided 50 multiple choice ; 1m each Put answers to Multiple Choice question in the boxes.
 200 Total Points ◦ 75 Points Writing Programs ◦ 60 Points Tracing Algorithms and determining results ◦ 35 Points Short Answer ◦ 30 Points Multiple Choice.
Sorting 1. Insertion Sort
Course Preliminaries Course Objectives Course Objectives Students’ Learning Outcomes Students’ Learning Outcomes Grading Policy Grading Policy Course Resources.
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.
Concurrency (Threads) Threads allow you to do tasks in parallel. In an unthreaded program, you code is executed procedurally from start to finish. In a.
Data Structures and Algorithms in Java AlaaEddin 2012.
 Saturday, April 20, 8:30-11:00am in B9201  Similar in style to written midterm exam  May include (a little) coding on paper  About 1.5 times as long.
Final Exam Review CS Total Points – 20 Points Writing Programs – 65 Points Tracing Algorithms, determining results, and drawing pictures – 50.
Exam 2 Review CS 3358 Data Structures. 90 Total Points – 50 Points Writing Programs – 25 Points Tracing Algorithms, determining results, and drawing pictures.
BIT 142:Programming & Data Structures in C#. BIT 143  Continues where this leaves off  A couple of weeks to review OOP, object composition, Big “Oh”
COMP9024: Data Structures and Algorithms Course Outline Hui Wu Session 1, 2016
Final Exam Review CS 3358.
CS16: Introduction to Algorithms and Data Structures
Programming in Java: lecture 7
COMP9024: Data Structures and Algorithms
Data Structures and Algorithms
Midterm Review.
Exam Hints.
OBJECT ORIENTED PROGRAMMING II GEORGE KOUTSOGIANNAKIS
Week 15 – Monday CS221.
CMSC201 Computer Science I for Majors Lecture 27 – Final Exam Review
Data Structures and Algorithms
Welcome to IT 516! Data Structures & Algorithms Review of Linked Lists Parallel ordered arrays Binary Search Trees Tom Becker Summerr 2018 Lecture 7.
Exam 2 Review CS 3358 Data Structures.
CSE332: Data Abstractions About the Final
Exam 2 Review CS 3358 Data Structures.
Exam 1 Review CS 3358.
EE 422C Exam 2 Review.
Exam 1 Review CS 3358.
Exam 2 Review CS 3358 Data Structures.
Sorting.
EE 312 Software Design and Implementation I
Final Exam Overview D.Sc. Arto Karila
OBJECT ORIENTED PROGRAMMING II GEORGE KOUTSOGIANNAKIS
CMSC201 Computer Science I for Majors Lecture 25 – Final Exam Review
CS 116 OBJECT ORIENTED PROGRAMMING II FINAL EXAM INFORMATION
History 11 Week 5.
Final Review Dr. Yingwu Zhu.
Review B.Ramamurthy 4/6/2019 BR.
EE 312 Final Exam Review.
Final Review B.Ramamurthy 5/8/2019 BR.
EE 312 Software Design and Implementation I
EE 422C Exam 1 Review.
BIT 143:Programming & Data Structures in C#
CS 2308 Final Exam Review.
Presentation transcript:

EE 422C Final Exam Review

Approximate point totals and types of questions Writing Code (15%) Tracing Code (15%) Short Answer/Drawing (50%) Matching (5%) Multiple Choice (15%)

Writing Code SortTools GoFish WordLadder Critters 1 Critters 2 (conceptual, no written code in JavaFX) Box Office Cheaters Understand the concepts and code for each of these assignments. You will not be writing code from the assignments on the exam, but the concepts are important.

Possible Code Tracing Big O analysis OOP concepts (inheritance and polymorphism) Threads Socket Programming

What to Study Concepts from the lecture Including code we wrote in class Pay special attention to: Graphs Binary Trees (and BSTs) Heaps Threads and parallel programming Especially race conditions and deadlock Sorting QuickSort and MergeSort Hashing Maps Sets There is nothing on the exam that we did not at least mention in the lecture or discussion at some point i.e. nothing from the book that we didn’t talk about

How to Study Rewrite the programs Redo the discussion section exercises Review the lecture slides and code Sleep!!