Question
Find the fourth proportion of (k + 1) , (k + 3) and (2k
+ 2). (Note: 'k' is the smallest two-digit prime number.)Solution
'k' = 11
k + 1 = 11 + 1 = 12
k + 3 = 11 + 3 = 14
2k + 2 = 2 x 11 + 2 = 24
Let the fourth proportion be 'm'.
12:14::24:m
So, 12 x m = 14 x 24
Or, 'm' = 28
In dynamic programming, overlapping subproblems and _________ are key properties.
Which of the following is true about the time complexity of Merge Sort?
Which of the following algorithms is best suited for finding the shortest path in a weighted graph where some edges may have negative weights but no neg...
Which sorting algorithm divides the array into halves recursively?
The minimum number of edges in a connected graph with n vertices is:
Which file structure is best suited for handling large datasets and ensuring fast access in C, C++, Java, or Python?
Which algorithm uses a priority queue to repeatedly pick the next closest vertex?
Dynamic Programming is useful when a problem has:
Which of the following is NOT a divide-and-conquer algorithm?
In dynamic programming, which principle ensures correctness by solving overlapping subproblems and storing results?
Relevant for Exams:
