What we will do Today


Year 1 IB Record of topics covered / reviewed / Homework / Activities  

Please Ignore anything Below


We have now covered the IB content, please use today to revise for end of year exams. 

Week Starting 26 March 2018

Review answer to Winter Paper 1 2016 Click here  



Week Starting 05 March 2018

Wednesday

Option 7 Control Systems

1 Review Resource management

2 Students will understand how Control Systems Operate and typical componets

After class discussion complete past paper questions and post your answers to google class room Past Paper Questions

Neuron Networks Watch Before Friday click here 

Monday

Option 4 Review Pseudo code  / flow chart exercises /

Complete exercises / practice  use IB approved notation click here upload solution to exercise B to google classroom for grading.

High Level Students

answer the review questions in section below, post answers to your blog complete by Thursday 8th March.  

Review Resource management Section Review Questions


Wednesday

Control systems click here

Week  9 Feb 26

HL IB Students Wed Option 7 Control Systems

Option 4 Review Pseudo code  / flow chart exercises / practice 

Week  5 Feb 5

Monday 2.1.1 2.1.2

Week  4 Jan 29

Friday

Exit Skills Define dynamic data structure and compare with static. Insert and delete from binary tree.

Exam Question Review and Answer sheets 

SL and None Ib please click here


Monday 2.1.1 2.1.2

Exit Skills Explain the use of primary memory, define terms RAM ROM and explain the difference between RAM and ROM


Wednesday

Quiz ​Assessment on Computer Architecture click here and enter  967-126

Exit Skills Every one can describe the properties of  arrays and linked lists and understand the advantages and disadvantages of each data structure

May 2014 Past Paper click here - Record the questions and answers in your Blog - Only answer the following: 

  • All of section A
  • Section B Q 12
  • Section B Q14

HL Section

Students will be able to 

  • 5.1.11 Describe the features and characteristics of a dynamic data structure.
  • 5.1.12 Describe how linked lists operate logically
  • 5.1.13 Sketch linked lists (single, double and circular).
  • Describe the features and characteristics of a dynamic data structure.

Tree Traversal Click here 

When above COMPLETE do May 2014 Past Paper click here - Record the questions and answers in your Blog - Only answer the following: 



Week  3 Jan 22

Monday

Review Computer Architecture  click Here and Click Here the Instruction Cycle

Wednesday

Start of class Wed give a 2 minute presentation/explanation of the following Whiteboard and marker and notes only   

Jimmy June

What is the operating Systems

Willy Gavin

The Instruction Cycle

Pete Vatsin

Different types of memory within a computer and  how they are used 

Complete Teacher Review Link on Google Classroom  ( be nice)

Ensure you have given me a copy of your IA  ( you may tidy in remainder of class) 

IF IA has been submitted then review in class or for homework 

Friday

Please upload the answer to the question section to your blog , will be graded on Monday so have weekend if needed to complete

IB Further

Please upload a screen shot of your parsing algorithm,  it will be graded on Monday so have weekend if needed to complete

Semester 1 Part 2

In Progress

TODO

Reviewed

Week  2 Jan 15

Mon

Complete Friday's activity,

5.1.4 Describe the characteristics of a two dimensional array click here and then select 5.1.4 from table of contents. Start on Recursion select 5.1.2

if complete work on peer to peer assessment of IA please

Wed

Everyone:  Review basic memory architecture.  Activity Describe the terms paging virtual memory and segmentation. Upload this to your blog

Further : Abstract Data  select from content table 5.1.14 - 5.1.17 Trees Binary and Non Binary and work through the material.

Activity Binary Tree Questions ( upload answers to your blog )

Fri

HL Only 5.1.2 Identify recursive thinking in a specified problem solution Complete Activities 1,A,B and C click here

Non HL Complete Peer to peer marking

Week 1 Jan 8

Mon

Holiday



Wed

Peer Review of IA and if not already completed look at multidimensional arrays in PHP Click here

Fri

5.1.4 Describe the characteristics of a two dimensional array click here and then select 5.1.4 from table of contents. Start on Recursion select 5.1.2

Week 18 11 Dec

Mon

Multidimensional arrays in PHP Click here



Wed

Fri

IA

Independent Work

Week 17  04 Dec

Mon

Holiday



Wed

Multidimensional arrays in PHP Click here

Create a form that allows Well's students to register for after class activities. Collect the following, student name, ID, email and the after class activity ( limited to 1 activity) ( use a drop down menu ). How can we record the user input ? Click here

Fri

IA

Independent Work

Week 16  27 Oct

Mon

Revision Time Exam Wednesday



Wed

Exam

4.2.4/42/5 Analyse an algorithm presented as a flow chart and psuedocode

Fri

IA

Independent Work

Week 15  20 Oct

Mon

Task select 1 topic related to computer security spend 10 mins researching so that you can explain to everyone in the class ( without prompts 2 minutes maximum)



Wed

Forms in HTML  and Calling a PHP program click here

4.2.4/42/5 Analyse an algorithm presented as a flow chart and psuedocode

