Interested to Buy Any Domain ? << Click Here >> for more details...
Q # 1 : in which graph algorithm do we start finding
vertices that should be first in the topological order and
then apploy the fact that every vertex must come before its
successors in the topolgical order.
- 3 Answers
- 6027 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
To my understanding of the question it sounds like
topological sort
| Is This Answer Correct ? | 3 Yes | 2 No |
What is map keyset?
Are the expressions arr and &arr same for an array of integers?
What is b tree in data structure?
Differentiate between list and set.
When will you sort an array of pointers to list elements, rather than sorting the elements themselves?
In which data structure, elements can be added or removed at either end, but not in the middle?
42 Answers Infosys, NIC, TTA, Wipro,
Name a few tree data structure application.
What is the bucket size, when the overlapping and collision occur at same time?
Write the stack overflow condition.
Can a tree be empty?
Who invented merge sort?
What is the difference between arraylist and array?
Windows 
