(F) identify, trace, and Select One: Select One: appropriately use recursion in Remember Observed programming solutions, including Understand Partially Observed algebraic computations; Apply Apply Not Observed Analyze Where: Evaluate Create (G) design, construct, evaluate, Select One: Select One: and compare search algorithms, Remember Observed including linear searching and Understand Partially Observed binary searching; Analyze Apply Not Observed Analyze Where: Evaluate Create (H) identify, describe, design, Select One: Select One: create, evaluate, and compare Remember Observed standard sorting algorithms, Understand Partially Observed including selection sort, bubble Create Apply Not Observed sort, insertion sort, and merge sort; Analyze Where: Evaluate Create (I) measure time/space efficiency Select One: Select One: of various sorting algorithms; Remember Observed Understand Partially Observed Apply Apply Not Observed Analyze Where: Evaluate Create
(F) identify, trace, and appropriately use recursion in programming solutions, including algebraic computations; Apply Select One: Remember Understand Apply Analyze Evaluate Create Select One: Observed Partially Observed Not Observed Where: (G) design, construct, evaluate, and compare search algorithms, including linear searching and binary searching; Analyze Select One: Remember Understand Apply Analyze Evaluate Create Select One: Observed Partially Observed Not Observed Where: (H) identify, describe, design, create, evaluate, and compare standard sorting algorithms, including selection sort, bubble sort, insertion sort, and merge sort; Create Select One: Remember Understand Apply Analyze Evaluate Create Select One: Observed Partially Observed Not Observed Where: (I) measure time/space efficiency of various sorting algorithms; Apply Select One: Remember Understand Apply Analyze Evaluate Create Select One: Observed Partially Observed Not Observed Where:
High%20School%20TEKS%20Alignment%20Resource%2FTechnology%20Applications%2FComputerScienceIITEKS2012-13.docx