1. 下列說(shuō)法正確的是 （ ）
A. Java語(yǔ)言不區(qū)分大小寫(xiě)
B. Java程序以類(lèi)為基本單位
C. JVM為Java虛擬機(jī)JVM的英文縮寫(xiě)
D. 運(yùn)行Java程序需要先安裝JDK
2. 下列說(shuō)法中錯(cuò)誤的是 ( )
A. Java語(yǔ)言是編譯執(zhí)行的
B. Java中使用了多進(jìn)程技術(shù)
C. Java的單行注視以//開(kāi)頭
D. Java語(yǔ)言具有很高的安全性
3. 下面不屬于Java語(yǔ)言特點(diǎn)的一項(xiàng)是( )
A. 安全性
B. 分布式
C. 移植性
D. 編譯執(zhí)行
4. 下列語(yǔ)句中，正確的項(xiàng)是 ( )
A . int $e,a,b=10
B. char c,d=’a’
C. float e=0.0d
D. double c=0.0f
Wi-Fi pollution, or an excessive number of access points in the area, especially on the same or neighboring channel, can prevent access and interfere with the use of other access points by others, caused by overlapping channels in the 802.11g/b spectrum
數(shù)字運(yùn)算，判斷一個(gè)數(shù)是否接近素?cái)?shù)
A Niven number is a number such that the sum of its digits divides itself. For example, 111 is a Niven number because the sum of its digits is 3, which divides 111. We can also specify a number in another base b, and a number in base b is a Niven number if the sum of its digits divides its value.
Given b (2 <= b <= 10) and a number in base b, determine whether it is a Niven number or not.
Input
Each line of input contains the base b, followed by a string of digits representing a positive integer in that base. There are no leading zeroes. The input is terminated by a line consisting of 0 alone.
Output
For each case, print "yes" on a line if the given number is a Niven number, and "no" otherwise.
Sample Input
10 111
2 110
10 123
6 1000
8 2314
0
Sample Output
yes
yes
no
yes
no
The government of a small but important country has decided that the alphabet needs to be streamlined and reordered. Uppercase letters will be eliminated. They will issue a royal decree in the form of a String of B and A characters. The first character in the decree specifies whether a must come ( B )Before b in the new alphabet or ( A )After b . The second character determines the relative placement of b and c , etc. So, for example, "BAA" means that a must come Before b , b must come After c , and c must come After d .
Any letters beyond these requirements are to be excluded, so if the decree specifies k comparisons then the new alphabet will contain the first k+1 lowercase letters of the current alphabet.
Create a class Alphabet that contains the method choices that takes the decree as input and returns the number of possible new alphabets that conform to the decree. If more than 1,000,000,000 are possible, return -1.
Definition
/*
* EULER S ALGORITHM 5.1
*
* TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM:
* Y = F(T,Y), A<=T<=B, Y(A) = ALPHA,
* AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B].
*
* INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N.
*
* OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T.
*/
The idea for this book was born during one of my project-related trips to the beautiful city
of Hangzhou in China, where in the role of Chief Architect I had to guide a team of very
young, very smart and extremely dedicated software developers and verification engineers.
Soon it became clear that as eager as the team was to jump into the coding, it did not have
any experience in system architecture and design and if I did not want to spend all my time in
constant travel between San Francisco and Hangzhou, the only option was to groom a number
of local junior architects. Logically, one of the first questions being asked by these carefully
selected future architects was whether I could recommend a book or other learning material
that could speed up the learning cycle. I could not. Of course, there were many books on
various related topics, but many of them were too old and most of the updated information
was either somewhere on the Internet dispersed between many sites and online magazines, or
buried in my brain along with many years of experience of system architecture.
