15110 Spring 2017
Problem Set 4  due Friday, February 17 at the beginning of class
Instructions
Type or neatly write the answers to the following problems.
Please STAPLE your homework before you hand it in.
On the first page of your homework, include you
15110 Spring 2017
Programming Assignment 1  due Tuesday, January 24 by 10:00 pm
Note: You are responsible for protecting your solutions to these problems from being seen by other
students both physically (e.g., by looking over your shoulder) and electro
15110 Spring 2017
Problem Set 9  due Friday, April 7 at the beginning of class
Instructions
Type or neatly write the answers to the following problems.
Please STAPLE your homework before you hand it in.
On the first page of your homework, include your na
15110 Spring 2017
Problem Set 6  due Monday, March 6 in class
Instructions
Type or neatly write the answers to the following problems.
Please STAPLE your homework before you hand it in.
On the first page of your homework, include your name, andrew ID, la
15110 Spring 2017
Programming Assignment 5  due Tuesday, February 28 by
10:00 pm
Note: You are responsible for protecting your solutions to these problems from being seen by
other students both physically (e.g., by looking over your shoulder) and electr
15110 Principles of Computing Spring 2017
Problem Set 2  due Friday, Feburary 3rd Before the Lecture
Reading Assignment
Read pages 1942 of chapter 2 of the book Blown To Bits.
Instructions
Type or neatly write the answers to the following problems.
Ple
15110 Spring 2017
Problem Set 7  due Friday March 24 in class
Instructions
Type or neatly write the answers to the following problems.
Please STAPLE your homework before you hand it in.
On the first page of your homework, include your name, andrew ID, la
15110 Spring 2017
Programming Assignment 4  due Tuesday February 14 by
10:00pm
IMPORTANT NOTE: Please note that you will have only 5 submissions for this assignment.
Any additional submissions will incur a 0.25 point penalty per submission.
Note: You ar
15110 Principles of Computing Spring 2017
Problem Set 3  due Friday, February 10 at the beginning of class
Instructions
Type or neatly write the answers to the following problems.
Please STAPLE your homework before you hand it in.
On the first page of y
15110 Spring 2017
Programming Assignment 8  due Tuesday, April 4th by 10:00pm
For this assignment, you will create a Python source file implementing each of the problems described
below. If you find it useful for any of the problems in this assignment,
Parallel and Sequential Data Structures and Algorithms
SCS 15210

Spring 2013
Chapter 6
Sequences
A sequence is an ordered set, i.e., is a collection of elements that are totally ordered.
Computer scientists use sequence data structures such as arrays and lists to represent
many different sorts of data. In this chapter, we specify
Parallel and Sequential Data Structures and Algorithms
SCS 15210

Spring 2013
Chapter 7
AlgorithmDesign Technique:
Contraction
Contraction, an inductive technique for designing parallel algorithms, is probably one
of the most important algorithmdesign techniques. Like divideandconquer algorithms, contraction algorithms involve
Parallel and Sequential Data Structures and Algorithms
SCS 15210

Spring 2013
Recitation 1
Scan
1.1
Announcements
SkylineLab has been released, and is due Friday afternoon. Its worth 125 points.
BignumLab will be released on Friday.
1
2
RECITATION 1. SCAN
1.2
What is scan?
In the SEQUENCE library, there is a symmetry among certai
Parallel and Sequential Data Structures and Algorithms
SCS 15210

Spring 2013
Recitation 4
Scan Reloaded
4.1
Announcements
BignumLab has been released, and is due Friday afternoon. Its worth 175 points.
RandomLab will be released on Friday.
19
20
RECITATION 4. SCAN RELOADED
4.2
Implementation
Recall the implementation of scan for
Parallel and Sequential Data Structures and Algorithms
SCS 15210

Spring 2013
Recitation 5
Randomization
5.1
Announcements
RandomLab has been released, and is due Friday afternoon. Its worth 100 points.
FingerLab will be released this Friday. However, it will be due in two weeks to allow
time to study for Exam I, which is going t
Parallel and Sequential Data Structures and Algorithms
SCS 15210

