According to memories, embarrassed, some 9CBS document center is not compatible.
Seeking F
For i = 1 to Na [i] = a [n 1-i] to recycle the array value, each number has two copies
What is AMDAHL (字 模 模, uncertain) French AMDAHL
In a computer programming parallel handler, a small number of required instructions is a feature that affects performance, even if the new processor is added, it cannot improve the running speed. This is the AMDAHL rule. Some people are challenging parallel processing at this point. Some people think that parallel treatment is good at increasing the number of processors to improve throughput and performance.
It is determined whether NP judges C, and the D equivalent judgment C does not have input to make it true to determine whether c can be reduced (whether it has been minimized) is NPRSA based on an integer decomposition: If there is a better rule of integer decomposition, The security of this method is declining. (√) This method is based on an unproven basis: the intensity of RSA is equivalent to the large number of decomposition. This method is based on the difference in the amount of arithmetic calculation of integer decomposition and inverse operation.
Newton iterations an increase speed of the number of effective digits. Given the Newton formula: ........ Each time a time increases 2 digits each time Double? Such as XN 1-a = 0.00001 (√)
S → AA → AA | 0 Quit 00000 How many analytical trees I. 10 II. 14 III. 24 IV.72
Which of the following is not a linear calculation, an endless sub-map, a double-link, a single source point, shortest path, a fixed point, to generate a forest
Those who are multithreaded features their own stacks and the context own address space sharing files and data
What is the reasoning method of an expert system is launched by a known conclusion (backward) is known from known conclusions (forward), which gives facts, contradictions or known facts. (II III)
Multi-thread wants to call the function Fill to populate a buffer, return to the pointer to the buffer, Fill is placed in the critical area, and ask which one can guarantee mutually exclusive. Buffer is a global variable. Buffer is a local variable of the caller and passes the buffer's pointer to the Fill. Buffer is a partial variable of Fill, returns a pointer to the buffer. RISC instructions: | OPCode | RA | RB | Offset | RA ← (RB Offset) The number of register is doubled, and the change in the size of the address is increased. I. × 4 II. × 2 III. No IV. Except 2 V. Except 4
The register that the caller or the called by the caller is saved in the RISC, and the save register value can be saved by the caller or by the caller. In the following program, which register is saved in both methods.
Given the mathematical formula and ask which section of the 5 segment of the program below.
A [i] = (i2 1) mod nx = seed; y = x; seed is the initial value DO x = a [i]; y = a [a [y] while x! = y Question i) Always stop (√) II) and N and SEED related III)
Ask which one with log n in the same order T [N] = T [N / 2] 1 T [N] = T [n / 2] log n
Raw after reading, which will generate i write data and then read WAWWAR pipeline without data direct access (Data Forward), which situation needs to be stopped waiting
When the pipeline detects the interruption of each clock cycle pipeline when the air is empty, each transfer command occurs.
7 processors can be exchanged with adjacent elements, ask the best cases of the Best Lesser Live (any sorting method) A) 2 b) 3 c) 6 (√) D) 24 E) 42
Hash linear detection, function is i mod 10 to 17 28 Add Hash Table
When is it true and only two variables are true, it is true. C abstract base class, asking which is wrong (vain class and abstract class) Virtual center () = 1/2 * (1 r ()) Virtual int L () = ... .Virtual Int r () = ... u () = ... d () = ... i) It is not possible to generate an instance II) Its inheritance class must maintain the behavior of the center. Its inheritance class must define l ....
Knapsack problem (backpack problem) i) This function does not satisfy the assertion II) Satisfaction and is a polynomial time III) Satisfaction and index time IV) This program is not terminated
Krusal is an i) a kind of greed II) branch boundary IV)
N (5/4), NLOG N, N * E16 which growth is slower
Call by value, (test value) seeking program results 12 3
Call by Reference (test reference), ask for program results 31 3
A = 0m1n (m is less than or equal to N), B = 0 m1 N (M is greater than or equal to N), B → 0ba b is regular A∩B is a context-independent A, B is all regular.
{Xx | x∈L} is also ∈LL is the regular L is the context-independent L is a recurrence of enumeration
NOT TRUE (not complete, five options) A and B regular, the A∩B regular a and b context have nothing to do, then A∩B context has nothing to do
If A can be a number b, if A is limited, B is limited, if b can be a number, if b is limited, a limited
Bubbling, 1 ... i, sorted to i, ask a probability of switching between A [I] and A [i 1]. a) 1/2 b) I / (i 1) c) 1 / n d) N / 2
Multi-threaded systems such as UNIX, NT, VMX, which rely on interrupt I / O task switching missions
Maximum blocks of blocks than TLB Looks with less (incomplete) Translation Lookaside BuffalPage Fault than Cahe Missing Less Page Fault than TLB Missing less
The page list is in the virtual memory, the maximum number of wages when the address conversion does not have the shortage, three times three times three times.
Ask which one cannot be expressed in the above form, indicating floating point s | e | f (-1) s (1.f) 2e-127 a) 100 b) 15.5 c) 0.1 d) 0.25 E) 0.0625
-14.5 1 | 1010 | 1101 Each of the above floating point numbers into mathematical formula
Which relative error large A * A * A B C b) A * a-b * c) a * a * (b c) d) a * a / b * csqrt (A * a b * c)
Two implementations of the linked list are sorted inserted inserted in a temporary queue. When you look up, use MERGE, and then return to the original queue. Have n elements, insert M elements, finally look up once, ask time complexity. O (M (N M))
The title is true. Ask the second type of time complexity O (M N) log (M N) O (M (Log (M N))
A two string number is given, asking the second number is the middle result of which of the first numerous columns.
Indicates that the universal signal light uses a few binary signals. (N value) i) log2N II) N iii) n2 iv) n!
Asking which x is always added 1, p, V is a binary signal (P x = x 1 V)
Ask the number of Feb number F-F1 T execution to ask the number of times O (N)
Relationship between F and N, CN B) N2
Q test of the nested relationship of Pascal calls.
Connecting the topic with static pointer to DEREFERENCE how many times (test static chain)
Complete function insert (** p x) C program asks which error uses memory reference technology waste collection, want to complete P = Q, P, Q is the pointer reference (P's reference technology, Q's reference technology 1)
Several length is 5
How many types (index) of the topic length of 2N 1
An automatic machine gives a status conversion table. There is an unknown state, to identify a string, ask for input 0, which state.
The minimum length word length received by the finite automation of N> 2. I) 1 II) 1 INSERT, DELETE, FIND asked which data type to achieve these three fastest balance binary trees E → E * E E E → (e) E → E E operator priority question What is not E * E * Shift "× (p (x) çQ (x)) and which equivalent ~ x (~ p (x) è ~ q))" × (x) ç q (x) "×" y (p (x) ) Ç q (y)) Binary tree, ask the minimum number of nodes L is the number of leaves, S is the number of nodes of children with a single child 2L-1 Which correct 2L-1 = All right E® Fée | TF®T® Not T Asks which of the I Not Left Combination II é priority is lower than NOTIII é Page Change Leading to Internal Debris Less Page Entry Extra Small Protection Granularity F (x, y) f (x, y) is reduced to calculate the time, and the following compilation optimization algorithm can be used (eliminating sub-expression) Select a copy propagation, code extraction, etc. Dynamic type check, static type check compiled long, dynamic execution time long static all check static code length, dynamic code short 3 operations make P point to RINT * PINT ** Q = & PINT R * P = r * q = & rq = * P Call must do what must be done Save Program Ruper Mask Interrupt Save Register A (b * c) * cannot introduce BB How many kinds of 01 ends and / or 01, the length is 10 characters The difference between A and B is 17 integer times this relationship in accordance with I) Self-contained II) Symmetrical III) Slice a [100, 50]: Address (A [I, J] -50 50J in the address of A [I, 7] (serial number in the two-dimensional array) Critical area can be used for I / O devices shared memory Which of the following cannot speed up the pipeline deployment loop to change the program to process call
