General Class Information Class Handouts Scores Assignments Reference Materials Miscellaneous

CSc 127B Introduction to Computer Science Spring 2005 Lester I. McCann, Ph.D.

The University of Arizona College of Science Department of Computer Science McCann's Home Page

General Class Information

• Class Announcements:
  • Timely class info can now be found in the Csc127b discussion list on the U of A Caucus System. Here is a page of "getting started" directions (in PDF). Then, click here to access the Caucus system.
  • The original class announcements page (retained as a piece of history...)
  
  
• Class syllabus (general course information)
• Section Leader lab hours (times when you can get help)
• Lecture Topic Outline
  
  
• Program Documentation and Development:
  • Programming Style Requirements (summary; PDF)
  • Toward Developing Good Programming Style (many documents here)
  
  
• Step-by-Step Guides from Head Section Leader Dave! Thanks, Dave!
  • Web-based Turnin (PDF) -- an alternative for those of you wanting to submit from places other than the Harvill lab
  • How to Learn Your CSID (PDF) -- useful so that you can find your scores on the score sheets that will be made available after each exam has been graded.
  • Installing Java 5.0 (PDF) -- how to install the latest version of Java. We'll be using new features of Java in this class, so if you use Java at home, you'll want to be sure that you've got the most recent version.
  • Installing TextPad (PDF) -- how to install TextPad and the UA student license.
  • Passing Command-Line Arguments to Java Via TextPad (PDF) -- some of my example programs are written to accept data from the command line, which is great if you're running them from a command window. But, you can convince TextPad to accept them, too, and it's not hard.

Class Handouts       (In case you lost your copy, or missed class)

• Class syllabus
• Programming Style Requirements (summary; PDF) --- see also "Program Documentation and Development", above

Current Student Scores       (Updated after each exam has been graded)

• Final Course Grades (Last Updated: 2005/05/13)

Assignments

• Program #1: The CalendarDate Class (PDF)
  • Instructor's solution (a one-time offer so that you can look at the documentation)
• Program #2: Two's Complement (PDF)
• Program #3: wc (Word Count) (PDF)
  • The example data files used in the handout: prog2a.dat   prog2b.dat
  • Some more examples. (Note that \n = newline, ^=space, [ and ] are not part of the content.)
    • unix-a.dat Content: [\na\nb\n\nc\n]   Output from wc: 5 lines, 3 words, 8 bytes
    • unix-b.dat Content: [w1^w3^^\n^^123\n##^**\n]   Output from wc: 3 lines, 5 words, 20 bytes
• Program #4: Polynomials (PDF)
• Program #5: Polynomials Revisited (PDF)
• Program #6: Maze Escape (PDF)
  • The sample maze (prog6sample.dat) (text)
• Program #7: Boundary-Fill (PDF)
  • The sample image (prog7sample.dat) (text)
• Program #8: Recursion (PDF)
• Program #9: Binary Search on a Binary File (PDF)
• Program #10: Reasoning vs. Reality (PDF)

Reference Materials       (Pointers to additional information)

• Text: The text for this semester is Data Abstraction and Problem Solving with Java, Walls and Mirrors, Updated ed., by Carrano and Prichard. It is available from our campus bookstore, or order your copy from one of these fine on-line retailers (I don't get anything for listing them here):
  • Barnes and Noble (www.bn.com)
  • Amazon.com
• Web Sites: Some web sites that you'll probably find to be useful references.
  • Java API Specification (Std. Ed. 5.0)
• Example Programs: Sample code (.java files) that I use in class to demonstrate concepts. All examples should work with Java 5 (aka Java 1.5).
  • Exceptions: TBn01.java
  • Files: TCn01.java   TCn02.java   TCn03.java   TCn04.java   TCn05.java   TCn06.java   TCn07.java
    Also, here are some versions of the corresponding TC* examples that use the Java 1.5 Scanner class for text file input:
    TSn02.java   TSn03.java   TSn07.java
  • Class Reuse: T02n01.java   T02n02.java   T02n03.java   T02n04.java
  • Interfaces, Assertions, etc.: T03n01.java   T03n02.java   T03n03.java   T03n04.java
  • Lists: T04n01.java  
  • Array-based Lists: T05n01.java  
  • Array-based Stacks: No examples.
  • Array-based Queues: No examples.
  • Generics: TGn01.java   TGn02.java   TGn03.java   TGn04.java  
  • Linked Lists: T08n01.java  
  • LL-based Stacks and Queues: No examples.
  • Searching Within Lists: No examples.
  • Recursion: T11n01.java   T11n02.java   T11n03.java   T11n04.java   T11n05.java  
  • Algorithm Analysis: No examples.
  • Sorting: No examples.
  • General and Binary Trees: No examples.
  • Binary Search Trees: T13n01.java   T13n02.java   T13n03.java   T13n04.java  
  • Iterators: TIn01.java   TIn02.java   TIn03.java   TIn04.java  

Miscellaneous       (A place for stuff that doesn't really fit anywhere else)

---

Return to Ol' Doc McCann's Home Page

If you have any comments about this page, drop me a note at mccannl@acm.org