Course CSC 220 – Data Structure
Description Data Structure is an essential and integral
component of software design and development, that is part of software
engineering practice. We typically design and model information (data
abstraction) & logic (algorithm) representing solutions necessary for
software applications.
Our main objective is to enhance students' proficiency in the areas of
software design and development, data structures, and
software engineering.
In this class, we will study a principle of the design, implementation and run-time analysis of important data structures and algorithms. We will cover but not limit to important data structures such as sorted arrays, linked lists, stacks, queues, and trees. An approach based on abstract data types, standard design notation/representation such as UML will be emphasized. Programming assignment will be in Java.
Prerequisites CSC 120 with C and better
Time & Room M-W-F 2:00pm-3:15pm, Nethken 105
Course URL www.latech.edu/~box/dss2004.htm
Instructor Dr. Chokchai (Box) Leangsuksun
Office Nethken 237
Office Hours M-W-F 8am-10:00am. T-Th 10:00pm-12:00pm or by an appointment
Phone 257-3291
e-mail box@latech.edu
.NET passport leangsuksun@hotmail.com (IM, VOIP SIP phone)
Grader TBA
Texts Data Structure and Algorithm in Java, 2nd Edition
by Robert LaForce
Publisher: Sam Pub Co; ISBN: 0672324539; (December 2002).
In addition to materials from the above main textbook, I’ll provide more references (URL or some books) when we discuss on some particular topics in the programming projects.
Any of your favorite JAVA books
Reference: Scott Kendall, Unified Process Explained, The, 1/e, ISBN-0-201-74204-7
Grading Policy 5-8 Programming Assignments 10%
Homework assignments 10%
Class Attendance 5%
Term Project 30%
Midterm Examination 15% April 16, 2004
Final Examination (comp.) 30% Friday, May 14, 2004
Peer Evaluation form and calculation formula
Presentations will be graded using this grade sheet