-
The algorithm is the basic principle, and there is a great connection in this chapter, and the probability relationship in Chapter 2 and Chapter 3 is large, because random sampling is the basis of the probability of random events, and estimating the population with samples is the basis of classical probability and geometric probability!
-
(1) Finiteness: The sequence of steps of an algorithm is finite and must be stopped after a finite operation, and cannot be infinite.
(2) Determinism: Each step in the algorithm should be deterministic and can be executed efficiently and obtain a definite result, and should not be ambiguous.
3) Sequentiality and correctness: The algorithm starts from the initial step, divided into a number of clear steps, each step can only have a definite follow-up step, the previous step is the premise of the next step, only after the execution of the previous step can the next step, and each step is accurate, in order to complete the problem of reading empty.
4) Non-uniqueness: The solution to a certain problem is not necessarily unique, and there can be different algorithms for a problem.
5) Universality: Many specific problems can be solved by designing reasonable algorithms, such as mental arithmetic and calculator calculations, which need to be solved through limited and pre-designed steps.
-
Chapter 1 Preliminary Algorithms.
1. Algorithm. 2. Block diagram.
3. There are three basic logical structures of arithmetic: (1) sequential structure, (2) conditional structure, and (3) cyclic structure.
4. Basic algorithm statements: (1) input and output statements, (2) assignment statements, (3) conditional statements, and (4) loop statements.
5. Algorithm cases: (1) tossing and turning division and more phase reduction (2) Qin Jiushao's algorithm (3) carry system.
Chapter 2 Statistics.
1. Data collection (sampling method) :(1) simple random sampling (2) systematic sampling (3) stratified sampling.
2. Collation, analysis, data, estimation, and inference: (1) estimating the population with samples: estimating the population distribution with sample frequency, estimating population data characteristics with sample data characteristics, and (2) correlation between variables: linear regression analysis.
Chapter 3 Probability.
Random events. The meaning and properties of probabilistic probability: 1. Classical generalizations 2. Geometric generalizations.
2. Apply probability to solve practical problems.
Random numbers vs. random models.
-
Chapter 1 Preliminary Algorithms.
1. Algorithm. 2. Block diagram.
3. The three basic logical structures of arithmetic.
4. Basic algorithm statements.
5. Algorithm cases.
Chapter 2 Statistics.
1. Collect data.
2. Collation, analysis, data, estimation, and inference.
Chapter 3 Probability.
Random events. The meaning and nature of probabilistic probability.
-
Summary. Hello, this classmate. High school math compulsory 3 is not very important.
Is it important for high school students to take the three compulsory math courses.
Hello, this classmate. High school math compulsory 3 is not very important.
Because many of his knowledge points are mainly based on understanding. There are not many specific words in the exam.
I know math clearly, but I always fail to do well in exams.
Here's why.
Of course, there is one aspect that must be understood. That is, his basic points in geometry and function problems are relatively simple.
For this reason, it is mainly due to the inaccurate grasp of knowledge points.
Can you give me some math methods or techniques?
It's definitely okay. But we need to know some of your current learning.
The first step in learning math is practice, and then it's about mastering your own methods.
How to understand. This is first of all your current grades, and then there is the fact that it would be better if you had a paper.
I'm a science student, can you give me some ways to study science?
OK. If you study science, it is not only about brushing up on questions, but also about mastering knowledge points.
If you want to memorize not only physics and chemistry, but also have a certain learning method, depending on each chapter.
1. For a given set, the elements in the set are deterministic, and any object is or may not be an element of the given set. >>>More
Be specific about what you want.
Compulsory 51Linear programming.
Truth be told, there is no formula for linear programming. >>>More
1.Left = tan -sin = sin (sec -1) = tan * sin = right.
2.Left = cos -2cos +1 + sin = 2-2cos = right. >>>More
1.Using the square of a square + b square" = 2ab (a + b) square < = 2 * (a square + b square) is too simple, I won't write the process. >>>More