Algo.2013f-hw History

Hide minor edits - Show changes to output - Cancel

Added lines 77-78:
: Complete List %toggle% : \
(:attachlist:)
Changed lines 76-77 from:
: Complete List %toggle% : \
(:attachlist:)
to:
Changed lines 76-77 from:
to:
: Complete List %toggle% : \
(:attachlist:)
Deleted lines 76-77:
: Complete List %toggle% : \
(:attachlist:)
Changed line 40 from:
|| 9 || Hashing || [[(Attach:) l11_BASE.pdf]] || Focus on Sects.1,4,5,6. || 2 ||
to:
|| 9 || Hashing || [[(Attach:) l11_BASE.pdf]] || Focus on Sects.1,4,5,6 (Highlight is the FKS scheme). || 2 ||
Added lines 76-78:

: Complete List %toggle% : \
(:attachlist:)
Changed line 9 from:
Click [Algo/2013f-hw-comments| HERE] to see comments and clarifications on the homework questions (starting from hw5).
to:
Click [[Algo/2013f-hw-comments| HERE]] to see comments and clarifications on the homework questions (starting from hw5).
Changed line 9 from:
Here are comments and clarifications on the homework questions (starting from hw5).
to:
Click [Algo/2013f-hw-comments| HERE] to see comments and clarifications on the homework questions (starting from hw5).
Added lines 8-9:

Here are comments and clarifications on the homework questions (starting from hw5).
October 22, 2013, at 07:25 PM EST by 128.122.253.228 -
Changed lines 34-35 from:
|| 5 || The Greedy Approach || [[(Attach:) l5_BASE.pdf]] || Focus on Sects.1,2,3,4,5 (Joy Ride, Coin Change, Intervals, Huffman, Dynamic Huffman) || 2 ||
|| 6 || Amortization || [[(Attach:) l6_BASE.pdf]] || Splay Analysis || 2 ||
to:
|| 5 || The Greedy Approach || [[(Attach:) l5_BASE.pdf]] || Focus on Sects.1,2,3,4,5 (Joy Ride, Coin Change, Intervals, Huffman, MST) || 2 ||
|| 6 || Amortization || [[(Attach:) l6_BASE.pdf]] || Splay Analysis and Fibonacci heaps || 2 ||
October 02, 2013, at 07:33 PM EST by 128.122.253.228 -
Changed line 34 from:
|| 5 || The Greedy Approach || [[(Attach:) l5_BASE.pdf]] || Focus on Sects.1,2,4,5 (Joy Ride, Coin Change, Huffman, Dynamic Huffman) || 2 ||
to:
|| 5 || The Greedy Approach || [[(Attach:) l5_BASE.pdf]] || Focus on Sects.1,2,3,4,5 (Joy Ride, Coin Change, Intervals, Huffman, Dynamic Huffman) || 2 ||
October 01, 2013, at 09:52 AM EST by 128.122.253.212 -
Changed line 31 from:
|| 2 || Recurrences || [[(Attach:) l2_BASE.pdf]] || Read up to Section 11 (Multiterm Master Theorem) || 3 ||
to:
|| 2 || Recurrences || [[(Attach:) l2_BASE.pdf]] || Read up to Section 10 (Multiterm Master Theorem) || 3 ||
Added lines 6-9:

You may pick them up from your account in NYU Classes.

(:if false:)
Changed line 13 from:
(:if false:)
to:
Added lines 16-17:

The assignment files will be updated and grow as the course progresses.
Deleted lines 18-19:

