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
- 6161 Views
- I also Faced
- E-Mail Answers
Answer Posted / achintya singhal
BFS
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Can you change size of array once created?
An array having 100 elements have numbers from 1 to 99 randomly out of which any number is repeated. Find the repeated number in minimum time and space complexity.
What exactly is data?
What is 1d array?
What is complete binary tree and almost complete binary tree?
What is hashing technique?
How do you find the height of a binary tree?
Is any implicit arguments are passed to a function when it is called?
On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.
Why do we use trees in data structures?
Does arraylist contain duplicates?
Can the double-checked locking fail on a single processor system?
Differentiate between the singly linked list and doubly linked list.
What is the maximum size of array?
Explain the expression trees?
