CSE 326 Course Review David Kaplan Dept of Computer Science & Engineering Autumn 2001.

Slides:



Advertisements
Similar presentations
INTRODUCTION TO CS16 CS16: Introduction to Algorithms and Data Structures Tu/Th 10:30-11:50 Metcalf Auditorium David Laidlaw Thursday, January 23, 2014.
Advertisements

Analysis & Design of Algorithms (CSCE 321)
CSE332: Data Abstractions Lecture 28: Course Wrap-Up / Victory Lap Dan Grossman Spring 2010.
DAST, Spring © L. Joskowicz 1 Data Structures – LECTURE 1 Introduction Motivation: algorithms and abstract data types Easy problems, hard problems.
TDDB57 DALG-C, DALG Exam Requirements Jan Maluszynski - HT 2006DALG-C.1 TDDB57 – DALG-C Examination Requirements.
CS333/ Topic 11 CS333 - Introduction CS333 - Introduction General information Goals.
Come on down! Take and fill out a survey Get a copy of lecture slides Please sit in the first 5 rows!
Administrivia- Introduction CSE 373 Data Structures.
CS 206 Introduction to Computer Science II 04 / 29 / 2009 Instructor: Michael Eckmann.
Data Structures, Spring 2004 © L. Joskowicz 1 DAST – Final Lecture Summary and overview What we have learned. Why it is important. What next.
DAST, Spring © L. Joskowicz 1 Data Structures – LECTURE 1 Introduction Motivation: algorithms and abstract data types Easy problems, hard problems.
Come on down! Take and fill out a survey Get a copy of lecture slides Please sit in the first 5 rows!
Data Structures Lecture-1:Introduction
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.
BIM213 – Data Structures and Algorithms Introduction 1.
10/20/20151 CS 3343: Analysis of Algorithms Review for final.
Design and Analysis of Algorithms 4 th Semester Computer Engineering Spring 2015 Conf.dr.ing. Ioana Sora
 Analysis Wrap-up. What is analysis?  Look at an algorithm and determine:  How much time it takes  How much space it takes  How much programming.
