<?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>ardalahmet.com &#187; function pointer</title>
	<atom:link href="http://www.ardalahmet.com/tag/function-pointer/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.ardalahmet.com</link>
	<description>ardalahmet on software and systems development and *et al*</description>
	<lastBuildDate>Thu, 08 Dec 2011 01:12:49 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.1</generator>
		<item>
		<title>CE242-Spring&#8217;09-Homework#6</title>
		<link>http://www.ardalahmet.com/2009/06/09/ce242-spring09-homework6/</link>
		<comments>http://www.ardalahmet.com/2009/06/09/ce242-spring09-homework6/#comments</comments>
		<pubDate>Tue, 09 Jun 2009 16:01:13 +0000</pubDate>
		<dc:creator>Ahmet Ardal</dc:creator>
				<category><![CDATA[CE-242]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[cpp]]></category>
		<category><![CDATA[data structure]]></category>
		<category><![CDATA[function pointer]]></category>
		<category><![CDATA[generic]]></category>
		<category><![CDATA[heapsort]]></category>
		<category><![CDATA[operator overloading]]></category>
		<category><![CDATA[sorting]]></category>
		<category><![CDATA[template]]></category>

		<guid isPermaLink="false">http://www.ardalahmet.com/?p=158</guid>
		<description><![CDATA[CE242 Data Structures and Algorithms Course @KHas &#8211; Spring 2009 &#8211; Homework #6 questions and solutions and some extra code including several different implementations of HeapSort algorithm with related test codes. I recommend you to check these links before inspecting the code: Heap data structure Array implementation of the Heap data structure Selection-based sorting HeapSort [...]]]></description>
		<wfw:commentRss>http://www.ardalahmet.com/2009/06/09/ce242-spring09-homework6/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>CE242-Spring&#8217;09-Homework#5</title>
		<link>http://www.ardalahmet.com/2009/06/09/ce242-spring09-homework5/</link>
		<comments>http://www.ardalahmet.com/2009/06/09/ce242-spring09-homework5/#comments</comments>
		<pubDate>Tue, 09 Jun 2009 06:11:22 +0000</pubDate>
		<dc:creator>Ahmet Ardal</dc:creator>
				<category><![CDATA[CE-242]]></category>
		<category><![CDATA[binary tree]]></category>
		<category><![CDATA[cpp]]></category>
		<category><![CDATA[data structure]]></category>
		<category><![CDATA[dictionary]]></category>
		<category><![CDATA[function pointer]]></category>
		<category><![CDATA[tree traversal]]></category>

		<guid isPermaLink="false">http://www.ardalahmet.com/?p=149</guid>
		<description><![CDATA[CE242 Data Structures and Algorithms Course @KHas &#8211; Spring 2009 &#8211; Homework #5 questions and solutions. CE242 Data Structures and Algorithms course description is available here. Download questions and solutions Note: &#8220;ce242-spring09-hw5-q1.cpp&#8221;, &#8220;ce242-spring09-hw5-q2.cpp&#8221; and &#8220;ce242-spring09-hw5-q3.cpp&#8221; need &#8220;BTree.cpp&#8221; module, so link them together while building the code. Source files: [BTree.h] &#124; show // ================================================== // - [...]]]></description>
		<wfw:commentRss>http://www.ardalahmet.com/2009/06/09/ce242-spring09-homework5/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>CE242-Spring&#8217;09-Homework#4</title>
		<link>http://www.ardalahmet.com/2009/06/08/ce242-spring09-homework4/</link>
		<comments>http://www.ardalahmet.com/2009/06/08/ce242-spring09-homework4/#comments</comments>
		<pubDate>Mon, 08 Jun 2009 20:45:56 +0000</pubDate>
		<dc:creator>Ahmet Ardal</dc:creator>
				<category><![CDATA[CE-242]]></category>
		<category><![CDATA[binary tree]]></category>
		<category><![CDATA[cpp]]></category>
		<category><![CDATA[data structure]]></category>
		<category><![CDATA[function pointer]]></category>
		<category><![CDATA[recursion]]></category>
		<category><![CDATA[tree traversal]]></category>

		<guid isPermaLink="false">http://www.ardalahmet.com/?p=144</guid>
		<description><![CDATA[CE242 Data Structures and Algorithms Course @KHas &#8211; Spring 2009 &#8211; Homework #4 questions and solutions and some extra code about how to use the BTree binary search tree data structure module. CE242 Data Structures and Algorithms course description is available here. Download questions and solutions Note: &#8220;testBTree.cpp&#8221; needs &#8220;BTree.cpp module, so link them together [...]]]></description>
		<wfw:commentRss>http://www.ardalahmet.com/2009/06/08/ce242-spring09-homework4/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>CE242-Spring&#8217;09-Homework#2</title>
		<link>http://www.ardalahmet.com/2009/06/08/ce242-spring09-homework2/</link>
		<comments>http://www.ardalahmet.com/2009/06/08/ce242-spring09-homework2/#comments</comments>
		<pubDate>Mon, 08 Jun 2009 09:39:05 +0000</pubDate>
		<dc:creator>Ahmet Ardal</dc:creator>
				<category><![CDATA[CE-242]]></category>
		<category><![CDATA[cpp]]></category>
		<category><![CDATA[data structure]]></category>
		<category><![CDATA[function pointer]]></category>
		<category><![CDATA[linked list]]></category>

		<guid isPermaLink="false">http://www.ardalahmet.com/?p=133</guid>
		<description><![CDATA[CE242 Data Structures and Algorithms Course @KHas &#8211; Spring 2009 &#8211; Homework #2 questions and solutions. CE242 Data Structures and Algorithms course description is available here. Download questions and solutions Note: &#8220;ce242-spring09-hw2-q1-a.cpp&#8221; and &#8220;ce242-spring09-hw2-q1-b.cpp&#8221; need &#8220;List.cpp&#8221; module, so link them together while building the code. Source files: [List.h] &#124; show // ================================================== // - File______: [...]]]></description>
		<wfw:commentRss>http://www.ardalahmet.com/2009/06/08/ce242-spring09-homework2/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>CE242-Spring&#8217;09-Homework#1</title>
		<link>http://www.ardalahmet.com/2009/06/08/ce242-spring09-homework1/</link>
		<comments>http://www.ardalahmet.com/2009/06/08/ce242-spring09-homework1/#comments</comments>
		<pubDate>Mon, 08 Jun 2009 09:13:06 +0000</pubDate>
		<dc:creator>Ahmet Ardal</dc:creator>
				<category><![CDATA[CE-242]]></category>
		<category><![CDATA[cpp]]></category>
		<category><![CDATA[data structure]]></category>
		<category><![CDATA[function pointer]]></category>
		<category><![CDATA[linked list]]></category>

		<guid isPermaLink="false">http://www.ardalahmet.com/?p=126</guid>
		<description><![CDATA[CE242 Data Structures and Algorithms Course @KHas &#8211; Spring 2009 &#8211; Homework #1 questions and solutions. CE242 Data Structures and Algorithms course description is available here. Download questions and solutions Note: &#8220;ce242-spring09-hw1-q1.cpp&#8221; needs &#8220;List.cpp&#8221; module, so link them together while building the code. Source files: [List.h] &#124; show // ================================================== // - File______: List.h _____________________________ [...]]]></description>
		<wfw:commentRss>http://www.ardalahmet.com/2009/06/08/ce242-spring09-homework1/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

