Computer Science C73
Scarborough Campus
September 7, 2016
University of Toronto
Homework Assignment #1
(worth 4% of the course grade)
Due: September 16, 2016, by 5 pm
You must submit your assignment as a PDF file through the MarkUs system by logging in w

Computer Science C73
Scarborough Campus
September 16, 2016
University of Toronto
Solutions for Homework Assignment #1
Answer to Question 1. We say that a set A of locations for the superboxes covers a set of locations B
of houses if every element of B is

University of Toronto at Scarborough
CSCC37Numerical Algorithms for Computational Mathematics, Fall 2014
Assignment #2: Linear Equations / Systems
Due: November 5, 2014 at 11:59 p.m.
This assignment is worth 10% of your final grade.
Warning: Your electron

CS 370 Fall 2008: Assignment 1
Instructor: Professor Keith Geddes
Lectures: MWF 3:30-4:20 MC 2017
Web Site: UW-ACE
Due: Thu Sep 25, 2008, 5:00 pm, in the Assignment Boxes, 3rd Floor MC
1. Consider the floating point number system F (2, 5, 10, 10) as defin

Computer Science C73
Scarborough Campus
November 5, 2014
University of Toronto
Homework Assignment #4
Due: November 26, 2014, by 9:30 am
(in the drop box for your CSCC73 tutorial section)
Appended to this document is a cover page for your assignment. Fill

University of Toronto at Scarborough
CSCC37Numerical Algorithms for Computational Mathematics, Fall 2014
Assignment #1: Computer Arithmetic / Norms
Due: October 9, 2014 at 11:59 p.m.
This assignment is worth 10% of your final grade.
Warning: Your electron

University of Toronto at Scarborough
CSCC37Numerical Algorithms for Computational Mathematics, Fall 2014
Assignment #3: Nonlinear Equations/FP Iteration
Due: November 21, 2014 at 11:59 p.m.
This assignment is worth 10% of your final grade.
Warning: Your e

Computer Science B36
Scarborough Campus
Fall 2016
University of Toronto
Some comments on proving the correctness
of greedy algorithms
Vassos Hadzilacos
In class we proved the correctness of the greedy algorithm for interval scheduling by employing a greed

HOW TO SUCCEED IN CSCC73
Vassos Hadzilacos
University of Toronto
July 2013, slightly revised July 2014 and August 2015
I define success in this course to be mastering the material to a degree that will enable you to solve
new computational problems effici

Computer Science C73
Scarborough Campus
September 23, 2016
University of Toronto
Solutions for Homework Assignment #2
Answer to Question 1.
a. Suppose
n = 4, w1 = w2 = 1, w3 = w4 = 2, and C = 3. The proposed algorithm will output the set
cfw_1, 2 (sinc