FSU Seal - 1851

    COURSE SYLLABUS

    COP 4531/CGS 5427 Complexity and Analysis of Data Structures and Algorithms
    Spring 2017

Pre/co-requisites:

Pre-requisites: COP 4530 (this pre-requisite will not be waived), MAD 3105 or 3107; Co-requisite: STA 4442, 4321, or 3032.

Class Schedule:

Activity Day Time Location
Lecture MW 3:35 pm - 4:50 pm HCB 215

Contact Information:

Instructor: Ashok Srinivasan
Office hours: Monday 5 pm - 6 pm, Wednesday 5 pm - 6 pm. I am also usually available in my office, and you can feel free to meet me in the afternoons, except just before class. Alternatively, you may schedule an appointment, either by email or by phone.
Office: 169, Love Building
Phone: 644-0559
Email: asriniva AT cs.fsu.edu
Teaching Assistant: Jarrod Moore
Office hours: MTW 12:30 pm - 1:30 pm.
Office: Computer Science Majors Lab, Love Building.
Email: jdm10c AT my.fsu.edu
Teaching Assistant: (For quiz grades) Victor Brunell
Office hours: R 3 pm - 4 pm.
Office: LOV 161.
Email: brunell AT cs.fsu.edu

Course Material:

Required Material
Computer Accounts

Course Rationale:

So far, you have acquired proficiency in programming in your two programming courses and in the data structures course (COP 4530). In COP 4530, you also learned different ways of organizing data to facilitate efficient access to them. In this course, you will use these data structures to solve commonly encountered computer science problems efficiently. You will also further develop your skills in analyzing the time complexity and in proving the correctness of your programs in a mathematically rigorous manner. Material that you learn in this course will enable you to make efficient use of computational resources, which is important to your becoming a good computer scientist later.

Course Description:

In this course, you will learn to develop efficient algorithms, analyze their running time and space requirements, and implement them efficiently. Algorithms and programs may be efficient in the following two respects:

In order to solve a problem efficiently, it is important to use efficient algorithms and also to implement the algorithms efficiently in code. You will learn the former in class. Your programming expertise should enable you to translate this knowledge into efficient code. This course maintains a balance between theory and programming, which will enable you to solve a problem efficiently.

Learning Objectives:

At the end of this course, you should be able to accomplish the objectives given below.

Your Responsibilities:

Deadlines and Instructions

Following the same professional guidelines that you will encounter at work, there are strict deadlines, and instructions that must be followed. Please read instructions carefully, and schedule your activities so that you submit assignments well in time. You should check your FSU email account and the course web page on Blackboard regularly, and note other announcements, on-line and in class. You should also subscribe to the discussion board forums on Blackboard so that you get updated on new posts.

Class Participation

We will ask you questions in class: (i) review questions on the previous lecture and (ii) questions on the material currently being discussed, and also questions that need to be answered on the discussion board, in order for us to obtain feedback on how well you understand the material. You should be prepared to answer these questions, and should also participate by asking questions, suggesting ideas, and performing in-class assignments that we give. Of course, you cannot participate in class unless you attend it! You will be graded on these activities.

Reading Assignments

After each lecture, you will be given a reading assignment pertaining to that lecture. You should read these, and also practice writing code. New material builds on the old ones. So, if you have trouble with some material, then please get help through the discussion board on Blackboard or from me, before the next class. You should also peruse the material for the next lecture, and be prepared to answer questions on it, which I will provide in advance. I expect that you will need to spend between one and two hours studying for each lecture. The assignments and exams will consume additional time. The following learning components are important, and you may want to verify if you do satisfactorily on these, after studying the material.

Homework Assignments

You will have two programming assignments and two written assignments in this course, and you will have around ten days to work on each one. The assignments will be announced on the Blackboard course web site under "Assignments". Assignment submission instructions are available at www.cs.fsu.edu/~asriniva/courses/ualg17/HWinstructions.html. The programming assignments will be substantially more difficult than those in previous programming courses, and require substantially better quality effort. Please start working on the assignments as soon as they are announced, if you wish to complete them on time!

Course Calendar:

Week Lecture Chapter Assignments
1 9 Jan Introduction
11 Jan Growth functions -- Sec 3.1 - 3.2
2 16 Jan Martin Luther King Day: No Class
18 Jan Divide-and-conquer -- Sec 4.1 - 4.2
3 23 Jan Solving recurrences -- Sec 4.3 - 4.4
25 Jan Solving recurrences -- Sec 4.5 - 4.6
4 30 Jan Review recurrences Assignment 1 announced 1 Feb
1 Feb Heapsort -- Sec 6.4 - 6.5
5 6 Feb Randomized Quicksort -- Sec 7.3 - 7.4
8 Feb Lower bound on sorting -- Sec 8.1
6 13 Feb Counting sort, radix sort, and bucket sort -- Sec 8.2 - 8.4 Assignment 1 due 13 Feb
15 Feb Randomized selection -- Sec 9.1 - 9.2
7 20 Feb Dynamic Programming: Rod Cutting Problem -- Sec 15.1 Assignment 2 announced 20 Feb
22 Feb Elements of dynamic programming and longest common subsequence -- Sec 15.3-15.4
8 27 Feb Review of Dynamic Programming Assignment 2 part 1 (theory) due 27 Feb
1 Mar Midterm review
9 6 Mar Midterm Midterm this week!
8 Mar Activity selection and greedy strategy -- Sec 16.1 - 16.2
10 7 Mar Spring break
15 Mar Spring break
11 20 Mar Huffman codes -- Sec 16.3 Assignment 2 part 2 (programming) due 22 Mar
22 Mar Greedy algorithms review -- Sec 16.1 - 16.3
12 27 Mar Amortized analysis -- Sec 17.2 - 17.3 Assignment 3 announced 27 Mar
29 Mar Elementary graph algorthms -- Sec 22.1 - 22.3
13 3 Apr Topological sort and Strongly connected components -- Sec 22.4 - 22.5
5 Apr Minimum spanning tree -- Sec 23.1 - 23.2
14 10 Apr Single source shortest path -- Sec 24.3 Assignment 3 due 10 Apr
Prorgamming assignment 4 announced 10 Apr
12 Apr NP-completeness -- Sec 34.1 - 34.3
15 17 Apr NP-completeness -- Sec 34.4 - 34.5 Assignment 4 due 22 Apr
19 Apr Approximation algorithms -- Sec 35.1
16 24 Apr Approximation algorithms -- Sec 35.4
26 Apr Review for Final Exam
17 5 May Final Exam: Friday 3 pm - 5 pm

