Announcements:
Extra HW 2 Due Friday, 10/14
Most questions about Human encoding trees, and two questions about
constraints
Oce Hours Thursday 5 PM in 283 Soda Hall
Data Representations Using Functions:
Functions with Shared Local State
Pairs Implemented a
Lecture 1 (08/25/2016)
Instructors:
Babak Ayazifar
[email protected]
517 Cory
No surprise visits!
Vladimir Stojanovic
[email protected]
513 Cory
The EE Community:
28 TAs
Head TA: Harrison
[email protected]
Army of academic interns:
Prefix Trees:
All words that share a prefix
A prefix tree (or just trie) indexes words by prefix
lookup: Follow a path from the root using a prefix, then enumerate everything
below the resulting node
Last node is a leaf (or terminal node): Root of the ter
Announcements:
Extra HW 2 Due Friday, 10/14
A new hw based on todays lecture will be up soon possibly due next week
Implementing an Object System:
Todays Topics:
What is a class?
What is an instance?
Well be using dispatch dictionaries
The OOP Abstraction
Lecture 35 (04/17/2017)
Sorting:
Sorting is a fundamental problem
Useful for putting things in order
Can be used to solve other tasks, sometimes in non-trivial ways
Improves duplicate finding from a naive N2 to N log N
Sorting improves 3SUM from a naive N
Lecture 33 (04/12/2017)
Announcements:
Saturday 4/15: Guerilla section will be held 12-2 PM in 2nd floor labs, covers graphs
and sorting
Project 3 thoughts:
Start today if you havent started yet, not a project you can do last minute
Slides and videos are
Lecture 30 (04/05/2017)
Announcements:
Project 3 will be out this weekend
Significant project so dont put o starting until the last minute
Larger than project 1, but not as big as project 2
Project will be closest to what you might do at an internship
Usi
Lecture 29 (04/03/2017)
Announcements:
Midterm Friday at 4
HW4 due Thursday, 4/6
Autograder is basically just the tests we gave you plus a test of your tests
Labs this week will be used for review of midterm material
Friday lecture will be open Q&A/review
Lecture 26 (03/20/2017)
Graphs:
Graph: A set of nodes (a.k.a vertices) connected pairwise by edges
Directed: Edges have a notion of direction
Undirected: No notion of directionality, and we can traverse the edges either way
Acyclic: No cycles exist in suc
Lecture 28 (03/24/2017)
Announcements:
Exam content window adjusted.
Covers only material up to today (3/24)
Todays lecture is largely bonus content
Discussion right after Spring Break will give some practice
You should know how to write basic regular exp
Lecture 36 (04/19/2017)
Announcements:
HW5 is out tonight
Due next Wednesday
Image resizing program
Lab 15, HW 6, and HW 7 are opportunities to replace earlier HWs or labs that you
missed or did poorly on
Due Friday of dead week
Only necessary if you need
Lecture 37 (04/21/2017)
Summary:
Tries will be roughly analogous to digit-by-digit radix sorting
Tries:
Digit-by-digit Search Analogy with Strings
Tries are a digit-by-digit set representation
Short for Retrieval Tree
Pronounced as try
Performance in Term
Lecture 32 (04/10/2017)
Announcements:
Project 3 is out
Time to get started
Midterm 2 grades will be out late Tuesday/early Wednesday
Grading is eectively done, but some makeups tomorrow
Sorting - Definitions:
A sort is a permutation (re-arrangement) of a
Lecture 34 (04/14/2017)
Announcements:
Project 3:
Goal is to be intense, but not too terribly long
Will survey you on the final survey on how it went
Last years students thought it was slightly too hard, but the version this
time should be good
Rastering
Lecture 27 (03/22/2017)
Graph Problems:
Runtime is Theta(V + E)
Each vertex is visited once. Each visit costs constant time
Space is Theta(V)
Call stack depth at most V
Traversals:
DFS Preorder: Order of DFS calls
DFS Postorder: Order of returns from DFS
Lecture 3 (01/23/2017)
ENIAC (U. Penn., 1946):
First Electronic General-Purpose Computer
Blazingly fast (multiply in 2.8 ms!)
Needed 2-3 days to setup new program, as it was programmed with patch cords and
switches
EDSAC (Cambridge, 1949(:
First General S
Lecture 1 (01/18/2017)
Professor Gerald Friedland:
Adjunct Assistant Professor
Specializes on multimedia computing, privacy & privacy education
Dr. Nick Weaver:
Specializes in network security and network management
Some security stu throughout the course