Answer / Shaili Gaur

Linked lists are a fundamental data structure in computer science. Here's a brief overview of common types:
1. Singly Linked List: Each node contains one reference to the next node.n```n Node A ---> Node B ---> Node C ---> NULLn```
2. Doubly Linked List: Each node contains references to both the previous and next nodes.n```n Node A <-- Node B <-- Node C <-- NULLn```
3. Circular Linked List: The last node's next pointer points back to the first node, creating a loop.n```n Node A ---> Node B ---> Node C ---> Node An```

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

1 Answers  

---

what is software cycle?give a diagramatic representation

1 Answers  

---

A* algorithm is based on which search method?

1 Answers  

---

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---

Consider the following algorithm: j = 1 ; while ( j <= n/2) { i = 1 ; while ( i <= j ) { cout << j << i ; i++; } j++; } (a) What is the output when n = 6, n = 8, and n = 10? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

1 Answers  

---

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

1 Answers   Tech Mahindra,

---

What is the breadth-first search algorithm?

1 Answers  

---

How does deep learning contrast with other machine learning algorithms?

1 Answers  

---

What’s your favorite algorithm, & can you explain it into me in less than a minute?

1 Answers  

---

What are the disadvantages of depth-first search algorithm?

1 Answers  

---

Which algorithm is used for solving temporal probabilistic reasoning?

1 Answers  

---

Tell us why is naïve bayes machine learning algorithm naïve?

1 Answers  

---