Answer / Gyanendra Prakash Chaudhary

Depth-First Search can take an excessive amount of memory in situations with many nodes connected by a small number of edges, as it explores deep into the graph before backtracking. It also doesn't guarantee finding the shortest path between two nodes.

What is breath-first search algorithm?

1 Answers  

---

Can you pick an algorithm. Write the psuedo-code for a parallel implementation?

1 Answers  

---

Which algorithm in ‘unification and lifting’ takes two sentences and returns a unifier?

1 Answers  

---

What is the most efficient way to store 1 million phone numbers memory-wise?

1 Answers   Aspire, Infogain,

---

Explain the Canny's Algorithm.

1 Answers   Adobe,

---

What is bidirectional search algorithm?

1 Answers  

---

Give a general algorithm for converting a m-array tree to a 2-ary tree.

1 Answers   Tech Mahindra,

---

Define Routing Algorithm?

1 Answers   Maveric,

---

What is the depth-first search algorithm?

1 Answers  

---

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.

1 Answers  

---

What is the iterative deepening depth-first search algorithm?

1 Answers  

---

What is depth-first search algorithm?

1 Answers  

---