Register

NIELIT Scientific Assistant A 2020 November: 79

• recategorized by
633 views
1 votes
1 votes

Which of the following algorithms can be used to most efficiently find whether a cycle is present in a given graph?

  1. Prim’s Minimum Spanning Tree Algorithm
  2. Breadth First Search
  3. Depth First Search
  4. Kruskal’s Minimum Spanning Tree Algorithm
• recategorized by
User Avatar

1 Answer

0 votes
0 votes
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
2
gatecse asked Dec 9, 2020
671 views
NIELIT Scientific Assistant A 2020 November: 64
Which of the following is a correct time complexity to solve the $0/1$ knapsack problem where $n$ and $w$ represents the number of items and capacity of knapsack respectively? $O(n)$ $O(w)$ $O(nw)$ $O(n+w)$
Which of the following is a correct time complexity to solve the $0/1$ knapsack problem where $n$ and $w$ represents the number of items and capacity of knapsack respecti...
User Avatar
1 votes
1 votes
1 answer
3
gatecse asked Dec 9, 2020
412 views
NIELIT Scientific Assistant A 2020 November: 65
Finding the location of the element with a given value is : Traversal Search Sort None of the options
Finding the location of the element with a given value is :TraversalSearchSortNone of the options
User Avatar
1 votes
1 votes
2 answers
4
gatecse asked Dec 9, 2020
526 views
NIELIT Scientific Assistant A 2020 November: 83
Which of the following is correct recurrence for worst case of QuickSort? $T(n)=T(n-4)+T(n-2)+O(1)$ $T(n)=T(n-1)+T(0)+O(n)$ $T(n)=2T(n/2)+O(n)$ $T(n)=4T(n/2)+O(n)$
Which of the following is correct recurrence for worst case of QuickSort?$T(n)=T(n-4)+T(n-2)+O(1)$$T(n)=T(n-1)+T(0)+O(n)$$T(n)=2T(n/2)+O(n)$$T(n)=4T(n/2)+O(n)$
User Avatar
Link Copied!