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

Summary of learning contents of textbook

• List: is a linear structure that can be implemented with a linked list or array, and the collection of lists has no intrinsic capacity, and he can grow as needed.
• There are three types of lists: ordered, unordered, indexed
• Ordered tables: Based on an attribute in a list, an element has an intrinsic association that defines the order of elements.
• Unordered lists: not really without order, but in a special order that is independent of the root element itself, and the user of the list determines the order of the elements.
• Index list: The order of the elements in the list cannot be determined by the user. Each element can get a reference index value from a numeric index starting at 0
• The difference between an indexed list and an array: The index value of an indexed list is always contiguous, and if an element is deleted, the position of the other element is as "collapsed" to eliminate the gap.

• List in the Java Collection API
  Figure 1

• Using the unordered list: Learning Plan 00
• Index List Use example: Josephus problem
• List ADT
  • Add an element to the list
    • Sequence list: Add (element added in list)
    • Unordered list: Addtofront
    • Figure
• Using the array implementation list
  • The front end of the list is fixed at index 0, and the integer variable tear represents an array of elements in the list and the next available location when the element is added to the end of the list.
  • Remove operation
  • Contains operation
  • Add operation with sequence list
  • Addafter Operations for unordered lists
• Implementing a list using linked lists
  • Remove operation

Problems in teaching materials learning and the solving process

• The difference between a list and a linked table and a queue

Problems in code debugging and resolving process code hosting

Figure Code Amount

Last week's summary of the wrong quiz

• Wrong question one
  Figure the wrong question one
• The wrong problem One analysis:
• Wrong question two:
• Two-part analysis: polymorphic references can reference different types of objects over a period of time. This sentence is correct, multi-state itself refers to a variety of states, I do the focus on the topic for a period of time, in fact, is not the focus.
• Three wrong questions:
• Three analysis of the wrong problem: Common features should be at a high level in the class hierarchy in order to maximize the use of resources, so that low-level can be referenced.
• The wrong question four:
• Four wrong questions: correct should be the most efficient way to implement an array-based stack is to keep the bottom of the stack at position 0 of the array. Because if the stack is reversed in the array, the efficiency will be high.

Pair and peer review templates:

• Blogs that are worth learning or questions:
  • 20172305 Tan Xin The problem solved very well, the content is comprehensive, the typesetting is exquisite.
  • 20172323 Wang Yuhan's blog contains specific code to summarize the contents of the textbook, but the problems encountered and the record of the process can be more enriched.
• Based on the scoring criteria, I scored for Tan Xin's blog: 6 points. The score is as follows:
  • Question plus 3 points
  • Sentiment does not impracticality plus 1 points
  • Beautifully formatted plus 1 points
    -Correct use of markdown syntax plus 1 points
    -Complete elements in the template plus 1 points
• Based on the scoring criteria, I scored for Wang Yuhan's blog: 6 points. The score is as follows:
  • Beautifully formatted plus 1 points
  • Question plus 2 points
  • Sentiment does not impracticality plus 1 points
    -Correct use of markdown syntax plus 1 points
    -Complete elements in the template plus 1 points

Other Learning progress bar

	lines of code (new/cumulative)	Blog Volume (Add/accumulate)	Learning Time (new/cumulative)
Goal	5000 rows	30 Articles	400 hours
First week	0/0	1/1	8/8
Second week	1163/1163	1/2	15/23
Third week	774/1937	1/3	12/50

Reference:

20172314 2018-2019-1 "program design and data structure" Fourth week study summary