Page 2 – Computer Science Education Blog

CS00 and CS01 courses available for free

Posted on October 23, 2014October 24, 2014 by benjamin

KTByte is proud to release its self guided CS00 and CS01 computer science classes for free to students worldwide. The online courses are interactive, self guided, and include 200 problems each. [ . . . ]

KTByte Fall Registration

Posted on August 2, 2014 by admin

Blog | Unsubscribe Like Tweet KTByte Computer Academy Please feel free to forward this newsletter to friends and family. Fall Registration Fall classes begin on September 7th, with [ . . . ]

How to connect Windows 8 or 8.1 to an AR-Drone 1.0

Posted on June 30, 2014 by admin

AR-Drone 1.0 uses ad-hoc wifi, which Windows 8 does not provide a graphical way to connect to. Here’s how you connect Windows 8 or 8.1 to any ad-hoc network, including the quadcopter. [ . . . ]

3 coding puzzles 100% of a middle school class got, versus 50% of interviewees

Posted on June 17, 2014June 17, 2014 by admin

Skip down to the end if you just want interview prep suggestions. There’s a lot of debate as to whether algorithms interview questions are effective. However, sometimes coding questions provide [ . . . ]

KTByte June Newsletter

Posted on June 17, 2014 by admin

Blog | Unsubscribe Like Tweet KTByte Computer Academy KTByte congratulates the 5 students who made it through USACO (USA Computing Olympiad – similar to Math Olympiad), who placed in the [ . . . ]

Mergesort for Processing and Processing.js

Posted on June 15, 2014 by admin

Since Processing.js does not support Java’s Arrays.sort or Collections.sort, I recommend writing your own sort. Here’s an example mergesort:

class Inters {
 float ang = random(0,10);
}

void setup() {
 ArrayList&lt;Inters&gt; x = new ArrayList&lt;Inters&gt;();
 for(int i = 0 ; i &lt; 20; i++) x.add(new Inters());
 mergesort(x);
 for(int i = 0; i &lt; x.size(); i++) println(x.get(i).ang);
}

void mergesort(ArrayList&lt;Inters&gt; inters) {
 if(inters.size() &lt;= 1) return;

 ArrayList&lt;Inters&gt; left = new ArrayList&lt;Inters&gt;();
 ArrayList&lt;Inters&gt; right = new ArrayList&lt;Inters&gt;();
 for(int i = 0 ; i &lt; inters.size(); i++) {
   if(i &lt; inters.size() / 2) left.add(inters.get(i));
   else right.add(inters.get(i));
 }

 mergesort(left);
 mergesort(right);

 for(int i=0,j=0,k=0; i &lt; inters.size(); i++) {
   if(k &gt;= right.size() || (j &lt; left.size() &amp;&amp; left.get(j).ang &lt; right.get(k).ang)) {
     inters.set(i, left.get(j++));
   }else {
     inters.set(i, right.get(k++));
   }
 }
}

class Inters {

float ang = random(0,10);

}

void setup() {

ArrayList<Inters> x = new ArrayList<Inters>();

for(int i = 0 ; i < 20; i++) x.add(new Inters());

mergesort(x);

for(int i = 0; i < x.size(); i++) println(x.get(i).ang);

}

void mergesort(ArrayList<Inters> inters) {

if(inters.size() <= 1) return;

ArrayList<Inters> left = new ArrayList<Inters>();

ArrayList<Inters> right = new ArrayList<Inters>();

for(int i = 0 ; i < inters.size(); i++) {

if(i < inters.size() / 2) left.add(inters.get(i));

else right.add(inters.get(i));

}

mergesort(left);

mergesort(right);

for(int i=0,j=0,k=0; i < inters.size(); i++) {

if(k >= right.size() || (j < left.size() && left.get(j).ang < right.get(k).ang)) {

inters.set(i, left.get(j++));

}else {

inters.set(i, right.get(k++));

}

KTByte Biz & Tech Contest Community Voting

Posted on June 11, 2014June 11, 2014 by admin

Vote your favorite project Actions by Ewen : http://appshowcase.mooo.com/projects/216/ Edu Game by Kevin : http://appshowcase.mooo.com/projects/223/ Moving to objects using color detection by Sky : http://appshowcase.mooo.com/projects/225/ Rubicon by Alex, Luke, Kenneth [ . . . ]