Схема розділу
-
LK - senior lecturer Pokhodenko B.O. group: MП-10-25
PC - senior lecturer Pokhodenko B.O. group: MП-10-25
Classes are held remotely in the format of web conferences at the link:
On conference Zoomhttps://us05web.zoom.us/j/6801738431?pwd=IIia98NCgF82f5AbTfVJgKnYIjGEoN.1&omn=87202327627
Meeting ID: 680 173 8431
Access code: 5rfLRp
-
Lesson 1. Computer Architecture. Number Systems.
Objective: A deep dive into the fundamentals of how computer systems work, starting with an introduction to the architecture and principles laid down by John von Neumann, which are the foundation for most modern computing devices. Modern architectural solutions used in today's computers will also be considered. In addition, the lesson is devoted to familiarizing yourself with different number systems, which is critical for understanding how computers process and store data.
-
Lesson 2. Introduction to Algorithm Theory
Objective: involves the hierarchical mastery of skills, ranging from a basic understanding of terms to the ability to create formalized solutions. At the lowest level, Knowledge/Remembering, the student should be able to define the concepts of an algorithm and a program, list the properties of an algorithm (such as discreteness, definiteness, mass applicability, resultativity), and name historical examples of algorithms, such as Euclid's algorithm and al-Khwarizmi's algorithm. The next level, Understanding, requires the student to explain the necessity of a high degree of algorithm detail when executed by a computer, interpret the phrase "an algorithm is a technological instruction," and formulate the distinction between an algorithm (a general method) and a program (the recording of an algorithm in a computer language). The Application (Applying) level (3) assumes that the student will demonstrate the practical use of knowledge, particularly apply the principles of algorithm construction to analyze the problem statement and its subject area, and solve a problem by constructing a mathematical model (e.g., for estimating the area of an auditorium) based on input and intermediate data. The fourth level, Analysis (Analyzing), requires the student to compare Euclid's iterative algorithm with ancient Babylonian algorithms, differentiate between the stages of problem statement analysis and its formal solution, and analyze the impact of the absence of mathematical notation in the 9th century on the style of al-Khwarizmi's verbal prescription. At the fifth level, Evaluation (Evaluating), the student must justify the importance of the formal solution to a problem as a stage of algorithm construction, critique the effectiveness of the "Slavic peasant multiplication method" (based on doubling and adding) compared to modern numerical algorithms, and evaluate the importance of the concept of an "algorithm" as one of the fundamental concepts of modern informatics. At the highest level, Creation (Creating), the student must develop (plan) their own algorithm for solving a new mass-oriented problem (e.g., for the operation of IoT sensors) considering all necessary properties and characteristics, and design (create) a formal solution to the problem, including the mathematical model and the relationship between input and output data.
-
Заняття 3. Назва
Мета:
-
-
Заняття 4. Назва
Мета: