Question
15 rotten bananas are accidentally mixed with 115 good
ones. It is not possible to just look at a banana and tell whether or not it is rotten. One banana is taken out at random from this lot. Determine the probability that the banana is taken out is a good one.Solution
Numbers of bananas = Numbers of rotten bananas + Numbers of good bananas ∴ Total number of bananas = 115 + 15 = 130 bananas P(E) = (Number of favourable outcomes) / (Total number of outcomes) P(picking a good banana) = 115/130 = 23/26
Recursive problems are implemented by
Which of the following is considered the strongest type of encryption method in modern cyber security practices?   Â
Which algorithm finds the longest common subsequence (LCS) of two sequences?
What is the worst-case time complexity of QuickSort with a random pivot for sorting n distinct elements?
Which traversal method in a binary search tree retrieves nodes in sorted order?
Dynamic Programming is preferred over recursion when:
Which sorting algorithm is not stable by default?
Which file structure is best suited for handling large datasets and ensuring fast access in C, C++, Java, or Python?    Â
In Database Management Systems, what is the primary purpose of normalization?
Which architecture allows multiple processors to share memory and work simultaneously?     Â
