Content: In this course we will explore advanced algorithms and data structures that are used to develop effective solutions to a variety of problems. We will also analyze the complexity of many algorithms. Common design techniques will be introduced, and NP-completeness will be discussed.
Course Outcomes: Students who complete the course will be able to
Communication: I will post relevant course information on the course web page as well as send announcements via email. It is your responsibility to be aware of this information, as well as all information presented in class, of course.
Course web page: http://www.radford.edu/nokie/classes/360. Please remember that I frequently revise my notes pages and they can change at any time, including just before, during, and just after class. As the semester progresses, the notes from last semester will be updated for this semester.
Evaluation:
Per cent | Activity |
50 | Programs, Homework, and In-class Activities |
30 | Two in-class tests |
20 | Comprehensive final exam: 10:15 a.m. - 12:15 p.m., Wednesday, May 6, 2020 |
100 | Total |
Assignments: Assignments for the course will include both homework problem sets to solve and programs to write.
It is important that you do the problem sets; figuring out the answers to problems is the best way to learn the material. Also, the problems are worth 50% of your grade. If there are 10 sets, then each will, obviously, be worth about half of a letter grade for the course!
Proble sets will be graded on correctnesss and completeness, as well as neatness, clarity, and grammar.
Please use the course grades page to verify that I recorded your grades correctly, and keep all graded work until after you have received your course grade.
Turning in work and Late Policy: Unless otherwise specified, homework problems will be due in class, on paper. Neither late homeworks nor electronic homework submissions will be accepted.
Each student can turn in an homework assignment late, but you must ask for permission.
Unless otherwise specified, programs will be submitted using the submit command, not D2L. Late programs will have a 10% per day penalty.
Attendance: Attendance is not required; however you will find it much easier to learn the material and to make a good grade if you come to class. If you get behind in this course you are likely to find it extremely difficult to catch up! Learning the concepts takes time, and you must work on the course material regularly for it to sink in. You will not be allowed to make up any in-class activities that you miss. Good attendance and class participation can be to your benefit if you have a borderline final grade!
Laptops: Laptops and other electronic devices are not to be used during class unless you have permission. Research shows that multitasking hurts learning, and it is also distracting to others. Experience shows that electronic distractions typically lower a student's performance in the course by a full letter grade.
Exams: In exceptional circumstances I may give permission to miss an exam if you contact me in advance. In such cases the weight of your final will be increased. Otherwise a missed exam will be worth 0 points.
Honor Code: This class will be conducted in strict observance of the Honor Code. Please refer to your Student Handbook for details of expected behavior.
Of course, all work that you submit for grading must be your
own. In relation to your assignments, this means that you
may discuss with
other students what a problem means; however, you may not discuss how
to do the assignment with anyone except me. Similarly, you
may discuss
with others what various definitions and theorems mean, but you must
not let anyone write your assignments for you and you must not use
someone else's solutions as a basis
for your own.
If you receive any help of any kind on an assignment (such as using material that you find in a book or on the web), then the work that you turn in must give credit for that help.
Please be aware that if I suspect that you have violated the Honor Code, then I will not hesitate to file charges with the Dean of Students Office.