Graph Based Problems

120 Posts  ·  2,010 Users
About this group
Answer the questions on the basis of the information given below. The following graph depicts the number of seats won by different political parties in India across four regions North, West, South and East in the year 2007 against the respec...
Page 1 of 12

Can any one share any link where I can study on graph based question.... I always stuck in graph based question..... how do I prepare!

8 comments
undefined
Write a comment
Write a comment...

how to draw the graph of  lx+yl=4 ??

1 comment
undefined
Write a comment
Write a comment...

Will be really an awesome experience to share his expertise.

fifa 14 ultimate team coins

undefined
Write a comment
Write a comment...

y = x - 4; 0 ≤ x

9 - 3/2x , 5 ≤ x ≤ 10

Also determine the maximum and minimum values of y in the given domain.
Its from time material. now the solution says the max value occurs at x = 5 so pl explain this .



undefined
Write a comment
Write a comment...

Pl provide the logic and answer of the following question

F(x)=x for x≤2
=2 for 2≤ 3
=x - 1 for 3

I have already seen its graph but let me know how to solve the equations.😁
1 comment
undefined
Write a comment
Write a comment...

FORE school not accepting CMAT SCORE?

undefined
Write a comment
Write a comment...

@Clark-Kent

Answer the questions on the basis of the information given below.



The following graph depicts the number of seats won by different political parties in India across four regions North, West, South and East in the year 2007 against the respective amount of expenditure (in lakhs) allotted to these parties. On the vertical axis, the number of seats won by any party in excess of 40 is indicated in the



brackets. However, for these observations the value in the horizontal axis is correctly depicted. No party other than those mentioned here contested the elections.



Which of the following pairs of political parties won equal number of seats across the country?

1) OCP, DPI (M)



2) CSP, DPI



3) DPI, TP



4) CSP, SJD Skip





2) CSP , DPI

D.v.shah
undefined
Write a comment
Write a comment...

How many questions comes from DI in section 1.?

4 comments
undefined
Write a comment
Write a comment...

PFA the screenshot of the graph based problem. Please answer the question below :

If the capacity at P2 is fully utilized then what is the least possible cost incurred per day in (Rs Thousand) in transporting all the coffee beans to the processing unit
Every champion was once a contender that refused to give up
1 comment
undefined
Write a comment
Write a comment...

Please save the attachment and answer the following question:


Total number of 1 mark question attempted correctly by Ramesh
Every champion was once a contender that refused to give up
16 comments
undefined
Write a comment
Write a comment...