32_Lesson_plan_V2_Computer Science_10_Revision

  • docx
  • 02.05.2020
Публикация на сайте для учителей

Публикация педагогических разработок

Бесплатное участие. Свидетельство автора сразу.
Мгновенные 10 документов в портфолио.

Иконка файла материала 32_Lesson_plan_V2_Computer Science_10_Revision.docx

Long term plan unit:

School:

Data:

Teacher’s name:

Class:

The number of attendees:

absentees:

Lesson theme

Sorting methods

Learning objectives that are achieved in this lesson (Subject Programme ref)

 10.5.1.4 apply sorting algorithms to solve applied problems

Lesson objectives

Implementation of Insertion and Bubble sorting algorithms

Write an algorithm to implement an insertion and bubble sort

Evaluation criteria

·     Know the complexity of sorting algorithms.

·     Compare the insertion and bubble sort algorithms

·     knows types of sorting algorithms

·     can create an algorithm of bubble sort

·     uses flowcharts to create algorithms

Language objectives

 

Learners able to

·         State what is the complexity of sorting  algorithm

·         Describe the processes of insertion and bubble sorting

 

Vocabulary and terminology specific to the subject:

Ordered list, unordered list, entry, iteration

 

Useful expressions for dialogs and letters:

Well, the complexity of an algorithm represented by … .

For example, the logic of swops has its own   … .

Obviously, the sorted data of great convenience for  … .

 

Cultivating values

collaboration, mutual respect, academic honesty, perseverance, responsibility, lifelong learning

Cross curricular links

English, Math

Prior knowledge

 

Types of data: numeric, alphanumeric; an array structure. Basics of programming like comparison and conditions, loops.

 Insertion sort, Bubble sort

During the classes

Planned stages of the lesson

Planned activities in the classroom

Resources

Beginning

4 min

 

 

 

 

 

4 min

 

 

 

 

 

 

 

 

 

 

12 min

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Students are divided into two groups and briefly explain the following points

1-group describes the bubble sort algorithm.

2-group describes the insertion sort algorithm.

Students work in pairs

1.      You must build binary tree:

{7, 3, 5, 2, 8, 1, 6, 10, 9, 4, 11}        

 

2.      Using “bubble sort” algorithm sort the following array.                                                                                                                                            [2]           

3

10

2

1

0

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Fill in the elements of the flowchart and write code on it

 

 

Presentation

Middle

18 min

 

 

 

 

 

 

 

 

 

Prepare tasks for solving problems using sorting.

 

1. Given an array of size N and integers K and L (1≤K≤L≤N). Find the sum of array elements with indices from K to L inclusive.

2. Given an array of size N. Find two neighboring elements whose sum is maximal, and output the indices of these elements.

3. Given an array of size N. Find the indices of those elements of the array that are larger than its right neighbor, and the number of such elements. The indices found are displayed in the order of their increase.

 

Homework

4. Given an array of size N. Find the index of its first local minimum (the local minimum is an element that is smaller than any of its neighbors).

5. Given an array of size N. Find the number of its last local maximum (the local maximum is an element that is larger than any of its neighbors).

6. Given an array of N. Find the second maximum element of the array

 

 

 

End

2 min

Reflections

 

I know

Was studied today

Need to remember

  •  
  •  
  •  
  •  
  •  

 

Differentiation - how do you plan to provide more support? What tasks do you plan to put before more able learners?

Evaluation - how do you plan to check the level of mastering the material by learners?

Health and safety practices


Differentiation can be expressed in the selection of tasks, in the expected result from a particular student, in the provision of individual support to the student, in the selection of educational material and resources taking into account the individual abilities of students (Gardner's theory of multiple intelligence).

Differentiation can be used at any stage of the lesson, taking into account the rational use of time.

Use this section to record the methods that you will use to assess what students have learned during the lesson.

Health-saving technologies.

Used body and physical exercises.

Points applied from the Safety Rules in this lesson.

Reflection on the lesson

 

Were the goals of lesson/ learning objectives realistic?

Have all the students reached the LO?

If not, why?

Is the differentiation done correctly in the lesson?

Were the time stages of the lesson sustained?

What were the deviations from the lesson plan and why?

Use this section to reflect on the lesson. Answer the most important questions about your lesson from the left column.

 

Overall assessment

 

What two aspects of the lesson went well (think about both teaching and learning)?

1:

 

2:

 

What could help improve the lesson (think about both teaching and learning)?

1:

 

2:

What I found during the lesson related to the class or the achievements / difficulties of individual students, what should I look for in subsequent lessons?

 


 

Скачано с www.znanio.ru

Посмотрите также