Embedded Files
Week 1: 10 - 14 January 2022
Week 1: 10 - 14 January 2022
Tuesday 11th January 2022
4.2.1 - Linear (sequential search)
4.2.1 - Binary Search
Wednesday 12th January 2022
4.2.1 - Bubble sort
Week 2: 17 - 21 January 2022
Week 2: 17 - 21 January 2022
Monday 10th January 2022
4.2.1 - Selection sort
Assignment - Searching & Sorting algorithms questions
Tuesday 11th January 2022
Wednesday 12th January 2022
4.2.3 - Discuss an algorithm to solve a specific problem
Thursday 13th January 2022
4.2.4 - Analyse an algorithm presented as a flowchart
4.2.5 - Analyse an algorithm presented as pseudocode
Friday 14th January 2022 (HL - only)
Period 3
7.1.7 - Compare a centrally controlled system with a distributed system
7.1.8 - Outline the role of autonomous agents acting within a larger system
Period 4 - IA
Week 3: 24 - 28 January 2022
Week 3: 24 - 28 January 2022
Tuesday 25th January 2022
4.2.8 - Deduce the efficiency of an algorithm in the context of its use
4.2.9 - Determine the number of times a step will be performed for given input data
Classwork - Algorithmic worksheet 1 - Analysis and design of algorithms
Homework - Algorithms homework 1 - Analysis and design of algorithms
Wednesday 26th January 2022
Web Science - C.2 - Searching the Web (C.2.1 - C.2.3)
Week 4: 31 January - 4 February 2022
Week 4: 31 January - 4 February 2022
Monday 31st January
Web Science - C.2.4 - Describe how a web crawler functions (bots, web-spiders, web-robots)
Tuesday 1st February
Web Science Option C
C.2.5 - Discuss the relationship between data in a meta-tag and how it is accessed by a web crawler
C.2.6 - Discuss the use of parallel web crawling
C.2.7 - Outline the purpose of web-indexing in search engines
Wednesday 2nd February
Test #5
4.2.1 - Describe the characteristics of standard algorithms on linear arrays.
4.2.2 - Outline the standard operations of collections.
4.2.8 - Deduce the efficiency of an algorithm in the context of its use.
4.2.9 - Determine the number of times a step in an algorithm will be performed for given input data.
Thursday 3rd February
Friday 4th February - HL only
Period 3 - Test on Topic 6 - Resource Management and Topic 7 - Control
Period 4 - Harder trace table question from HL May 2015 paper 1
Week 5: 7 - 11 February 2022
Week 5: 7 - 11 February 2022
Tuesday 8th February 2022
1.2 System Design Basics
1.2.4 - Identify the relevant stakeholders when planning a new system
1.2.5 - Describe the methods of obtaining requirements from stakeholders
Move Thinking procedurally here before structure charts in 1.2.7
1.2.7 - Construct suitable representations to illustrate system requirements
Assignment 1: Data flow diagram question
Assignment 2: Construct suitable representations to illustrate system requirements
Wednesday 9th February 2022
1.2.8 - Describe the purpose of prototypes to demonstrate the proposed system to the client
1.2.9 - Discuss the importance of iteration during the design process
1.2.10 - Explain the possible consequences of failing to involve the end-user in the design process
Assignment: Pseudocode algorithms - Searching & Sorting - M2014 P1 SL Q14
Solution - Pseudocode algorithms
Week 6: 14 - 18 February 2022
Week 6: 14 - 18 February 2022
Monday 14th February 2022
1.1 - Systems in Organisations
1.1.1 - Identify the context for which a new system is planned
1.1.2 - Identify the need for change management
1.1.3 - Outline compatibility issues resulting from situations including legacy systems or business mergers
Assignment - Pseudocode past questions
Tuesday 15th February 2022
1.1.4 - Software as a Service (SaaS)
1.1.5 - Alternative installation processes
Assignment - Pseudocode past question #2
Use Mat's p-code tool to test you pseudocode for parts (c) and d(ii)
Wednesday 16th February 2022
1.1.6 - Problems that may arise as part of data migration
1.1.7 - Suggest various types of testing
Revision 1.1.1-1.1.7 questions
Thursday 17th February 2022
Friday 18th February 2022 - HL only
Period 3 - Topic 5 - Abstract Data Structures (23 hours)
5.1.1 - Identify a situation that requires the use of recursive thinking
5.1.2 - Identify recursive thinking in a specified problem solution
5.1.3 - Trace a recursive algorithm to express a solution to a problem.
Week 7: 21 - 25 February 2022
Week 7: 21 - 25 February 2022
Tuesday 22nd February 2022
Assessment test #6: 4.2.1, 4.2.8, 4.2.9 + 1.2.8 to 1.2.10 + 1.1.1 to 1.1.7
Wednesday 23rd February 2022
IA lesson (3/30)
Ski-week holiday
Week 8: 7 - 11 March 2022
Week 8: 7 - 11 March 2022
Monday 7th March 2022
Systems in organisations - User focus:
1.1.8 - Describe the importance of user documentation
1.1.9 - Evaluate different methods of providing user documentation
1.1.10 - Evaluate different methods of delivering user training
Quizlet - section 1.1 - Systems in Organisations
Homework Assignment : Systems in organisations questions
Tuesday 8th March 2022
Operating systems and application systems
2.1.6 - Describe the main functions of an operating system
2.1.7 - Outline the use of a range of application software
2.1.8 - Identify common features of applications
Homework Assignment - Operating systems and application software
Wednesday 9th March 2022
2.1.9 - Define the terms: bit, byte, binary, denary/decimal, hexadecimal (Lesson 1 of 2)
Classwork - Google sheets - Binary to Denary conversion - self-marking spreadsheet
Homework - Worksheet - Binary to Denary conversion
Thursday 10th March 2022
2.1.9 - Define the terms: bit, byte, binary, denary/decimal, hexadecimal (Lesson 2 of 2)
Classwork - Binary, Denary & Hexadecimal worksheet
Homework Assignment - Python programs - Denary to Binary & Binary to Denary
Friday 11th March 2022 - HL only
Period 3 & 4: Topic 5 - Abstract data structures
5.1.4 - Describe the characteristics of a 2D array & 5.1.5 - Construct algorithms using 2D arrays
Week 9: 14 - 18 March 2022
Week 9: 14 - 18 March 2022
Tuesday 15 March
2.1.10 - Outline the way in which data is represented in the computer
Wednesday 16 March
Week 10: 21 - 25 March 2022
Week 10: 21 - 25 March 2022
Monday 21 March 2022
Simple Logic Gates: 2.1.11 - Define the Boolean operators: AND, OR, NOT, NAND, NOR and XOR
2.1.12 - Truth Tables using Boolean operators (Lesson 1)
Assignments: Truth tables (self-marking)
Truth tables - practice (classroom-multimedia - random questions)
Tuesday 22 March 2022
2.1.13 - Construct a logic diagram using AND, OR, NOT, NAND, NOR and XOR gates
Wednesday 23 March 2022
2.1.12 - Truth Tables using Boolean operators - (Lesson 2)
Assignments: Divisibility & Modulus - self-marking
Truth tables-Algorithms-Pseudocode-practice Markscheme
Thursday 24 March 2022
Starter - Truth tables and Trace tables questions
Friday 25 March 2022 (HL only)
Period 3 - No lesson: Careers morning
Period 4 - 5.1.6 - Discuss the characteristics and applications of a stack
5.1.7 - Construct algorithms using the access methods of a stack
Stacks 5.1.6 - 5.1.7. - presentation
Week 11: 28 March - 1 April 2022
Week 11: 28 March - 1 April 2022
Tuesday 29 March 2022
Web Science - C.3 - Distributed approaches to the Web (C.3.1 & C.3.2)
Wednesday 30 March 2022
Web Science - C.3 - Distributed approaches to the Web (C.3.3 & C.3.4)
Week 12: 4 - 8 April 2022
Week 12: 4 - 8 April 2022
Monday
Web Science - C.3 - Distributed approaches to the Web (C.3.5)
Tuesday
Web Science - C.3 - Distributed approaches to the Web (C.3.6 & C.3.7)
Wednesday
IA - Solution #6 of 30
Thursday
IA - Solution #7 of 30
Friday - HL only
Period 3 & Period 4
Read through the powerpoint presentation below. For the final two p-code examples from the book, check you understand the code. Different outputs will be generated every time example 12 is run.
5.1.8 & 5.1.9 - Describe the characteristics and applications of a queue, construct algorithms using the access methods of a queue
Download the past question and answer it - work in pairs.
Page updated
Google Sites
Report abuse