CSCI3410-01, Summer 2010
Introduction to Data Structures
Course Syllabus

PROFESSOR INFORMATION
Name:              Dr.  Yao
Office:             Atkinson Hall 317
Telephone:      (478) 445-5483
Email:              jf.yao@gcsu.edu
URL:               http://abacus2.gcsu.edu
Office Hours: 12:45-2:00p.m., M-Th or by appointment


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:

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

    •     Recursion

    •     Sorting

    •     Lists

    •     Stacks

    •     Queues

    •     Trees

    •     Heaps and Priority Queues

    •     Hash Table

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

  3. 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
            Midterm Exam            30%                    July 1, 2010 (1p.m.,  Th)
            Final Exam                  40%                   August 4, 2010 (1p.m., Wed)
            Homework                  30%   

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:

  1. You are expected to read the textbook everyday.

  2. 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.

  3. 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.

  4. Your grades are updated on a regular basis on the WebCT throughout the term.  

 TENTATIVE COURSE OUTLINES
Week   1        Recursion
Week   2        Sorting, searching, and Algorithm Analysis
Week   3        Generics
Week   4        Array-Based Lists
Week   5        Linked Lists
Week   6        Stacks, Queues
Week   7        Trees
Week   8        Priority Queues (Class ended Aug. 4, 2010)

July 8, 2010 IS THE LAST DAY TO WITHDRAW A COURSE WITHOUT ACADEMIC PENALTY.