Software-Sequence of instructions executed by the

system.
Hardware-devices used to manipulate software.
Algorithm –step by step procedure for evaluating the
program.
Flowchart-Pictorial representation of algorithm.
Problem Solving Aspects

 Problem Definition Phase – What should be done in

the program.
 Getting started on a problem-Analyzing the possible
ways of solving the problem.
 Use of specific examples
 Similarities among problems
 Working backwards from the solution.
 General problem solving strategies.
Divide and Conquer,Dynamic programming.
Top down design

 A powerful technique for designing algorithms and

how to solve it.
 It should be precise and concise.
 The performance is by stepwise fashion.
 Methods of top down design
a) Breaking a problem into subproblems.
b) Choice of suitable data structures.
Choice of suitable data structures.
Implementation of Algorithms.
Analysis of Algorithms

 They are simple,but powerful and general solutions.

 Clear and concise steps.
 Easily modifiable.
 Correct and clear defined solutions.
 Economical-computer time,storage and peripherals.
Loops

 Repetitive occurrence of statements.

 If we want to perform the same set of statements
repeatedly ,the looping constructs is useful.
 The various looping structures are
*For statements
*While statements
*Do_While statements.
Programming Constructs

 #include<stdio.h> Preprocessor directive instructs the

compiler to accept the following C program.
 main()
{ - start of the program
-declaration and initialization statements;
-Input and output functions;
-getch() –input function which accepts input from the
user and used to make the output remain stable in the
output screen .
} -end of the program.
Programming Environment.

 Compiler - A program that translates a High Level

Language into Machine Language.
 Assembler-An assembler is a program that takes basic
computer instructions and converts them into a pattern of
bits that the computer’s processor can use to perform its
basic operations.
 Linker – A linker is a program that combines object
modules to form an executable program.
 Loader- A loader is a component ,which brings the
information from secondary storage to main memory for
execution.
 Interpreter- same as compiler but interprets one by one
line.
Implementation Issues

 C program Examples for programming constructs.

 Java is a interpreted and compiled language.
 Devc++ compiler ,TC compiler ,Java compiler.
 Mysql loader,Userguides loader.
 Dynamic linker for
Microsoftwindows,LINUX,MachOS.
 ASP –Active Server Pages and ASP.NET are examples
for Assembler.