Question
In school B, if 24 sweets are given to 1 boy and 16
sweets given to 1 girl, then find the Total sweets given to all boys and girls Read the data carefully and answer the following questions: The number of boys in school A is 40% more than the number of teachers in the same school. The number of girls in school A is 84 which is equal to the average of number of teachers and boys in the same school. Ratio of number of girls in school A and B is 7:9 respectively and the sum of number of girls in school B and C is 140. School C has two more boys than school A and 11 more teachers than school B. Ratio of number of teachers and boys in school B is 13:11 respectively while sum of number of teachers and boys in school B is 168.Solution
Let the number of teachers in school A = 5x Then the number of boys in school A = 7x According to the question, => 5x + 7x = 84 × 2 => x = 14 So, number of teachers in school A = 5 × 14 = 70 Number of boys in school A = 7 × 14 = 98 Number of girls in school B = 84 × (9/7) = 108 Number of girls in school C = 140 – 108 = 32 Number of boys in school C = 98 + 2 = 100 Number of teachers in school B = 168 × (13/24) = 91 Number of boys in school B = 168 – 91 = 77 Number of teachers in school C = 91 + 11 = 102 Number of boys in school C = 98 + 2 = 100 
Sweets given to all boys = 24 × 77 = 1848 Sweets given to all girls = 16 × 108 = 1728 Total sweets given to all boys and girls = 1848 + 1728 = 3576
Which algorithm is used for computing Max-Flow in a network?
Given the following code snippet, which operation is performed on the binary tree to produce the output: 4, 2, 5, 1, 3 ?
class Node {Â Â Â Â Â in...Which data structure is most suitable for implementing a priority queue with logarithmic time complexity for insertion and deletion?
Tarjan’s algorithm is used to find:
In C++, which access specifier makes members accessible only from within the class itself and from friend functions/classes?
What is the worst-case time complexity for inserting an element into a hash table that uses separate chaining for collision resolution?
In a graph, what is the maximum number of edges in a simple undirected graph with 'n' vertices?
Time complexity of heap sort is:
Which of the following is true about triggers in a relational database?
What is the primary purpose of an abstract class?
Relevant for Exams:
