University of Oregon
Go to Main Content
 

HELP | EXIT

Spring 2006

 

Transparent Image
Computer & Information Science (CIS)
120 Deschutes, 346-4408
College of Arts & Sciences
Course Data
  CIS 212   + Lab >4 0.00 cr.
Basic concepts and practices of computer science. Topics include algorithmic problem solving, levels of abstraction, object-oriented design and programming, software organization, analysis of algorithm and data structures.
Grading Options: Optional; see degree guide or catalog for degree requirements
Instructor: Chen Z Office:   139 Deschutes Hall
Phone:   (541) 346-0489
Course Materials
 
  CRN Avail Max Time Day Location Instructor Notes

+ Lab

34171 5 10 1000-1050 f See DuckWeb Chen Z  
 
Associated Sections

Lecture

34168 10 30 1300-1350 mwf See DuckWeb Atkins D !$
Academic Deadlines
Deadline     Last day to:
April 2:   Process a complete drop (100% refund, no W recorded)
April 9:   Drop this course (100% refund, no W recorded)
April 9:   Process a complete drop (90% refund, no W recorded)
April 10:   Drop this course (75% refund, no W recorded; after this date, W's are recorded)
April 10:   Process a complete drop (75% refund, no W recorded; after this date, W's are recorded)
April 12:   Add this course
April 12:   Last day to change to or from audit
April 16:   Withdraw from this course (75% refund, W recorded)
April 23:   Withdraw from this course (50% refund, W recorded)
April 30:   Withdraw from this course (25% refund, W recorded)
May 21:   Withdraw from this course (0% refund, W recorded)
Caution For information on last day to Change Grade Option or Change Variable credit: Dates & Deadlines calendar

You can't drop your last class using the "Add/Drop" menu in DuckWeb. Go to the “Completely Withdraw from Term/University” link to begin the complete withdrawal process. If you need assistance with a complete drop or a complete withdrawal, connect with an Academic Advisor. If you are attempting to completely withdraw after business hours, and have difficulty, please contact the an Academic Advisor the next business day.

Expanded Course Description
The course introduces the concept of abstract data type, and several abstract data types, e.g., lists, stacks, queues, binary trees, are defined and implemented. The course also covers basics of algorithm design and analysis. Recursive and iterative approaches to problem solving are covered, with means for developing and analyzing the resultant algorithms. Notions of correctness proof and Big-O time complexity are explored.
New Search

1

2

3

4

5

6

Hour Minute am/pm
Hour Minute am/pm
Mon Tue Wed Thu Fri Sat Sun
Transparent Image
Skip to top of page
Release: 8.11