Сделайте реферативный перевод текста.

 

 

Текст VII.

Сделайте аннотационный перевод текста.

Programming Techniques

Computer programming is a field that has to do with the analytical creation of source code that can be used to configure computer systems. More detailed, programming (or coding) is the process of designing, writing, testing, debugging
(or troubleshooting), and maintaining the source code of computer programs.
The purpose of programming is to create a program that exhibits a certain desired behavior. The process of writing source code often requires expertise in many different subjects, including knowledge of the application domain, specialized algorithms and formal logic.

In what follows, some most common programming techniques will be considered.

Linear programming is a mathematical modeling technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints. Given a polytope and a real-valued affine function defined on this polytope, a linear programming method will find a point on the polytope, where this function has the smallest (or largest) value if such point exists, by searching through the polytope vertices. Linear programming is useful for guiding quantitative decisions in business planning, industrial engineering, and – to a lesser extent – in the social and physical sciences.

Functional programming is a programming paradigm that treats computation as the evaluation of mathematical functions and avoids mutable data. Functional programming wants to avoid state changes as much as possible and works with data flowing between functions. This method has its roots in lambda calculus, developed in the 1930s to investigate function definition, function application, and recursion. Many functional programming languages can be viewed as elaborations on the lambda calculus.

Logic programming is the use of mathematical logic for computer programming. In this view of logic programming, logic is used as a purely declarative representation language, and a theorem-prover or model-generator is used as the problem-solver. The problem-solving task is split between the programmer, who is responsible only for ensuring the truth of programs expressed in logical form, and the theorem-prover or model-generator, which is responsible for solving problems efficiently.

Recursive programming is a powerful technique that can greatly simplify some programming tasks. In brief, recursive programming is the situation in which a procedure calls itself, passing in a modified value of the parameter(s) that was passed in to the current iteration of the procedure. Typically, a recursive programming environment contains (at least) two procedures: first, a procedure to set up the initial environment and make the initial call to the recursive procedure, and second, the recursive procedure itself that calls itself one or more times.

Object-oriented programming (OOP) is a programming language model organized around “objects” rather than “actions” and data rather than logic. OOP uses predefined programming modular units (objects, classes, subclasses, and so forth) in order to make programming faster and easier to maintain. Object-oriented languages help to manage complexity in large programs. Objects package data and the operations on them so that only the operations are publicly accessible and internal details of the data structures are hidden. This information hiding made large-scale programming easier by allowing a programmer to think about each part of the program in isolation. In addition, objects may be derived from more general ones, “ inheriting ” their capabilities. Such an object hierarchy made it possible to define specialized objects without repeating all that is in the more general ones.

Текст VIII.