The assignment files will be updated and grow as the course progresses.
Changed lines 26-36 from:
|| 1 || Introduction to Algorithmics || [[(Attach:) l1.pdfx]] || Read the non-starred sections lightly; focus on Sect. 7 || 1 ||
|| 2 || Recurrences || [[(Attach:) l2.pdfx]] || Read up to Section 11 (Multiterm Master Theorem) || 3 ||
|| 3 || Balanced Search Trees || [[(Attach:) l3.pdfx]] || Read up to Sect. 8 ((a,b)-Trees) || 2 ||
|| 4 || Pure Graph Algorithms || [[(Attach:) l4.pdfx]] || Focus on biconnectivity (Para.30) and strong components (Para.38) || 2 ||
|| 5 || The Greedy Approach || [[(Attach:) l5.pdfx]] || Focus on Sects.1,2,4,5 (Joy Ride, Coin Change, Huffman, Dynamic Huffman) || 2 ||
|| 6 || Amortization || [[(Attach:) l6.pdfx]] || Splay Analysis || 2 ||
|| 7 || Dynamic Programming || [[(Attach:) l7.pdfx]] || Focus on Sects.2,3,4,5,7. || 2 ||
|| 8 || Probabilistic Algorithms || [[(Attach:) l8.pdfx]] || Focus on Sects.15-21. (Use rest of chapter for reference) || 4 ||
|| 9 || Hashing || [[(Attach:) l11.pdfx]] || Focus on Sects.1,4,5,6. || 2 ||
|| 10 || Disjoint Sets || [[(Attach:) l13.pdfx]] || Focus on Sects.1 to 4. || 2 ||
|| 11 || Min Cost Paths || [[(Attach:) l14.pdfx]] || Read chapter but focus on lecture topics || 2 ||
to:
|| 1 || Introduction to Algorithmics || [[(Attach:) l1_BASE.pdf]] || Read the non-starred sections lightly; focus on Sect. 7 || 1 ||
|| 2 || Recurrences || [[(Attach:) l2_BASE.pdf]] || Read up to Section 11 (Multiterm Master Theorem) || 3 ||
|| 3 || Balanced Search Trees || [[(Attach:) l3_BASE.pdf]] || Read up to Sect. 8 ((a,b)-Trees) || 2 ||
|| 4 || Pure Graph Algorithms || [[(Attach:) l4_BASE.pdf]] || Focus on biconnectivity (Para.30) and strong components (Para.38) || 2 ||
|| 5 || The Greedy Approach || [[(Attach:) l5_BASE.pdf]] || Focus on Sects.1,2,4,5 (Joy Ride, Coin Change, Huffman, Dynamic Huffman) || 2 ||
|| 6 || Amortization || [[(Attach:) l6_BASE.pdf]] || Splay Analysis || 2 ||
|| 7 || Dynamic Programming || [[(Attach:) l7_BASE.pdf]] || Focus on Sects.2,3,4,5,7. || 2 ||
|| 8 || Probabilistic Algorithms || [[(Attach:) l8_BASE.pdf]] || Focus on Sects.15-21. (Use rest of chapter for reference) || 4 ||
|| 9 || Hashing || [[(Attach:) l11_BASE.pdf]] || Focus on Sects.1,4,5,6. || 2 ||
|| 10 || Disjoint Sets || [[(Attach:) l13_BASE.pdf]] || Focus on Sects.1 to 4. || 2 ||
|| 11 || Min Cost Paths || [[(Attach:) l14_BASE.pdf]] || Read chapter but focus on lecture topics || 2 ||
Changed line 38 from:
|| 12 || NP-Completeness and beyond || [[(Attach:) l30.pdfx]] || || 2 ||
to:
|| 12 || NP-Completeness and beyond || [[(Attach:) l30_BASE.pdf]] || || 2 ||
Added line 71:
(:if false:)
Added line 74:
(:if end:)
Added lines 1-72:
(:title Assignment Page :)

Assignments are either Homework Assignments or Reading Assignments.

!! Homework Assignments
Your homework assignments are found in the following pdf file:

* Homework assignment file: [[(Attach:) coming-soon.pdf]].
(:if false:)
* Homework solution file: [[(Attach:) hw_sol.pdf]].
* Data set for Hashing in Homework 7: [[(Attach:) small.txt]], [[(Attach:) big.txt]]
(:if end:)

The assignment files will be updated and grow as the course progresses.

!! Reading Assignments
We encourage you to read ahead of lectures (you don't have to read the whole chapter, just
go as far as you can, in order to mentally prepare for the topics).
Usually, only the initial sections of a chapter is needed
-- below we give some additional guide.
Note that some files are not yet available.


