D.12: Algorithm Design

From

(Difference between revisions)
Jump to: navigation, search
(Resources for Algorithm Design)
(Resources for Algorithm Design)
Line 25: Line 25:
== Resources for Algorithm Design ==
== Resources for Algorithm Design ==
-
These are links to information about Algorithm Design:
 
-
 
-
[http://newterra.chemeketa.edu/faculty/mfry5/CS160/VTCS0/Algorithms/Lessons/index.html Online CS Modules: Algorithms]
 
-
 
-
[http://newterra.chemeketa.edu/faculty/mfry5/cs160/Labs/160-Lab06BKG.pdf Online CS Modules: Algorithms, Part 2]
 
-
 
-
[http://newterra.chemeketa.edu/faculty/mfry5/CS160/VTCS0/ProgrammingLanguages/Lessons/index.html Online CS Modules: Programming Languages]
 
-
 
-
[http://newterra.chemeketa.edu/faculty/mfry5/cs160/Labs/160-Lab07BKG.pdf Online CS Modules: Programming Languages, Part 2]
 
-
 
-
[http://newterra.chemeketa.edu/faculty/mfry5/CS160/VTCS0/SE/Lessons/index.html, Online CS Modules: Software Engineering]
 
-
 
-
[http://newterra.chemeketa.edu/faculty/mfry5/cs160/Labs/160-Lab08BKG.pdf Online CS Modules: Software Engineering, Part 2]
 
-
 
-
[http://newterra.chemeketa.edu/faculty/mfry5/CS160/VTCS0/DataStructures/Lessons/index.html Online CS Modules: Data Structures]
 
-
 
-
[http://newterra.chemeketa.edu/faculty/mfry5/cs160/Labs/160-Lab09BKG.pdf Online CS Modules: Data Structures, Part 2]
 
-
 
-
Note that all of the above links have related Problem Sets in Microsoft WORD format that can be accessed through Mitch Fry's CS 160 site:
 
-
[http://newterra.chemeketa.edu/faculty/mfry5/#]
 
[[media:QS-worksheet.doc | Worksheets for comparing and implementing Sorts with quiz. (Kathy Roberson)]]<br/>
[[media:QS-worksheet.doc | Worksheets for comparing and implementing Sorts with quiz. (Kathy Roberson)]]<br/>

Revision as of 15:15, 23 June 2011

Oregon Department of Education knowledge and skills for Algorithm Design

D.12 Algorithm Design: Understand methods of algorithm design and its relationship to data structures.

D.12.1 Design algorithms using recurrence or iteration.

D.12.2 Design algorithms using divide-and-conquer.

D.12.3 Design algorithms using recursion.

D.12.4 Evaluate the efficiency of an algorithm including the order of complexity of algorithms.

D.12.5 Demonstrate understanding of the relationship of set theory, relations, functions, combinatorics, sequences, series, graph theory, and matrices to the design of data structures and algorithms.

D.12.6 Demonstrate understanding of the relationship of data structures to the design of algorithms and use this understanding to analyze algorithms.

Discrete Math Learning modules

Introduction to algorithmic analysis and complexity (from Terrel Smith's class, MS-Powerpoint slide set)
Representing algorithms in PsuedoCode (MS-Word 2003 format)

Resources for Algorithm Design

Worksheets for comparing and implementing Sorts with quiz. (Kathy Roberson)



HS Discrete Math (CS0) top page


Personal tools
MediaWiki Appliance - Powered by TurnKey Linux