Mike Cottrell College of Business
Computer Science
CSCI 3200 – Data Structures and Analysis
Summer 2015 – Section A
GENERAL INFORMATION:
Mr. Justin Turner
Hansford Hall 118
Justin.Turner@ung.edu
706-867-2843
Office Hours – Available by appointment
TEXT AND OTHER MATERIALS
Required Text
Data Structures and Algorithm Analysis in Java (3rd edition)
Mark Allen Weiss, Pearson/Addison Wesley, 2012
ISBN 10: 0-13-257627-9
ISBN 13: 9780-13-257627-7
Required Software
JDK (Java Development Kit), version 7 or newer:
http://www.oracle.com/technetwork/java/javase/downloads/
Other Resources
eLearning/D2L: https://ung.view.usg.edu/
COURSE DESCRIPTION
The course covers the structure of data and algorithms. Topics covered include sorting, searching,
updating, hashing techniques, advanced tree structures and a more formal and in-depth treatment of the
topics included in CSCI 2700. An introduction to complexity analysis of algorithms and complexity
classes as well as parallel and distributed algorithms will also be covered.
Prerequisite: Grade of C or better in CSCI 1302 (Comp Sci 2) and MATH 2510 (Discrete)
COURSE OBJECTIVES (EXPECTED OUTCOMES)
This course should provide you with the basic methods and tools for survival as a designer or
programmer of application software. You have to learn about abstract data types, such as lists, queues,
and graphs, and their implementation in an object-oriented programming language. You will study
algorithms that let you manipulate data types. Finally, we will analyze these algorithms, and try to
categorize them with regard to their performance (complexity).
METHODS OF INSTRUCTION
Lecture, discussion, demonstration and development of Java code, lab projects, and student research.
EVALUATION METHODS & COURSE GRADING
Grading Scale
Item Weight
90% and Above A
Final Exam 20%
80% and Above B
Test 20%
70% and Above C
Assignments 60%
60% and Above D
Total 100%
Below 60% F
TENTATIVE COURSE CALENDAR
Important Dates: http://ung.edu/academics/academic-calendar.php
Week Topic
Chapters
Fall 2013 Dates
1
Math and Java Review
Ch 1
Jun 1, 3
2
Intro to Complexity Analysis
Ch 2
Jun 8, 10
3
Lists, Stacks, and Queues
Ch 3
Jun 15, 17
4
Trees
Ch 4
Jun 22, 24
5
Hashing
Ch 5
Jun 29, Jul 1
6
Priority Queues
Ch 6
Jul 6, 8
7
Sorting
Ch 7
Jul 13, 15
8
Graphs
Ch 9
Jul 20, 24
9
Applications
Ch 10
July 27
F
Final Exam
Wed, Jul 29th 2:10pm – 4:10pm
SUPPLEMENTAL SYLLABUS
Students are expected to refer to the Supplemental Syllabus for the following information:
1. Academic Exchange
2. Academic Integrity Policy
3. Academic Success Plan Program
4. Class Evaluations
5. Course Grades and Withdrawal Process
6. Disruptive Behavior Policy
7. Inclement Weather
8. Smoking Policy
9. Students with Disabilities