Searching and Sorting Assignment: Computer Science - Grade 12
Searching and Sorting Assignment: Computer Science - Grade 12
Assignments for the grade 12 Computer Science course will be more open ended and (hopefully) creative than the problem set
given in previous grades
In grade 10, you did the specific problems I set out for you (problem 1, problem 2, etc.)
In grade 11 you had more choice from a collection of problems to do whichever problem(s) you felt was best for your learning
Now, in grade 12, you will have even more choice as now I mostly want you to design your OWN problem(s) to demonstrate your
learning to me on the specific unit content
D ETAILS :
You should design your own programming problem to demonstrate the specific learning outcomes for this unit (see below)
The problem may have a specific purpose (like a hypothetical company you are programming for) or just simple unit content
examples
You may design one problem to demonstrate the unit learning outcomes, or several
You may make the problem have a simple input/output system (e.g. System.out.println() and Scanner input, or
simple JOptionPane dialogs) or a more complex GUI
You may even carry one problem over unit to unit expanding on it each time to demonstrate the unit learning outcomes and
resubmitting it with its modifications for marking after each unit (this may even be incorporated into your final project)
Options: if you do not wish to make programming problems, you may demonstrate your learning in these other ways:
- Review notes: create a set of study notes for the unit either by hand or typed - do not just recopy my notes, but create
summary notes
- Video Tutorials: create a video screencast tutorial example(s) of how to learn the specific learning outcomes for the
unit and upload this to youtube (or give Mr. Wachs the video file) – if you are unsure how to do this, please see Mr. Wachs
for suggestions for software, etc.
M ARKING :
I will use the same marking rubric matrix that I used through grade 10 and expanded on through grade 11
This includes all eleven domains in: problem solving, commenting, design, data structures, algorithms, methods, style, usability, error
handling, success, and holistic approach
The mastery factor I will apply will be dependent on the problem(s) you design and will increase or decrease based on factors like:
- How many unit learning outcomes you demonstrate (breadth of knowledge)
- How complex your demonstration of learning outcomes is (depth of knowledge)
- How detailed your overall solution is in terms of size (lines of code), design, and practicality (usability, realism, etc.)
- How creative your
problem(s) are
Your problem(s) that you designed for this unit should demonstrate the following:
1. Students demonstrate an efficient linear search algorithm (through a method or class interface)
2. Students demonstrate an efficient bubble sort algorithm (through a method or class interface)
3. Students demonstrate an efficient selection sort algorithm (through a method or class interface)
4. Students demonstrate an efficient binary search algorithm (through a method or class interface)
SEARCHING AND SORTING THURSDAY, OCTOBER 31, 2013 MR. WACHS: COMPUTER SCIENCE 40S