Spring 2013
Chapter 4
Algorithm Design and Analysis
An essential component of algorithm design is the analysis of the resource usage of algorithms. Resources of interest usually include the amount of total work an algorithm
performs, the energy it consumes, the time
Parallel and Sequential Data Structures and Algorithms
SCS 15210

Spring 2013
Chapter 3
SPARC: A Strict Language for Parallel
Computing
To describe the algorithms covered in this book, we use a pseudocode notation that
is based on a language, which we call SPARC. SPARC is a strict functional language
similar to the ML class of lang
Parallel and Sequential Data Structures and Algorithms
SCS 15210

Spring 2013
Chapter 5
Example: Genome Sequencing
Human genome is the full nucleic acid sequence for humans; it consists of nucleotide
bases of A (Adenine), Cytosine (C), Guanine (G), or Thymine (T). The human genome
contains over 3 billion base pairs, each of which c
Parallel and Sequential Data Structures and Algorithms
SCS 15210

Spring 2013
Chapter 2
Mathematical Preliminaries
We present an overview of basic mathematical definitions used throughout the book.
We assume familiarity with collegelevel mathematics. This chapter is far from complete but further details can be found in standard te
Parallel and Sequential Data Structures and Algorithms
SCS 15210

Spring 2013
Chapter 1
Introduction
parallel
The topic of this book might best be described as problem solving with computers.
The idea is you have some problem to solve (e.g. finding the shortest path from your
room to your first class), and you want to use your comp
15110 SUMMER SESSION TWO 2014
Problem Set 6  due Thursday, July 17 at
9:00AM in class
Reading Assignment
Read chapter 3 in Blown To Bits.
Instructions
Type or neatly write the answers to the following problems.
Please STAPLE your homework before you hand
CHAPTER 3
GENERATIVE AND DISCRIMINATIVE
CLASSIFIERS:
NAIVE BAYES AND LOGISTIC REGRESSION
Machine Learning
c
Copyright 2015.
Tom M. Mitchell. All rights reserved.
*DRAFT OF February 15, 2016*
*PLEASE DO NOT DISTRIBUTE WITHOUT AUTHORS PERMISSION*
This is a
10601 Machine Learning
MariaFlorina Balcan
Spring 2015
Generalization Abilities: Sample Complexity Results.
The ability to generalize beyond what we have seen in the training phase is the essence of machine
learning, essentially what makes machine learn
Machine Learning 10601
Tom M. Mitchell
Machine Learning Department
Carnegie Mellon University
January 14, 2015
Today:
The Big Picture
Overfitting
Review: probability
Readings:
Decision trees, overfiting
Mitchell, Chapter 3
Probability review
Bishop
Machine Learning 10601
Tom M. Mitchell
Machine Learning Department
Carnegie Mellon University
January 21, 2015
Today:
Bayes Rule
Estimating parameters
MLE
MAP
some of these slides are derived
from William Cohen, Andrew
Moore, Aarti Singh, Eric Xing,
Machine Learning 10601
Tom M. Mitchell
Machine Learning Department
Carnegie Mellon University
January 26, 2015
Today:
Bayes Classifiers
Conditional Independence
Nave Bayes
Readings:
Mitchell:
Nave Bayes and Logistic
Regression
(available on class webs
Machine Learning 10601
Tom M. Mitchell
Machine Learning Department
Carnegie Mellon University
February 2, 2015
Today:
Logistic regression
Generative/Discriminative
classifiers
Readings: (see class website)
Required:
Mitchell: Nave Bayes and
Logistic R
Machine Learning 10601
Tom M. Mitchell
Machine Learning Department
Carnegie Mellon University
February 4, 2015
Today:
Generative discriminative
classifiers
Linear regression
Decomposition of error into
bias, variance, unavoidable
Readings:
Mitchell: N
Machine Learning 10601
Tom M. Mitchell
Machine Learning Department
Carnegie Mellon University
February 2, 2015
Today:
Logistic regression
Generative/Discriminative
classifiers
Readings: (see class website)
Required:
Mitchell: Nave Bayes and
Logistic R