<?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>Placement Papers &#187; MICROSOFT</title>
	<atom:link href="http://www.placementpapers.in/category/microsoft/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.placementpapers.in</link>
	<description></description>
	<lastBuildDate>Fri, 20 Jan 2012 11:03:38 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<xhtml:meta xmlns:xhtml="http://www.w3.org/1999/xhtml" name="robots" content="noindex" />
		<item>
		<title>Microsoft Placement Paper (Technical-C, OS) 2011</title>
		<link>http://www.placementpapers.in/microsoft-placement-paper-technical-c-os-2011.html</link>
		<comments>http://www.placementpapers.in/microsoft-placement-paper-technical-c-os-2011.html#comments</comments>
		<pubDate>Tue, 01 Feb 2011 06:51:11 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[MICROSOFT]]></category>
		<category><![CDATA[Microsoft 2011 Placement Papers]]></category>
		<category><![CDATA[Microsoft Interview Question Paper]]></category>
		<category><![CDATA[Microsoft Interview Questions]]></category>
		<category><![CDATA[MICROSOFT latest placement paper]]></category>
		<category><![CDATA[MICROSOFT placement papers]]></category>
		<category><![CDATA[Microsoft Placement Papers 2011]]></category>

		<guid isPermaLink="false">http://www.placementpapers.in/?p=1837</guid>
		<description><![CDATA[1. An array of size k contains integers between 1 and n. You are given an  additional scratch array of size n. Compress the original array by removing  duplicates in it. What if k &#60;&#60; n?
ANS. Can be done in O(k) time i.e. without initializing the auxiliary  array!
2. An array of integers. [...]


Related posts:<ol><li><a href='http://www.placementpapers.in/microsoft-placement-papers-5.html' rel='bookmark' title='Permanent Link: MICROSOFT Placement Papers 5'>MICROSOFT Placement Papers 5</a></li><li><a href='http://www.placementpapers.in/microsoft-placement-papers-4.html' rel='bookmark' title='Permanent Link: MICROSOFT Placement Papers 4'>MICROSOFT Placement Papers 4</a></li><li><a href='http://www.placementpapers.in/microsoft-placement-papers-1.html' rel='bookmark' title='Permanent Link: MICROSOFT Placement Papers 1'>MICROSOFT Placement Papers 1</a></li></ol>]]></description>
		<wfw:commentRss>http://www.placementpapers.in/microsoft-placement-paper-technical-c-os-2011.html/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>MICROSOFT Placement Papers 6</title>
		<link>http://www.placementpapers.in/microsoft-placement-papers-6.html</link>
		<comments>http://www.placementpapers.in/microsoft-placement-papers-6.html#comments</comments>
		<pubDate>Tue, 12 Jan 2010 06:22:17 +0000</pubDate>
		<dc:creator>mod</dc:creator>
				<category><![CDATA[MICROSOFT]]></category>
		<category><![CDATA[MICROSOFT 2009 placement papers]]></category>
		<category><![CDATA[MICROSOFT 2009 question papers]]></category>
		<category><![CDATA[MICROSOFT 2009 test papers]]></category>
		<category><![CDATA[MICROSOFT 2010 placement papers]]></category>
		<category><![CDATA[MICROSOFT 2010 question papers]]></category>
		<category><![CDATA[MICROSOFT company papers]]></category>
		<category><![CDATA[MICROSOFT company profile]]></category>
		<category><![CDATA[MICROSOFT exam paper]]></category>
		<category><![CDATA[MICROSOFT exam papers]]></category>
		<category><![CDATA[MICROSOFT exam pattern]]></category>
		<category><![CDATA[MICROSOFT exam pattern 2009]]></category>
		<category><![CDATA[MICROSOFT exam pattern 2010]]></category>
		<category><![CDATA[MICROSOFT interview papers]]></category>
		<category><![CDATA[MICROSOFT interview pattern 2009]]></category>
		<category><![CDATA[MICROSOFT interview pattern 2010]]></category>
		<category><![CDATA[MICROSOFT latest placement paper]]></category>
		<category><![CDATA[MICROSOFT latest placement papers]]></category>
		<category><![CDATA[MICROSOFT placement paper 2009]]></category>
		<category><![CDATA[MICROSOFT placement paper 2010]]></category>
		<category><![CDATA[MICROSOFT placement papers]]></category>
		<category><![CDATA[MICROSOFT placement papers 2009]]></category>
		<category><![CDATA[MICROSOFT previous placement papers]]></category>
		<category><![CDATA[MICROSOFT profile]]></category>
		<category><![CDATA[MICROSOFT question papers]]></category>
		<category><![CDATA[MICROSOFT recent placement papers]]></category>
		<category><![CDATA[MICROSOFT sample papers]]></category>
		<category><![CDATA[MICROSOFT solved placement papers]]></category>
		<category><![CDATA[MICROSOFT solved test papers]]></category>
		<category><![CDATA[MICROSOFT test papers]]></category>
		<category><![CDATA[placement paper]]></category>
		<category><![CDATA[placement papers]]></category>
		<category><![CDATA[placement papers of MICROSOFT]]></category>

		<guid isPermaLink="false">http://www.placementpapers.in/?p=1550</guid>
		<description><![CDATA[76. I was a c++ code and was asked to find out the bug in that. The bug was that he declared an object locally in a function and tried to return the pointer to that object. Since the object is local to the function, it no more exists after returning from the function. The [...]


Related posts:<ol><li><a href='http://www.placementpapers.in/microsoft-placement-papers-2.html' rel='bookmark' title='Permanent Link: MICROSOFT Placement Papers 2'>MICROSOFT Placement Papers 2</a></li><li><a href='http://www.placementpapers.in/microsoft-placement-papers-3.html' rel='bookmark' title='Permanent Link: MICROSOFT Placement Papers 3'>MICROSOFT Placement Papers 3</a></li><li><a href='http://www.placementpapers.in/microsoft-placement-papers-4.html' rel='bookmark' title='Permanent Link: MICROSOFT Placement Papers 4'>MICROSOFT Placement Papers 4</a></li></ol>]]></description>
		<wfw:commentRss>http://www.placementpapers.in/microsoft-placement-papers-6.html/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>MICROSOFT Placement Papers 5</title>
		<link>http://www.placementpapers.in/microsoft-placement-papers-5.html</link>
		<comments>http://www.placementpapers.in/microsoft-placement-papers-5.html#comments</comments>
		<pubDate>Tue, 12 Jan 2010 06:21:18 +0000</pubDate>
		<dc:creator>mod</dc:creator>
				<category><![CDATA[MICROSOFT]]></category>
		<category><![CDATA[MICROSOFT 2009 placement papers]]></category>
		<category><![CDATA[MICROSOFT 2009 question papers]]></category>
		<category><![CDATA[MICROSOFT 2009 test papers]]></category>
		<category><![CDATA[MICROSOFT 2010 placement papers]]></category>
		<category><![CDATA[MICROSOFT 2010 question papers]]></category>
		<category><![CDATA[MICROSOFT company papers]]></category>
		<category><![CDATA[MICROSOFT company profile]]></category>
		<category><![CDATA[MICROSOFT exam paper]]></category>
		<category><![CDATA[MICROSOFT exam papers]]></category>
		<category><![CDATA[MICROSOFT exam pattern]]></category>
		<category><![CDATA[MICROSOFT exam pattern 2009]]></category>
		<category><![CDATA[MICROSOFT exam pattern 2010]]></category>
		<category><![CDATA[MICROSOFT interview papers]]></category>
		<category><![CDATA[MICROSOFT interview pattern 2009]]></category>
		<category><![CDATA[MICROSOFT interview pattern 2010]]></category>
		<category><![CDATA[MICROSOFT latest placement paper]]></category>
		<category><![CDATA[MICROSOFT latest placement papers]]></category>
		<category><![CDATA[MICROSOFT placement paper 2009]]></category>
		<category><![CDATA[MICROSOFT placement paper 2010]]></category>
		<category><![CDATA[MICROSOFT placement papers]]></category>
		<category><![CDATA[MICROSOFT placement papers 2009]]></category>
		<category><![CDATA[MICROSOFT previous placement papers]]></category>
		<category><![CDATA[MICROSOFT profile]]></category>
		<category><![CDATA[MICROSOFT question papers]]></category>
		<category><![CDATA[MICROSOFT recent placement papers]]></category>
		<category><![CDATA[MICROSOFT sample papers]]></category>
		<category><![CDATA[MICROSOFT solved placement papers]]></category>
		<category><![CDATA[MICROSOFT solved test papers]]></category>
		<category><![CDATA[MICROSOFT test papers]]></category>
		<category><![CDATA[placement paper]]></category>
		<category><![CDATA[placement papers]]></category>
		<category><![CDATA[placement papers of MICROSOFT]]></category>

		<guid isPermaLink="false">http://www.placementpapers.in/?p=1548</guid>
		<description><![CDATA[
51. An array of size k contains integers between 1 and n. You are given an additional scratch array of size n. Compress the original array by removing duplicates in it. What if k &#60;&#60; n?
ANS. Can be done in O(k) time i.e. without initializing the auxiliary array!
52. An array of integers. The sum of [...]


Related posts:<ol><li><a href='http://www.placementpapers.in/microsoft-placement-papers-4.html' rel='bookmark' title='Permanent Link: MICROSOFT Placement Papers 4'>MICROSOFT Placement Papers 4</a></li><li><a href='http://www.placementpapers.in/microsoft-placement-papers-1.html' rel='bookmark' title='Permanent Link: MICROSOFT Placement Papers 1'>MICROSOFT Placement Papers 1</a></li><li><a href='http://www.placementpapers.in/microsoft-placement-papers-2.html' rel='bookmark' title='Permanent Link: MICROSOFT Placement Papers 2'>MICROSOFT Placement Papers 2</a></li></ol>]]></description>
		<wfw:commentRss>http://www.placementpapers.in/microsoft-placement-papers-5.html/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>MICROSOFT Placement Papers 4</title>
		<link>http://www.placementpapers.in/microsoft-placement-papers-4.html</link>
		<comments>http://www.placementpapers.in/microsoft-placement-papers-4.html#comments</comments>
		<pubDate>Tue, 12 Jan 2010 06:19:45 +0000</pubDate>
		<dc:creator>mod</dc:creator>
				<category><![CDATA[MICROSOFT]]></category>
		<category><![CDATA[MICROSOFT 2009 placement papers]]></category>
		<category><![CDATA[MICROSOFT 2009 question papers]]></category>
		<category><![CDATA[MICROSOFT 2009 test papers]]></category>
		<category><![CDATA[MICROSOFT 2010 placement papers]]></category>
		<category><![CDATA[MICROSOFT 2010 question papers]]></category>
		<category><![CDATA[MICROSOFT company papers]]></category>
		<category><![CDATA[MICROSOFT company profile]]></category>
		<category><![CDATA[MICROSOFT exam paper]]></category>
		<category><![CDATA[MICROSOFT exam papers]]></category>
		<category><![CDATA[MICROSOFT exam pattern]]></category>
		<category><![CDATA[MICROSOFT exam pattern 2009]]></category>
		<category><![CDATA[MICROSOFT exam pattern 2010]]></category>
		<category><![CDATA[MICROSOFT interview papers]]></category>
		<category><![CDATA[MICROSOFT interview pattern 2009]]></category>
		<category><![CDATA[MICROSOFT interview pattern 2010]]></category>
		<category><![CDATA[MICROSOFT latest placement paper]]></category>
		<category><![CDATA[MICROSOFT latest placement papers]]></category>
		<category><![CDATA[MICROSOFT placement paper 2009]]></category>
		<category><![CDATA[MICROSOFT placement paper 2010]]></category>
		<category><![CDATA[MICROSOFT placement papers]]></category>
		<category><![CDATA[MICROSOFT placement papers 2009]]></category>
		<category><![CDATA[MICROSOFT previous placement papers]]></category>
		<category><![CDATA[MICROSOFT profile]]></category>
		<category><![CDATA[MICROSOFT question papers]]></category>
		<category><![CDATA[MICROSOFT recent placement papers]]></category>
		<category><![CDATA[MICROSOFT sample papers]]></category>
		<category><![CDATA[MICROSOFT solved placement papers]]></category>
		<category><![CDATA[MICROSOFT solved test papers]]></category>
		<category><![CDATA[MICROSOFT test papers]]></category>
		<category><![CDATA[placement paper]]></category>
		<category><![CDATA[placement papers]]></category>
		<category><![CDATA[placement papers of MICROSOFT]]></category>

		<guid isPermaLink="false">http://www.placementpapers.in/?p=1546</guid>
		<description><![CDATA[
27. Besides communication cost, what is the other source of inefficiency in RPC? (answer : context switches, excessive buffer copying). How can you optimize the communication? (ans : communicate through shared memory on same machine, bypassing the kernel _ A Univ. of Wash. thesis)
28. Write a routine that prints out a 2-D array in spiral [...]


Related posts:<ol><li><a href='http://www.placementpapers.in/microsoft-placement-papers-1.html' rel='bookmark' title='Permanent Link: MICROSOFT Placement Papers 1'>MICROSOFT Placement Papers 1</a></li><li><a href='http://www.placementpapers.in/microsoft-placement-papers-5.html' rel='bookmark' title='Permanent Link: MICROSOFT Placement Papers 5'>MICROSOFT Placement Papers 5</a></li><li><a href='http://www.placementpapers.in/microsoft-placement-papers-3.html' rel='bookmark' title='Permanent Link: MICROSOFT Placement Papers 3'>MICROSOFT Placement Papers 3</a></li></ol>]]></description>
		<wfw:commentRss>http://www.placementpapers.in/microsoft-placement-papers-4.html/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>MICROSOFT Placement Papers 3</title>
		<link>http://www.placementpapers.in/microsoft-placement-papers-3.html</link>
		<comments>http://www.placementpapers.in/microsoft-placement-papers-3.html#comments</comments>
		<pubDate>Tue, 12 Jan 2010 06:18:45 +0000</pubDate>
		<dc:creator>mod</dc:creator>
				<category><![CDATA[MICROSOFT]]></category>
		<category><![CDATA[MICROSOFT 2009 placement papers]]></category>
		<category><![CDATA[MICROSOFT 2009 question papers]]></category>
		<category><![CDATA[MICROSOFT 2009 test papers]]></category>
		<category><![CDATA[MICROSOFT 2010 placement papers]]></category>
		<category><![CDATA[MICROSOFT 2010 question papers]]></category>
		<category><![CDATA[MICROSOFT company papers]]></category>
		<category><![CDATA[MICROSOFT company profile]]></category>
		<category><![CDATA[MICROSOFT exam paper]]></category>
		<category><![CDATA[MICROSOFT exam papers]]></category>
		<category><![CDATA[MICROSOFT exam pattern]]></category>
		<category><![CDATA[MICROSOFT exam pattern 2009]]></category>
		<category><![CDATA[MICROSOFT exam pattern 2010]]></category>
		<category><![CDATA[MICROSOFT interview papers]]></category>
		<category><![CDATA[MICROSOFT interview pattern 2009]]></category>
		<category><![CDATA[MICROSOFT interview pattern 2010]]></category>
		<category><![CDATA[MICROSOFT latest placement paper]]></category>
		<category><![CDATA[MICROSOFT latest placement papers]]></category>
		<category><![CDATA[MICROSOFT placement paper 2009]]></category>
		<category><![CDATA[MICROSOFT placement paper 2010]]></category>
		<category><![CDATA[MICROSOFT placement papers]]></category>
		<category><![CDATA[MICROSOFT placement papers 2009]]></category>
		<category><![CDATA[MICROSOFT previous placement papers]]></category>
		<category><![CDATA[MICROSOFT profile]]></category>
		<category><![CDATA[MICROSOFT question papers]]></category>
		<category><![CDATA[MICROSOFT recent placement papers]]></category>
		<category><![CDATA[MICROSOFT sample papers]]></category>
		<category><![CDATA[MICROSOFT solved placement papers]]></category>
		<category><![CDATA[MICROSOFT solved test papers]]></category>
		<category><![CDATA[MICROSOFT test papers]]></category>
		<category><![CDATA[placement paper]]></category>
		<category><![CDATA[placement papers]]></category>
		<category><![CDATA[placement papers of MICROSOFT]]></category>

		<guid isPermaLink="false">http://www.placementpapers.in/?p=1544</guid>
		<description><![CDATA[Algorithms and Programming
1. Given a rectangular (cuboidal for the puritans) cake with a rectangular piece removed (any size or orientation), how would you cut the remainder of the cake into two equal halves with one straight cut of a knife ?
2. You&#8217;re given an array containing both positive and negative integers and required to find [...]


Related posts:<ol><li><a href='http://www.placementpapers.in/microsoft-placement-papers-1.html' rel='bookmark' title='Permanent Link: MICROSOFT Placement Papers 1'>MICROSOFT Placement Papers 1</a></li><li><a href='http://www.placementpapers.in/microsoft-placement-papers-4.html' rel='bookmark' title='Permanent Link: MICROSOFT Placement Papers 4'>MICROSOFT Placement Papers 4</a></li><li><a href='http://www.placementpapers.in/microsoft-placement-papers-6.html' rel='bookmark' title='Permanent Link: MICROSOFT Placement Papers 6'>MICROSOFT Placement Papers 6</a></li></ol>]]></description>
		<wfw:commentRss>http://www.placementpapers.in/microsoft-placement-papers-3.html/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

