A level Paper 4 practical programs

The aim and the purposes of this course to enable students to develop practical approach in following topics:

19 Computational thinking and problem-solving : Algorithms and Recursion

20 Further programming :   Object-Oriented Programming (OOP)

19.1 Algorithms:

• Write an algorithm to implement a linear search

• Write an algorithm to implement a binary search

• The conditions necessary for the use of a binary search 

• How the performance of a binary search varies according to the number of data items 

• Write an algorithm to implement an insertion sort

• Write an algorithm to implement a bubble sort

• Performance of a sorting routine may depend on the initial order of the data and the number of data items 

• Write algorithms to implement, find, insert and delete an item in linked list

• Write algorithms to implement, find, insert and delete an item in binary tree

• Write algorithms to implement, find, insert and delete an item in stack

• Write algorithms to implement, find, insert and delete an item in queue

• Show understanding that a graph is an example of an ADT. 

• Describe the key features of a graph and justify its use for a given situation Candidates will not be required to write code for this structure. 

• Describe the following ADTs and demonstrate how they can be implemented from appropriate builtin types or other

ADTs: stack, queue, linked list, dictionary, binary tree 

• Including use of Big O notation to specify time and space complexity 

19.2 Recursion: 

• Essential features of recursion. 

• How recursion is expressed in a programming language. 

• Write and trace recursive algorithms 

• When the use of recursion is beneficial

• Use of stacks and unwinding 

20 Object Oriented Programming (OOP): 

• understanding of the terminology associated with OOP (including objects, properties, methods, classes, inheritance,

• polymorphism, containment (aggregation), encapsulation, getters, setters, instances 

• understanding of how to solve a problem by designing appropriate classes 

• understanding of and ability to write code that demonstrates the use of OOP