May 13th 2016 Lesson Notes: Difference between revisions

From Computer Science Wiki
 
(6 intermediate revisions by the same user not shown)
Line 6: Line 6:


# You are going to plan and implement a move function in chess
# You are going to plan and implement a move function in chess
# If you did not take the pseudocode test, you must do this.


==[[file:homework.png]] What is your homework and when is it due ?==
==[[file:homework.png]] What is your homework and when is it due ?==


# It depends. If you do not finish this assessment, you must finish by the '''start of class on Friday'''.
# There is no homework.


</td>
</td>
Line 17: Line 18:
== [[File:planfortoday.png]] What is the actual plan? ==
== [[File:planfortoday.png]] What is the actual plan? ==


# We  will watch a video on sorting
<html>
# We will write a summative assessment.
<iframe width="420" height="315" src="https://www.youtube.com/embed/2e986xX25jY" frameborder="0" allowfullscreen></iframe>
</html>
# Watch my introduction video
# Send me a pastebin link with your code '''at the START of class'''
# Plan and implement your code
# Send me a pastebin link with your code (in canopy) '''at the END of class'''
 




Line 31: Line 38:
==[[File:target.png]] Is this graded? ==
==[[File:target.png]] Is this graded? ==


# your work will count towards a summative grade in some AtL's.
# your work will count towards a formative grade in some AtL's.


</td>
</td>
Line 45: Line 52:




* Identify the procedure appropriate to solving a problem. Level: 2
* Evaluate whether the order in which activities are undertaken will result in the required outcome. Level: 3
* Explain the role of sub-procedures in solving a problem. Level: 3
* Identify when decision-making is required in a specified situation. Level: 2
* Identify the decisions required for the solution to a specified problem. Level: 2
* Identify the condition associated with a given decision in a specified problem. Level: 2
* Explain the relationship between the decisions and conditions of a system. Level: 3
* Deduce logical rules for real-world situations. Level: 3
* Identify the inputs and outputs required in a solution. Level: 2
* Identify pre-planning in a suggested problem and solution. Level: 2
* Explain the need for pre-conditions when executing an algorithm. Level: 3
* Outline the pre- and post-conditions to a specified problem. Level: 2
* Identify exceptions that need to be considered in a specified problem solution. Level: 2
* Identify the parts of a solution that could be implemented concurrently. Level: 2
* Describe how concurrent processing can be used to solve a problem. Level: 2
* Evaluate the decision to use concurrent processing in solving a problem. Level: 3
* Identify examples of abstraction. Level: 2
* Explain why abstraction is required in the derivation of computational solutions for a specified situation. Level: 3
* Construct an abstraction from a specified situation. Level: 3
* Distinguish between a real-world entity and its abstraction. Level: 2
* Describe the characteristics of standard algorithms on linear arrays. Level: 2
* Outline the standard operations of collections. Level: 2
* Discuss an algorithm to solve a specific problem. Level: 3
* Analyse an algorithm presented as a flow chart. Level: 3
* Analyse an algorithm presented as pseudocode. Level: 3
* Analyse an algorithm presented as pseudocode. Level: 3
* Construct pseudocode to represent an algorithm. Level: 3
* Construct pseudocode to represent an algorithm. Level: 3
* Suggest suitable algorithms to solve a specific problem. Level: 3





Latest revision as of 08:10, 12 May 2016

Class plan.png What are we going to learn today?[edit]

  1. You are going to plan and implement a move function in chess
  2. If you did not take the pseudocode test, you must do this.

Homework.png What is your homework and when is it due ?[edit]

  1. There is no homework.

Planfortoday.png What is the actual plan?[edit]

  1. Watch my introduction video
  2. Send me a pastebin link with your code at the START of class
  3. Plan and implement your code
  4. Send me a pastebin link with your code (in canopy) at the END of class


Target.png Is this graded?[edit]

  1. your work will count towards a formative grade in some AtL's.

Ourstandards.png Standards we are covering today[edit]


  • Identify the procedure appropriate to solving a problem. Level: 2
  • Evaluate whether the order in which activities are undertaken will result in the required outcome. Level: 3
  • Explain the role of sub-procedures in solving a problem. Level: 3
  • Identify when decision-making is required in a specified situation. Level: 2
  • Identify the decisions required for the solution to a specified problem. Level: 2
  • Identify the condition associated with a given decision in a specified problem. Level: 2
  • Explain the relationship between the decisions and conditions of a system. Level: 3
  • Deduce logical rules for real-world situations. Level: 3
  • Identify the inputs and outputs required in a solution. Level: 2
  • Identify pre-planning in a suggested problem and solution. Level: 2
  • Explain the need for pre-conditions when executing an algorithm. Level: 3
  • Outline the pre- and post-conditions to a specified problem. Level: 2
  • Identify exceptions that need to be considered in a specified problem solution. Level: 2
  • Identify the parts of a solution that could be implemented concurrently. Level: 2
  • Describe how concurrent processing can be used to solve a problem. Level: 2
  • Evaluate the decision to use concurrent processing in solving a problem. Level: 3
  • Identify examples of abstraction. Level: 2
  • Explain why abstraction is required in the derivation of computational solutions for a specified situation. Level: 3
  • Construct an abstraction from a specified situation. Level: 3
  • Distinguish between a real-world entity and its abstraction. Level: 2
  • Describe the characteristics of standard algorithms on linear arrays. Level: 2
  • Outline the standard operations of collections. Level: 2
  • Discuss an algorithm to solve a specific problem. Level: 3
  • Analyse an algorithm presented as a flow chart. Level: 3
  • Analyse an algorithm presented as pseudocode. Level: 3
  • Construct pseudocode to represent an algorithm. Level: 3
  • Suggest suitable algorithms to solve a specific problem. Level: 3


Computer1.png As a computer scientist, you have[edit]

These are the characteristics every computer scientist works towards.

  • Confidence in dealing with complexity
  • Persistence in working with difficult problems
  • Tolerance for ambiguity
  • The ability to deal with open-ended problems
  • The ability to communicate and work with others to achieve a common goal or solution

Credit.png Credits[edit]