Class Photo | Course Home | Homework | Programming | Schedule & Lecture Notes | Submit

Saint Louis University

Computer Science 220
Computer Science II
Michael Goldwasser

Fall 2004

Dept. of Math & Computer Science

Homework Assignment 05

List and Sequence ADTs

Contents:


Overview

Topic: List and Sequence ADT
Related Reading: Ch. 5.2-5.3 and 5.5-5.6
Due: 9:30am Tuesday, 2 November 2004

Please make sure you adhere to the policies on academic integrity.


Practice Problems


Problems to be Submitted (20 points)

  1. (7 points)

    Reinforcement Exercise R-5.10 on page 246 of the text.

  2. (8 points)

    Creativity Exercise C-5.11 on page 248 of the text.

  3. (5 points)

    Using the List interface methods, describe a recursive function for determining if a list L of n integer objects contains a given integer k. Your function should not contain any loops. How much space does your function use in addition to the space used for L?


Extra Credit

  1. (2 points)

    Creativity Exercise C-5.12 of the text.
    (Hint available through Hint Server on textbook's website).


CSA-220, Fall 2004
Michael Goldwasser
goldwamh at our university domain.

Last modified: Tuesday, 26 October 2004
301 Moved Permanently

Moved Permanently

The document has moved here.


Apache/2.4.57 (Red Hat Enterprise Linux) OpenSSL/3.0.7 PHP/8.0.30 Server at cs.slu.edu Port 443