0
Views
Unified State Examination courses in computer science - course RUB 24,920. from Online school TutorOnline, training 56 ac. hours, Date: December 4, 2023.
Miscellaneous / / December 07, 2023
The school curriculum does not always have enough hours to work individually with each student.
TutorOrnline will help you increase your computer science knowledge by 40% quickly, efficiently and inexpensively.
Receive a free consultation and 2 lessons for each course.
TutoOrnline is not just a website. This is a whole team of professional, highly qualified specialists in their field. All of them are interested in your success, and therefore will be in touch 24/7. This is the same training, the intensity and topic of which you control. To everything you can add:
Preparing for the Unified State Exam in computer science through online courses takes place in the comfort of your own home: no time or money is wasted on travel. Before training begins, your knowledge will be assessed, gaps will be identified, and it will be clear what needs to be worked on and what can simply be repeated. Then a convenient time for classes will be specified. In this way, an individual schedule will be built that will not interfere with the future applicant’s preparation for other exams.
First of all, preparation courses for the Unified State Exam in computer science are not boring lessons with theory and practice. These are original classes with a creative approach to science. All classes will be recorded and can be reviewed. If necessary, homework can be discussed directly with the teacher or discussed with classmates in the general chat. You can view the full training program on the website.
TutoOrnline works to successfully pass exams and guarantee admission to a university in the desired specialty. Come and we will take you into the big world of computer science.
PREPARATION COURSE FOR THE UNIFORM STATE EXAMINATION
1. Number systems (1, 16 tasks)
1. Concept of SS. Converting numbers from SS to another.
2. Arithmetic operations in different SS
3. Comparison of numbers in different SS.
4. Finding the base of a number system by writing a number in this system.
5. Equations and various number systems.
6. Solving various examples of 1 task
7. Solving various examples of task 16
2. Encoding and decoding of information (5,9,10,13 tasks)
1. Concept of information. Units of information. Translation of information units
2. The concept of encoding and decoding information. Hartley and Shenon formulas.
3. Solving various examples of task 13
4. Coding of graphic and sound information
5. Information transfer rate
6. Solving various examples of task 9
7. Fano code. Equal and unequal code
8. Solving various examples of task 5.
9. Coding of text information in SS.
10. Word busting
11. Solving various examples of task 10
12. Interim certification (decision 1, 16, 13, 9, 5, 10) (6 primary points - 40 test points, i.e. the minimum threshold)
3. Information modeling (3,4, 7,12,15,17)
1. The concept of modeling. Types of models
2. Solving various examples of 3.4 tasks
3. Spreadsheet concept. Absolute and mixed reference
4. Solving various examples of task 7
5. Finding the number of paths, solution to task 15
6. Determining the mask and IP address
7. Solving various examples 12
8. Evaluating the performance of search engines based on the entered query
9. Solving various examples of task 17
10. Interim certification (decision 1, 16, 13, 9, 5, 10, 3, 4, 7, 12, 15, 17) (12 primary points - 51 test points)
4. Fundamentals of Logic Algebra (2, 18, 23)
1. Introduction to mathematical logic; operations of negation, conjunction, disjunction, exclusive or, implication and equivalence in analytical form and in the form of truth tables
2. Basic laws of mathematical logic
3. Analysis of truth tables (with complete or partially filled data)
4. Solving various examples 2 tasks
5. Analysis of Boolean Expressions
6. Solving various examples of task 18
7. Solving logical equations using the mapping method
8. Solving various examples 23 tasks
9. Interim certification (decision 1, 16, 13, 9, 5, 10, 3, 4, 7, 12, 15, 17, 2, 18, 23) (15 primary points - 57 test points)
5. Basics of algorithmization and programming (6,8,11,14,19,20,21,22,24,25,26,27)
1. The concept of an algorithm and types of algorithms; execution and analysis of simple algorithms
2. Solving various examples of task 6
3. The concept of the performer and his command system
4. Solving various examples 14, 22 tasks
5. Basics of programming. Basic commands in a programming language
6. Linear, branching and cyclic (types of loops) algorithms in a programming language
7. Solving various examples of task 8
8. The concept of an array. Input and output, data processing
9. Solving various examples of task 19
10. The concept of recursive algorithms (the use of algorithms to find maxima, minima, average values, sums, products, sorting arrays, finding GCD and LCM, factorial, decomposition of a given number into digits)
11. Solving various examples of 20,21 tasks
12. Features of Part 2 (assessment, examples of writing programs)
13. Solution to 24 tasks
14. Solution to task 25
15. Solution to task 26
16. Solution to task 27
6. Unified State Exam test solution
1. Unified State Exam test solution (1 lesson)
2. Solution to the Unified State Exam test (lesson 2)
Subscribe