AP_S11_PM-Programming_(Algorithms)

Q11_1_1: LIST ALL the key values w/c maybe Inserted in key-value '46'.

Q11_1_2-A: Program for the INSERT Operation fill in the blank_'A' function insert (n,t) n ≠ nil.

Q11_1_2-B: Program for the INSERT Operation fill in the blank_'B' create new node store pointer to node 'k'.

Q11_1_3_1: Sample Binary Search Tree. Which node to be the substitute node if key-value '50' is deleted.

Q11_1_3_2-C: Program for the DELETE Operation fill in the blank_'C' if (x -> left).

Q11_1_3_2-D: Program for the DELETE Operation fill in the blank_'D' elseif (x -> right).

Q11_1_3_2-E: Program for the DELETE Operation fill in the blank_'E' else (e ⬅ x -> right) while().

Q11_1_4-F: Program for the DELETE Operation fill in the blank_'F' d levels (root not being the 1st level).

Q11_1_4-G: Program for the DELETE Operation fill in the blank_'G' Number of nodes n and "NUMBER of levels d".

Q11_1_4-H: Program for the DELETE Operation fill in the blank_'H' for searching substitute note is tested.

Q11_2_1-A: String Search Program (simple approach) fill in the blank_'A' the logic to get the "last" value when the 1st m chars of the text consisting of n chars.

Q11_2_1-B: String Search Program (simple approach) fill in the blank_'B' while(j <= m) loop for string comparison chars of TEXT are stored in array T[i] chars of Pattern are stored in array P[j].

Q11_2_1-C: String Search Program (simple approach) fill in the blank_'C' i <- 1 j <- j + 1.

Q11_2_1-2: How many comparisons necessary in the WORST CASE SCENARIO (m).

Q11_2_1-3: Sequence of TWELVE A's What are the 1st char, 2nd char, and 3rd char (separate the letter answers by comma (,) & space).

Q11_2_2_1-D: String Search Program (simple approach) fill in the blank_'D' the value of 'i' calculate shift width d(x).

Q11_2_2_1-E: String Search Program (simple approach) fill in the blank_'E' while(j > 0) loop for string comparison chars of TEXT are stored in array T[i].

Q11_2_2_1-F: String Search Program (simple approach) fill in the blank_'F' what is else i <- i + i - 1 when the value of i is 'm' & j is 1.

Q11_2_2-2: How many char comparisons are necessary when none of the char in the pattern is found.

Q11_3_1: Sample Merge Sort Process.

Q11_3_2: Algorithm for Merge Function fill in the blank_'A' Merge Repeat while i < first.length or j < second.length first.length.

Q11_3_2: Algorithm for Merge Function fill in the blank_'B' i < first j is greater than or equal to blank_A.

Q11_3_2: Algorithm for Merge Function fill in the blank_'C' i < first.length A[i+j].

Q11_3_2: Algorithm for Merge Function fill in the blank_'D' j < second.length A[i+j].

Q11_3_3: Algorithm for Merge_Sort Function fill in the blank_'E' A.length greater than what? when: i <- i + 1 & j <- j + 1.

Q11_3_3: Algorithm for Merge_Sort Function fill in the blank_'F' m is A.length ÷ 2 n is what (when fraction is truncated)?.

Q11_3_3: Algorithm for Merge_Sort Function fill in the blank_'G' merge_sort(A) second[i] is what (when 'm' is the new first)?.

Q11_3_3: Algorithm for Merge_Sort Function fill in the blank_'H' merge_sort(A) new first(m).

Q11_3_3: Algorithm for Merge_Sort Function fill in the blank_'I' merge_sort(A) new second(n).

Q11_3_4: Appropriate evaluation of 'Merge_Sort'.

Q11_4_1-1: Data Format foreign & domestic businesses.

Q11_4_1-2: Data Format small data size.

Q11_4_1-2: Data Format RosettaNet standard Data must be conformant.

Q11_4_2-1: XML Document Data.

Q11_4_2-2: XML Document Data.

Q11_4_2-3: XML Document Data.

Q11_4_3: Fill in the blank_A.

Q11_4_3: Fill in the blank_B.

Q11_4_3: Fill in the blank_C.

Q11_4_3: Fill in the blank_D.