Quiz1Su98 - Conceptually do this: Before: Front1 Front2...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Quiz #1 EEL4851 Summer 1998 On stacks, queues and general list Part 1. Given the array implementation of single-linked list (next but no prev fields), suppose there are 2 linked list in this array besides the empty list ( three total ). The lists are start with front1 and front2. Write a segment of code to concatenate the two lists. That is, connect the front of the second list to the end of the first list.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Conceptually do this: Before: Front1 Front2 After: Front1 Front2 Part 2. Given the following array, what will the array look like after concatenating the two lists? Before: 1 2 3 4 5 6 7 Fred smith Bill A. Linda Evans Eliza smith Barbara W. 4 1-1 5 2-1 3 7 front1 empty_front front2-1 6 After ?: 1 2 3 4 5 6 7 Fred smith Bill A. Linda Evans Eliza smith Barbara W. front1 empty_front front2...
View Full Document

This document was uploaded on 01/14/2012.

Page1 / 2

Quiz1Su98 - Conceptually do this: Before: Front1 Front2...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online