Course Home | Syllabus | Assignments | Schedule | Downloads | | [print]

# CS 3510: Advanced Algorithms/Data Structures

## Spring 2018 Syllabus

### Course Description

Required of students pursuing a Computer Science degree or emphasis. Covers the analysis and design of algorithms and data structures, including graphs, greedy algorithms, divide and conquer algorithms, and dynamic programming.

### Prerequisites

CS 2420 (Grade C- or higher); AND CS 2810 (Grade C- or higher); AND CS 3310 (Grade C- or higher)

### Course fees

**Course fee:** $25, used to assist in maintaining CIT infrastructure.

### Disability Statement

If you suspect or are aware that you have a disability that may affect your success in the course you are strongly encouraged to contact the Disability Resource Center (DRC) located in the North Plaza Building. The disability will be evaluated and eligible students will receive assistance in obtaining reasonable accommodations. Phone # 435-652-7516.

### Sections

WMF 8:00-8:50 am in Smith 117

Final exam Apr 27 at 7:00 am - 8:50 am

### Instructor

**Instructor:** Curtis Larsen

**Email:** larsen@dixie.edu

**Phone:** 435-652-7972

**Office:** North Burns 233

**Office Hours:** MWF: 1:00-1:50 pm; TR: 8:00-8:50 am (@Burns 233) or by appointment. (Fall 2017)

## Objectives

The student will be able to discuss the principles of:

- analysis of algorithms,
- divide-and-conquer algorithms,
- graph algorithms,
- dynamic programming, and
- linear programming.

The student will be able to:

- analyze algorithm run time,
- find and solve recurrence relations,
- create and analyze divide-and-conquer, graph, dynamic programming and linear programming algorithms,
- choose suitable algorithms for problems.

## Resources

### Texts

There is one required text for the course. It is available from the campus bookstore. Additionally, there is a recommended text book for reference. It is not available in the campus bookstore.

*Algorithms*by Dasgupta, Papadimitriou and Vazirani, ISBN: 978-0-07-352340-8 (required)This book is required and is the primary text for the course.

*Introduction to Algorithms, Third Edition*by Cormen, Leiserson, Rivest, and Stein ISBN: 978-0262033848 (recommended)

### Computer Labs

You may use the computers and software in the Smith Computer Center. Some lab assistants may be able to help with assignments and pass off homework assignments for introductory courses.

### Course Web Site

Assignment submissions and grades will be managed in the Canvas System.

## Assignments and Exams

### Reading

The student is responsible for reading the material in the textbook. A reading schedule is provided with the class schedule on the course website. The student is expected to read the material before the class in which it is discussed. The book also includes material beyond what we will discuss in lecture, which you are encouraged to study on your own. Feel free to bring questions from the reading to lectures or to office hours.

### Assignments

A series of problem sets will be assigned. The number of points awarded per problem set may vary depending on the number and difficulty of the problems. The homework will consist of written work and computer programming work. The assignments are designed to promote the course objectives listed above.

Assignment problems must be submitted on paper at the start of class on the due date. Program source code must be submitted via the CIT submission system by the start of class on the due date.

There will be some problems due most class days.

### Quizzes

This course will have many quizzes in the semester. Quizzes are designed to check understanding of the course materials, and to promote the course objectives. Quizzes will be short in-class activities, and graded on participation.

All quizzes will be weighted equally.

### Exams

There will be two midterm exams and one final exam as scheduled during finals week. The midterm exams will be scheduled in the testing center to allow 120 minutes. The final will require the full 120 minutes scheduled for the exam time. The midterm exam topics will be from the recently covered materials. The final exam topics will be comprehensive.

### Grading

Assignments will count for 20% of your point total. Quizzes will count for 1% of your point total. The midterm exams will each count for 22% of your point total. The final exam will count for 35% of your point total.

Letter grades are assigned based on the percentage of possible points attained, according to the following chart:

