Every One is saying that Documentation is very very importent in Tester's Life.Could any one explain with proper examples..?

1979

---

What is an example of a machine learning project you're proud of?

856

---

Which is a benefit of search advertising with google adwords?

70

---

What is the difference between postgresql and sql?

535

---

How many sorting techniques are there?

631

---

How do you make a table on microsoft word 2007?

421

---

What are the 3 main stages involved in testing with qtp?

790

---

I'm generating a pulse of 3V with frequency 80Hz (12.5ms time period) and pulse duration 0.125ms and feeding it to a transformer since i want the pulse to get amplified around 60V. At the output amplification s happening but the pulse is changed to a spike, can you tell me what could be the reason? (an ordinary transformer 220V-12V stepdown transformer is reverse connected ie. now it is 12V-220V stepup and voltage amplification happens)

1654

---

What do you understand by coding schemes?

894

---

What is flume and kafka?

63

---

How to design the NGR Resistance

1796

---

At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf. All these packets are to be loaded on cars. The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E,………….]. Each Car will load the packet with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come. No matter how deep in the shelf any packet ‘B’ is, all of the ‘B’ packets will be displaced before the ‘C’ car arrives. For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX]. If any shelf is used once, then it could be used again only if it is vacant. Packets from the initial shelf could be unloaded from top only. Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.

1943

---

What is the importance of lifecycle and validatable interface in hibernate?

320

---

How to capitalize the first letter of each word in a string (python)?

666

---

How to check a variable is array or not in php?

723

---