CS 1581 Lab Exercise

Exercise 13.13

Suggestions

This exercise requires the rewriting of all advertised queue ADT interface procedures:

make-queue
empty-queue?
head
enqueue!
dequeue!

To write these, it is helpful to have the following non-advertised procedures:

(define start      ;accessor for start of queue
  (lambda (queue)
    (vector-ref queue 0)))
    
(define set-start! ;mutator for start of queue
  (lambda (queue node)
    (vector-set! queue 0 node)))

(define tail       ;accessor for tail of queue
  (lambda (queue)
    (vector-ref queue 1)))
    
(define set-tail!  ;mutator for tail of queue
  (lambda (queue node)
    (vector-set! queue 1 node)))

See more suggestions on next slide.

previous | index | next