<?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>Reflections of a scattered Mind !! &#187; Minor</title>
	<atom:link href="http://blog.saionline.co.in/tag/minor/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.saionline.co.in</link>
	<description>&#34;Not all scattered pieces are of broken glass&#34;</description>
	<lastBuildDate>Mon, 14 Nov 2011 20:56:24 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3</generator>
<cloud domain='blog.saionline.co.in' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
		<item>
		<title>Parallel Programming Minor Test &#8211; I</title>
		<link>http://blog.saionline.co.in/2008/08/parallel-programming-minor-test-1/?utm_source=rss&#038;utm_medium=rss&#038;utm_campaign=parallel-programming-minor-test-1</link>
		<comments>http://blog.saionline.co.in/2008/08/parallel-programming-minor-test-1/#comments</comments>
		<pubDate>Sat, 30 Aug 2008 10:37:00 +0000</pubDate>
		<dc:creator>Sai Prasad</dc:creator>
				<category><![CDATA[Academics]]></category>
		<category><![CDATA[Minor]]></category>
		<category><![CDATA[NITW]]></category>
		<category><![CDATA[Parallel Programming]]></category>

		<guid isPermaLink="false">http://blog.saionline.co.in/2008/08/parallel-programming-minor-test-i/</guid>
		<description><![CDATA[Date : 29.08.2008
Duration : 40 Minutes
Max. Marks : 10
1. Give a CREW PRAM algorithm to merge two sorted lists.
2. Define shuffle and exchange connections in a shuffle-exchange network. Prove that if a shuffle link connects nodes i and j, then j is single-bit left cyclic rotation of i.
3. What is  [...]]]></description>
			<content:encoded><![CDATA[<div style="text-align: left;"><span style="font-weight: bold;">Date :</span> 29.08.2008</div>
<div style="text-align: center;"><span style="font-weight: bold;">Duration :</span> 40 Minutes</div>
<div style="text-align: right;"><span style="font-weight: bold;">Max. Marks :</span> 10</div>
<p><span style="font-weight: bold;">1.</span> Give a CREW PRAM algorithm to merge two sorted lists.</p>
<p><span style="font-weight: bold;">2. </span>Define shuffle and exchange connections in a shuffle-exchange network. Prove that if a shuffle link connects nodes i and j, then j is single-bit left cyclic rotation of i.</p>
<p><span style="font-weight: bold;">3.</span> What is the average number of communication links in the use during Johnsson and Ho&#8217;s one-to-all broadcast algorithm on the hypercube?</p>
]]></content:encoded>
			<wfw:commentRss>http://blog.saionline.co.in/2008/08/parallel-programming-minor-test-1/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
	</channel>
</rss>

