<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>DoctorInterview</title>
	<atom:link href="http://doctorinterview.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://doctorinterview.com</link>
	<description>Online Interview Training Site</description>
	<lastBuildDate>Sun, 30 Aug 2009 16:47:48 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.4</generator>
		<item>
		<title>Experienced</title>
		<link>http://doctorinterview.com/resumecv/experienced/</link>
		<comments>http://doctorinterview.com/resumecv/experienced/#comments</comments>
		<pubDate>Sun, 30 Aug 2009 16:46:07 +0000</pubDate>
		<dc:creator>Bishal-Nath</dc:creator>
				<category><![CDATA[Resume/CV]]></category>

		<guid isPermaLink="false">http://doctorinterview.com/index.html/?p=368</guid>
		<description><![CDATA[Some one said First impression is last impression. So resume is the first impression as it is the first point of initiating an interview. I have done a research of designing the best resume and I have shared the format. You need to add your information in necessary places and edited accordingly. 1. This resume [...]]]></description>
			<content:encoded><![CDATA[<h3><span style="color: #808080;">Some one said First impression is last impression. So resume is the first impression as it is the first point of initiating an interview. I have done a research of designing the best resume and I have shared the format. You need to add your information in necessary places and edited accordingly.</span></h3>
<p><span id="more-368"></span><br />
<script type="text/javascript"><!--
google_ad_client = "pub-0722392184555888";
/* 728x90, horizontal, animated, big */
google_ad_slot = "1066237574";
google_ad_width = 728;
google_ad_height = 90;
//-->
</script>
<script type="text/javascript"
src="http://pagead2.googlesyndication.com/pagead/show_ads.js">
</script></p>
<h3><a href="http://www.doctorinterview.com/RESUME/EX1.doc"><span style="color: #0000ff;">1. This resume can cover till 1.2 years of experience. Its bit detail resume and most of the people might not like it because of its length. But believe me it helped people to crack the best companies in IT industry</span></a></h3>
<p><script type="text/javascript"><!--
google_ad_client = "pub-0722392184555888";
/* 728x90, horizontal, animated, big */
google_ad_slot = "1066237574";
google_ad_width = 728;
google_ad_height = 90;
//-->
</script>
<script type="text/javascript"
src="http://pagead2.googlesyndication.com/pagead/show_ads.js">
</script></p>
<h3><span style="color: #0000ff;"> </span></h3>
<h3><a href="http://www.doctorinterview.com/RESUME/EX2.doc"><span style="color: #0000ff;">2. Second resume can also cover till 1.2 years of experience but it has been aimed to present additional Research Experience also.</span></a></h3>
<h3><span style="color: #0000ff;"> </span></h3>
<h3><a href="http://www.doctorinterview.com/RESUME/EX3.doc"><span style="color: #0000ff;">2. Third resume is for more experienced people with professional look and it suggested by management colleges people</span></a></h3>
<h3> </h3>
<p> <script type="text/javascript"><!--
google_ad_client = "pub-0722392184555888";
/* 728x90, horizontal, animated, big */
google_ad_slot = "1066237574";
google_ad_width = 728;
google_ad_height = 90;
//-->
</script>
<script type="text/javascript"
src="http://pagead2.googlesyndication.com/pagead/show_ads.js">
</script></p>
]]></content:encoded>
			<wfw:commentRss>http://doctorinterview.com/resumecv/experienced/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>New Graduate</title>
		<link>http://doctorinterview.com/resumecv/new-graduate/</link>
		<comments>http://doctorinterview.com/resumecv/new-graduate/#comments</comments>
		<pubDate>Sun, 30 Aug 2009 16:31:37 +0000</pubDate>
		<dc:creator>Bishal-Nath</dc:creator>
				<category><![CDATA[Resume/CV]]></category>

		<guid isPermaLink="false">http://doctorinterview.com/index.html/?p=367</guid>
		<description><![CDATA[Some one said First impression is last impression. So resume is the first impression as it is the first point of initiating an interview. I have done a research of designing the best resume and I have shared the format. You need to add your information in necessary places and edited accordingly. 1. This resume [...]]]></description>
			<content:encoded><![CDATA[<h3><span style="color: #808080;">Some one said First impression is last impression. So resume is the first impression as it is the first point of initiating an interview. I have done a research of designing the best resume and I have shared the format. You need to add your information in necessary places and edited accordingly.</span></h3>
<p><span id="more-367"></span><br />
<!--adsense--></p>
<h3><a href="http://www.doctorinterview.com/RESUME/NG1.doc"><span style="color: #0000ff;">1. This resume is basic resume mainly for campus interview. The marks can be put sem/year wise and project can be put in detal.</span></a></h3>
<h3><span style="color: #0000ff;"> </span></h3>
<p><!--adsense--></p>
<h3><a href="http://www.doctorinterview.com/RESUME/NG2.doc"><span style="color: #0000ff;">2. Second resume has professional looks and can be used both for campus interview and interview after passing from the college.</span></a></h3>
]]></content:encoded>
			<wfw:commentRss>http://doctorinterview.com/resumecv/new-graduate/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Pirates Problem</title>
		<link>http://doctorinterview.com/puzzle/pirates-problem/</link>
		<comments>http://doctorinterview.com/puzzle/pirates-problem/#comments</comments>
		<pubDate>Sun, 30 Aug 2009 16:01:16 +0000</pubDate>
		<dc:creator>Bishal-Nath</dc:creator>
				<category><![CDATA[Puzzle]]></category>

		<guid isPermaLink="false">http://doctorinterview.com/index.html/?p=366</guid>
		<description><![CDATA[There are five super intelligent pirates who are dividing the 100 platinum coins among themselves. But there are some rules. The senior most pirates will propose the distribution and all other people will vote for the decision. If at least 50% people vote for the decision then all will go by the decision otherwise they [...]]]></description>
			<content:encoded><![CDATA[<p><span id="more-366"></span><br />
<!--adsense--></p>
<h3><strong><span style="color: #0000ff;">There are five super intelligent pirates who are dividing the 100 platinum coins among themselves. But there are some rules. The senior most pirates will propose the distribution and all other people will vote for the decision. If at least 50% people vote for the decision then all will go by the decision otherwise they will kill the senior pirate who has proposed the decision and the next senior pirate will propose again and the process will go on until they divide everything among themselves. How will the senior pirate decide the distribution to survive? </span></strong></h3>
<h3><span style="color: #808080;"> </span></h3>
<h3><span style="color: #808080;"> </span></h3>
<h3><span style="color: #808080;"> </span></h3>
<p><!--adsense--></p>
<h3><span style="color: #808080;">If the senior pirate wants to survive then he needs 50% vote that means three people should vote. One is himself so he needs two more people to vote for himself. 4th pirate will never vote as he needs only one vote which he can get by sharing the coins with another pirate.</span></h3>
<h3><span style="color: #808080;">Lets backtrack the problem.<br />
If there is only one pirate then he eill get everything for himself<br />
If there are two pirates then senior will take 100% coins as he needs only one vote that he will do for himself<br />
If there are three pirates, then senior pirate knows that he needs to convince one more pirate. That one pirate can be the last pirate and he can keep 99 coins with himself and give one to third pirate to get his vote. Third pirate knows that nothing is better than 1 coin and vote for 3rd senior pirate<br />
If there are four pirates, then senior pirate knows the situation if he dies. And senior pirates need one more people to vote for his decision. So he can give two coins to pirate 4 as 2 is better than 1. But again if 4th senior dies then pirate 3 will not get anything so he will better give 1 coin to 3rd pirate and get the vote as 1 is better than nothing</span></h3>
<h3><span style="color: #808080;">So now you have a pattern for dividing the coins</span></h3>
<p><!--adsense--></p>
<h3><span style="color: #808080;">Pirate 1<br />
100</p>
<p>1     2<br />
0    100</span></h3>
<h3><span style="color: #808080;">1       2       3<br />
1       0       99</span></h3>
<h3><span style="color: #808080;"> </span></h3>
<h3><span style="color: #808080;">1       2       3         4<br />
0       1       0         99</span></h3>
<h3><span style="color: #808080;">1       2       3         4<br />
0       1       0         99</span></h3>
<h3><span style="color: #808080;">1       2       3         4       5<br />
1       0       1         0       98 </span></h3>
<h3><span style="color: #808080;"> </span></h3>
]]></content:encoded>
			<wfw:commentRss>http://doctorinterview.com/puzzle/pirates-problem/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Gold Chain of 7 segments</title>
		<link>http://doctorinterview.com/puzzle/gold-chain-of-7-segments/</link>
		<comments>http://doctorinterview.com/puzzle/gold-chain-of-7-segments/#comments</comments>
		<pubDate>Sun, 30 Aug 2009 15:57:50 +0000</pubDate>
		<dc:creator>Bishal-Nath</dc:creator>
				<category><![CDATA[Puzzle]]></category>

		<guid isPermaLink="false">http://doctorinterview.com/index.html/?p=365</guid>
		<description><![CDATA[A man has a gold chain of 7 segments and he needs to give one segment per day to his servant at the end of each day for 7 days. How many times will you divide the gold chain?       Day1: Cut one segment and give it to the servant Day2: Take back [...]]]></description>
			<content:encoded><![CDATA[<p><span id="more-365"></span><br />
<!--adsense--></p>
<h3><span style="color: #0000ff;">A man has a gold chain of 7 segments and he needs to give one segment per day to his servant at the end of each day for 7 days. How many times will you divide the gold chain?</span></h3>
<h3><span style="color: #808080;"> </span></h3>
<h3><span style="color: #808080;"> </span></h3>
<h3><span style="color: #808080;"> </span></h3>
<p><!--adsense--></p>
<h3><span style="color: #808080;">Day1: Cut one segment and give it to the servant<br />
Day2: Take back the old segment and give the part having 2 segments<br />
Day3: Give him the old 1 segment<br />
Day4: Take back everything and give him a part having 4 segment<br />
Day5: Give him the one segment part<br />
Day6:  Take back the 1 segment and give him 2 part having 2 segment<br />
Day7: Give him the 1 segment </span></h3>
<p><!--adsense--></p>
]]></content:encoded>
			<wfw:commentRss>http://doctorinterview.com/puzzle/gold-chain-of-7-segments/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Round Manhole</title>
		<link>http://doctorinterview.com/puzzle/round-manhole/</link>
		<comments>http://doctorinterview.com/puzzle/round-manhole/#comments</comments>
		<pubDate>Sun, 30 Aug 2009 15:53:40 +0000</pubDate>
		<dc:creator>Bishal-Nath</dc:creator>
				<category><![CDATA[Puzzle]]></category>

		<guid isPermaLink="false">http://doctorinterview.com/index.html/?p=364</guid>
		<description><![CDATA[Why manhole is round in shape       A round manhole cover cannot fall through its circular opening, whereas a square manhole cover may fall in if it were inserted diagonally in the aperture. The bearing surfaces of manhole frames and covers are machined to assure flatness and prevent them from becoming dislodged by [...]]]></description>
			<content:encoded><![CDATA[<p><span id="more-364"></span><br />
<!--adsense--></p>
<h3><span style="color: #0000ff;">Why manhole is round in shape</span></h3>
<h3><span style="color: #808080;"> </span></h3>
<h3><span style="color: #808080;"> </span></h3>
<h3><span style="color: #808080;"> </span></h3>
<p><!--adsense--></p>
<h3><span style="color: #808080;">A round manhole cover cannot fall through its circular opening, whereas a square manhole cover may fall in if it were inserted diagonally in the aperture. The bearing surfaces of manhole frames and covers are machined to assure flatness and prevent them from becoming dislodged by traffic. Round castings are much easier to machine using horizontal boring mills. Circular covers do not need to be rotated to align them when covering a circular manhole. Human beings have a roughly circular cross-section.<br />
A round manhole cover can be more easily moved by being rolled. If an automobile rolls over a dislodged manhole of another shape, the sharp corners could puncture the automobile&#8217;s tire, whereas a circle doesn&#8217;t have corners. It&#8217;s easier to dig a circular hole.<br />
Tradition </span></h3>
<p><!--adsense--></p>
]]></content:encoded>
			<wfw:commentRss>http://doctorinterview.com/puzzle/round-manhole/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Wrong labeling of three packets</title>
		<link>http://doctorinterview.com/puzzle/wrong-labeling-of-three-packets/</link>
		<comments>http://doctorinterview.com/puzzle/wrong-labeling-of-three-packets/#comments</comments>
		<pubDate>Sun, 30 Aug 2009 15:50:43 +0000</pubDate>
		<dc:creator>Bishal-Nath</dc:creator>
				<category><![CDATA[Puzzle]]></category>

		<guid isPermaLink="false">http://doctorinterview.com/index.html/?p=363</guid>
		<description><![CDATA[There are three packets in front of you among which one has offer letter, another has reject letter and third one has both offer letter and reject letter. All are labeled wrongly. How will you find the content of the bag if you are allowed to pick only one thing from any of the bag? [...]]]></description>
			<content:encoded><![CDATA[<p><span id="more-363"></span><br />
<!--adsense--></p>
<h3><span style="color: #0000ff;">There are three packets in front of you among which one has offer letter, another has reject letter and third one has both offer letter and reject letter. All are labeled wrongly. How will you find the content of the bag if you are allowed to pick only one thing from any of the bag?</span></h3>
<h3><span style="color: #808080;"> </span></h3>
<h3><span style="color: #808080;"> </span></h3>
<h3><span style="color: #808080;"> </span></h3>
<p><!--adsense--></p>
<h3><span style="color: #808080;">Pick from the bag that has labeled both the item as it will definitely have only one item in it.<br />
If it has Offer letter than, the bag labeled with reject letter will definitely have Offer &amp; Reject letter and rest one will have Reject letter.<br />
If it has Reject letter than, the bag labeled with reject letter will definitely have Offer letter and rest one will have Offer &amp; Reject letter.</span></h3>
<p><!--adsense--></p>
]]></content:encoded>
			<wfw:commentRss>http://doctorinterview.com/puzzle/wrong-labeling-of-three-packets/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>1000 Bottle of wine, 1 with poison</title>
		<link>http://doctorinterview.com/puzzle/1000-bottle-of-wine-1-with-poison/</link>
		<comments>http://doctorinterview.com/puzzle/1000-bottle-of-wine-1-with-poison/#comments</comments>
		<pubDate>Sun, 30 Aug 2009 15:48:39 +0000</pubDate>
		<dc:creator>Bishal-Nath</dc:creator>
				<category><![CDATA[Puzzle]]></category>

		<guid isPermaLink="false">http://doctorinterview.com/index.html/?p=362</guid>
		<description><![CDATA[A king has 1000 bottles of wines and some one has mixed poison in one bottle. Now how the king will find that bottle. He has lot of prisoners to test.       All the bottles are marked with numbers from 1 to 1000. You can get the binary representation of all the number. [...]]]></description>
			<content:encoded><![CDATA[<p><span id="more-362"></span><br />
<!--adsense--></p>
<h3><span style="color: #0000ff;">A king has 1000 bottles of wines and some one has mixed poison in one bottle. Now how the king will find that bottle. He has lot of prisoners to test.</span></h3>
<h3><span style="color: #808080;"> </span></h3>
<h3><span style="color: #808080;"> </span></h3>
<h3><span style="color: #808080;"> </span></h3>
<p><!--adsense--></p>
<h3><span style="color: #808080;">All the bottles are marked with numbers from 1 to 1000. You can get the binary representation of all the number.<br />
So bottle 1=0000000001<br />
bottle 1000=1111101000<br />
Now you need 10 prisoners. Prisoners one will take a sip from the bottle which has 1 in the last significant bit and so on. So bottle 1000 ill be tried on prisoners 4, 6, 7, 8, 9 and 10.<br />
The king can get back the number of bottle by keeping all the dead and alive prisoners according to their number, assigning 1 to dead, 0 to alive prisoners and calculate the number of bottle.<br />
After four weeks, line the prisoners up in their bit order and read each living prisoner as a 0 bit and each dead prisoner as a 1 bit. The number that you get is the bottle of wine that was poisoned.</span></h3>
<h3><span style="color: #808080;"> </span></h3>
<p><!--adsense--></p>
]]></content:encoded>
			<wfw:commentRss>http://doctorinterview.com/puzzle/1000-bottle-of-wine-1-with-poison/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>100 Doors</title>
		<link>http://doctorinterview.com/puzzle/100-doors/</link>
		<comments>http://doctorinterview.com/puzzle/100-doors/#comments</comments>
		<pubDate>Sun, 30 Aug 2009 15:46:00 +0000</pubDate>
		<dc:creator>Bishal-Nath</dc:creator>
				<category><![CDATA[Puzzle]]></category>

		<guid isPermaLink="false">http://doctorinterview.com/index.html/?p=361</guid>
		<description><![CDATA[There are 100 doors in front of you. First time while passing close all the door that are open and open all the door that are closed. Second time visit 2, 4, 6&#8230; door. Third time visit 3 6 9 &#8230; door. Repeat the process till you encounter only 100th door. After the process how [...]]]></description>
			<content:encoded><![CDATA[<p><span id="more-361"></span><br />
<!--adsense--></p>
<h3><span style="color: #0000ff;">There are 100 doors in front of you. First time while passing close all the door that are open and open all the door that are closed. Second time visit 2, 4, 6&#8230; door. Third time visit 3 6 9 &#8230; door. Repeat the process till you encounter only 100th door. After the process how will you tell the state (open or close) of each door?</span></h3>
<h3><span style="color: #808080;"> </span></h3>
<h3><span style="color: #808080;"> </span></h3>
<p><!--adsense--></p>
<h3><span style="color: #808080;">You will visit each door N number of time. That is the divisor of that door. For example you will visit 4th door at 1, 2, 4th round. 5th door at 1th , 5th  round. 6th door at 1th, 2nd, 3rd, 6th round. So if you see the pattern then all the perfect square numbered door will change their initial state and all other will move back to their initial state</span></h3>
<p><!--adsense--></p>
]]></content:encoded>
			<wfw:commentRss>http://doctorinterview.com/puzzle/100-doors/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Suicide bomber</title>
		<link>http://doctorinterview.com/puzzle/suicide-bomber/</link>
		<comments>http://doctorinterview.com/puzzle/suicide-bomber/#comments</comments>
		<pubDate>Sun, 30 Aug 2009 15:42:54 +0000</pubDate>
		<dc:creator>Bishal-Nath</dc:creator>
				<category><![CDATA[Puzzle]]></category>

		<guid isPermaLink="false">http://doctorinterview.com/index.html/?p=359</guid>
		<description><![CDATA[A suicide bomber has come to blast on one place and he has two threads to put fire. Both the thread last for 30sec. But he wants to cont for 45sec. He can not cut the thread or connect the thread.       He can put fire on first thread, once it burn half, [...]]]></description>
			<content:encoded><![CDATA[<p><span id="more-359"></span><br />
<!--adsense--></p>
<h3><span style="color: #0000ff;">A suicide bomber has come to blast on one place and he has two threads to put fire. Both the thread last for 30sec. But he wants to cont for 45sec. He can not cut the thread or connect the thread.</span></h3>
<p><!--adsense--></p>
<h3><span style="color: #808080;"> </span></h3>
<h3><span style="color: #808080;"> </span></h3>
<h3><span style="color: #808080;"> </span></h3>
<h3><span style="color: #808080;">He can put fire on first thread, once it burn half, he can put fire on another thread and it will help to count up to 45sec. </span></h3>
<p><!--adsense--></p>
]]></content:encoded>
			<wfw:commentRss>http://doctorinterview.com/puzzle/suicide-bomber/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Doctor with one hand, two glove and three patients</title>
		<link>http://doctorinterview.com/puzzle/doctor-with-one-hand-two-glove-and-three-patients/</link>
		<comments>http://doctorinterview.com/puzzle/doctor-with-one-hand-two-glove-and-three-patients/#comments</comments>
		<pubDate>Sun, 30 Aug 2009 15:35:02 +0000</pubDate>
		<dc:creator>Bishal-Nath</dc:creator>
				<category><![CDATA[Puzzle]]></category>

		<guid isPermaLink="false">http://doctorinterview.com/index.html/?p=358</guid>
		<description><![CDATA[There is a doctor with only one hand and he has two gloves using which he should operate on three patients but blood should not mix with each other.   Doctor can wear both the glove and then operate first patient. then remove off the first glove and operate on second patient. Then reverse the [...]]]></description>
			<content:encoded><![CDATA[<p><span id="more-358"></span><br />
<!--adsense--></p>
<h3><span style="color: #0000ff;">There is a doctor with only one hand and he has two gloves using which he should operate on three patients but blood should not mix with each other.</span></h3>
<h3><span style="color: #808080;"> </span></h3>
<p><!--adsense--></p>
<h3><span style="color: #808080;">Doctor can wear both the glove and then operate first patient. then remove off the first glove and operate on second patient. Then reverse the first glove and wear it on second glove and operate third patient. </span></h3>
<p><!--adsense--></p>
]]></content:encoded>
			<wfw:commentRss>http://doctorinterview.com/puzzle/doctor-with-one-hand-two-glove-and-three-patients/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

