Computer Science 431

Algorithms

Spring 2013, The College of Saint Rose

Agenda

- Announcements
- Take my new courses next semester!
- CSC 381 - one credit course on C programming in Unix (especially if you want to take OS next spring)
- CSC 461 - regular course on parallel processing

- Problem Set 4 out
- Decrease and conquer wrapup
- binary search
- fake coin problem

- Divide and conquer
- general idea
- master theorem
- mergesort
- quicksort
- binary trees

Due at the start of class, Thursday, March 14.

Please submit answers to these questions
either as a hard copy (typeset or handwritten are OK) or by email to
*terescoj AT strose.edu* by the start of class. Please use a clear subject line
when submitting by email (*e.g.*, CSC 431 Lecture
Assignment 15, Joe Student). We will discuss these
questions at the start of class, so no late submissions are
accepted.

- Levitin Exercise 5.1.6, p. 175 (4 points)
- Levitin Exercise 5.1.7, p. 175 (2 points)
- Levitin Exercise 5.2.1, p. 181 (6 points)
- Levitin Exercise 5.2.3, p. 181 (2 points)

Links