|CSC 161||Grinnell College||Fall, 2011|
|Imperative Problem Solving and Data Structures|
This module applies previous concepts (e.g., pointers, linked lists) to widely-used dynamic data structures. Topics covered include:
|Tuesday, November 15||Abstract data types|
Module 6: Stacks, queues
|Wednesday, November 16||Abstract data types|
Module 6: Stacks
|Reading on stacks
Four implementations of stacks:
|lab on stacks|
|Friday, November 18||Abstract data types|
Module 6: Queues
|Reading on queues||lab on queues||Tuesday, November 29|
|Monday, November 21||Program management: header files||Reading on program management||lab on program management||Monday, December 5|
|Tuesday, November 22||Hour Test 3|
|Wednesday, November 23||Bash scripts|
Module 6: Using Bash scripts for testing
|Reading on Bash Scripts||lab on bash scripts||Wednesday, December 7|
|Monday, November 28||Project||Photos with Stacks and Queues||Due: Friday, November 2|
Working in pairs, students should develop a program that creates a stack and a queue, makes the robot take (at least) fifteen pictures, and show the pictures in a "movie" and a "reverse movie", using the stack and queue implementations.
Use a Makefile for compiling your program(s); the Makefile should compile the stack implementation, queue implementation and movie operations separately.
You should also consider possible mistakes that may arise with your implementation, develop a test plan, and run tests to ensure you code is working correctly.
Each image should be different from the previous. Possible ways to implement this would be to have the robot move between taking pictures, or have someone/something move in front of the robot.
This project will be worth 25 points, based on the following rubric:
This document is available on the World Wide Web as
created created 19 July 2011 by Henry M. Walker
last full revision 17 August 2011 by Henry M. Walker, Dilan Ustek, and April O'Neill
revised 2 September 2011 by Henry M. Walker
revised 18 November 2011 by Henry M. Walker
|For more information, please contact Henry M. Walker at firstname.lastname@example.org.|