Question
P and Q start a business with initial capital of 40000
and 60000 respectively. After 8 months, R joined them in the business with initial capital of “C”. If at the end of the year the profits were distributed in the ratio of 2:3:6. Find the initial capital “C” of R.Solution
Ratio of profit=> 40000Ă—12 : 60000Ă—12 : CĂ—4 => 120000 : 180000 : C Given ratio of profit : 2:3:6 By using above information we get: 120000/2 = C/6 => C = 360000
Which of the following is true for a min-heap?
The Master Theorem gives time complexity for recurrences of the form:
Which of the following sorting algorithms has the best worst-case time complexity?
In mobile computing, what is the main feature of pervasive computing?
In a Min-Heap, the root node is:
What is the time complexity of searching in a balanced binary search tree?
Which data structure is used for implementing recursive function calls?
Which file structure is best suited for handling large datasets and ensuring fast access in C, C++, Java, or Python?    Â
Which algorithm uses a “divide and conquer” strategy?
Which data structure is used in BFS (Breadth-First Search)?
Relevant for Exams:
