Question
Worst case is the worst case time complexity of Prim’s
algorithm if adjacency matrix is used?Solution
The correct answer is C
Statement
Only a few Pink is Black
Some Black is White
All White is Red
Conclusion
I) Â Some Black is Red
Statements:
Each car is bus.
Only few bus are train.
No bus is cycle.
Conclusions:
I. At least some car are train.
Statements:Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â
Some roses are sunflowers.
Some sunflowers are lotus.
Conclusions:Â ...
Statements:
Some year are day.
Each year is month.
Only day are week.
Conclusions:
I. Some month are week.
II. Some month are year.
III. No year is week
Statements: Â Â Â Â Â Some news are telecasts.
All telecasts are satellites.
All satellites are emissions.
Conclusions:Â Â ...
Statements :Some files are folders.
Some folders are envelopes.
Some envelopes are letters.
Conclusions :I. Some letters are folder...
Statement:
Some Rugs are Mats
Only Mats is Curtain
Only a few Mats are Pillow
Some Pillow are not Towel.
C...
Statements:Â All covers are glasses.
Some caps are covers.
No cup is a cap.Â
Conclusions:Â Â Â Â Â Â I. Some cups are not...
Statements: All pens are papers.
Some papers are not books.
All books are pencils.
Conclusions...
Statements:
All pinks are blacks
Only a few blacks are greens
Some greens are not whites
Only a few whites are orange
...