CS 195:  Data Representation, Storage
Management, and C Programming

Laboratory Exercises

Computer Science 195 includes regular laboratory exercises, as described below:
Laboratory
Exercise Title and Description
Lab. 1 Elementary C Programming:
  • Basic Syntax
  • Compiling and Running
  • Lab. 2 Integer Representation:
  • Unions: differently typed views of the same storage location
  • Printing Bit Representations
  • Lab. 3 Floating Point Representation:
  • Printing Bit Representations
  • Experimentation
  • Lab. 4 Functions in C:
  • Parameter Passing
  • Examples and Experiments
  • Lab. 5 Singly-Linked Lists:
  • Printing the Last Element on a List
  • Couting the Items on a List
  • Lab. 6 More Singly-Linked Lists:
  • Moving Items to the Front of a List
  • Printing List Elements in Reverse Order
  • Lab. 7 Doubly-Linked Lists:
  • Locating an Item on a List
  • Moving Items to the Front of a List
  • Lab. 8 Queues
  • Circular Lists
  • Implementing a Queue
  • Lab. 9 Binary Search Trees
  • Implementation in C
  • Tree Construction
  • Searching
  • Lab. 10 Tree Operations:
  • Counting Nodes
  • Printing Leaves
  • Computing Sums
  • Lab. 11 Files in C:
  • Standard Library Functions
  • File Processing
  • Lab. 12 Concurrency in C:
  • Creating new processes: fork
  • Process communication with pipe
  • Lab. 13 More on the Compiling Process:
  • Separate Compilation
  • Automating the Compiling Process: make and Makefile
  • Lab. 14 Multi-Processing Application
  • Shared Memory Connecting Two Processes
  • Counting Sentences and Words in a File

  • This document is available on the World Wide Web as

    http://www.cs.grinnell.edu/~walker/courses/195.fa01/lab-index.html
    

    created August 26, 2001
    last revised December 10, 2001
    Valid HTML 3.2!
    For more information, please contact Henry M. Walker at walker@cs.grinnell.edu.