How many elements are there in a two-dimensional array declared as int a[5][4], and how much memory does it occupy if an int takes 4 bytes?
Arrays
Original Khojo Papers practice question — not from a past board paper.
int lo = 0, hi = n - 1, pos = -1; while (lo <= hi) { int mid = (lo + hi) / 2; if (a[mid] == v) { pos = mid; break; } else if (a[mid] < v) lo = mid + 1; else hi = mid - 1; }
No citable source has been recorded for this record. Treat it as practice material, not as fact.
The array must be sorted, or the halving logic is invalid.
From the same topic and chapter, at a similar level.
How many elements are there in a two-dimensional array declared as int a[5][4], and how much memory does it occupy if an int takes 4 bytes?
Arrays
State the worst-case number of comparisons made by bubble sort on an array of n elements.
Arrays
Write a Java program segment to sort a one-dimensional integer array in ascending order using selection sort.
Arrays
Write a Java program segment to find the sum of the elements of the left diagonal of a square matrix a of size n.
Arrays
Write a Java program segment to print the transpose of a square matrix a of size n.
Arrays
State and verify the absorption law X + X·Y = X using a truth table.
Boolean Algebra