FALL 2011 COSC 511 Syllabus

Course meets: T R 5:30 - 6:45pm 5:30 - 6:45pm 207 Pray-Harrold

Course communication

Instructor: Professor Susan Haynes
Office Hours: TBA 511E Pray-Harrold

Textbooks: Description:
Complexity measures of algorithms; searching, sorting, string matching, and graph algorithms; design and analysis of greedy algorithms, backtracking, divide and conquer approach, dynamic programming; NP-complete and NP-hard problems are studied.

Online versus brick-and-mortar
The content of the course is being placed online through eCollege (emuonline.edu). There will be an online asynchronous space for discussion of homework problems -- this will be either through eCollege or through emu-cosc511-FA11.wikispaces.com.

Any student can, at any time, be online or traditional, and that can change as often as desired over the course of the term. There will be deadlines on homework submissions; homework can be submitted early. The quizzes and final are released (with appropriate security) to the individual student who has completed the relevant homework.

Student work and assessment:

Grades Academic Honesty
I expect, and your fellow students expect, that every person in this class will adhere to the highest ethical standards. Unless otherwise specified, all work handed in to me must be your own independent work. If you act in an academically or ethically dishonest manner, you will receive an E for the final grade and I will submit your name to the dean of students for dismissal or academic sanction.

Collaboration
You may collaborate as desired on homework problem sets. Each student must submit a copy of the answers. You do not need to write the collaborators' names on the submission.

CAVEAT
This document may be modified, with appropriate notification to students, as pedagogically necessary or advisable.