#20172330 2018-2019-1 "program design and data structure" Fourth Week study summary

20172330 2018-2019-1 "program design and data Structure" the second week study summary textbook Learning content Summary queue

• 1. The list can be divided into sequential tables, unordered lists, and index lists.
• 2. Elements in a sequence list have intrinsic associations that define the order of elements.
• 3. The elements in the unordered list are sorted in any way that the user chooses.
• 4. The index list maintains a sequential numeric index value for his element.
• 5. An iterator is an object that provides the means to iterate over a set.
• 6. The interface allows us to create polymorphic use, where the method being called is based on the specific object being referenced.
• 7. When creating a league schedule, it is convenient to have a sequence list.
• The 8.Josephus problem is a typical computational problem that can be solved with an indexed list.

Problems in teaching materials learning and the solving process

• Issue 1: There is a comparison of sequence tables, unordered lists, and index lists.
• Problem 1 Solution: Baidu know the three different places.
  Difference:

• A sequence list is based on some of the attributes of the elements in the list. The list is sorted based on a key value, and for elements that have already been added to the ordered table, as long as the key value of the element is given, and the list has defined all the key values of the element, it has a fixed position in the list.

• unordered lists, where each element's position is not based on any intrinsic characteristics of the element, but is not misled by the name, the elements in the unsorted list are placed in a special order, except that the order is independent of the element itself, and the user of the list determines the order of the list.

• An indexed list, similar to an unordered list, where there is no intrinsic relationship between the elements of an indexed list that determines their order in the list. The user of the list determines the order of the elements, but in addition, each of its elements can be referenced from a numeric index, which
  The index value increments from 0 to the end of the list, starting from the head of the list. When the list changes, the index value adjusts to the response to maintain order and continuity. The index list maintains a sequential numeric index value for his element.

Problems in code debugging and the resolution process

• Question 1:

Code Hosting last week exam error summary

• 1.A linked implementation of A stack adds and removes elements from the _______ of the linked list.
  A. Front
  B. Rear
  C. Middle
  D. None of the above
  Parsing: The stack is similar to putting the box, and then take the box from the top one to take is the front.

• 2.A polymorphic Reference uses _______________, not the type of the reference, to determine which version of A method to I Nvoke.
  A. The type of the object
  B. The type of the reference
  C. Both A and B
  D. None of the above
  Parsing: polymorphic use often focuses on the type of object rather than the type of application.

The implementation of the collection operations should affect the the-the-the-interact with the collection.
A. True
B. False

Parsing: Using arrays and linked lists at the same time can be complex.

Pairing and mutual evaluation

• Based on the scoring criteria, I scored for King's blog: 7 points. The score is as follows:

Correct use of markdown syntax (plus 1 points)

Complete features in the template (plus 1 points)

Problems and solutions in textbook learning (plus 3 points)

Feelings, experience real (add 1 points)

Reviews seriously, can point out the blog and the Code of the problem (plus 1 points)

• Blogs that are worth learning or questions:
  • The combination of pictures and text is easy to understand.
  • Added the contents of the blog, easy to view, while the style has been updated, looks more beautiful
  • Read a lot of information to make the blog more convincing.
• Something worth learning or doing in your code:
  -Commit is still very detailed and organized.

reviewed the classmates blog and code

• This week's study of the knot
  • 20172333
  • Pairs of learning content
    • For the preparation of after-school projects.

Other (sentiment, thinking, etc., optional)

The new week does not have much to learn, but contains a lot of things, I hope to continue to learn.

Learning progress Bar

	lines of code (new/cumulative)	Blog Volume (Add/accumulate)	Learning Time (new/cumulative)	Important Growth
Goal	5000 rows	30 Articles	400 hours
First week	0/0	1/1	10/10
Second week	700/700	1/2	10/20
Third week	700/700	1/3	10/30

Reference: Why is it so difficult to estimate software engineering applications, software engineering estimation methods

• Planned study time: 10 hours

• Actual learning time: 10 hours

• Improved situation:

Last week because after class did not read the textbook carefully, resulting in a lot of knowledge of the test is forgotten, this time after the lesson spent a lot of time to read textbooks, or very rewarding.

Resources

• Java Programming and Data Structure Tutorial (fourth edition)

• Tutorial on Java Programming and data Structure (fourth edition) Learning Guide

#20172330 2018-2019-1 "program design and data structure" Fourth Week study summary