Info iconThis preview shows page 1. Sign up to view the full content.

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

Unformatted text preview: Discrete Computational Structures, CSE 2353, Fall 2009 Quiz # 2, 100 Points 1. [50] Construct the truth table for each of the following statement formulas: a) (~p V q) r b) (p Λ ~q) ~q 2. [50] Show the status of the array L = {5, 1, 4, 7, 3, 2} at the end of each inner loop iteration of the Bubble Sort algorithm. Bubble Sort algorithm works as follows: procedure bubblesort (L, n) begin for i := 1 to n – 1 do //outer loop for j := 1 to n – i do // inner loop if L[j] > L[j + 1] then swap (L[j], L[j+1]) end...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online