spring04_pset8

# spring04_pset8 - Massachusetts Institute of Technology...

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

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

View Full Document

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Massachusetts Institute of Technology Department of Aeronautics and Astronautics Cambridge, MA 02139 16.03/16.04 Unified Engineering III, IV Spring 2004 Problem Set 8 Name: Due Date: 4/6/04 Time Spent (min) CP5_6 S4 S5 S6 S7 Study Time Announcements: Q4F is on Wednesday, 3/31 at 9am. CP5_6 The problems in this problem set cover lectures C5 and C6. 1. a. What are doubly linked lists? What is the record declaration for a node in a doubly linked list? (hint: see Feldman page 672, problem 8) b. Write an algorithm to insert a node into a sorted doubly linked list. Use a diagram to show the sequence of operations that have to be performed to carry out the insertion step. Hint: Extend the approach used in class/ notes for singly linked lists. c. Implement your algorithm as an Ada95 program. Assume: i. The data field consists of a single integer. Turn in a hard copy of your algorithm and code listing, and an electronic copy of your code. 2. What is the Shortest Path through the graph shown below using Dijkstra’s algorithm? Show all the steps in the computation of the shortest path. b e a c d 1 2 10 5 7 3 2 9 4 6 3. Define the following terms (as applied to graphs): a. Walk b. Path c. Eulerian Path d. Cycle e. Degree of a vertex Unified Engineering II Spring 2004 Problem S4 (Signals and Systems) Note: This problem is similar to one given a couple years ago. Please try to do this...
View Full Document

{[ snackBarMessage ]}

### Page1 / 7

spring04_pset8 - Massachusetts Institute of Technology...

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

View Full Document
Ask a homework question - tutors are online