Binary Search Algorithm - Theory and Programming

Learners are introduced to theory (including mathematical concepts) , design and programming using VB.NET and Python. An exciting and in-depth look at Binary Search algorithm as used in computer programming. 2-6 hours of lessons. The resource also comes complete with VB.NET project files and Python scripts. This is suitable for A Level Computing or any other Level 3 computing course. Can also be used for GCSE computing.

40 Page detailed handout containing theory, explanations and code listings.

This is a self-contained learning material and can be given to students who can then work independently. Can be used for 2-6 hours of learning. Alternatively handouts can be used by teacher to guide students step by step depending on ability.

The document is organised into two main sections:

1. Section 1 - Learners are introduced to the theory underpinning Binary Search. Learners create a number guessing game in VB.NET / Python to help understand the concepts behind Binary Search. This is very useful for beginners new to algorithms. Program teaches, selection and iteration. Typically section 1 can be used for a 2 hour lesson and learners enjoy creating the program and learning about the theory behind binary search.

2. Learners understand how Binary Search works . Learners then create a Binary Search program in VB.NET / Python. Learners use Arrays and learn selection and iteration. There is an advanced implementation using Lists which can be used to introduce lists, sub procedures and functions. Typically section 2 can be used for a 2 hour lesson.

The handout comes with all the Microsoft Visual studio 2013 projects created using VB.NET and Python script files created using IDLE. There is a stronger emphasis on VB.NET.

There are 7 VB.NET projects associated with this handout. Two of these are for teacher use but learners can implement these also in addition to the 5 other projects.

There are 2 Python scripts.

Abrar Hamid
abrar.hamid@stcg.ac.uk