May 12th 2016 Lesson Notes: Difference between revisions

From Computer Science Wiki
(Created page with " __NOTOC__ <table cellspacing="10" style="width:100%;"> <tr> <td style="width:50%; margin:0; margin-top:10px; margin-right:10px; border:1px solid #dfdfdf; padding:0 1em 1em 1...")
 
Line 5: Line 5:
==[[File:class_plan.png]] What are we going to learn today?==
==[[File:class_plan.png]] What are we going to learn today?==


# You are going to review a very simple concept, [[pseudocode]].
# You are going to understand the advantages and disadvantages of networks [http://www.bbc.co.uk/education/guides/zh4whyc/revision click here]
# You will write a program for a robot to sort through a group of 10 numbers. The robot must sort the numbers from smallest to largest.
# You are going to learn about types of networks
#


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

Revision as of 08:48, 12 May 2016

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

  1. You are going to understand the advantages and disadvantages of networks click here
  2. You are going to learn about types of networks

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

  1. No homework today

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

  1. You will write a program for a robot to sort through a group of 100 numbers. The robot must sort the numbers from smallest to largest.
  2. We will write this in plain English (or rather, pseudocode) You should create a google document and share it with Mr. MacKenty (bmackenty@aswarsaw.org)
    1. Your code should have at least one verb from each command statement.
  3. If you would like to exceed the standard for this assessment, please also write a program which sorts through a list of 100 names and alphabetizes them.


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]