COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
A semiformal, English-like language with limited vocabulary that can be used to design and describe algorithms.
|
|
|
A formal language that is specifically used to write program.
|
|
|
A graph used to depict or show a step by step solution using symbols which represent a task.
|
|
|
A series of steps or statements that are executed in the order they are written in an algorithm.
|
Detailed explanation-1: -What is Pseudocode. A semiformal, English-like language with limited vocabulary that can be used to design and describe algorithms. A formal language that is specifically used to write program. A graph used to depict or show a step by step solution using symbols which represent a task.
Detailed explanation-2: -Pseudocode is an artificial and informal language that helps programmers develop algorithms. Pseudocode is a “text-based” detail (algorithmic) design tool. The rules of Pseudocode are reasonably straightforward. All statements showing “dependency” are to be indented.
Detailed explanation-3: -Pseudocode (pronounced SOO-doh-kohd) is a detailed yet readable description of what a computer program or algorithm must do, expressed in a formally-styled natural language rather than in a programming language. Pseudocode is sometimes used as a detailed step in the process of developing a program.
Detailed explanation-4: -Pseudocode is defined as a method of describing a process or writing programming code and algorithms using a natural language such as English. It is not the code itself, but rather a description of what the code should do.
Detailed explanation-5: -Mathematical style pseudocode is sometimes referred to as pidgin code, for example pidgin ALGOL (the origin of the concept), pidgin Fortran, pidgin BASIC, pidgin Pascal, pidgin C, and pidgin Lisp.