Spring2016.CSCI230CourseSyllabus History

Hide minor edits - Show changes to markup

Changed line 101 from:
  • You are expected to take good notes during lecture.
  • You are expected to take good notes during lecture. Through your notes you will contribute to the shared student lecture notes.
Added lines 108-121:

(:cellnr valign=top align=right style='padding:5px;':) Academic Integrity: (:cell style='padding:5px;':)

  • Lying, cheating, attempted cheating, and plagiarism are violations of our Honor Code that, when identified, are investigated. Each incident will be examined to determine the degree of deception involved.
  • Cases of suspected academic dishonesty will be reported directly by the instructor and/or others having knowledge of the incident to the Dean of Students. A student found responsible by the Honor Board for academic dishonesty will receive a XF in the course, indicating failure of the course due to academic dishonesty. This grade will appear on the student’s transcript for two years after which the student may petition for the X to be expunged. The student may also be placed on disciplinary probation, suspended (temporary removal) or expelled (permanent removal) from the College by the Honor Board.
  • Students should be aware that unauthorized collaboration--working together without permission-- is a form of cheating. Unless the instructor specifies that students can work together on an assignment, quiz and/or test, no collaboration during the completion of the assignment is permitted. Other forms of cheating include possessing or using an unauthorized study aid (which could include accessing information via a cell phone or computer), copying from others’ exams, fabricating data, and giving unauthorized assistance.
  • You should read the complete Honor Code and all related processes in the Student Handbook.

(:cellnr valign=top align=right style='padding:5px;':) Electronics Devices: (:cell style='padding:5px;':)

  • The use of electronic devices, both stand-alone and network capable, will play an increasingly important roll in teaching and learning at the College of Charleston, including their use in our classrooms. Just be respectful about unnecessary distractions to you and to others seated around you.
  • If you take notes on your computer, you will occasionally be asked to post them onto the shared student lecture notes.\\
Added lines 1-121:
College of CharlestonJan 6, 2016

CSCI 230 – Data Structures and Algorithms

Course Syllabus

(:table border=0 width=100%:)

(:cell width=20% align=right style='padding:5px;':) Professor: (:cell width=80% style='padding:5px;':) Dr. Bill Manaris
(:cellnr valign=top align=right style='padding:5px;':) Office: (:cell style='padding:5px;':) Room: 326 Harbor Walk East Building
Phone: (95)3-8159
E-mail: manarisb@cofc.edu
Web: http://www.cs.cofc.edu/~manaris/
(:cellnr valign=top align=right style='padding:5px;':) Office Hours: (:cell style='padding:5px;':) MWF 10-11am
Other hours available by appointment.

(:cellnr valign=top align=right style='padding:5px;':) Course Description: (:cell style='padding:5px;':) This course reviews and develops the abstract data type as mathematical models. Data structures and algorithms are developed as the objects and operations of abstract data types. Topics include lists, stacks, queues, trees, graphs, searching, sorting, and analysis of the efficiency of algorithms. Lectures three hours per week.

(:cellnr valign=top align=right style='padding:5px;':) Prerequisites: (:cell style='padding:5px;':)

  • CSCI 221 with a grade of C- or better
  • MATH 207

(:cellnr valign=top align=right style='padding:5px;':) Tentative Outline: (:cell style='padding:5px;':) Recursion, algorithm analysis, abstract data types, lists, stacks, queues, trees, hashing, priority queues, sorting, graph algorithms, advanced data structures (e.g., suffix trees).

The above outline is tentative; some topics may be added, others subtracted, as interest suggests and time permits.

(:cellnr valign=top align=right style='padding:5px;':) Textbook: (:cell style='padding:5px;':) Mark Weiss, Data Structures and Algorithm Analysis in Java, 3rd ed., Pearson, 2012. (:cellnr valign=top align=right style='padding:5px;':) References: (:cell style='padding:5px;':)

