20,182,312 2019-2020-1 "Object-oriented programming and data structures," the tenth week learning summary

Learning content summary

1. FIG dense and sparse graph, if e (number of edges) <n (number of vertices) of taking the product of two points on the top, so called sparse graphs, otherwise known as dense FIG.
2. Network: map with the edge of the right to be called net.
3. Right: side-related data and information around the edges of.
4 showing the degree of: a degree of the undirected graph points is the number of edges and the associated point. There penetration to the drawings: the number of edges of the strip to the end point. There is a degree of the drawing: the number of edges of the bar to the starting point. The directed graph is the sum of the degrees of penetration.

Textbook learning and problem-solving process

Question 1: XXXXXX
Problem 1 Solution: XXXXXX
Question 2: XXXXXX
Problem 2 Solution: XXXXXX
...

Code debugging and problem solving in the process

Question 1: XXXXXX
Problem 1 Solution: XXXXXX
Question 2: XXXXXX
Problem 2 Solution: XXXXXX
...

Code hosting

(Run results screenshot statistics.sh script)

Last week exam wrong question summary

The wrong questions 1 and reason, to understand the situation
Question 2 and the wrong reasons, to understand the situation
...

Comments had students blog and code

Pair this week learning
- student ID
- student ID
- Pair learning content
  - XXXX
Last week blog peer assessment case
- student ID
- student ID

Other (perception, thinking, etc., optional)

xxx
xxx

Learning progress bar

	The number of lines of code (add / accumulate)	Blog amount (add / accumulate)	Learning time (add / accumulate)
aims	5000 rows	30	400 hours
the first week	200/200	2/2	20/20
the second week	300/500	2/4	18/38
The third week	500/1000	3/7	22/60
the fourth week	300/1300	2/9	30/90

Plan study time: XX hours
The actual study time: XX hours
Improvements:

20,182,312 tenth week learning summary