# UNDERSTANDING COMPUTATIONAL PROBLEM, ALGORITHMS WITH JAVA

The conceptual and contextual model for understanding and solving computational problems with algorithm and Java

While we understand the concepts and context of programming languages, we often tend to encourage ourselves and other learners to dive into programming straightaway without understanding the programming principles well. This may be so due to lack of a directive system or a way to understand the principle. This paper, however, tends to provide a guiding system for learners to learn programming or algorithm well by following a model known as “a conceptual and contextual model” for understanding the world problems as being a computational problem affecting the algorithm design and implementation. This model aims to provide improvement in understanding the concept or principle of programming practices and applications. The model models the world problems in terms of vectors in the space that scale up with time in different dimensions. The dimension spectrum indicates the complexity of the problems that scale up from simple problems in the subspace to the complex problems in the whole space with time. The simple is modelled to be in the subspace whereas the complex ones modelled to be in the whole space. For example, smaller problems may be found at a point, 1D….in a straight line and complex problems are found in the 2D, 3D, up to some n for a deterministic system or to the infinity ∞ for non-deterministic system. The spectrums of the problems are the reason for the need of data structure such as sets, lists, dictionary, arrays to solve the computational in different dimension as done in some of the machine learning algorithms. For example, multidimensional array may be required as solve complex problem in the whole space as opposed to single dimensional arrays that may be required to solve problems in lower dimensions. Array of arrays may be needed to solve complex problems, whereas small problems may be manipulated and solved by using other primitives and variables without the need of many or single sets of data. This is how this model may help us think and reason out how design and implement algorithm to solve the world computational problems.

What you’ll learn

• Introduction to the birth of Science and Technology & the computational problem.
• The algorithm and the model for solving computational problem.
• Building a Linear model for solving computational problem.
• Practical observation and application of the model for solving computational problems.
• Understanding knowledge and Algorithms.
• Humans Vs Algorithms and the Computer System.
• How to build an algorithm (A program or computer system).
• Understanding what computer is all about.
• How does a computer do the tasks (what we give it to do)?.

Course Content

• Introduction –> 4 lectures • 22min.
• Introduction to the birth of Science and Technology & the computational problem –> 3 lectures • 24min.
• The algorithm and the model for solving computational problem –> 4 lectures • 40min.
• Building a Linear model for solving computational problem –> 4 lectures • 29min.

Requirements

While we understand the concepts and context of programming languages, we often tend to encourage ourselves and other learners to dive into programming straightaway without understanding the programming principles well. This may be so due to lack of a directive system or a way to understand the principle. This paper, however, tends to provide a guiding system for learners to learn programming or algorithm well by following a model known as “a conceptual and contextual model” for understanding the world problems as being a computational problem affecting the algorithm design and implementation. This model aims to provide improvement in understanding the concept or principle of programming practices and applications. The model models the world problems in terms of vectors in the space that scale up with time in different dimensions. The dimension spectrum indicates the complexity of the problems that scale up from simple problems in the subspace to the complex problems in the whole space with time. The simple is modelled to be in the subspace whereas the complex ones modelled to be in the whole space. For example, smaller problems may be found at a point, 1D….in a straight line and complex problems are found in the 2D, 3D, up to some n for a deterministic system or to the infinity ∞ for non-deterministic system. The spectrums of the problems are the reason for the need of data structure such as sets, lists, dictionary, arrays to solve the computational in different dimension as done in some of the machine learning algorithms. For example, multidimensional array may be required as solve complex problem in the whole space as opposed to single dimensional arrays that may be required to solve problems in lower dimensions. Array of arrays may be needed to solve complex problems, whereas small problems may be manipulated and solved by using other primitives and variables without the need of many or single sets of data. This is how this model may help us think and reason out how design and implement algorithm to solve the world computational problems.

Get Tutorial