OUTLINE OF ALGORITHMICS

We have already mentioned that not every problem has an algorithmic solution. The problem, which has at least one algorithmic solution, is called algorithmic or computable problem. Also, we should note that there is no systematic method (i.e., algorithm) for designing algorithms even for algorithmic problems.

BUILDING BLOCKS OF ALGORITHMS

Next, we enumerate the basic actions and corresponding instructions used in a
computer system based on a Von Neuman architecture. We may recall that an
instruction is a notation for an action and a sequence of instructions defines a
program whereas a sequence of actions constitutes a process. An instruction is also
called a statement.

PROBLEMS, AVAILABLE TOOLS & ALGORITHMS

In order to explain an important point in respect of the available tools, of which one must take care while designing an algorithm for a given problem, we consider some alternative algorithms for finding the product m*n of two natural numbers m and n.

CHARACTERISTICS OF AN ALGORITHM

Next, we consider the concept of algorithm in more detail. While designing an algorithm as a solution to a given problem, we must take care of the following five important characteristics of an algorithm:

The Four - Colour Problem & The Fermat's Last Theorem

Question: State and describe any one of the following two problems :
(i)The Four - Colour Problem
(ii)The Fermat's Last Theorem


Solution:

MCA (3rd Semester) SOLVED ASSIGNMENT IGNOU MCA III 3rd Samester Solved Assignment 2013 2014 MCS-031 MCS-032 MCS-033 MCS-034 MCS-035

IGNOU MCA III 3rd Samester Solved Assignment 2013 2014
 (MCS-031, MCS-032, MCS-033, MCS-034, MCS-035 ,MCSL-036)
MCA (3rd Semester) SOLVED ASSIGNMENT IGNOU MCA III 3rd Samester Solved Assignment 2013 2014  MCS-031 MCS-032 MCS-033 MCS-034 MCS-035