in single linked list , each node contains data and address of next node. if middle of list the node is damaged/crashed then how to find where the link is failed and how to get the all the data which is stored after the crashed node?

0 Answers  

---

As written, each loop iteration in the LIST-SEARC′ procedure requires two tests: one for x ≠ nil[L] and one for key[x] ≠ k. Show how to eliminate the test for x ≠ nil[L] in each iteration.

1 Answers   Microsoft,

---

if your monitor is not started with your cpu, but start when monitor attach to another cpu then where is the problem?

2 Answers  

---

how strcpy usingrecursive function

0 Answers  

---

In HSE safety system, why the combination of H,S&E letters? and what is relationship?

2 Answers  

---

---

what is e-bum.

0 Answers   TCS,

---

can u perform addition of two octal numbers using java?

0 Answers  

---

Write the fetch cycle and execute cycle for following instructions:JMPNZ (jump to the given address if the accumulator not equal to zero) RET(return from a subroutine) ADB (add the contents of register B to the accumulator and save result in the accumulator).

0 Answers   IBM,

---

Why we use 4 - 20 ma?

0 Answers  

---

which is better php,asp.net,jsp? and why?

0 Answers  

---

What questions and tests would i be given to becme a service enginner 2 for a train company repairing trains

1 Answers  

---

Why do windmills never appear stationary?

0 Answers  

---