ECS 60

Homepage

Fall 2017

Syllabus
Grades
How NOT to program
UCD Computer Science at Home
Unix Tutorial

Fall 2015 Video Archives

Winter 2015 Video Archive:

 

Fall 2015

09-25-2015 Introduction, Math Review, Induction

09-28-2015 Complexity, ADTs, Lists

09-30-2015 CursorList

10-02-2015 Skip Lists

10-05-2015 Trees and Intro to B-Trees

10-07-2015 B Tree Lecture

10-09-2015 Binary Tree and Traversals

10-12-2015 AVL Trees

10-14-2015 Splay Trees

10-16-2015 Tries and Huffman Encoding

10-19-2015 Amortized Analysis

10-21-2015 Hash Tables1

10-23-2015 Hash Tables2

10-26-2015 Extendible Hash

10-28-2015 Binary Heaps and Intro to D Heaps

10-29-2015 Midterm1 Review

11-02-2015 Heaps

11-04-2015 Disjoint Sets

11-06-2015 Graphs definitions and topological sort

11-09-2015 Critical Path Analysis and unweighted shortest path

11-13-2015 Minimum Spanning Tree

11-16-2015 Kruskals Ford-Faulkerson

11-18-2015 Articulation Points

11-19-2015 Midterm2 Review

11-23-2015 Selection Insertion Sort

11-25-2015 Shell Sort, Heap Sort and Merge Sort

11-30-2015 Quick sort and Bucket Sort

12-02-2015 Radix Sort and Intro NP Complete1

12-04-2015 NP Completion

 

Winter 2015

02-09-2015 Binary Heaps and D Heaps and intro to disjoint sets

02-11-2015 Disjoint Sets

Programming Assignments
Program #1
Program #2
Program #3
Program #4

Program #5

Written Homework Assignments
Homework #1
Homework #2
Homework #3
Homework #4
Homework #5
Homework #6
Homework #7

Practice Tests
Practice Midterm #1.pdf
Practice Midterm #1 Key.pdf
Practice Midterm #2.pdf
Practice Midterm #2 Key.pdf
Tree Examples.pdf
Tree Examples Key.pdf
Practice Final.pdf
Practice Final Key.pdf
Previous Final Essays.pdf
Previous Final Essays Keys.pdf

ADT and sorting Demonstrations

Notes on ECS 60 graph algorithms with their exact video locations (thanks to David Montes)
Visualization of algorithms and data structures (thanks to Julien Hoachuck)

ADT Demonstrations site (thanks to Dylan Wang)
ADT Demonstration Download (trees.jar)
AVL Tree Demonstration
AVL Tree Applet
BTrees, our way: Basics, Insertions, Deletions  (by Stephan Burroughs, former student)

Big-O Complexities (thanks to So Choi)
Skip List Demonstration
(thanks to Peter Rozental)
Sort and ADT Demonstrations!
(thanks to Jourdan Yeh)
Sorting Algorithm Demonstrations (thanks to Russell Miller)
15 sorting algorithms in 6 minutes on YouTube (thanks to Gabrielle Chwalik)
Quick-sort with Hungarian (Küküllőmenti legényes) folk dance (thanks to Disha Bendre)
Splay Tree Demonstration (thanks to Adam Strauss)

Splay Tree Demonstration
STL versions of the Graph Algorithms written by a former ECS 60 student (thanks to Aakash Prabhu)
Red-Black Tree Demonstration

Other helpful links
Complexity Lecture Notes
Cursor List Excerpt

Trees Lecture Notes
Previous Challenge Programs.pdf
ECS 40 Home Page
for UCD Unix help.
Moonedit a text editor that permits remote collaboration (thanks to Andrew Chow).
gdb Interactive Tutorial
Professor Matloff's Tutorial Page If you are looking for a tutorial on any topic in UNIX, LINUX or C, it's there!