1. Identify the comparisons and exchanges made to sort the following array using the selection exchange sort technique. Note: you may not need all columns.
|
Original
Array
|
1st
Pass
|
2nd
Pass
|
3rd
Pass
|
4th
Pass
|
5th
Pass
|
6th
Pass
|
7th
Pass
|
8th
Pass
|
9th
Pass
|
|
12
|
|
|
|
|
|
|
|
|
|
|
63
|
|
|
|
|
|
|
|
|
|
|
45
|
|
|
|
|
|
|
|
|
|
|
5
|
|
|
|
|
|
|
|
|
|
|
18
|
|
|
|
|
|
|
|
|
|
|
40
|
|
|
|
|
|
|
|
|
|
|
32
|
|
|
|
|
|
|
|
|
|
2. Use the table below to show the values in a stack after executing each of the following instructions. What is the value of the stack pointer after all of the executions have been completed? Note: There is only 1 stack. You are showing the changes in the stack values as each number is pushed onto or popped from the stack.
Push 12; Push 45; Push 47; Push 21; Pop X; Push 83; Pop X; Pop X; Push 32
3. Use the table below to show the values in a queue after executing each of the following instructions. Note: There is only 1 queue. You are showing the changes in the queue values as each number is added to or deleted from the queue.
Add 12; Add 45; Add 47; Add 21; Delete X; Add 83; Delete X; Delete X; Add 32