CSCI13410-01 Course Syllabus

Introduction to Data Structures, Spring 2010

Name:              Dr.  Yao
Office:             Atkinson Hall 317
Telephone:      (478) 445-5483
Email:              jf.yao@gcsu.edu
URL:               http://abacus2.gcsu.edu/
Office Hours: 8:25a.m.-9:25a.m. and 10:50p.m.--12:20p.m. on Tu and Th
   -online office hours will be held at the same time
   -non-urgent emails will be answered at the same time

LOCATIONS
Classroom/Lab: A&S 143 

REQUIRED TEXT:

Starting Out with Java – from Control Structures through Data Structure, by Tony Gaddis and Godfrey Muganda, 2007.

PREREQUISITE: C or higher in CSCI 1302 

COURSE OBJECTIVES:

This course serves the objective of providing a thorough grounding in the basic mathematical and scientific principles of algorithms and advanced software design techniques.  This advanced treatment of programming principles, practices and experiences serves the objectives of preparation for more advance studies in Computer Science and preparation for professional programming employment.

EXPECTED COURSE OUTCOME:

* Students will become acquainted with the following data structures concept and
algorithm:

· Recursion

· Sorting

· Lists

· Stacks

· Queues

· Trees

· Heaps and Priority Queues

· Hash Table

* Students will be able to develop these data structures in Java, C++, or other
programming languages from scratch;

* Students will be able to analyze the complexity of a program Using O
notation.

ACADEMIC HONESTY:

The integrity of students is a critical component of the academic process.  All written work submitted in this course must be individual work unless the instructor assigns a team of students to work on an assignment.  Students must properly document all outside sources used for projects, programs, and homework. The submission of another’s work as one’s own is plagiarism, and will be dealt with using the procedures outlined on the Undergraduate Catalog.

EXAMS:

Percentage Date
            Exam I             25%                 Feb. 18, 2010
            Exam II            25%                 March 30, 2010
            Final Exam      25%                 May 4, 2010 (11:00-13:45, Tu.)
            Homework       25%   

FINAL GRADES:
      Grade              Percentage
        A                90% and up
        B                80% - 89.99%
        C                70% - 79.99%
        D                60% - 69.99%
        F                59.99% or less 

 COURSE POLICY:

· You are expected to read the textbook prior to and after class.

• Class and lab participation is essential in learning computer technology.  It is your responsibility to attend the class/lab in order to achieve good learning, therefore obtain a good grade.
• You must NOT miss any exam unless you have a verifiable written excuse.  An unexcused absence will result in a numerical grade of zero for that exam/seminar.  An excused absence from the seminar must be made up by a different exam. 
• The homework material will be included in the exams.  Therefore, doing the homework assignments by yourself is essential in obtaining a good score in an exam.
• Late assignments will be penalized 10% per day after the assignment due date.  Any assignment will not be accepted after 5 days late.
• Prior to mid-semester, you will receive feedback on your academic performance in this course.  Your overall grades are updated on a regular basis on the Web throughout the semester.  

TENTATIVE COURSE OUTLINE:

Week   1, 2       Recursion
Week   3, 4       Sorting, searching, and Algorithm Analysis
Week  5, 6        Generics, Collections
Week   7, 8       Array-Based Lists, Linked Lists
Week   9, 10     Stacks
Week   11, 12   Queues
Week  13, 14    Trees
Week   15, 16    Heap and Priority Queues

Week 17 Hash Table

Class end on May 3, 2010

Martin Luther King Day: Jan. 18,  2010

Spring Break (March 22-26)

March 8, 2010 is the last day to drop without academic penalty.

FIRE DRILL PROCEDURE

In the event of a fire alarm signal students will exit the building in a quick and orderly manner through the nearest hallway exit.  Learn the floor plan and exits of this building. Do not use elevators.  Crawl on the floor if you encounter heavy smoke. Assist disabled persons and others if possible without endangering your own life. Assemble for a head count on front lawn of main campus.