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
- 5842 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 |
Explain linear linked implementation of Stack and Queue?
What are the advantages and disadvantages of linked list over array?
Which sorting algorithms are in place?
Is arraylist better than array?
What is numeric array?
What are the drawbacks of array implementation of queue?
Can we modify final arraylist?
What is time complexity of hashmap?
What is the best time complexity of bubble sort?
What is a threaded binary tree? Explain its operation with example?
State the advantages of using postfix notations?
What is homogeneous array?
Windows 
