Programs - programming language, Basic Computer Science

Assignment Help:

Programs - programming language:

Programs to implement algorithms on the computer must be written in a language that the computer can understand. It is fruitful, therefore, to describe algorithms in a language that resembles the language used to write computer programs.  This is called pseudo code.  It is not a programming language with a rigid syntax, but is similar to one.  The idea is that it should be easy to write a program by looking at the pseudo code.  

Let us take few problems to illustrate how to express the solution to a problem in the form of an algorithm. We will also see how algorithm can be diagrammatically represented using flow chart, and also how a program can be written based on the algorithm.  For providing a solution to any problem some input from the user is required. In the following examples the number n that is expected from the user should be an  integer. In the program, it will be declared of the required type only, referred as data type of the variable. A Detailed description of variable and data type is given in a later section.  


Related Discussions:- Programs - programming language

Why is the random class in the .net framework not suitable, QUESTION (a...

QUESTION (a) (i) Why is the Random class in the .NET framework not suitable for generating random bytes for cryptography purposes? (ii) Mention two characteristics required

What is packet switching? explain, Question 1 What are the five subscriber...

Question 1 What are the five subscriber-related signaling functions performed by the operator? Question 2 Compare Microprogrammed control and Hard-wired control Que

Cathode ray tube monitors, Cathode Ray Tube Monitors (CRT): Monitors d...

Cathode Ray Tube Monitors (CRT): Monitors display what is going on in your computer. They can run at various resolutions. It is the part of computer which looks like a TV set.

Describe FCFS Scheduling algorithm ?, FCFS algorithm also known as: • Firs...

FCFS algorithm also known as: • First-In-First-Out (FIFO) • Run-Until-Done • Run-to-Completion • Possibly, First-Come-First-Served algorithm is the easiest scheduling algorithm i

Pipelining concept, The easiest way to approach pipelining is to regard as...

The easiest way to approach pipelining is to regard as the three stage fetch, decode and execute instruction execution cycle outlined earlier. There are times during each of these

What are the features that bash shell provides, Question 1 What are the fe...

Question 1 What are the features that Bash shell provides? Question 2 Explain Runlevels Question 3 Discuss the following                           1) Links 2) Doma

Static ram, STATIC RAM: Flip-Flops are the basic memory cells in a stat...

STATIC RAM: Flip-Flops are the basic memory cells in a static RAM. Each flip-flop is based on either two bipolar transistors or two Metal Oxide Semiconductors Field-Effect Tra

Info Systems Management, Assignment 1: Project Management and Information ...

Assignment 1: Project Management and Information Security 2-3 page paper in which you: 1. Explicate in detail the importance of project management as it relate to an informatio

Explain uses of system call and its major types, In computing, a system cal...

In computing, a system call is how a program asks for a service from an operating system''s kernel. This may contain hardware related services (for example accessing the hard disk)

Geometric mean - algorithm, The geometric mean is obtained by multiplying a...

The geometric mean is obtained by multiplying all the four numbers and taking the fourth root of the product. Let x 1 ,x 2 ,x 3  and x 4  be the given four numbers then geometric

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd