ICS 211: Introduction to Computer Science II, Fall 2003

Overview

Materials

WebCT

Schedule

Grading

Contact Info

FAQ

News (9/7)

 

Overview

Catalog Description:

Algorithms and their complexity, introduction to software engineering, recursion, data structures (linked lists, queues, stacks, trees), searching and sorting algorithms.

Goals

In this course, students will:

  • Learn standard data structures, including linked lists, stacks, queues, and trees.
  • Learn standard algorithms for sorting and searching
  • Be exposed to the basics of algorithm analysis and complexity.
  • Be exposed to software engineering techniques such as abstract data types and separation of definition and implementation.
  • Learn to use Java for more complex programming projects than those in ICS 111.
  • Discover that good programs can't be written without disciplined thinking or be thrown together at the last minute.

Prerequisites:

ICS 111 (with A or B); basic familiarity with Java.

Instructor:

Dr. Daniel Suthers

Meeting Times:

None! This is an online course. It will be taught using "Asynchronous Learning Network" (ALN) technology, specifically WebCT.

Note: we also have regular classroom based sections. Take the online version only if it solves a problem for you (such as conflict with work, or you do not live on O'ahu). Extra discipline is required to keep up in an online course!

Other Information:

Please read the rest of the pages accessible via the menu to the left. If you have questions after reviewing this site, email me.