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
- 6019 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
What is the logic to reverse the array?
Briefly explain recursive algorithm 50 how do you search for a target key in a linked list?
Is radix sort faster than quicksort?
What is concurrentlinkeddeque?
Is hashmap a collection?
Define circular list?
Suppose in an integer array, there is 1 to 100 number, out of one is duplicate, how to find?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
What are the basic operations of stack?
Explain multiply linked list in short.
What are the advantages of linked list over an array?
What is 1d array?
Is array a collection?
Differentiate between list and set.
Can arraylist be resized?
