Semester: Spring 2008
Credits: 3 semester hours
Classroom: Udvar-Hazy 204
Section 01: TR 10:30am-11:45am
Instructor: Curtis Larsen
Phone: 652-7972
Office: Udvar-Hazy 323
Email: larsen@dixie.edu
Office/Lab Hours:
M: 10:00-11:50
W: 10:00-11:50
F: 10:00-11:50
Description: Course for students in the Computer Science Program. This course will instruct students in the analysis and design of algorithms and data structures including balanced trees, graphs, greedy algorithms, divide and conquer, and dynamic programming.
If you are a student with a physical or mental impairment and would like to request accommodations, please contact the Disability Resource Center (652-7516) in Room 201 of the Student Services Center. The Disability Resource Center will determine your eligibility for services based upon complete professional documentation. If you are deemed eligible, the Disability Resource Center will further evaluate the effectiveness of your accommodation requests and will authorize reasonable accommodations that are appropriate for your disability.
Prerequisites: CS 2420, CS 2810, and MATH 3310
Labs: The CIT computers in Udvar-Hazy 200 and Udvar-Hazy 151 are available to students for projects associated with this course.
Resources: The required text for this course is "Algorithms" by Dasgupta, Papadimitriou, and Vazirani (ISBN: 978-0-07-352340-8). Additionally, the text "Introduction to Algorithms, Second Edition" by Cormen, Leiserson, Rivest, and Stien (ISBN: 0-07-013151-1) is recommended.
Reading: The student is responsible for reading the material in the required text book. A reading schedule is provided with the class schedule. The student is expected to read the material before the class in which it is discussed, and to be prepared for discussions and questions.
Homework: A series of approximately 10 problem sets will assigned. The number of points awarded per problem set may vary depending on the number and difficulty of the problems. Most of the homework will consist of written work, but programming will be involved for some problems.
Assignments must be submitted on paper in class on the due date. The written homework solutions will be required to be typeset.
Late Policy: Assignments are due by class time on the date specified in the schedule. Assignments turned in after the due time are considered 1 day late. They may be turned in up to 3 school days late but 10 percent of the points are lost per day. After 3 days, assignments receive 0 points.
Tests: There will be one midterm and one final exam, given in the classroom on the dates specified in the class schedule. The midterm will require the full 75 minutes of class time. The final will require the full 120 minutes allotted for finals, and will be comprehensive in coverage.
There will be no late, early or makeup exams given, without arrangements made before the day of the examination.
Grading: Grades will be given according to the ratio of the students' scores to the total possible score for the class. The scores will be allotted 40% to homework, 25% to the midterm, and 35% to the final.
|
Time Commitment: Courses should require about 45 hours of work per credit hour of class. This class will require about 135 hours of work on the part of the student to achieve a passing grade. This requires at least 7 hours outside of class each week.
Cheating: Cheating will not be tolerated, and will result in a failing grade for the students involved. Cheating includes, but is not limited to, turning in homework assignments that are not the student's personal work.
You are encouraged to work in groups while studying for tests, discussing class lectures, discussing algorithms for homework solutions, and helping each other identify errors in your homework solutions.
However, each student must create and type in their own solution. Any kind of copying and pasting is NOT okay. If you need help understanding concepts, get it from the instructor or fellow classmates. But never copy another's code, electronically or visually.