Minimum Percentage | Letter Grade | Minimum Percentage | Letter Grade | Minimum Percentage | Letter Grade | Minimum Percentage | Letter Grade |

94 | A | 84 | B | 74 | C | 64 | D |

90 | A- | 80 | B- | 70 | C- | 60 | D- |

87 | B+ | 77 | C+ | 67 | D+ | 0 | F |

## Course Policies

### Attendance

Students are responsible for material covered and announcements made in class.
School-related absences may be made up only if prior arrangements are made. The
class schedule presented is approximate. The instructor reserves the right to
modify the schedule according to class needs. Changes will be announced in
class and posted to the website. Exams and quizzes cannot be made up unless
arrangements are made *prior* to the scheduled time.

### 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, which is approximately 9 hours per week. If you do not have the time to spend on this course, you should probably rethink your schedule.

### Late Policy

Assignments are due on the date specified in the schedule. Handing them in or passing them off after the specified time is considered one day late. You may turn them in up to two school days late with penalties as described below. After two days late, you receive zero points.

For example: if an assignment is due at noon on Thursday:

- Before noon Friday the assignment is considered 1 day late.
- Before noon Monday the assignment is considered 2 days late.
- After noon on Monday the assignment will not be accepted.

Saturdays, Sundays, and school holidays do not count as late days. Late days do
*not* extend beyond the last day of class.

Each student is given five free late days to use over the course of the semester. The lateness of an assignment will be determined according to the rules given above, and the first five late days used during the semester will be forgiven. After that, each late day will result in a 10% penalty.

Important notes:

- Even using free late days, students cannot submit assignments more than two days late and receive credit. No assignments will be accepted more than two days past the original deadline.
- Free late days are applied to the
*first*five late days during the semester. Students cannot control which late days are penalized and which ones forgiven; the first five late days in the semester are forgiven, and the rest are penalized. - Free late days only apply to students who submit
*every*assignment within the two-day cutoff period. For example, if you fail to submit the fifth assignment, or submit it more than two days late, you will forfeit all free late days,*including those used for earlier assignments*. - No other extensions will be granted, except under exceptional circumstances. Students should reserve their free late days to use in the event of illness, emergencies, traveling, sports conflicts, etc. Students are advised not to use their free late days early in the semester, as assignments tend to get more difficult and schedules tighter as the semester progresses.

### Collaboration

Limited collaboration with other students in the course is permitted. Students may seek help learning concepts and developing programming skills from whatever sources they have available, and are encouraged to do so. Collaboration on assignments, however, must be confined to course instructors, lab assistants, and other students in the course. Students are free to discuss strategies for solving programming assignments with each other, but this must not extend to the level of programming code. Each student must code his/her own solution to each assignment. See the section on cheating.

### Cheating

Cheating will not be tolerated, and will result in a failing grade for the students involved as well as possible disciplinary action from the college. Cheating includes, but is not limited to, turning in homework assignments that are not the student’s own work. It is okay to seek help from others and from reference materials, but only if you learn the material. As a general rule, if you cannot delete your assignment, start over, and re-create it successfully without further help, then your homework is not considered your own 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. If you are unsure if collaboration is appropriate, contact the instructor. Also, note exactly what you did. If your actions are determined to be inappropriate, the response will be much more favorable if you are honest and complete in your disclosure.

Where collaboration is permitted, each student must still create and type in
his/her 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 or written work, either
electronically or visually. The line between collaborating and cheating is
generally one of language: talking about solutions in English or other natural
languages is usually okay, while discussions that take place in programming
languages are usually not okay. It is a good idea to wait at least
30 minutes after any discussion to start your independent write-up. This
will help you commit what you have learned to long-term memory as well as help
to avoid crossing the line to cheating.

## College Policies

Additional college policies, calendars, and statements are available online at http://new.dixie.edu/reg/syllabus/.

Last Updated 01/11/2018