English | Graded Assignment | Unit Test, Part 2: Sense and Sensibility
Name: Dylan Carney
Date: 4/1/2016
Graded Assignment
Unit Test, Part 2: Sense and Sensibility
Answer the following questions in complete sentences.
Total score: _ of 55 points
(Score fo
6.006 Introduction to Algorithms
Recitation 11
October 21, 2011
Principles of Algorithm Design
When you are trying to design an algorithm or a data structure, its often hard to see how to
accomplish the task. The following techniques can often be useful:
6.006 Intro to Algorithms
Recitations 5
September 23, 2011
BSTNode
1 class BSTNode(object):
2
"A node in the vanilla BST tree."
3
4
def _init_(self, parent, k):
5
"Creates a node.
6
7
Args:
8
parent: The nodes parent.
9
k: The key of the node.
10
"
11
sel
6.006 Intro to Algorithms
Recitation 1
September 9, 2011
Asymptotic Complexity
These notes aim to help you build an intuitive understanding of asymptotic notation. They are a
supplement to the material in the textbook, not a replacement for it.
Informally
Subscribe to the
Enter Email
OCW Newsletter
Help | Contact Us
Courses
Find courses by:
Topic
MIT Course Number
Department
Collections
Audio/Video Lectures
Online Textbooks
New Courses
Most Visited Courses
OCW Scholar Courses
This Course at MIT
Supplem
Subscribe to the
Enter Email
OCW Newsletter
Help | Contact Us
Courses
Find courses by:
Topic
MIT Course Number
Department
Collections
Audio/Video Lectures
Online Textbooks
New Courses
Most Visited Courses
OCW Scholar Courses
This Course at MIT
Supplem
Introduction to Algorithms: 6.006
Massachusetts Institute of Technology
Professors Erik Demaine and Srini Devadas
November 22, 2011
Problem Set 7
Problem Set 7
Both theory and programming questions are due on Tuesday, December 6 at 11:59PM.
Please downloa
Introduction to Algorithms: 6.006
Massachusetts Institute of Technology
Professors Erik Demaine and Srini Devadas
December 7, 2011
Problem Set 7E
Problem Set 7E
You will need to submit the ps7e_answer.tex le containing your grading explanation to the
Stel
Introduction to Algorithms: 6.006
Massachusetts Institute of Technology
Professors Erik Demaine and Srini Devadas
November 1, 2011
Problem Set 6
Problem Set 6
Both theory and programming questions are due on Tuesday, November 15 at 11:59PM.
Please downloa
6.006 Intro to Algorithms
Recitation 2
September 14, 2011
Python Cost Model
Operators in Eriks notes, minus what was covered in lecture:
1. list operations:
(a) L1.extend(L2)
(b) L2 = L1[i:j]
(c) b = (x in L) or L.index(x) or L.find(x)
2. tuple and str
3.
6.006 Intro to Algorithms
Recitation 5
September 23, 2011
Sidebar: Data Structures
A data structure is a collection of algorithms for storing and retrieving information. The operations that store information are called updates, and the operations that ret
6.006 Introduction to Algorithms
Recitation 10
October 14, 2011
Problem 1. Recurrence
Fall 2010 1(c): Find an asymptotic solution of the following recurrence. Express your answer
1
using -notation, and give a brief justication. (Note that n log n = 2 = (1
6.006 Introduction to Algorithms
Recitation 9b
October 12, 2011
Matching DNA Sequences
Today we will look at the code structure of the DNA sequence matching problem in PSet 4.
A DNA sample is represented as a sequence of characters such as A, G, C, T in u
6.006 Introduction to Algorithms
Recitation 9b
October 12, 2011
dnaseq.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
# Maps integer keys to a set of arbitrary values.
class Multidict:
# Initializes a new multi-value dictionary, and adds any key
6.006 Introduction to Algorithms
Recitation 7
September 30, 2011
Sort Stability
A sorting algorithm is stable if elements with the same key appear in the output array in the same
order as they do in the input array. That is, it breaks ties between two ele
6.006 Introduction to Algorithms
Recitation 8
October 5, 2011
Simulation Algorithms
Simulations are immensely useful, both for prot (design validation) and fun (games such as Angry
Birds). Simulations can be optimized with the aid of data structures such
6.006 Introduction to Algorithms
Recitation 9
October 7, 2011
Rolling Hash
Rolling hash is an abstract data type that maintains a list and supports the following operations:
hash(): computes a hash of the list.
append(val): adds val to the end of the li
6.006 Intro to Algorithms
Recitation 8
October 5, 2011
Line-Sweep Algorithms
1 class CrossVerifier(object):
2
def _events_from_layer(self, layer):
3
"Populates the sweep line events from the wire layer."
4
left_edge = min([wire.x1 for wire in layer.wires.
6.006 Intro to Algorithms
Recitation 6
September 28, 2011
AVL Trees
Recall the operations (e.g. find, insert, delete) of a binary search tree. The runtime of
these operations were all O(h) where h represents the height of the tree, dened as the length of
Introduction to Algorithms: 6.006
Massachusetts Institute of Technology
Professors Erik Demaine and Srini Devadas
November 22, 2011
Problem Set 7
Problem Set 7
Both theory and programming questions are due on Tuesday, December 6 at 11:59PM.
Please downloa
Introduction to Algorithms: 6.006
Massachusetts Institute of Technology
Professors Erik Demaine and Srini Devadas
November 1, 2011
Problem Set 6
Problem Set 6
Both theory and programming questions are due on Tuesday, November 15 at 11:59PM.
Please downloa
Introduction to Algorithms: 6.006
Massachusetts Institute of Technology
Professors Erik Demaine and Srini Devadas
September 8, 2011
Problem Set 1
Problem Set 1
Both theory and programming questions are due Thursday, September 15 at 11:59PM.
Please downloa
Subscribe to the
Enter Email
OCW Newsletter
Help | Contact Us
Courses
Find courses by:
Topic
MIT Course Number
Department
Collections
Audio/Video Lectures
Online Textbooks
New Courses
Most Visited Courses
OCW Scholar Courses
This Course at MIT
Supplem