CT.L3B-03
http://drupdev.csc.villanova.edu/csta7/?q=taxonomy/term/61/all
enArrays Lesson Plan
http://drupdev.csc.villanova.edu/csta7/?q=node/1066
<div class="field field-name-field-description field-type-text-long field-label-above"><div class="field-label">Description: </div><div class="field-items"><div class="field-item even">This is a sample lesson plan and assignment for teaching arrays. This was part of a lesson plan assignment of mine for my CS AQ. I learned how to program by taking working video games and enhancing them. Many students will likely learn the same way. Resources for source code are given in the Word doc.</div></div></div>Fri, 04 Jul 2014 01:26:55 +0000kambagiri1066 at http://drupdev.csc.villanova.edu/csta7Cache-Oblivious Computations: Algorithms and Experimental Evaluation
http://drupdev.csc.villanova.edu/csta7/?q=node/1059
<div class="field field-name-field-description field-type-text-long field-label-above"><div class="field-label">Description: </div><div class="field-items"><div class="field-item even">Discussion based on techniques and analysis for handling massive data sets. Analysis of algorithms is discussed from the perspective of I/O complexity and the cache-oblivious model. Related topics include the Longest Common Subsequence problem, recursion, bioinformatics, priority queue, heaps and Gaussian Elemination. This is a very mathematical treatment.</div></div></div>Fri, 04 Jul 2014 01:06:23 +0000kambagiri1059 at http://drupdev.csc.villanova.edu/csta7