Lesson 1

З м і с т

Стор.

Передмова...............................................................................................................................5

Algorithmic and Programming.................................................................................................6

Computer equipment and organization of computational work...............................................9

Electrical engineering and electrical mechanics.....................................................................16

Theory of Automatic control..................................................................................................23

Manufacturing processes and equipment automation objects................................................26

Microprocessor technology....................................................................................................31

System analysis and theory of complex systems...................................................................34

Fundamentals of computer-integrated management.............................................................. 40

Business process automation................................................................................................. 42

Integrated computer technology and database.......................................................................44

Modern object-oriented programming techniques..................................................................48

Programming and software and hardware in process control systems...................................51

Передмова

Метою “Методичних вказiвок” є формування впродовж 72 годин аудиторних занять у

студентів (вхідний рівень володіння мовою – В1) вмiнь та навичок читання, письма та

говоріння за тематикою спеціальності на ІІ курсі навчання в

Інституті енергетики та комп’ютерно-інтегрованих систем управління (вихідний рівень володіння мовою – В2). За рахунок тренування і виконання читання текстів і комунікативних завдань студенти зможуть досягти практичного володіння англійською мовою за фахом.

Практичне володіння іноземною мовою в рамках даного курсу припускає наявність таких умінь в різних видах мовної комунікації, які дають можливість:

· вільно читати оригінальну літературу іноземною мовою у відповідній галузі знань;

· оформляти витягнуту з іноземних джерел інформацію у вигляді перекладу або резюме;

· робити повідомлення і доповіді іноземною мовою на теми, пов'язані з науковою роботою майбутнього фахівця;

· вести бесіду за фахом.

Кожний урок складається з тексту й комплекса мовних вправ, які розраховані на удосконалення навичок активізації словарного і граматичного мінімуму професійного спрямування.

“Методичні вказiвки” забезпечують підготовку до міжнародного усного і письмового спілкування англійською мовою для спеціальних цілей, а саме - оволодіння лексичними, граматичними і стилістичними навичками, а також умінням розмовляти, читати, переписуватися, перекладати, конспектувати, згортати | і розгортати усну і письмову англомовну інформацію наукового функціонального стилю, що передбачено вимогами Програми вивчення іноземних мов у нефілологічному ВУЗі.

Lesson 1

Read the text: Algorithmic and Programming

In mathematics and computer science, an algorithm (from Algoritmi, the Latin form of Al-Khwārizmī) is an effective method expressed as a finite list of well-defined instructionsfor calculating a function. Algorithms are used for calculation, data processing, and automated reasoning. In simple words an algorithm is a step-by-step procedure for calculations.

Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, will proceed through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.

While there is no generally accepted formal definition of "algorithm," an informal definition could be "a set of rules that precisely defines a sequence of operations." For some people, a program is only an algorithm if it stops eventually; for others, a program is only an algorithm if it stops before a given number of calculation steps.

Algorithms are essential to the way computers process data. Many computer programs contain algorithms that detail the specific instructions a computer should perform (in a specific order) to carry out a specified task, such as calculating employees' paychecks or printing students' report cards. Thus, an algorithm can be considered to be any sequence of operations that can be simulated by a Turing-complete system.

Typically, when an algorithm is associated with processing information, data is read from an input source, written to an output device, and/or stored for further processing. Stored data is regarded as part of the internal state of the entity performing the algorithm. In practice, the state is stored in one or more data structures.

For some such computational process, the algorithm must be rigorously defined: specified in the way it applies in all possible circumstances that could arise. That is, any conditional steps must be systematically dealt with, case-by-case; the criteria for each case must be clear (and computable).

Because an algorithm is a precise list of precise steps, the order of computation will always be critical to the functioning of the algorithm. Instructions are usually assumed to be listed explicitly, and are described as starting "from the top" and going "down to the bottom", an idea that is described more formally by flow of control.

So far, this discussion of the formalization of an algorithm has assumed the premises of imperative programming. This is the most common conception, and it attempts to describe a task in discrete, "mechanical" means. Unique to this conception of formalized algorithms is the assignment operation, setting the value of a variable. It derives from the intuition of "memory” as a scratchpad. There is an example below of such an assignment.

For some alternate conceptions of what constitutes an algorithm see functional programming and logic programming.

Most algorithms are intended to be implemented as computer programs. However, algorithms are also implemented by other means, such as in a biological neural network (for example, the human brain implementing arithmetic or an insect looking for food), in an electrical circuit, or in a mechanical device.

Computer programming (often shortened to programming or coding) is the process of designing, writing, testing, debugging, and maintaining the source code of computer programs. This source code is written in one or more programming languages. The purpose of programming is to create a program that performs specific operations or 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.

Within software engineering, programming (the implementation) is regarded as one phase in a software development process.

There is an ongoing debate on the extent to which the writing of programs is an art, a craft or an engineering discipline. In general, good programming is considered to be the measured application of all three, with the goal of producing an efficient and evolvable software solution (the criteria for "efficient" and "evolvable" vary considerably). The discipline differs from many other technical professions in that programmers, in general, do not need to be licensed or pass any standardized (or governmentally regulated) certification tests in order to call themselves "programmers" or even "software engineers." Because the discipline covers many areas, which may or may not include critical applications, it is debatable whether licensing is required for the profession as a whole. In most cases, the discipline is self-governed by the entities which require the programming, and sometimes very strict environments are defined (e.g. United States Air Force use of Ada Core and security clearance). However, representing oneself as a "Professional Software Engineer" without a license from an accredited institution is illegal in many parts of the world.

Another ongoing debate is the extent to which the programming language used in writing computer programs affects the form that the final program takes. This debate is analogous to that surrounding the Sapir–Whorf hypothesis in linguistics and cognitive science, which postulates that a particular spoken language's nature influences the habitual thought of its speakers. Different language patterns yield different patterns of thought. This idea challenges the possibility of representing the world perfectly with language, because it acknowledges that the mechanisms of any language condition the thoughts of its speaker community.

I. Answer the questions:

1. What is an algorithm?

2. What processes must algorithm be rigorously defined for?

3. What processes does computer programming include?

4. What’s the purpose of the coding?

<== попередня сторінка	\|	наступна сторінка ==>
	\|

Не знайшли потрібну інформацію? Скористайтесь пошуком google:

Генерація сторінки за: 0.006 сек.