CSCI13410-01 Course Syllabus

Introduction to Data Structures, Fall 2007

Professor Info	Locations	Required Textbook	Prerequisite	Course Objectives
Course Description	Course_Policy	Final_grades	Exams	Exam Schedule
Course Outlines	Last Day To Drop	Academic_Honesty	Fire_Drill

PROFESSOR INFORMATION
Name:             Dr. Yao
Office:             Atkinson Hall 317
Telephone:      (478) 445-5483
Email:              jf.yao@gcsu.edu
URL:               http://abacus.gcsu.edu
Office Hours:  T, H -- 8:20AM-9:20AM, 10:50AM-12:20PM; or by appointments (Back to top)

LOCATIONS
Classroom: Atk 310 (2:00pm-3:15pm T, H) (Back to top)

REQUIRED TEXT:

Data Abstraction and problem Solving with Java – Walls and Mirrors, by Frank M. Carrano and Janet J. Prichard, Second Edition, 2005. (Back to top)

PREREQUISITE: C or higher in CSCI 1302 (Back to top)

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 CS and preparation for professional programming employment. (Back to top)

COURSE DESCRIPTION :
Introduction to data structures and their applications. Topics include references, linked structures, stacks, queues, lists, graphs, trees, heap, hashed tables, introductory algorithm analysis, and recursion. Basic implementation and algorithms for manipulating these structures in the context of typical problems are covered. (Back to top)

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. You may view the honor code online. (Back to top)

EXAMS:
Percentage Date
Exam I  20% Sept. 20, 2007
Exam II   20% Oct. 25, 2007
Final Exam 30% Dec. 11, 2007 (2:00pm-4:45pm, Tu.)
Homework  30%

        ------------------------------------------------------------
         Total                 100%

Note: The Homework material will be included in the exams. (Back to top)

FINAL GRADES:
      Grade              Percentage
        A                90% and up
        B                80% - 89.999%
        C                70% - 79.999%
        D                60% - 69.999%
        F                59.999% or less (Back to top)

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 a test unless you have a verifiable excuse.  An unexcused absence from a test will result in a numerical grade of zero for that test.
• 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 three day 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. (Back to top)

TENTATIVE COURSE OUTLINE:

Week 1 Chapter 2: Principles of Programming and Software Engineering

Week 2 Chapter 3: Recursion: The Mirrors

Week 3  Chapter 3: Recursion: The Mirrors

Week 3 Chapter 4: Data Abstraction: The Walls

Labor Day Holiday (Sept. 3-4, 2007)

Week  4 Chapter 5: Linked Lists

Week 5 Chapter 6: Recursion as a Problem-Solving Techniques

Week 6 Chapter 7: Stacks

Week 7 Chapter 7, 8: Stacks, Queues
Week 8 Chapter 8: Queues

Week 9 Chapter 9: Advanced Java Topics

Week 10 Chapter10: Algorithm Efficiency, Sorting

Week 11 Chapter10: Algorithm Efficiency, Sorting

Thanksgiving Holidays (Nov. 21-23, 2007)

Week  12 Chapter 11: Trees

Week  13 Chapter 11: Trees

Week  14 Chapter 12: Tables, Heap and Priority Queues
Week 15 Chapter 12: Tables, Heap and Priority Queues

Week 16 Chapter 13: Advanced Implementations of Tables 

Week 17 Chapter 13: Advanced Implementations of Tables (Class ended Dec. 4, 2007)(Back to top)

OCTOBER 10, 2007 IS THE LAST DAY TO WITHDRAW A COURSE WITHOUT ACADEMIC PENALTY. (Back to top)

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. (Back to top)