Description:This is an advanced course for computer science programming or computer engineering. It can also be used in an advanced math class for grades 11 and 12.
The unit deals with different algorithms and problem solving techniques. Plus, it contains a lot of information about various kinds of sorting algorithms.
Each lesson contains a problem set along with a solution set--useful for improving problem solving and testing skills.
The basic prerequisites of the course are as follows:
1. Knowledge of any one programming language like (C, C++,Java)
Description:This is a Teacher/Student Manual for the Algorithm unit. Students and teachers both will get basic guidelines for using this unit in the most efficient way.
Description:This lesson is an introduction to algorithms. It includes a brief history of algorithms and outlines the topics covered throughout the remainder of the unit. The lesson contains examples and a problem set with solutions that can be used by students as an introductory exercise.
Description:This lesson is about the divide and conquer method of problem solving. It includes examples to help you understand the topic. A problem set with solutions is provided for further practice.
Description:In this lesson, students will learn about the dynamic programming technique. It includes examples to help you understand the topic. A problem set with solutions is provided for further practice.
Description:This lesson explains the different types of sorting algorithms and how to differentiate them on the basis of time complexity, running time, space consumption, etc. Students can easily remember and memorize these things using the notes file attached inside this lesson.
