CS 320 Computer Architecture Spring 2008 Unit 2 Basic Concepts
Furman Haddix, Ph.D. Assistant Professor Minnesota State University, Mankato
Unit 2 Basic Concepts Objectives
Computer Organization and Architecture Machine Language Generations of Computers P
CS 310 Unit 20 Single Source Shortest Paths
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato Spring 2008
Single Source Shortest Paths Objectives
Introduction to Single Source Shortest Paths (SSSP) SSSP in Directed Acycli
CS 310 Unit 19 Minimum Spanning Trees
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato Spring 2008
Unit 19 Minimum Spanning Trees Objectives
Minimum Spanning Tree Problem Minimum Spanning Tree Examples (After Kruskal
CS 310 Unit 18 Topological Sort and Strongly Connected Components
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato Spring 2008
Unit 18 Objectives
Two Depth First Search Applications Topological sort Strongly connected co
CS 310 Unit 17 Elementary Graph Algorithms
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato Spring 2008
Unit 17 Objectives
Seven bridges of Konigsberg problem Graph notation and representation Breadth-first search Dep
CS 310 Unit 16
Optimal Binary Search Trees,
Huffman Codes, and Greedy
Programming
Furman Haddix Ph.D.
Assistant Professor
Minnesota State University,
Mankato
Spring 2008
Unit 16 Objectives
• Optimal Binary Search Trees
• Elements of the Greedy Strategy
•
CS 310 Unit 14 Augmenting Data Structures
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato Spring 2008
Exam 2
Exam on Monday, March 31 Review on Thursday, March 27 Covers Chapters 9-14
Augmenting Data Structures Object
Exam 2
Wednesday, March 26, 2008 Units 9-14
CS 310 Unit 13 Red Black Trees
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato Spring 2008
Red Black Trees Objectives
Coloring for synchronization and coordination Colori
CS 310 Unit 12 AVL Trees
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato Spring 2008
AVL Trees Objectives
Balanced Search Trees Rotation in Balanced Search Trees AVL Trees
Definition Insertion Rebalance/Restructure
CS 310 Unit 11 Binary Search Trees
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato Spring 2008
Binary Search Tree Objectives
Binary Search Tree Definitions Binary Search Tree Algorithms
Insert() Traversal() Sear
CS 310 Unit 10 Hash Tables Collisions and Perfect Hashing
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato Spring 2008
Unit 9 Dynamic Sets Direct Addressing Hashing Functions Unit 10 Collisions Chaining Load Facto
CS 310 Unit 8 Elementary Data Structures
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato Spring 2008
CS 310 Unit 8 Elementary Data Structures Objectives Dynamic Sets Stacks Queues Linked Lists Sentinel Linked Lists
CS 310 Unit 7 Medians and Order Statistics
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato Spring 2008
Unit 7 Medians and Order Statistics Objectives
Order Statistics Finding ith element in set of size n elements Ra
CS 310 Unit 6 Linear Time Sorting
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato
CS 310 Unit 6 Linear Time Sorting Objectives
Limits for Comparison Sorts Counting Sort Stable Sorts Radix Sort Bucket Sort Text, Chap
CS 310 Unit 5 Quicksort
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato
CS 310 Unit 5 Quicksort Objectives
Introduction to Quicksort A quicksort Algorithm Quicksort Running Time Randomized quicksort Text, Chapter 7
CS 310 Unit 4 Heapsort
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato
CS 310 Unit 4 Heapsort Objectives
Standard Tree Definitions Introduction to Heapsort
O(n log n), like merge sort Sorts in place, like insertion so
CS 310 Unit 2 Asymptotic Notation and Recurrences
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato
CS 310 Unit 2 Asymptotic Notation and Recurrences Objectives
Asymptotic Notation
O(n) "Big Oh" (or "Oh") of n (n) Omeg
CS 310 Unit 1
Introduction to Algorithms
Furman Haddix Ph.D.
Assistant Professor
Minnesota State University,
Mankato
Spring 2008
Unit 1 Introduction to Algorithms
Objectives
•
•
•
•
•
•
Analysis of Algorithms, the Course
What is an algorithm?
Analysis of
CS 310 Final Exam Review
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato Spring 2008
Unit 1
Simple Sort Examples Bubble Sort Insertion Sort Merge Sort Recurrence Tree Notation
Running Time: (n) Floor and Ceiling F
CS 310 Exam I Review: Units 1-8
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato Spring 2008
Unit 1
Simple Sort Examples Bubble Sort Insertion Sort Merge Sort Recurrence Tree Notation
Running Time: (n) Floor and Ce
CS 310 Exam 3 Review
Furman Haddix Ph.D. Assistant Professor Minnesota State University, Mankato Spring 2008
Dynamic Programming Objectives
What is Dynamic Programming Fibonacci algorithm top-down, bottom-up, memoized Factory Example Matrix Mult