+ Review CS302 Spring 2013 David Kauchak. + Admin Final posted on the course web page on Monday due Sunday at 11:59pm time-boxed (3-4 hours) You may use:
1 Data Structures and Programming 資料結構與程式設計. 2 Instructor: 顏嗣鈞 Web: Time: 9:10-12:00 AM, Tuesdaay.
December 4, Algorithms and Data Structures Lecture XV Simonas Šaltenis Aalborg University
CS Data Structures II Review & Final Exam. 2 Topics Review Final Exam.
CSE 326: Data Structures Lecture #25 Class Wrap-up Steve Wolfman Winter Quarter 2000.
CSE 326 Linear ADTs: Lists, Stacks and Queues David Kaplan Dept of Computer Science & Engineering Autumn 2001.
CSE373: Data Structures & Algorithms Lecture 22: The P vs. NP question, NP-Completeness Lauren Milne Summer 2015.
CS223 Advanced Data Structures and Algorithms 1 Review for Final Neil Tang 04/27/2010.
Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 223 – Advanced Data Structures Course Introduction.
1 BIM304: Algorithm Design Time: Friday 9-12am Location: B4 Instructor: Cuneyt Akinlar Grading –2 Midterms – 20% and 30% respectively –Final – 30% –Projects.
Review for Final Exam – cs411/511 Definitions (5 questions, 2 points each) Algorithm Analysis (3 questions, 3 points each) General Questions (3 questions,
Review for Final Exam Non-cumulative, covers material since exam 2 Data structures covered: –Treaps –Hashing –Disjoint sets –Graphs For each of these data.
Course Review Fundamental Structures of Computer Science Margaret Reid-Miller 29 April 2004.
Design and Analysis of Algorithms (09 Credits / 5 hours per week) Sixth Semester: Computer Science & Engineering M.B.Chandak
CSE 340: Review (at last!) Measuring The Complexity Complexity is a function of the size of the input O() Ω() Θ() Complexity Analysis “same order” Order.
CSE332: Data Abstractions Lecture 28: Course Wrap-up Tyler Robison Summer
Principles of Imperative Computation Lecture 1 January 15 th, 2012.
BITS Pilani Pilani Campus Data Structure and Algorithms Design Dr. Maheswari Karthikeyan Lecture1.
Design and Analysis of Algorithms 4 th Semester Computer Engineering Spring 2016 Conf.dr.ing. Ioana Ṣ ora
David Kaplan Dept of Computer Science & Engineering Autumn 2001
CSC 421: Algorithm Design & Analysis
CS16: Introduction to Algorithms and Data Structures
CSCE 210 Data Structures and Algorithms
Welcome to the Course of Advanced Algorithm Design
Design and Analysis of Algorithms (09 Credits / 5 hours per week)
Data Structures and Algorithms
CSE 326: Data Structures: Advanced Topics
CSC 421: Algorithm Design & Analysis
Review for Final Exam Non-cumulative, covers material since exam 2
Data Structures and Algorithms
Review for Final Exam Non-cumulative, covers material since exam 2
CS 3343: Analysis of Algorithms
Algorithm Design and Analysis
CS 3343: Analysis of Algorithms
Definition In simple terms, an algorithm is a series of instructions to solve a problem (complete a task) We focus on Deterministic Algorithms Under the.
Design and Analysis of Algorithms (07 Credits / 4 hours per week)
CS 3343: Analysis of Algorithms
CS 3343: Analysis of Algorithms
CS 3343: Analysis of Algorithms
CS 3343: Analysis of Algorithms
Review CSE116 2/21/2019 B.Ramamurthy.
Algorithm Design and Analysis
CSE 326: Data Structures Lecture #24 The Algorhythmics
Administrivia- Introduction
COP3530- Data Structures Introduction
Final Review B.Ramamurthy 5/8/2019 BR.
INTRODUCTION TO ALOGORITHM DESIGN STRATEGIES
Department of Computer Science & Engineering
Design and Analysis of Algorithms (04 Credits / 4 hours per week)
Review for Final Neil Tang 05/01/2008
COMP 122 – Design and Analysis of Algorithms
Presentation transcript:

CSE 326 Course Review David Kaplan Dept of Computer Science & Engineering Autumn 2001

Course ReviewCSE 326 Autumn Why (did we) study data structures? Clever ways to organize information in order to enable efficient computation Systems Theory AI Graphics Applications DataStructures Databases NetworkingGames

Course ReviewCSE 326 Autumn Why (did we) take CSE 326?  Guaranteed non-obsolescence  May be most important CS course you ever take  Gain concepts, plans and mechanisms for creating better software

Course ReviewCSE 326 Autumn Course Goals  Learn some of the fundamental data structures in computer science  Learn to solve problems abstractly  Data structures are the building blocks  Learn to analyze and improve algorithms  Prove correctness  Gauge and improve time complexity  Learn UNIX  Required in upcoming courses

Course ReviewCSE 326 Autumn Concepts, Plans, Mechanisms Concepts  A list that lets me store and retrieve things  A tree that lets me store and retrieve things by hierarchy  A table that lets me store and retrieve things by name  A graph (network) that represents distances between cities, relationships between people, tasks within a project, etc.  and so on …

Course ReviewCSE 326 Autumn Concepts, Plans, Mechanisms Plans  Pseudocode  Block Diagrams  Flowcharts Mechanisms  Working code Intuition is the bridge concepts  plans  mechanisms

Course ReviewCSE 326 Autumn Organizing Information Concepts Simple collectionCollection with hierarchy Collection with complex topology Plans (ADTs) List, Stack, Queue Binary Search Tree, B-Tree, AVL Tree, Heaps, … Directed Graph, DAG, Flow Network, … MechanismsNumerous “Linear”“Hierarchical”“Graphical”

Course ReviewCSE 326 Autumn Using Organized Information Examples  Dictionary ADT  Store, retrieve, update, delete to-from large bodies of information  Priority queue ADT  Handle “priority” on-the-fly  Disjoint Sets ADT  Handle dynamic equivalence on-the-fly  Graph {ADT, data structure, ???}  Answer hard questions (sometimes efficiently!)  Shortest paths, spanning trees, …

Course ReviewCSE 326 Autumn Asymptotic Complexity How the running time of an algorithm scales with the size of its input Ways to measure complexity  Worst case  Average case  Amortized over a series of (presumably representative) runs  Best case (occasionally useful)

Course ReviewCSE 326 Autumn Apocalyptic Laptop Seth Lloyd, a physicist at the Massachusetts Institute of Technology, has calculated how to make PCs almost unimaginably faster--if you don't mind working on a black hole. Lloyd has used the laws of thermodynamics, information, relativity, and quantum mechanics to figure out the ultimate physical limits on the speed of a computer… Lloyd's ultimate laptop would convert all of its 1-kilogram mass into energy via Einstein's famous equation E = mc 2, thus turning itself into a billion-degree blob of plasma. "This would present a packaging problem," Lloyd admits … The computer would be capable of performing operations per second. - Charles Seife, Science Magazine, Vol 289, No 5484, Sep , pp

Course ReviewCSE 326 Autumn Big Bang ApocaLap, 1 year ApocaLap, 1 sec 1000 MIPS since Big Bang 1000 MIPS, 1 day

Course ReviewCSE 326 Autumn Stuff we did  Lists  Stacks  Queues  Search trees, in many flavors (BST, AVL, splay)  Heaps, in many flavors (binary, d, leftist, skew)  Hashing  Graphs, spanning trees  Graph algorithms (Dijkstra’s, Kruskal’s, Prim’s)  Asymptotic complexity  Recursion analysis  Sorting, in many flavors  Randomization (treaps, skip lists)

Course ReviewCSE 326 Autumn Stuff we didn’t get to  Algorithm Design  Greedy  Divide and conquer  Backtracking  Dynamic programming  Amortized Analysis (formal mechanisms)  NP-Completeness  At least enough to qualitatively distinguish P and NP problems : - (

Course ReviewCSE 326 Autumn Are we convinced yet? Mastery of this material separates you from …

Course ReviewCSE 326 Autumn Coming Attractions  Wed Dec 12: wrap-up and closing ceremony  Wed Dec 12 3:30-4:30pm: Case Study  Better Living through Graphs and Trees  Sun Dec 16: Final Exam Review Session  Time/place TBD To do study for … Final Exam Mon, Dec 17 2:30pm, MGH 389