Question

Define these 10 programming terms with their definitions related to Computer Science,

here are the ten terms to define.

IDE
syntax error
logic error
while & for looping (mention "end-of-file" looping)
algorithm
increment
decrement
accumulator
flowchart
pseudo code

Answer 1

IDE:

An IDE, or Integrated Development Environment, enables programmers to consolidate the different aspects of writing a computer program. IDEs increase programmer productivity by combining common activities of writing software into a single application: editing source code, building executables, and debugging.

An integrated development environment (IDE) is a software application that provides comprehensive facilities to computer programmers for software development. An IDE normally consists of at least a source code editor, build automation tools and a debugger. Some IDEs, such as NetBeans and Eclipse, contain the necessary compiler, interpreter, or both; others, such as SharpDevelop and Lazarus, do not.

syntax error:

In computer science, a syntax error is an error in the syntax of a sequence of characters or tokens that is intended to be written in compile-time. A program will not compile until all syntax errors are corrected. For interpreted languages, however, a syntax error may be detected during program execution, and an interpreter's error messages might not differentiate syntax errors from errors of other kinds.

A syntax error occurs when information is entered into a computer in an unrecognizable or improper format. If, for instance, someone typed an email address using the word “dotcom” instead of “.com,” the message would be undeliverable because of a syntax error. Poorly or incorrectly formatted information might be entered by a programmer, end user, or even by computer software itself. Computer programs communicate through digital language, and they have their own rules of grammar; when these rules are violated, a syntax error occurs.

logic error:

In computer programming, a logic error is a bug in a program that causes it to operate incorrectly, but not to terminate abnormally (or crash). A logic error produces unintended or undesired output or other behaviour, although it may not immediately be recognized as such.

Logic errors occur in both compiled and interpreted languages. Unlike a program with a syntax error, a program with a logic error is a valid program in the language, though it does not behave as intended. Often the only clue to the existence of logic errors is the production of wrong solutions, though static analysis may sometimes spot them.

while & for looping (mention "end-of-file" looping):

In most computer programming languages, a while loop is a control flow statement that allows code to be executed repeatedly based on a given Boolean condition. The while loop can be thought of as a repeating if statement.

In computer science, a for-loop (or simply for loop) is a control flow statement for specifying iteration, which allows code to be executed repeatedly.

You can detect when the end of the file is reached by using the member functions provided. End Of File or EOF is a specific designation for a file marker that indicates the end of a file or data set. So your loop will run until EOF is reached.

algorithm:

In mathematics and computer science, an algorithm is a finite sequence of well-defined, computer-implementable instructions, typically to solve a class of problems or to perform a computation.Algorithms are always unambiguous and are used as specifications for performing calculations, data processing, automated reasoning, and other tasks.

increment:

Increment is a unary operators that add one, to the operand. The operand must have an arithmetic or pointer data type, and must refer to a modifiable data object. Pointers values are increased by an amount that makes them point to the next element adjacent in memory.

decrement:

Decrement a unary operators that subtracts one from the operand. The operand must have an arithmetic or pointer data type, and must refer to a modifiable data object. Pointers values are decreased by an amount that makes them point to the previous element adjacent in memory.

accumulator:

In a computer's central processing unit (CPU), the accumulator is a register in which intermediate arithmetic and logic results are stored.

Without a register like an accumulator, it would be necessary to write the result of each calculation (addition, multiplication, shift, etc.) to main memory, perhaps only to be read right back again for use in the next operation. Access to main memory is slower than access to a register like the accumulator because the technology used for the large main memory is slower (but cheaper) than that used for a register. Early electronic computer systems were often split into two groups, those with accumulators and those without.

flowchart:

A flowchart is a diagram that depicts a process, system or computer algorithm. They are widely used in multiple fields to document, study, plan, improve and communicate often complex processes in clear, easy-to-understand diagrams. Flowcharts, sometimes spelled as flow charts, use rectangles, ovals, diamonds and potentially numerous other shapes to define the type of step, along with connecting arrows to define flow and sequence. They can range from simple, hand-drawn charts to comprehensive computer-drawn diagrams depicting multiple steps and routes.

pseudo code:

In computer science, pseudocode is a plain language description of the steps in an algorithm or another system. Pseudocode often uses structural conventions of a normal programming language, but is intended for human reading rather than machine reading. It typically omits details that are essential for machine understanding of the algorithm, such as variable declarations and language-specific code. The programming language is augmented with natural language description details, where convenient, or with compact mathematical notation. The purpose of using pseudocode is that it is easier for people to understand than conventional programming language code, and that it is an efficient and environment-independent description of the key principles of an algorithm. It is commonly used in textbooks and scientific publications to document algorithms and in planning of software and other algorithms.