<?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>Benjamin Coban &#8211; codevember.org</title>
	<atom:link href="https://codevember.org/author/cobbie/feed/" rel="self" type="application/rss+xml" />
	<link>https://codevember.org</link>
	<description>Code for fun</description>
	<lastBuildDate>Tue, 03 Feb 2026 10:31:33 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.9.1</generator>
	<item>
		<title>Codevember XII: About finding a parking spot, Multiplayer Wave Defense Fishing Game and much more!</title>
		<link>https://codevember.org/codevember-xii-about-finding-a-parking-spot-multiplayer-wave-defense-fishing-game-and-much-more/</link>
		
		<dc:creator><![CDATA[Benjamin Coban]]></dc:creator>
		<pubDate>Sun, 01 Feb 2026 13:50:30 +0000</pubDate>
				<category><![CDATA[Uncategorized]]></category>
		<guid isPermaLink="false">https://codevember.org/?p=1046</guid>

					<description><![CDATA[XII&#8217;th time&#8217;s the charme! For this year, the Codevember event took place in Karlsruhe, home of Germanys first Octopus Döner (which none tasted AFAIK). This time, the host was the FZI Forschungszentrum Informatik, an applied research center for IT solutions and boy, did we have fun. Mobility4BW &#8211; open mobility data from Baden-Württemberg accessible on [&#8230;]]]></description>
		
		
		
			</item>
		<item>
		<title>Codevember XII &#8211; CV goes FZI</title>
		<link>https://codevember.org/codevember-xii-cv-goes-fzi/</link>
		
		<dc:creator><![CDATA[Mat Schlenker]]></dc:creator>
		<pubDate>Tue, 16 Sep 2025 18:22:55 +0000</pubDate>
				<category><![CDATA[Uncategorized]]></category>
		<guid isPermaLink="false">https://codevember.org/?p=997</guid>

					<description><![CDATA[Der Codevember e.V. veranstaltet jährlich einen Hackathon, bei dem kreative Ideen umgesetzt werden. In diesem Jahr findet der Codevember erstmals gemeinsam mit dem FZI Forschungszentrum Informatik in Karlsruhe statt. Durch die Zusammenarbeit wollen wir nicht nur Projekte umsetzen, sondern auch Einblicke in aktuelle Technologien geben, neue Perspektiven eröffnen und zeigen, wie kreative Ansätze gesellschaftlichen Mehrwert [&#8230;]]]></description>
		
		
		
			</item>
		<item>
		<title>Step up your game &#8211; Upgrade from C to C++</title>
		<link>https://codevember.org/from-c-to-cpp/</link>
					<comments>https://codevember.org/from-c-to-cpp/#respond</comments>
		
		<dc:creator><![CDATA[Benjamin Coban]]></dc:creator>
		<pubDate>Wed, 10 Nov 2021 17:52:04 +0000</pubDate>
				<category><![CDATA[Development]]></category>
		<guid isPermaLink="false">https://codevember.org/?p=671</guid>

					<description><![CDATA[When writing complex programs in C, one will be confronted with the topic of code redundancy and accessibility control issues. C++ was first introduced in 1983, called &#8220;C with classes&#8221;, and solves a bunch of hurdles stumpling upon programming in C. The advantages of object-oriented programming languages Defining complex data structures in C remembers of [&#8230;]]]></description>
		
					<wfw:commentRss>https://codevember.org/from-c-to-cpp/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>How To Setup A C Project With WSL2 And Visual Studio Code &#8211; A Short Overview</title>
		<link>https://codevember.org/c-with-wsl2-vscode/</link>
					<comments>https://codevember.org/c-with-wsl2-vscode/#respond</comments>
		
		<dc:creator><![CDATA[Benjamin Coban]]></dc:creator>
		<pubDate>Thu, 28 Oct 2021 14:03:01 +0000</pubDate>
				<category><![CDATA[Development]]></category>
		<category><![CDATA[Workspace]]></category>
		<guid isPermaLink="false">https://codevember.org/?p=654</guid>

					<description><![CDATA[In this post, I will show you guys how I set up a C Compiler on my Windows 11 machine. Since as a tutor I will check completed tasks written in C, but I personally want to avoid a big Visual Studio solution for it, I will use the WSL2 on my machine to compile [&#8230;]]]></description>
		
					<wfw:commentRss>https://codevember.org/c-with-wsl2-vscode/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Recipe: How To Translate A Recursive Function Into An Implicite One</title>
		<link>https://codevember.org/recursive-to-implicite/</link>
					<comments>https://codevember.org/recursive-to-implicite/#respond</comments>
		
		<dc:creator><![CDATA[Benjamin Coban]]></dc:creator>
		<pubDate>Mon, 18 Oct 2021 11:38:31 +0000</pubDate>
				<category><![CDATA[Algorithmics]]></category>
		<category><![CDATA[Applied Mathematics]]></category>
		<category><![CDATA[Theory In Computer Science]]></category>
		<category><![CDATA[Algorithmics Basics]]></category>
		<category><![CDATA[function]]></category>
		<category><![CDATA[implicite]]></category>
		<category><![CDATA[recursive]]></category>
		<guid isPermaLink="false">http://codevember.org/?p=467</guid>

					<description><![CDATA[In order to determine the runtime of a recursive function, it is helpful to translate this function into an implicite one. This blog post illustrates a straight-forward approach, intuitively &#8211; with exactly 5 steps on a small example. This approach is also applicable for almost every recursive function. Why Tho? The reason to resolve a [&#8230;]]]></description>
		
					<wfw:commentRss>https://codevember.org/recursive-to-implicite/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>An (in-)formal Introduction To Attack Defense Trees</title>
		<link>https://codevember.org/attack-defense-trees/</link>
					<comments>https://codevember.org/attack-defense-trees/#respond</comments>
		
		<dc:creator><![CDATA[Benjamin Coban]]></dc:creator>
		<pubDate>Mon, 23 Aug 2021 09:48:22 +0000</pubDate>
				<category><![CDATA[Algorithmics]]></category>
		<category><![CDATA[Graph Theory]]></category>
		<category><![CDATA[Theory In Computer Science]]></category>
		<category><![CDATA[Attack Defense Trees]]></category>
		<category><![CDATA[Propositional formulas]]></category>
		<category><![CDATA[Semantics]]></category>
		<category><![CDATA[Software Quality]]></category>
		<guid isPermaLink="false">http://codevember.org/?p=72</guid>

					<description><![CDATA[It is widely known that the security of a system seen as property is not static. Therefore, there cannot exist a general algorithm deciding whether or not a given system is secure in its sense. IT-Security Architects and Engineers are stuck with persistent research of bug reports of the technology the respective enterprise is using. [&#8230;]]]></description>
		
					<wfw:commentRss>https://codevember.org/attack-defense-trees/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>A Few Words On Algorithm Complexity</title>
		<link>https://codevember.org/a-few-words-on-algorithm-complexity/</link>
					<comments>https://codevember.org/a-few-words-on-algorithm-complexity/#respond</comments>
		
		<dc:creator><![CDATA[Benjamin Coban]]></dc:creator>
		<pubDate>Sat, 24 Oct 2020 22:34:36 +0000</pubDate>
				<category><![CDATA[Algorithmics]]></category>
		<category><![CDATA[Theory In Computer Science]]></category>
		<category><![CDATA[Algorithmics Basics]]></category>
		<guid isPermaLink="false">http://codevember.org/?p=424</guid>

					<description><![CDATA[One of the key properties of a given algorithm is its complexity. A computer scientist is interested in the adequacy of the algorithm runtime relative to the size of the input. While there exist sharp runtime lower bounds for any given algorithm, for upper bounds however, the sky is the limit. It depends on the [&#8230;]]]></description>
		
					<wfw:commentRss>https://codevember.org/a-few-words-on-algorithm-complexity/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
