<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.expertiza.ncsu.edu/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Djallred</id>
	<title>Expertiza_Wiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.expertiza.ncsu.edu/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Djallred"/>
	<link rel="alternate" type="text/html" href="https://wiki.expertiza.ncsu.edu/index.php?title=Special:Contributions/Djallred"/>
	<updated>2026-06-26T10:31:36Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.41.0</generator>
	<entry>
		<id>https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216_F09/&amp;diff=27892</id>
		<title>CSC 216 F09/</title>
		<link rel="alternate" type="text/html" href="https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216_F09/&amp;diff=27892"/>
		<updated>2009-11-18T02:51:18Z</updated>

		<summary type="html">&lt;p&gt;Djallred: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;==Background==&lt;br /&gt;
This is a simple exercise for finding recursive equations and writing them as Java code.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Props===&lt;br /&gt;
1. Whiteboard&lt;br /&gt;
&lt;br /&gt;
2. Access to a Java editor&lt;br /&gt;
&lt;br /&gt;
===Procedure===&lt;br /&gt;
&lt;br /&gt;
1) Give each row a sequence of numbers. &lt;br /&gt;
&lt;br /&gt;
Ex:&lt;br /&gt;
&lt;br /&gt;
	a) 2, 6, 10, 14,...&lt;br /&gt;
&lt;br /&gt;
	b) 0, 1, 0, 1...&lt;br /&gt;
&lt;br /&gt;
	c) 2, 6, 12, 20...&lt;br /&gt;
&lt;br /&gt;
	d) 1, 4, 9, 16...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
2) Then have each row work together to find the recursive definition for the sequences.&lt;br /&gt;
&lt;br /&gt;
Ex:&lt;br /&gt;
&lt;br /&gt;
	a) 4n-2&lt;br /&gt;
&lt;br /&gt;
	b) 1+(-1)^n&lt;br /&gt;
&lt;br /&gt;
	c) n(n + 1)&lt;br /&gt;
&lt;br /&gt;
	d) n^2&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
3) Lastly, each group should write Java code to implement the recursive equation and submit via Google Docs.  &lt;br /&gt;
&lt;br /&gt;
Ex:&lt;br /&gt;
&lt;br /&gt;
a) &lt;br /&gt;
&lt;br /&gt;
public int recursion( int n ){&lt;br /&gt;
    int a = 0;&lt;br /&gt;
    if(n == 1) a = 2;&lt;br /&gt;
    else a = recursion( n - 1 ) + 4;&lt;br /&gt;
    return a;&lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
By: David Duran &amp;amp; Dereck Allred&lt;/div&gt;</summary>
		<author><name>Djallred</name></author>
	</entry>
	<entry>
		<id>https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216_F09/_VisualExceptionHandlingExercise&amp;diff=27828</id>
		<title>CSC 216 F09/ VisualExceptionHandlingExercise</title>
		<link rel="alternate" type="text/html" href="https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216_F09/_VisualExceptionHandlingExercise&amp;diff=27828"/>
		<updated>2009-11-18T02:04:26Z</updated>

		<summary type="html">&lt;p&gt;Djallred: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Visual Exception Handling Excercise]]&lt;br /&gt;
&lt;br /&gt;
[[http://pg-server.csc.ncsu.edu/mediawiki/index.php/CSC_216_F09/polymorphism_showdown Polymorphism Showdown]]&lt;br /&gt;
&lt;br /&gt;
==Exercises==&lt;br /&gt;
&lt;br /&gt;
===Inheritance===&lt;br /&gt;
&lt;br /&gt;
===GUIs===&lt;br /&gt;
&lt;br /&gt;
[http://pg-server.csc.ncsu.edu/mediawiki/index.php/CSC_216_F09/javicimo Javicimo]&lt;br /&gt;
&lt;br /&gt;
===[[CSC 216 F09/Data Structure Jeopardy|Data Structure Jeopardy]]===&lt;br /&gt;
&lt;br /&gt;
===[[CSC 216 F09/Who Wants to be a CSC Major|Who Wants to be a CSC Major]]===&lt;br /&gt;
&lt;br /&gt;
===[[CSC 216 F09/Interfaces1|Interfaces-Comparing Similarities Among Different Types of Objects]]===&lt;br /&gt;
&lt;br /&gt;
===[[CSC 216 F09/ActionListener|ActionListener Charades]]===&lt;br /&gt;
&lt;br /&gt;
[http://pg-server.csc.ncsu.edu/mediawiki/index.php/CSC_216_F09/ Recursion Exercise]&lt;/div&gt;</summary>
		<author><name>Djallred</name></author>
	</entry>
</feed>