Look [[here|http://cs.nyu.edu/yap/pub/classes/basic/05f/hw]] for your class homeworks.\n\nSolutions:\n[[Homework 2|sol2.pdf]]\n[[Homework 3|sol3.pdf]]\n[[Homework 4|sol4.pdf]]
9/17/05 - Page created\n10/9/05 - Solutions for homework 2 added\n10/15/05 - Solutions for homework 3 added\n11/18/05 - Solutions for homework 4 added
Welcome to the webpage for the Fall '05 Basic Algorithms class.\n\nIf you have suggestions or bug reports, please let me know at wu (at) cs.nyu.edu\n\nThis page is basically a static version of tagglywiki. The page should work with any recent browser. It has been tested on IE, Firefox and Opera for Windows and Safari, Omniweb, Firefox and Camino for OS X.
| 1 | Sep 12 | Introduction: Representative problems|Chap. 1|\n| 2 | Sep 19 |Algorithmic Analysis |Chap. 2|\n| 3 | Sep 26 |Graphs |Chap. 3|\n| 4 | Oct 3; |Quiz 1 & Graphs (contd) |Chap. 3|\n| 5 |Oct 10 |Greedy Algorithms |Chap. 4; Oct 10 (Columbus day); Midterm (Oct 12)|\n|6 |Oct 17 |Greedy Algorithms (contd) |Chap. 4|\n|7 |Oct 24 |Divide and Conquer |Chap 5|\n|8 |Oct 31 |Divide and Conquer(contd) |Chap 5|\n|9 |Nov 7 |Dynamic Programming |Chap. 6 |\n|10 |Nov 14 |Dynamic Programming (contd) |Chap. 6|\n|11 |Nov 21 |NP Completeness |Chap. 8; Thanksgiving (Nov 24)|\n|12 |Nov 28 |Quiz 2 & NP Completeness (contd) |Chap. 8|\n|13 |Dec 5 |Randomized Algorithms |Chap. 13|\n|14 |Dec 12 |Randomized Algorithms (contd) |Chap. 13; Last class (Dec 14)|\n|15 |Dec 19 |Final Exam | |
Unfortunately, we need to discuss this issue which rarely arises.\n\n(A) For the student:\nFirst of all, remember that the university and also our department has clear guidelines about this topic. Please consult these rules. \n\nWhat constitutes cheating? Basically any work you submit with your name on it says "THIS IS MY OWN WORK". Cheating is when this is false. If you partially copied from someone or some source, you must acknowledge this in the assignment. When in doubt, ask me. Note that this is different from DISCUSSING the material with other students in the class: you can freely do this (I encourage this!). But once you start to write up your solution, you are on your own. Abetting cheating is just as serious -- if you knowingly let a friend copy your work, you are also responsible for cheating. \n\n(B) For the Grader: \nI do not expect you to deliberately look out for cheating, but when you get a sense of something unusual, you might want to check more closely. Make a note of the names and discuss with me -- do not confront the students directly.
NOTE: \nAs grader, you should know the general instructions that I give to students on handing in homework. Beware that these instructions may be modified for individual homework or classes!\n\nThere are two basic ways to submit your homework:\n\n(1) Non-programs must be handed in as hardcopies.\n* These are due during class hours.\n* It should be properly bound together (stapled or in an envelop).\n\n(2) Programs must be handed in electronically, in\nONE single email. \n* These are due by midnite of the due date. \n* If you have to re-submit one of the files, please resend the ENTIRE set in one email (so that we can just delete your earlier email).
* [[Instructions for a TA or Grader]]\n* [[How to Hand in Homework]]\n* [[How to Record Grades]]\n* [[Academic Honesty]]
*[[Java Resources|http://cs.nyu.edu/yap/pub/classes/basic/info/java.html]] : tutorials, programs, etc. \n*[[Make Program|http://cs.nyu.edu/~yap/prog/make/]] : tutorial and info \n*[[Cygwin Resources|http://cs.nyu.edu/~yap/prog/cygwin]] : great free unix environment for your Windows! \n*[[Printing Postscript|http://cs.nyu.edu/yap/pub/classes/info/postscript.html]]\n*General Computing FAQs: [[Unix|http://cs.nyu.edu/yap/pub/classes/basic/info/unix-faqs.html]], [[Windows|http://cs.nyu.edu/yap/pub/classes/basic/info/win-faqs.html]]. \n*The [[Information Technology Services (ITS)|http://cs.nyu.edu/yap/pub/classes/basic/info/its.html]] at NYU provides your basic [[computing needs|http://www.nyu.edu/acf/facstaff.html]] at NYU. Look here for lab sites and hours. \n* Other useful [[links|http://cs.nyu.edu/yap/pub/classes/basic/info/links.html]]. \n*If you have suggestions for this space, please send an email to wu (at) cs.nyu.edu.
The course introduces you to:\n* efficient data structures (e.g., balanced trees),\n* basic computational problems (e.g., shortest paths)\n* important algorithms (e.g., string matching),\n* the mathematical tools for complexity analysis (e.g., recurrences), and\n* general computational paradigms (e.g., divide and conquer) \n\nOur approach is relatively rigorous and mathematical. The pace is not leisurely -- so expect to spend time outside of lectures to keep up with the work. Attendence at lectures and recitations is essential.