Scribd
Upload
51 views

Introduction - Docx Programing

Computer programming involves writing algorithms, which are step-by-step instructions, in a programming language that a computing device can understand and execute. Programmers conceive and design algorithms to solve problems, then encode them into source code using programming languages that provide control structures and data types. Successful programming requires understanding algorithms, programming paradigms like procedural and object-oriented programming, debugging processes, and implementing algorithms within an integrated development environment.

Uploaded by

Aliona Mihalachi
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
51 views

Introduction - Docx Programing

Computer programming involves writing algorithms, which are step-by-step instructions, in a programming language that a computing device can understand and execute. Programmers conceive and design algorithms to solve problems, then encode them into source code using programming languages that provide control structures and data types. Successful programming requires understanding algorithms, programming paradigms like procedural and object-oriented programming, debugging processes, and implementing algorithms within an integrated development environment.

Uploaded by

Aliona Mihalachi
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Introduction

Programming involves describing processes and procedures which are derived from
algorithms. The ability to program is what sets apart a developer and an end user.
Typically the role of the developer is to instruct a device (such as a computer) to
carry out instructions; the instructions are known as source code and is written in a
language that is converted into something the device can understand. The device
executes the instructions it is given.
Algorithms help to describe the solution to a problem or task; by identifying the
data and the process needed to represent the problem or task and the set of steps
needed to produce the desired result.
Programming languages typically provide the representation of both the data and
the process; they provide control constructs and data types (which can be
numbers, words, and objects, and be constant or variable).
The control constructs are used to represent the steps of an algorithm in a
convenient yet unambiguous fashion. Algorithms require constructs that can
perform sequential processing, selection for decision-making, and iteration for
repetitive control. Any programming language that provides these basic features
can be used for algorithm representation.
This unit introduces students to the core concepts of programming with an
introduction to algorithms and the characteristics of programming paradigms.
Among the topics included in this unit are: introduction to algorithms, procedural,
object-orientated & event-driven programming, security considerations, the
integrated development environment and the debugging process.
On successful completion of this unit students will be able to design and implement
algorithms in a chosen language within a suitable Integrated Development
Environment (IDE). This IDE will be used to develop and help track any issues with
the code.
As a result they will develop skills such as communication literacy, critical thinking,
analysis, reasoning and interpretation which are crucial for gaining employment and
developing academic competence
LO1

Programming is the process of taking an algorithm and encoding it into a notation, a


programming language, so that it can be executed by a computer. Although many
programming languages and many different types of computers exist, the important
first step is the need to have the solution. Without an algorithm there can be no
program.

Computer science is not the study of programming. Programming, however, is an


important part of what a computer scientist does. Programming is often the way that
we create a representation for our solutions..

Computer programming is the act of writing algorithms (a set of instructions) that tell
a computer what to do.

■ These algorithms are executed by a computing device (PC, Laptop, mobile device,
tablet, washing machine, car alarms etc.)

■ People who program are referred to as programmers.

■ Computer programmers write, test, and maintain the detailed instructions, called
programs, that computers must follow to perform their functions.

■ Programmers also conceive, design, and test logical structures for solving
problems by computer.

All data items in the computer are represented as strings of binary digits. In order to
give these strings meaning, we need to have data types. Data types provide an
interpretation for this binary data so that we can think about the data in terms that
make sense with respect to the problem being solved. These low-level, built-in data
types (sometimes called the primitive data types) provide the building blocks for
algorithm development.
P1

Algorithms describe the solution to a problem in terms of the data needed to


represent the problem instance and the set of steps necessary to produce the
intended result.

Programming languages must provide a notational way to represent both the


process and the data. To this end, languages provide control constructs and data
types.

An algorithm is a detailed series of instructions for carrying out an operation or


solving a problem. In a non-technical approach, we use algorithms in everyday
tasks, such as a recipe to bake a cake or a do-it-yourself handbook.

Technically, computers use algorithms to list the detailed instructions for carrying out
an operation. For example, to compute an employee’s paycheck, the computer uses
an algorithm. To accomplish this task, appropriate data must be entered into the
system. In terms of efficiency, various algorithms are able to accomplish operations
or problem solving easily and quickly.

■ Algorithm is a step by step procedure for solving a problem in a finite amount of


time.

■ Typically, algorithms go with the data structures to manipulate the data (e.g., the
methods of a class).

■ Most algorithms transform input objects into output objects. – Input - An algorithm
has input values from a specified set – Output - From each set of input values an
algorithm produces output values from a specified set. The output values are the
solution to the problem.

Algorithms must: • Be definite – the algorithms must have a defined steps


• Be correct: always give a correct solution

• Terminate: must terminate in a finite time

• Be complete: always gives a solution when one exists

• Generic- The algorithm should be applicable for all problems of the desired form,
not just for a particular set of input values.
LO2

You might also like