• Introduction/Mathematical Foundations (Chapters 1, 3, Appendix A)
• Recurrences (Chapter 4)
• Sorting Algorithms (Chapters 2, 8)
• Randomized Algorithms (Chapters 5, 7, 9)
• Data Structures (Chapters 6, 11, 12, 13, 14)
• Greedy Algorithms (Chapter 16)
• Dynamic Programming (Chapter 15)
• Graph Algorithms (Appendix B4, Chapters 22, 23, 24, 25)
• Selected Topics (Chapters 28, 30, 31, 34, 35)

Please make sure that you have a CS department computer account - you will need it for the programming assignments. You can obtain a CS department account by filling out the account registration form at the CS department.

Late policy: each late homework will incur a 10% penalty for each day of delay, but no homeworks may be submitted later than 3 days after the deadline.

Academic integrity: Students are encouraged to study together, however each student must individually prepare his/her solutions. Cheating or plagiarism are not permitted and will be sanctioned according with the UNR policy on Academic Standards. You should carefully read the section on Academic Dishonesty found in the UNR Student Handbook (copies of this section are on-line). Your continued enrollment in this course implies that you have read it, and that you subscribe to the principles stated therein.

Exams: there will be one mid-term and one final exam. Both exams will be closed books, closed notes. Permission to take exams on other dates than scheduled will not be given, except for extreme medical emergencies.

Grading policy (tentative, subject to change):

	Homework:	40%
	Mid-term:	25%
	Final exam:	30%
	Attendance and class participation:	5%

Grading scheme (tentative, subject to change):

	A:	90 and above
	B:	80-89
	C:	65-79
	D:	55-64
	F:	<55