Interested to Buy Any Domain ? << Click Here >> for more details...
Write the Shortest path algorithm for a graph.
- 1 Answers
- 1862 Views
- Tech Mahindra, I also Faced
- E-Mail Answers
Answer Posted / ashmit tyagi
Dijkstra's Algorithm
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
what are the minimum requirements for statr testing?
Give a general algorithm for converting a m-array tree to a 2-ary tree.
Which algorithm inverts a complete resolution strategy?
A* algorithm is based on which search method?
What is iterative deepening depth-first search algorithm?
Sorting algorithms and time complexity of various algorithms.
Explain the Canny's Algorithm.
What is meant by a * search algorithm?
Which is the most straight forward approach for planning algorithms?
Consider the following algorithm, where the array A is indexed 1 through n: int add_them ( int n , int A[ ] ) { index i , j , k ; j = 0 ; for ( i = 1 ; i <= n ; i++) j = j + A[i] ; k = 1 ; for ( i = 1 ; i <= n ; i++) k = k + k ; return j + k ; } (a) If n = 5 and the array A contains 2, 5, 3, 7, and 8, what is returned? (b) What is the time complexity T(n) of the algorithm?
1. Consider the following algorithm: for ( i = 1 ; i <= 1 . 5 n ; i++) cout << i ; for ( i = n ; i >= 1 ; i - - ) cout << i ; (a) What is the output when n = 2, n = 4, and n = 6? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.
Draw a flowchart to find the average of four number?
Can you pick an algorithm. Write the psuedo-code for a parallel implementation?
What was deep learning, & how does it contrast with other machine learning algorithms?
Give an algorithm for the following problem. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is minimized. You may assume that n is a multiple of 2.
