Latest other Aptitude Question SOLUTION: Consider three classes A, B and C with 20, 30 and 50 students respectively. The averages score in maths of students in class B is 16 more than that of those in class C and the aver

Follow Quotesrain

other Question Papers:

other Select Another Category Numerical Ability Select Another Topic

Maths Puzzle

other Question Topics

Category (101)

General Ability (7)

General Knowledge(3)

HR Interview (3)

Interview(2)

Logical Reasoning (29)

Numerical Ability (189)

Programming (5)

Verbal Ability (8)

Advertisements

Previous Question: Sum of first 25 terms in AP is 525, sum of the next 25 terms is 725, what is the common difference? Next Question: All algorithms discussed in this chapter for determining the minimum spanning tree have one thing in common: they start building the tree from the beginning and they add new edges to the structure, which eventually becomes such a tree. However, we can go in the opposite direction and build this tree by successively removing edges to break cycles in the graph until no circuit is left. In this way, the graph turns into the tree. The edges chosen for removal should be the edges of maximum weight among those that can break any cycle in the tree (for example, Dijkstra’s method). This algorithm somewhat resembles the Kruskal method, but because it works in the opposite direction, it can be called a Kruskal method à rebours. Use this approach to find the minimum spanning tree for the graph of distances between at least a dozen cities

(#M40040935) OTHER Numerical Ability question solve Keep an EYE

Consider three classes A, B and C with 20, 30 and 50 students respectively. The averages score in maths of students in class B is 16 more than that of those in class C and the average score of those in class A is 2 more than the overall average of scores in A, B and C. What is the difference between average of class C and class A?: Asked In other Harsh Poddar (9 years ago); Unsolved Read Solution (1); Is this Puzzle helpful? (28) (22) Submit Your Solution

Advertisements

Read Solution (1) :

Please Login to Read Solution.

Previous Question: Sum of first 25 terms in AP is 525, sum of the next 25 terms is 725, what is the common difference? Next Question: All algorithms discussed in this chapter for determining the minimum spanning tree have one thing in common: they start building the tree from the beginning and they add new edges to the structure, which eventually becomes such a tree. However, we can go in the opposite direction and build this tree by successively removing edges to break cycles in the graph until no circuit is left. In this way, the graph turns into the tree. The edges chosen for removal should be the edges of maximum weight among those that can break any cycle in the tree (for example, Dijkstra’s method). This algorithm somewhat resembles the Kruskal method, but because it works in the opposite direction, it can be called a Kruskal method à rebours. Use this approach to find the minimum spanning tree for the graph of distances between at least a dozen cities

Login
Register

Sponsored Links

Advertisements

Challenger of the Day

no image

Dimple

India

Punjab

Time: 00:01:33

Points

19

Maths Quotes

Maths is just like a lantern that enlightens your life with numbers

nishant

MATHEMATICS IS LIKE TRUE LOVE- A SIMPLE IDEA BUT CAN GET COMPLICATED...

Ricky Gakhar

Placed User Comments

M4Math helped me a lot.

Vipul Chavan 3 years ago

Thanks m4 maths for helping to get placed in several companies.
I must recommend this website for placement preparations.

yash mittal 4 years ago

2511K+Registerd user
1758K+Engineers
753K+MBA Asprirant
3K+Enginnering College
250+Company Exam
150K+Interview Questions

All rights are reserved to @m4maths.com