Additional reading materials will provided via handouts and the class website.
(:cellnr valign=top align=right style='padding:5px;':) Learning Outcomes: (:cell style='padding:5px;':)

  • Analyze algorithms using asymptotic analysis.
  • Distinguish between the notions of an abstract data type and physical data structure.
  • Apply stacks, queues, lists, trees, binary search trees, balanced binary trees, hash tables, heaps and priority queues, and graph ADTs in computer solutions.
  • Implement ADTs and appropriate operations on ADTs.
  • Be able to identify the advantages and disadvantages of the use of specific data structures in specific problem situations.
  • Distinguish between various sorting algorithms in terms of how they work and their efficiency in specific problem situations.
  • Apply written communication skills to produce one or more reports on one to two pages on topics of data structures and algorithms.

(:cellnr valign=top align=right style='padding:5px;':) Grading: (:cell style='padding:5px;':) To receive a passing grade for the course, you must average a passing grade on each of the following: assignments, tests, and final exam.

Scale: A: 90-100; B: 80-89; C: 70-79; D: 60-69; F: <60. The grades of B+/–, C+/–, and D+/– may be given at the professor's discretion.

You need to earn a C- or better to advance (to take courses having 230 as prerequisite).

Final Grade Computation: Assignments (4-6) 30%, Tests (2) 40%, Comprehensive Final Exam 20%, and Class Participation 10%.

(:cellnr valign=top align=right style='padding:5px;':) Honor Code: (:cell style='padding:5px;':)

  • You must do your assignments alone (or with your teammates, for group assignments).
  • You are not allowed to discuss assignments and possible solutions with any person other than the instructor (or with your teammates, for group assignments). Any violation of these rules is an honor offense.
  • On assignments you will be asked to identify the person(s) you received help from, if any.
  • Also see the College of Charleston Student Handbook, especially sections on The Honor Code (p. 11), and Student Code of Conduct (p. 12). There is other useful information there.

(:cellnr valign=top align=right style='padding:5px;':) Test Policies: (:cell style='padding:5px;':)

  • Attendance at tests is mandatory. You must complete tests with no discussion or sharing of information with other students.
  • Calculators, computers, cell phones, etc. may not be used during a test, unless otherwise directed.

(:cellnr valign=top align=right style='padding:5px;':) Classroom Policies: (:cell style='padding:5px;':)

  • You are expected to attend all classes, and be in class on-time. If you accumulate 4 or more absences, you may be given a 'WA' grade.
    • If you miss class, you must fill out Absence Memo Request Form from the Absence Memo Office.
    • If you miss class, you are responsible for announcements made in class, assignment due dates, etc.
  • You are expected to take good notes during lecture.
  • You are expected to participate in class with questions and invited discussion.
  • You are expected to do your own work during class activities, exercises, and assignments.
  • You should turn off all electronic devices (e.g., cell phones, etc.).
  • You must use the computers only as directed (e.g., no checking email, or playing games) during class.
  • Any student who feels he or she may need an accommodation based on the impact of a disability should contact me individually to discuss your specific needs. Also, please contact the Center for Disability Services for additional help.
  • In summary, you should contribute positively to the classroom learning experience, and respect your classmates right to learn (see College of Charleston Student Handbook, section on Classroom Code of Conduct (p. 58)).

(:cellnr valign=top align=right style='padding:5px;':) Assignment Policies: (:cell style='padding:5px;':)

  • Assignment grades will be based on design, style, and correctness of result.
  • Assignments may NOT be submitted via email.
  • Submission instructions will be provided for each assignment. Assignments that are submitted any other way will NOT be graded.

(:cellnr valign=top align=right style='padding:5px;':) Late Policy: (:cell style='padding:5px;':)

  • You have four "late" days for the whole semester. You may use these days as you wish for assignment submission. If you use them up, no late assignments will be accepted.
  • If you submit everything on time (i.e., use no late days), you will earn an additional 2.5 bonus points on your course grade.