# 1 - enqueue(a), enqueue (b), enqueue (c), dequeue, enqueue...

This preview shows pages 1–3. Sign up to view the full content.

CSCE 350: Data Structures and Algorithms Spring 2010 Homework 1 Solution 02/01/10 1. (0.6 points) Problem 1.1.5. 2. (0.6 points) Problem 1.2.5.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
3. (0.6 points) Problem 1.3.1 4. (0.6 points) Problem 1.4.3. Do part a. on the following sequence: push(a), push(b), push(c), pop, push(d), pop, pop, push(e) Then do part b. on the following sequence:
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: enqueue(a), enqueue (b), enqueue (c), dequeue, enqueue (d), dequeue, dequeue, enqueue (e) Remember that you have to show the stack and the queue after each operation! a. c d b b b b b e a a a a a a a a b. a ab abc bc bcd cd d de 5. (0.6 points) Problem 1.4.4. 6. (0.6 points) Problem 2.1.1. a, c, e. 7. (0.4 points) Problem 2.1.3....
View Full Document

## This note was uploaded on 06/11/2011 for the course CSCE 350 taught by Professor Staff during the Spring '08 term at Columbia SC.

### Page1 / 3

1 - enqueue(a), enqueue (b), enqueue (c), dequeue, enqueue...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online