|| border = 1 bgcolor=lightgreen
||! Topic ||! Title ||! File ||! Reading Assignment ||! No. Lectures ||
|| 1 || Introduction to Algorithmics || [[(Attach:) l1.pdfx]] || Read the non-starred sections lightly; focus on Sect. 7 || 1 ||
|| 2 || Recurrences || [[(Attach:) l2.pdfx]] || Read up to Section 11 (Multiterm Master Theorem) || 3 ||
|| 3 || Balanced Search Trees || [[(Attach:) l3.pdfx]] || Read up to Sect. 8 ((a,b)-Trees) || 2 ||
|| 4 || Pure Graph Algorithms || [[(Attach:) l4.pdfx]] || Focus on biconnectivity (Para.30) and strong components (Para.38) || 2 ||
|| 5 || The Greedy Approach || [[(Attach:) l5.pdfx]] || Focus on Sects.1,2,4,5 (Joy Ride, Coin Change, Huffman, Dynamic Huffman) || 2 ||
|| 6 || Amortization || [[(Attach:) l6.pdfx]] || Splay Analysis || 2 ||
|| 7 || Dynamic Programming || [[(Attach:) l7.pdfx]] || Focus on Sects.2,3,4,5,7. || 2 ||
|| 8 || Probabilistic Algorithms || [[(Attach:) l8.pdfx]] || Focus on Sects.15-21. (Use rest of chapter for reference) || 4 ||
|| 9 || Hashing || [[(Attach:) l11.pdfx]] || Focus on Sects.1,4,5,6. || 2 ||
|| 10 || Disjoint Sets || [[(Attach:) l13.pdfx]] || Focus on Sects.1 to 4. || 2 ||
|| 11 || Min Cost Paths || [[(Attach:) l14.pdfx]] || Read chapter but focus on lecture topics || 2 ||
|| X || Guest Lecture || [[(Attach:) mystery.pdf]] || || 1 ||
|| 12 || NP-Completeness and beyond || [[(Attach:) l30.pdfx]] || || 2 ||



(:if false:)

* [[(Attach:) Fib.java]] : sample program for Fibonacci numbers
* [[(Attach:) Makefile]] : sample Makefile (modify for your use)
* [[(Attach:) Makefile2]] : another sample Makefile
* [[(Attach:) _bashrc]] : sample _bashrc file (rename it to ".bashrc") and put in your home directory.
* [[(Attach:) lect.pdf]] : the first two lectures
* [[(Attach:) MyLinkedList.java]] : sample implementation of Lists, using linked lists
* [[(Attach:) MyArrayList.java]] : sample implementation of Lists, using arrays
* Hw1 solutions: [[(Attach:) Fibonacci.java]], [[(Attach:) Makefile-hw1]]
* Hw2 solutions: [[(Attach:) NewArrayList.java]], [[(Attach:) NewLinkedList1.java]], \
[[(Attach:) NewLinkedList2.java]] %toggle% : \
The 2 versions of NewLinkedLists implements 2 ways of appending: \
node by node, or the entire list in one shot.
* Helpers for hw3: [[(Attach:) TestDouble.java]]
* Hw3 sample solutions: [[(Attach:) Kaufman-Travis.tar]], [[(Attach:) Lin-Emily.tar]] \
[[(Attach:) Gao-Jiayang.tar]]
* [[(Attach:) Pred.java]]: very simple BST class (containing the predecessor code of midterm)
* March 19: [[(Attach:) mid_Sol.pdf]]: Solution to Midterm (with discussions -- please study this)
* March 22: [[(Attach:) Bst_hw4.java]]: Sample file for Hw4
* March 26: [[(Attach:) lect-avl-eg.pdf]]: example of AVL tree for deletion
* March 28: [[(Attach:) SmallList.java]]: Implement this interface (from text) \
for Hw4, Question 1.
* April 9: [[(Attach:) lect-Btree.pdf]]: Notes on B-Tree splits, borrows, merges.
* April 11: [[(Attach:) Bst.java]]: Sample file for Hw5 (you can extend this to Avl.java)
* April 20: [[(Attach:) AVL.tar]]: Tar file for AVL solution for Hw5.

(:if end:)

: Complete List %toggle% : \
(:attachlist:)