Grading Criteria:

The overall grade in this course will be based on your performance in (i) exams, (ii) class participation, and (iii) assignments, with weights as given in Table 1. Exams consist of a midterm and a final exam. Class participation consists of answering questions correctly in class, on the discussion board, and other positive contributions, discussed in greater detail at www.cs.fsu.edu/~asriniva/courses/ualg17/classparticipation.html. Assignments consist of roughly two programming projects and two written assignments.

You need to obtain 70% on either the first assignment or the third assignment to pass the course. If you meet this requirement, then your weighted average of the midterm and final exam should be at least 70% for you to get a course grade of C or better. If you meet this constraint too, then your final grade will be determined using Table 2.

    Table 1: Course Points
    Item Weight
    Class Participation 10
    Midterm 20
    Final Exam (comprehensive) 30
    Assignments 40
    Table 2: Letter Grades
    Points Grade
    92 - 100 A
    90 - 91 A-
    88 - 89 B+
    82 - 87 B
    80 - 81 B-
    78 - 79 C+
    72 - 77 C
    70 - 71 C-
    68 - 69 D+
    62 - 67 D
    60 - 61 D-
    0 - 59 F

NOTE: You must earn a weighted average of 70% in the exams to be awarded a course grade of C or better. For example, if you obtain a total of 78%, but an exam average of only 65%, then you will not get a C+. Instead, you will get a C-, because that is the highest grade for which you will be eligible without meeting the exam cutoff.

Programming assignment Assessment

You must understand your project work. If you are asked to explain your work, and you are unable to do so, you may be assigned a grade of zero.

Course Policies:

Attendance Policy

The university requires attendance in all classes, and it is also important to your learning. The attendance record may be provided to deans who request it. If your grade is just a little below the cutoff for a higher grade, then your attendance will be one of the factors that we consider in deciding whether to "bump" you up to the higher grade. Missing three or fewer lectures will be considered good attendance.

Excused absences include documented illness, deaths in the immediate family and other documented crises, call to active military duty or jury duty, religious holy days, and official University activities. Accommodations for these excused absences will be made and will do so in a way that does not penalize students who have a valid excuse. Consideration will also be given to students whose dependent children experience serious illness.

You should let me know of absences in advance, when possible, and submit your documentation. You should make up for any materials missed due to absences.

Missed Exam Policy

A missed exam will be recorded as a grade of zero. We will follow the university rules regarding missed final exams (see http://registrar.fsu.edu/dir_class/spring/exam_schedule.htm), for the midterm.

Late Assignment Policy

In order to enable us to provide timely solutions to assignments, we have the following policy regarding submission of late assignments.

Grade of 'I' Policy

The grade of 'I' will be assigned only under the following exceptional circumstances:

Professional Ethics

You will gain confidence in your ability to design and implement algorithms only when you write the code yourself. On the other hand, one does learn a lot through discussions with ones peers. In order to balance these two goals, I give below a list of things that you may, and may not, do.

Things you may not do: You should not copy code from others. This includes directly copying the files, replacing variable names in their code with different names, altering indentation, or making other modifications to others' code, and submitting it as your own. (You may also wish to note that many of the modifications that make codes look very different in a higher level language, yield lower level representations that are very close, and are easy to detect.) Furthermore, you should take steps to ensure that others cannot copy code from you -- in particular, you should have all permissions on assignment files and directories unset for others.

Things you may do: You may discuss specific problems related to use of the computer, useful utilities, and some good programming practices, with others. For example, you may ask others about how to submit your homework, or how to use the debugger or text editor. Honor Code: The Florida State University Academic Honor Policy outlines the University's expectations for the integrity of students' academic work, the procedures for resolving alleged violations of those expectations, and the rights and responsibilities of students and faculty members throughout the process. Students are responsible for reading the Academic Honor Policy and for living up to their pledge to be honest and truthful and [to] strive for personal and institutional integrity at Florida State University. (Florida State University Academic Honor Policy can be found at http://fda.fsu.edu/content/download/21140/136629/AHPFinal2014.pdf .)

Plagiarism:

Plagiarism is "representing another's work or any part thereof, be it published or unpublished, as ones own. For example, plagiarism includes failure to use quotation marks or other conventional markings around material quoted from any source" (Florida State University General Bulletin 1998-1999, p. 69). Failure to document material properly, that is, to indicate that the material came from another source, is also considered a form of plagiarism. Copying someone else's program, and turning it in as if it were your own work, is also considered plagiarism.

SYLLABUS CHANGE POLICY:

This syllabus is a guide for the course and is subject to change with advanced notice.

Last modified: 27 Mar 2017