Daily note for IB Year 2 Standard Level Computer Science

Block 1, Room C152


Thursday 19 November 2020

 

Daily Note

The plan for our class:

  1. Hello. My daughter is home sick, so I am home with her. I will not zoom with you today. Please be on your best behavior. Anyone wearing socks today is awarded 5 Mr. MacKenty points, anyone with green socks is awarded an additional 5 Mr. MacKenty points (there can be any green anywhere on the sock). If anyone has decorative socks (the substitute alone shall determine if a sock is decorative) please award 5 additional Mr. MacKenty points. So if one of you is wearing a green christmas tree socks, you'd be up for 15 Mr. MacKenty points. 
  2. If you haven't turned in your homework for system fundamentals, please do this soon.
     
  3. Please read the daily bulletin for today. 
     
  4. Please read the testing schedule for todayToday is a testing day 2
     
  5. We are going to split the class between HL and SL today. Please read the instructions below: 
     
    1. IF YOU ARE AN SL STUDENT, please review the following wiki pages. There are questions on almost all the pages. On a google document, please write one quiz question for each topic, and provide an answer. This means you should have 9 questions and 9 answers. Please share this with me by the end of class today. 
      1. Thinking procedurally

        1. Procedural thinking

        2. Evaluating process

        3. Sub-process

      2. Decisions

        1. Decisions

      3. Thinking logically

        1. Logical rules

      4. Thinking ahead

        1. Inputs and outputs

        2. Pre-conditions

        3. Exceptions

      5. Thinking concurrently

        1. Concurrency

    2. IF YOU ARE AN HL student: please review the following standards.  On a google document, please write one quiz question for any 9 topics and provide an answer. This means you should have 9 questions and 9 answers. Please share this with me by the end of class today. The page to rememeber abstract data structures can be found here
      ​​​​​​​
      1. Identify a situation that requires the use of recursive thinking.
      2. Identify recursive thinking in a specified problem solution.
      3. Trace a recursive algorithm to express a solution to a problem.
      4. Describe the characteristics of a two- dimensional array.
      5. Construct algorithms using two- dimensional arrays.
      6. Describe the characteristics and applications of a stack.
      7. Construct algorithms using the access methods of a stack.
      8. Describe the characteristics and applications of a queue.
      9. Construct algorithms using the access methods of a queue.
      10. Explain the use of arrays as static stacks and queues.
      11. Describe the features and characteristics of a dynamic data structure.
      12. Describe how linked lists operate logically.
      13. Sketch linked lists (single, double and circular).
      14. Describe the characteristics and applications of a collection.
      15. Construct algorithms using the access methods of a collection.
      16. Discuss the need for sub-programmes and collections within programmed solutions.
      17. Construct algorithms using pre-defined sub-programmes, one-dimensional arrays and/or collections.
      18. Describe how trees operate logically (both binary and non-binary).
      19. Define the terms: parent, left-child, right-child, subtree, root and leaf.
      20. State the result of inorder, postorder and preorder tree traversal.
      21. Sketch binary trees.
      22. Define the term dynamic data structure.
      23. Compare the use of static and dynamic data structures.
      24. Suggest a suitable structure for a given situation.
         
    3. All questions via our class discussion board please

Your homework for today: 

  1. All homework is on Google classroom 

 

​​​​​​​

 

A little less comfortable

 

A little more comfortable

 

Our Big idea

The big idea for today is System fundamentals.

The essential questions for this topic are:

How do you design a system so it works really well for your client or customer?

It takes time to explore and really understand a big idea. If you want to
learn more about system fundamentals (which is connected to today's daily note), please click here.



 

Links

Zoom Link for our class: https://zoom.us/j/7430326991

Google classroom: here
Syllabus: Click here
All daily notes: Click here

Covid-testing link: Click here
High school bulletin: Click here
Current event activity: Click here




 

Tags

 

Reminders & routines:

IF today ==  testing_day_for_me:
     remember to go get tested!

IF today == first_period_of_day:
    read_daily_notes

IF today == Friday:
    current_event_protocol()

 

Please read and follow these reminders:

  1. Always start every class by reading our daily note

  2. Please check now: is visual studio code working from my programming folder?