CS 303 Kent State

Heaps Definition: A heap is a binary tree with the following conditions: Shape requirement: it is essentially complete: All its levels are full except possibly the last level, where only some rightmost leaves may be missing. . Parental dominance

Decrease and Conquer Decrease and Conquer Exploring the relationship between a solution to a given instance of (e.g., P(n) )a problem and a solution to a smaller instance (e.g., P(n/2) or P(n-1) )of the same problem. Use top down(recursive) or botto

CS303 Spring 05 Homework 4 (25 pts) Due: March 17 (Thu) 2005 Exercises 6.4 Problem 1 (10 pts) Problem 2 (5 pts) Problem 6.b and 6.c (10 pts)

CS303 Spring 05 Homework 5 (25 pts) Due: April 7 (Thur.) 2005 Exercises 8.2 Problem 7 (10 pts) Exercises 8.4 Problem 2.a (10 pts) Problem 5 (5pts)

CS303 Spring 05 Homework 2 (25 pts) Due: Feb. 3 (Thu), 2005 1. Exercise 2.3, P68 Problem 6 (10pts) 2. Exercise 2.4, P76-77 Problem 1 (6pts), part b, c, and e. Problem 7 (9 pts)

Review Overview Fundamentals of Analysis of Algorithm Efficiency Algorithmic Techniques Divide-and-Conquer, Decrease-and-Conquer Dynamic Programming Greedy Technique Data Structures Heaps Graphs adjacency matrices & adjacency linked lists Trees 2

CS303 Computer Algorithms Instructor: Dr. Yanxia Jia (yjia@ashland.edu) Course web page http:/www.ashland.edu/~yjia/Courses/CS303/S05_CS303_Syl.html Why Study Algorithms? Al Khawarizmi A great Iranian mathematician, geographer and astronomer. He int

Study Guide (Chapter 4 and 5) Chapter 4 Understand the idea of divide-and-conquer. Sorting algorithms: Mergesort, quicksort, and insertion sort. o How do the algorithms work? Are they in-place? o Time efficiency: the best and worst case. Binary se

Space and Time Tradeoffs (Hashing) 1 Space and Time Tradeoffs Space and Time tradeoffs in algorithm design are a well-known issue . Example: computing values of a function at many points. One type of technique is to use extra space to facilitate f