EE360C: Algorithms
University of Texas at Austin
Dr. Christine Julien
Homework #1
Due: January 24, 2013 (in class quiz)
Homework #1
You should try to solve these problems by yourself. I recommend that you start early and get help
in oce hours if needed. I
EE360C: Algorithms
University of Texas at Austin
Dr. Christine Julien
Homework #2
Due: January 31, 2013 (in class quiz)
Homework #2
You should try to solve these problems by yourself. I recommend that you start early and get help
in oce hours if needed. I
EE360C: Algorithms
University of Texas at Austin
Dr. Christine Julien
Homework #3
Due: February 7, 2013 (in class quiz)
Homework #3
You should try to solve these problems by yourself. I recommend that you start early and get help
in oce hours if needed. I
EE360C: Algorithms
University of Texas at Austin
Dr. Christine Julien
Homework #8
Due: March 28, 2013 (in class quiz)
Homework #8
You should try to solve these problems by yourself. I recommend that you start early and get help
in oce hours if needed. If
EE360C: Algorithms
University of Texas at Austin
Dr. Christine Julien
Homework #5
Due: February 28, 2013 (in class quiz)
Homework #5
You should try to solve these problems by yourself. I recommend that you start early and get help
in oce hours if needed.
EE360C: Algorithms
University of Texas at Austin
Dr. Christine Julien
Homework #6
Due: March 7, 2013 (in class quiz)
Homework #6
You should try to solve these problems by yourself. I recommend that you start early and get help
in oce hours if needed. If y
\documentclass[11pt]cfw_article
\usepackagecfw_amsmath,textcomp,amssymb,geometry,graphicx,enumerate
\def\Namecfw_PUT SOMETHING HERE % Your name
\def\SIDcfw_PUT SOMETHING HERE % Your student ID number
\def\Logincfw_PUT SOMETHING HERE % Your login (your cla
CS 170
Algorithms
Fall 2014
David Wagner
Worksheet 10/10
1. Amortized running time of a bunch of Finds, if we dont call Union
Imagine we have a set of trees on n nodes, built by some sequence of calls to MakeSet and Union.
(a) Before we begin, put $1 on e
EE360C: Algorithms
University of Texas at Austin
Dr. Christine Julien
Homework #4
Due: February 14, 2013 (in class quiz)
Homework #4
You should try to solve these problems by yourself. I recommend that you start early and get help
in oce hours if needed.
EE360C: Algorithms
University of Texas at Austin
Dr. Christine Julien
Homework #7
Due: March 21, 2013 (in class quiz)
Homework #7
You should try to solve these problems by yourself. I recommend that you start early and get help
in oce hours if needed. If
EE360C: Algorithms
University of Texas at Austin
Dr. Christine Julien
Homework #9
Due: April 18, 2013 (in class quiz)
Homework #9
You should try to solve these problems by yourself. I recommend that you start early and get help
in oce hours if needed. If
EE360C: Algorithms
University of Texas at Austin
Dr. Christine Julien
Homework #9
Due: April 11, 2013 (in class quiz)
Homework #9
You should try to solve these problems by yourself. I recommend that you start early and get help
in oce hours if needed. If
CS 170
Algorithms
Fall 2014
David Wagner
11/26 Notes
Random forests
Next, well look at random forests, another machine learning algorithm for the classification problem. The random forest classifier is a collection of decision treeswell see in a moment wh
CS 170: Algorithms
H
H
H
H
.
S
.
.
.
.
Linear Programming today!
No laptops please.
Thank you !
Elchanan Mossel (UC Berkeley)
CS 170:Spring 2014
April 1, 2014
1 / 24
Profit maximization.
Plant Carrots or Peas?
2$ bushel of carrots. 4$ for peas.
Carrots ta
\documentclass[11pt]cfw_article
\usepackagecfw_amsmath,textcomp,amssymb,geometry,graphicx,enumerate
\def\Namecfw_PUT SOMETHING HERE % Your name
\def\SIDcfw_PUT SOMETHING HERE % Your student ID number
\def\Logincfw_PUT SOMETHING HERE % Your login (your cla
Priority Queues (Heaps)
Chapter 6
Fall 2014
2014 by Greg Ozbirn, UT-Dallas, for use with Data
Structures book by Mark Allen Weiss
1
Introduction
A queue is a FIFO data structure.
Each item in the queue is treated equally.
There may be times when we wi
CS170
Prof Mossel
Lecture 17
1.
2.
3.
4.
Today:
Example of Graph Algorithms
Example of Dynamic Programing
Not for midterm
concepts
But - applying
On Thu
Midterm! Thu Mar 20,
CS 170:Algorithms
Prof Elchanan Mossel.
Based on: Algorithms by Dasgupta Papadimitriou and Vazirani.
Slides edited from a version created by Prof. Satish Rao.
For UC-Berkeley CS170 Spring 2014 students use only.
Do not re-post or distribute
Elchanan Mosse
CS 170:Algorithms
Prof Elchanan Mossel.
Based on: Algorithms by Dasgupta Papadimitriou and Vazirani.
Slides edited from a version created by Prof. Satish Rao.
For UC-Berkeley CS170 Spring 2014 students use only.
Do not re-post or distribute
Elchanan Mosse
CS 170:Algorithms
Prof Elchanan Mossel.
Based on: Algorithms by Dasgupta Papadimitriou and Vazirani.
Slides edited from a version created by Prof. Satish Rao.
For UC-Berkeley CS170 Spring 2014 students use only.
Do not re-post or distribute
Elchanan Mosse
CS 170:Algorithms
Prof Elchanan Mossel.
Based on: Algorithms by Dasgupta Papadimitriou and Vazirani.
Slides edited from a version created by Prof. Satish Rao.
For UC-Berkeley CS170 Spring 2014 students use only.
Do not re-post or distribute
Elchanan Mosse
CS 170:Algorithms
Prof Elchanan Mossel.
Based on: Algorithms by Dasgupta Papadimitriou and Vazirani.
Slides edited from a version created by Prof. Satish Rao.
For UC-Berkeley CS170 Spring 2014 students use only.
Do not re-post or distribute
Elchanan Mosse
CS 170:Algorithms
Prof Elchanan Mossel.
Based on: Algorithms by Dasgupta Papadimitriou and Vazirani.
Slides edited from a version created by Prof. Satish Rao.
For UC-Berkeley CS170 Spring 2014 students use only.
Do not re-post or distribute
Elchanan Mosse
CS 170:Algorithms
Prof Elchanan Mossel.
Based on: Algorithms by Dasgupta Papadimitriou and Vazirani.
Slides edited from a version created by Prof. Satish Rao.
For UC-Berkeley CS170 Spring 2014 students use only.
Do not re-post or distribute
Elchanan Mosse
CS 170:Algorithms
Prof Elchanan Mossel.
Based on: Algorithms by Dasgupta Papadimitriou and Vazirani.
Slides edited from a version created by Prof. Satish Rao.
For UC-Berkeley CS170 Spring 2014 students use only.
Do not re-post or distribute
Elchanan Mosse
CS 170
Algorithms
Fall 2014
David Wagner
Worksheet 12/05
Left side of the classroom: do Q1 then Q3 then Q2. Right side: do Q2 then Q3 then Q1.
Work with the following graph G:
a
c
b
d
1. PageWalk
Let T (v) be the fraction of time spent at vertex v, in the
% Search for all the places that say "PUT SOMETHING HERE".
\documentclass[11pt]cfw_article
\usepackagecfw_amsmath,textcomp,amssymb,geometry,graphicx,enumerate
\def\Namecfw_PUT SOMETHING HERE % Your name
\def\SIDcfw_PUT SOMETHING HERE % Your student ID num
Sorting
Chapter 7
Fall 2014
2014 by Greg Ozbirn, UT-Dallas, for use with
Data Structures book by Mark Allen Weiss
1
Sorting
Sorting is a common problem when working with
data.
Data is often collected in unsorted order and must
be sorted for reporting o