PHI 210
Peer evaluation
Name of evaluator:
Author being evaluated:
The goal is to help the author improve their argument by pointing out the strengths and
weaknesses of their paper.
1) Did the author clearly state their thesis? Does the thesis promise a s
Programming
Techniques
R. Morris
Editor
A Sorting
Problem and
Its Complexity
Ira Pohl
University of California*
A technique for proving min-max norms of sorting
a l g o r i t h m s is given. O n e new a l g o r i t h m for finding the
minimum and maximum
CSC263H
Data Structures and Analysis
University of Toronto
Course Information
Instructor: Sam Toueg
Office: Sandford Fleming 2304C
Office Hours: Friday 10 am - 12 noon, or by appointment
Telephone: 416-946-3510
Email: sam@cs.toronto.edu
Course web page:
D
TIME COMPLEXITY OF ALGORITHMS
Vassos Hadzilacos
University of Toronto
1
Measuring time complexity
The worst-case time complexity of an algorithm is expressed as a function
T : N N
where T (n) is the maximum number of steps in any execution of the algorith
CSC263H
Data Structures and Analysis
University of Toronto
Note on BFS
BFS(s) Computes the Shortest Paths from s Proof Sketch
Recall that during the execution of a BFS started from s (denoted BFS(s), if a node u
discovers a node v, then d[v] is set to d[u
CSC263H
Data Structures and Analysis
University of Toronto
Note on MST
MST Construction Theorem
The following theorem shows how one can extend any spanning forest of a graph G that is
contained in some MST of G, into a larger forest that is also contained
Computer Siene 263/B63
Design and Analysis of Data Strutures
University of Toronto
NOTES ON AVL TREES
by Vassos Hadzilaos
Binary searh trees work well in the average ase, but they still have the drawbak of linear worst ase time
omplexity for all three ope
Computer Science CSC263H
St. George Campus
March 10, 2016
University of Toronto
Solutions for Homework Assignment #4
Answer to Question 1. First we make some observations common to both sub-questions. The value of
x at the completion of the algorithm is i
Computer Science CSC263H
St. George Campus
February 25, 2016
University of Toronto
Solutions for Homework Assignment #3
Answer to Question 1. The set S can be implemented as an augmented AVL tree T . Each node u of
T contains the fields:
key: contains th
Computer Science CSC263H
St. George Campus
February 11, 2016
University of Toronto
Homework Assignment #3
Due: February 25, 2016, by 5:30 pm
You must submit your assignment as a PDF file of a typed (not handwritten)
document through the MarkUs system by
Computer Science CSC263H
St. George Campus
January 28, 2016
University of Toronto
Solutions for Homework Assignment #1
Answer to Question 1.
a. T (n) is O(n2 ). This is because for every n > 2:
(i) For every input array A of size n, the outer for loop of
Computer Science CSC263H
St. George Campus
March 10, 2016
University of Toronto
Homework Assignment #5
Due: March 24, 2016, by 5:30 pm
You must submit your assignment as a PDF file of a typed (not handwritten)
document through the MarkUs system by loggin
Computer Science CSC263H
St. George Campus
February 25, 2016
University of Toronto
Homework Assignment #4
Due: March 10, 2016, by 5:30 pm
You must submit your assignment as a PDF file of a typed (not handwritten)
document through the MarkUs system by log
Computer Science CSC263H
St. George Campus
January 28, 2016
University of Toronto
Homework Assignment #2
Due: February 11, 2016, by 5:30 pm
You must submit your assignment as a PDF file of a typed (not handwritten)
document through the MarkUs system by l
Computer Science CSC263H
St. George Campus
January 14, 2016
University of Toronto
Homework Assignment #1
Due: January 28, 2016, by 5:30 pm
You must submit your assignment as a PDF file of a typed (not handwritten)
document through the MarkUs system by lo
CSCE 221 Assignment 6 Cover Page
First Name
Last Name
User Name
UIN
E-mail address
Please list all sources in the table below including web pages which you used
to solve or implement the current homework. If you fail to cite sources you can
get a lower nu
CSCE 221 Homework 5 Cover Page
First Name
Last Name
User Name
UIN
E-mail address
Please list all sources in the table below including web pages which you used to solve or implement the
current homework. If you fail to cite sources you can get a lower numb
CSCE 221 Cover Page
Homework Assignment #4
First Name
Last Name
User Name
UIN
E-mail address
Please list all sources in the table below including web pages which you used to solve or implement the
current homework. If you fail to cite sources you can get
CSCE 221 Cover Page
Homework Assignment #3
First Name
Last Name
User Name
UIN
E-mail address
Please list all sources in the table below including web pages which you used to solve or implement the
current homework. If you fail to cite sources you can get
CSCE 221 Assignment 6 Cover Page
First Name
Last Name
User Name
UIN
E-mail address
Please list all sources in the table below including web pages which you used to solve or implement the current homework.
If you fail to cite sources you can get a lower nu
CSCE 221 Assignment 5 Cover Page
First Name
Last Name
User Name
UIN
E-mail address
Please list all sources in the table below including web pages which you used to solve or implement the
current homework. If you fail to cite sources you can get a lower nu
CSCE 221 Assignment 4 Cover Page
First Name
Last Name
User Name
UIN
E-mail address
Please list all sources in the table below including web pages which you used to solve or implement the
current homework. If you fail to cite sources you can get a lower nu
CSCE 221 Assignment 3
Due March 1 at 11:59pm
Hardcopy Report: Return to your TA in labs that week
Part 1: Implementing Queue and Stack Based on Linked List
Objective
This is an individual assignment which has two parts. Part 1 involves implementing Queue
Project Cover Page
This project is a group project. For each group member, please print rst and last name and e-mail address.
1.
2.
3.
Please write how each member of the group participated in the project.
1.
2.
3.
Please list all sources: web pages, peop
Assignment 1 (100 pts)
Due February 1, 2013 by midnight to CSNet
Hard copy of the report is due Monday/Tuesday in your lab
The purpose of this programming assignment is to learn about organizing data using the STL classes vector and
list, analyzing the be
CPSC 221
Data Structures & Algorithms
Minimum Spanning Tree
Minimum Spanning Tree (MST) of a given undirected, connected and
weighted graph G = (V, E ) is a subgraph G = (V, E ) containing all the
vertices of G and subset of edges with the minimum weight