Question
Running time T(n) where 'n' is the input size of the
recursive algorithm given as : T(n) = c + T(n-1), if n > 1 ; T(n) = d if n < 1. The order of the algorithm isSolution
The running time T(n) where ‘n' is the input size.
Three Statements are given followed by three conclusions numbered I, II and III. Assuming the statements to be true, even if they seem to be at varianc...
Statements:Â Â Â Â Â
No book is a pencil.
All books are boards.
All boards are dusters.
No eraser is a duster.
...
Statements: Some windows are door.
                         Some door are watch.
Conclusions: I. Some windows a...
Statements:
Every universe is earth.
All sun are moon.
No universe is sun.
Conclusions:
I. A few moon are universe.
II. No earth is moon.
Statements:
Only White are Grey
No Blue are Black
All Blue are White
Conclusion:
I. Some Blue can be Grey
Statements:
All tomatoes are potatoes.
All potatoes are onions.
Conclusions:
I. Some potatoes are tomatoes.
II. All tomatoes are onions.
Conclusions:
I. All Writers can be Novels.
II. Some Novels are not Magazines.
Statements:
Statements:
At least some blue are red.
Some black are pink.
Every red is black.
None pink is green.
Conclusions:
...- Statements:
All Flowers are Fruits.
Only a few Fruits are Vegetables.
No Vegetable is Carrot.
Conclusions:
I. All Flower... Statements:
Some Marble are Colour
Only a few Colour is Tile
Only Tile is Floor
Conclusions:
I. All Tile being Colour...
Relevant for Exams:
