Basic definition of program, Computer Engineering

Assignment Help:

Q. Basic defination of program?

A program generally consists of a set of instructions and data specifying the solution of a particular problem. Programs (and data) expressed in the binary system (using 0s and 1s) are known as machine-language programs. Writing programs in this form, which demands a detailed knowledge of the computer structure, is rather tedious and error-prone. Assembly- language programming is developed by using symbolic names, known as mnemonics, and matching machine-language instructions on a more or less one-for-one basis. An assembler is then used to translate assembly-language programs into their equivalent machine-language programs. Because both assembly-language and machine-language programmings are specific to a particular computer, high-level languages (HLL) such as Fortran, Pascal, Basic, LISP, and C have been developed such that programs written by using them could be run on virtually any computer. Also, these are problem-oriented languages, which allow the user to write programs in forms that are as close as possible to the human-oriented languages.


Related Discussions:- Basic definition of program

Explain the different types of buses with neat diagram, Explain the differe...

Explain the different types of buses with neat diagram. When a word of data is transferred among units, all the bits are transferred in parallel over a set of lines known as bu

State about the indirect addressing, Indirect addressing A memory locat...

Indirect addressing A memory location is given that holds another memory location. This second memory location holds the real data. This mechanism solves problems caused by rea

Explain level of a node, Level of a node The root is at level zero and ...

Level of a node The root is at level zero and the level of the node is 1 more than the level of its parent

Find the boolean expression for boolean algebra, Find the Boolean expressio...

Find the Boolean expression for logic circuit shown in Figure below and reduce it using Boolean algebra. Ans. Y = (AB)' + (A' + B)' = A' + B' + AB' by using Demorgan's Theorem. =

List-processing without using suppress-dialog, What happens if we use Leave...

What happens if we use Leave to list-processing without using Suppress-Dialog? If we don't use Suppress-Dialog to next screen will be viewed but as empty, when the user presse

Explain traffic handling capacity, Traffic Handling Capacity is given by ...

Traffic Handling Capacity is given by (A)  Switching capacity × Theoretical maximum load (B)  Switching capacity / Theoretical maximum load (C)  Theoretical maximu

A switch statement , Which is more efficient, a switch statement or an if e...

Which is more efficient, a switch statement or an if else chain? Ans) The differences, if any, are likely to be small. The switch statement was designed to be efficiently impl

How reassembling of ip fragments is advantageous, Reassembling of IP fragme...

Reassembling of IP fragments at the ultimate destination is advantageous. Give reasons. Needing the ultimate destination to reassemble the fragments has two major advantages. F

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