thinking in java 5th edition

a method in Class A at the same time, the parameter of the method is class B objectvoid Setbottom (Circle c) so that after declaring an object of Class B, a reference to the object is passed to the Class B object declared in Class A by invoking a reference passing method in Class A. This allows the method of Class B to be used by object manipulation of Class A, which is called object A to reuse The method of object B in a composite way . an object that declares an instantiated class B can be re

often subject to changes in the index.Problems in teaching materials learning and the solving processThis week to study is the 8th, 9 chapters of knowledge, learning how to handle the exception of the code, the usual code will have some small problems, through the students and books to explain can be explained, through the knowledge of this chapter, my ability to deal with the code of abnormal error has improved a lot, I can also carry out even the correct handling when I meet the wrong band co

. The InputStream instance can be specified using the properties's load () method. The InputStream instance is automatically closed when the load () method finishes. If you want to get all the keys in the map, you can call the map's keyset () to return the set object. If you want to get the key and value of the map at the same time, you can use the entrySet() method, which will return a set object, each element is an Map.Entry instance, you can call getKey() the Get key, call to getValue()

1/4 10/10 Second week 300/500 1/5 10/20 Third week 800/1300 1/6 20/40 Week Four 700/2000 2/8 20/60 Week Five 1100/3100 2/10 30/90 Week Six / / / Seventh Week Eighth Week Reference: Why is it so difficult to estimate softwar

kinds of syntax, inheritance architecture also obviously become abstract, there are many things with the API, to be good at checking Api,java in the class too much, do not need to remember all, But it will be checked and used. The program is through continuous learning, a little piece of patchwork out.Learning progress Bar Lines of code (new/cumulative Blog volume (Add/accumulate) Learning time (new/cumulative) Im

, y=x-x/n, the number of training, X, Y is close.Reference: Why is it so difficult to estimate software engineering applications, software engineering estimation methods Planned study time: xx hours Actual study time: xx hours Improved situation: (Take a look at the software engineer's ability self-evaluation table of the modern soft-ware courseware)Resources Java Learning Notes (8th

, thinking, etc., optional) This week the study task is heavier, in the study tenth chapter, because lacks the eighth chapter knowledge, learns to be difficult, the understanding of the code is not deep enough, encounters does not understand only then forwards the corresponding knowledge point to learn the side to supplement, the efficiency is not high. ShouldAfter encountering the knowledge points that do not understand, will be related to the knowledge of the system to complement, and

Tips"Effective Java, third Edition" an English version has been published, the second edition of this book presumably many people have read, known as one of the four major Java books, but the second edition of 2009 published, to now nearly 8 years, but with

Download address: Network disk download Introduction to the content One of the most influential and valuable works in the Java field, with more than 20 years of experience in teaching and research of senior Java technology experts to write (won the Jolt Award), and "Java Programming ideas," the same as the more than 10-year global best-selling not decline, popul

Tips"Effective Java, third Edition" an English version has been published, the second edition of this book presumably many people have read, known as one of the four major Java books, but the second edition of 2009 published, to now nearly 8 years, but with

DescriptionHere is read the "Effective Java Chinese version of the second edition" of the Reading notes, here will record some personal feeling a little bit important content, convenient for later review, may be due to personal strength reasons caused by misunderstanding, if found welcome to point out. Some individuals do not understand that will be marked with a slash.The first chapter is the introduction,

conquer algorithm 29810.2.1 split algorithm run time 29810.2.2 recent point problem 30010.2.3 select question 3 0210.2.4 theoretical improvement of some arithmetic problems 30410.3 dynamic programming 30710.3.1 a table instead of a recursive 30710.3.2 matrix multiplication order arrangement 30910.3.3 optimal binary search tree 31110.3.4 all point pair Shortest path 31210.4 randomization algorithm 31410.4.1 random　Number generator 31510.4.2 Jump table 31910.4.3 primality test 32010.5 backtrackin

48916.3.4 process contains how many steps 49016.3.5 need to control and monitor 4911 6.3.6 when to redefine a project objective 49216.4 law Field 49216.4.1 Royce Methodology 49316.4.2 Extreme Programming (XP) 49616.4.3 Rugby methodology 50016.5 Case study 50516.5.1 XP project: ATRAC T 50616.5.2 Local main customer: FRIEND 50816.5.3 Distributed project: JAMES 51316.5.4 Case Study summary 51816.6 recommended readings 52116.7 Exercise 521 Part 4 Appendix Appendix A design Pattern 525a.1 Abstrac T