Fri

IA

Independent Work

Week 14   11 Oct

Mon

Using Login details in email login to ibcomputerscience.xyz and create a new post with 3 sections. The first section of your post should describe the difference between HTML and XML.  The second section of your post should contrast and compare  CSS and  XSLT. 

Your post should be formatted using  appropriate html tags use a minimum of 5 different HTML tags and describe these ins section 3  


Wed

Quadratic Time Algorithms ( nested loops ) and more Click Here

4.2.4/42/5 Analyse an algorithm presented as a flow chart and psuedocode

Fri

IA

Independent Work

Week 13   6 Oct

Mon

IA


Wed

Option 4.2.4 &4.2.5 Analyse an algorithm presented as a flow chart Click Here if complete try nested loops  Click Here

4.2.4/42/5 Analyse an algorithm presented as a flow chart and psuedocode

Fri

IA

Independent Work

Independent Work

Week 12   30 Oct

Mon

4.2.7 FCER Click Here 

4.2.3 Click here and complete Challenge A only


Wed

Option 2.1.11 2.1.13  Logic Gates Click Here  and complete challenges then post to your google site title page  "Option 2 Logic Gates" or similar

2.1.11-2.1.13 Logic Gates

Fri

Problem solving and testing  Please Click Here

Independent Work

Independent Work

Midterm Exam on Wed 18th Oct : In Preparation Review

Week 11   16 Oct

Mon

What are Algorithms ?  Click here 

4.2.7 FCER Click Here 

4.2.3 Click here and complete Challenge A only

Wed

Midterm Exam

Fri

IA

Independent Work

Week 9   02 Oct

Mon

NEXT Efficiency, Tracing Algorithms in Pseudo Code Click here  Post solutions to Activity C & D to Google Classroom

What are Algorithms ?  Click here 

Wed

4.2.9 Iterations Click here to set up up XAMPP then Click here for todays Activity on Iterations

4.2.7 FCER Click Here 

Fri

IA

Independent Work


Week 8   25 Sep

4.2.8 Deduce Efficiency

4.2.6 Construct Pseudo Code

5  Parts of 5 HL Thinking Abstractly

Mon

Class presentations Web Science

Wed

Everyone attempt again the flow chart parsing algorithm TASK2 ( This time assume you have a stack data structure with push and pop and  2 arrays, Opening.List[...] containing list of opening bracket and Closing.List holding the closing brackets ) keep to IB notation Click Here Post Solutions to google classroom

NEXT Tracing Algorithms in Pseudo Code  Click here  

What are Algorithms ?  Click here 

4.2.6 Construct Pseudo Code

4.2.8 Deduce Efficiency

Fri

IA

Independent Work

Preparation / Home work for Next Week


Week 7   18 Sep

4.2.8 Deduce Efficiency

4.2.6 Construct Pseudo Code

5  Parts of 5 HL Thinking Abstractly

Mon

PD Day no School

Wed

4.2 Abstraction / Collections / Pseudo Code  Click here  

What are Algorithms ?  Click here 

Fri

IA

Independent Work

Preparation / Home work for Next Week


Week 6   11 Sep

Mon

4.1 Online Interaction Click here

Wed

C4 The evolving Web Click Here for Instructions



Fri

IA

Independent Work

Week 5   04 Sep

4.2.1 Searching, sorting and other algorithms on arrays

Mon

Summative Assessment ( Web Searching and the Cloud )

Wed

Review searching click here . Activity on Khan Academy ( do not complete the challenge, but do complete the quiz) Click here 

Sorting Click here

Big O Notation Click here

Completed ? Start on C.1.2 the evolving web click here



Fri

IA

Independent Work

Week 4   28 August

4.2.1 Searching, sorting and other algorithms on arrays

Mon

Pseudo Code and Linear Searching Click here

Selection Activity color cards and food

Wed

Linear and Binary Searching Click Here When Complete Click here for Khan Academy activity You do not need to complete the Challenge, but do complete the Quiz . Big O simplified Click here

Presentation on Cloud Computing 

Fri

IA

Independent Work

Week 2  14th August

Mon

Wed

Frid

Covered 

Weekly Task Pseudo Code

Reviewed and  Started C.2.1 - C.2.12 

Review Prev Learning / IA Independent work

Activities 

Create Presentation  C.2.1 - C.2.12 ( 5 mins ) Due 18th August

Comments

Record of topics covered / reviewed / Homework / Activities  

Week 3  21 August

Mon

Wed

Frid

Covered 

IA

Complete C.2.10 - C.2.12 

Start  C.4 ( evolving Web)

Activities 

Join link  to quizelet https://quizlet.com/join/tA72weyqx

Complete by 23rd August . Exercise please click here

Comments

Week  1  

Mon

Wed

Frid

Covered 

Weekly Task Pseudo Code

Reviewed and  Started C.2.1 - C.2.12 

Review Prev Learning / IA Independent work

Activities 

Create Presentation  C.2.1 - C.2.12 ( 5 mins ) Due 18th August

Comments

Scroll to Top