Course Number:
Course Name:
Course Credits:
Schedule:
210
Data Structures and Algorithms I
4
Fall, Spring, sometimes Summer
Syllabus Date:
Prepared By:
August 28, 2006
Zhong-Hui Duan
Prerequisites:
or equivalent
Completion of 3450:208 and 3460:209 with a grade of C- or better
Text: Big Java, 2nd ed. Cay Horstmann, Wiley 2006, ISBN: 978-0-471-69703-9
Bulletin Description: Interfaces, inheritance and polymorphism, graphic user interfaces,
event and exception handing, files and streams, elementary data structures and associated
algorithms. Topics include lists, stacks, queues, and sorting methods.
Detailed Description: A continuation of the study of programming theory and practice
studied in Introduction to Computer Science. Some elementary data structures, their
implementation and basic searching and sorting algorithms are introduced. There is also
a laboratory component to this course.
Course Goals: To reinforce problem solving and programming skills through
programming in Java and to introduce basic data structures and algorithms that are
needed for more advanced courses.
Topics:
 Interfaces and Polymorphism
 Event Handling
 Inheritance
 Graphical User Interfaces
 Exception Handling
 Streams
 Recursion
 Searching and Sorting
 Linked Lists, Stacks and Queues
Computer Usage: Students use a Java IDE to develop programs and work through lab
exercises and programming assignments.
References:
 http://www.horstmann.com/bigjava.html
 Java How to Program, 7th ed., Harvey & Paul Deitel & Associates, Prentice Hall,
2007, I ISBN-13: 978-0-132-22220-4, http://www.prenhall.com/deitel/