97 GRE CS_SUB Remembrance (Question No .: Options]
1. Which 16 binding of 0, 1 interlaced binary string A is produced below. 0101 B. AAAA C. FFFF D. BBBB E. 1010 [B]
2. Array a [0, ....] Each element is different, performs the following procedure for i = 1 to n DOA [i] = a [n 1-i] Question the subsequent group value: a. The same as the original value B. Each element has two copies C. Reverse relationship with the original value [B]
3. Which is not NP-HARD ProBLEM? A. 3-color coloring B. 4-color coloring C. There is a shortest path D in the drawing. Cargo burden [c]
4. The function f accepts a binary operator and binary number, followed by the following rules: from the leftmost intercepted two-digit operation, the result is placed on the most left and output of the input until the input string is air. example. F (XOR, 101101) operation When the input string changes are as follows: 111010101 101 11 0 outputs 10110. Then f (xor, 10011) = a. 10111 B. 11101 C. 10011 D. 11001 E. ? [D]
5. f The same topic, if f (xor, x) = 101, then X can be bites: a. 0011 B. 1101 C. 1000 D. 0101 E. 1011 [e]
6. In the figure below, the value of the output Y = x is (set A b C D is a random change):
A b y
CDA. 100% B. 75% C. 50% D. 25% E. 0% [A]
7. The access to the variable X is correctly used by the P V operation is: a. P; access (x); P B. V; access (x); p C. P; access (x); v [c] 8. = A. θ (nk) B. θ (NK 1) C. θ (NLOGN) D. θ (kn) [b] 9. For a number, ask for minimum, which structure is not suitable? A. Ordered chain table B. Ordered array C. Search number D. Hash table E. AVL number [D] 10. What is the loop constant of the program? The original element value of group A (1 ... .b) is A0 K: = 1WHILE K <> B D0 Begin K: = K 1 A [K-1]: = a [k] end
I. K A. II, III ONLY B. I, III ONLY C. Ii Only D. I, II, III ONLY [C] 11. The conflict probability of the Ethernet frame is c, which is resolved with the resend, and the probability of each retransmission is independent, and several error frames have been issued before the average number of correct frames is issued? A. C / (1-C) B. (1-C) / C C. 1 / (1-c) D. 1-C E. C [C] 12. Some procedures: Program prog; var A: array [1 ... 3] of integer; J: Ingeger Procedure P (x, y: integer); begin x: = x 1; j: = jx; y: = yx endbeginfor J: = 1 to 3 DO A [J]: = J; J: = 2; P (J, A [J]); Writeln (a [1], A [2], A [3], J); END If the parameter passes is BY-VALUE, the output is: [1, 2, 3, -1] 13. For the above program, if the parameter is passed to BY-Reference, the output is: [1, 2, 3, 0] 14. The following programs calculate the number f (N: ingeger; var f, f1: integer); procedurevar t: integerBeginif n = 2 Then Begin f: = 1; T: = 0 endelse begin f (n-1, f1, T); f: = f1 t; endnd; ask, call f (n, y, f1), the number of recursive times is: A. θ (n) B. θ (CN) C. θ (NLOGN) [A] (C is constant) 15. For the top, the relationship between Y and N is: a. Θ (n) b. Θ (cn) C. θ (nlogn) [b] (c is constant) 16. Which is produced Memory Leak? A. P: = nil; new (q); p: = q; b. P: = nil; new (q); Q: = P; c. P: = nil; new q); p: = nil; [b] 17. There is a floating point format: The value is:? Representation: 18. Which number cannot be represented by the topic: A. 17 B. -3.5 C. 0.1 D. 0.75 E. 0.25 [C] 19. Practical use of LR to handle the purpose of the secondary anti-method: i. Only two kinds of grammar trees II are produced. The second sense can make the analytical table state less III. Eryi method may have fewer production [II III] 20. The SYSTEM crash may cause the file system of the practical buffer in memory, how to solve? I. Increase the buffer size II. Buffer double III. IV. SIDK has automatic writing multiple features [III] 21. Which automatological identification language L: (# a 2 # b) MOD 3 = 0? (#A represents a number of A) 1 A. A B B A B. B 2 3 A 22. Functional Language: (Set n = 1 in (Set F (x) = x n in set n = 2 in f (17))))))))) In static scient scope and dynamic scient, there are f (17) = 19b. Under static Scope and dynamic scope, f (17) = 18c. Static Scope: f (17) = 19, dynamic scope f (17) None definition D. Static Scope: f (17) Non-defined, dynamic scope f (17) = 18e. Unfained twenty three. In order for f (x, y) f (x, y) time to happen, how to compile fluidization? A. Code Processing B. Copy propagation C. Elimination child represents [C] 24. There is a program below: (1) A: = 1) While a 26. In general, there is no characteristic of RISC? A. And Memory Reference B. Let only have load, storec. Convening D. Order only and register related E. RISC compiler is simpler D. INTEGER Instructior 27. Language L is undecidable, then I. IS undecidableii. L Contains III in a Recurive language. IS Recursive 28. RISC RDOST, RSource1, RSource2 Features: rdost = rsource1 OP Rsource2 procedures are as follows: Mor R4, ... Mor R0, ... MOR R1, ... MOR R2, ... CALL PLOAD R3, ... ADD R4, R4, R0ADD R4, R4 , R3, R0, R?, R4P: MUL R0, R0, R0Mul R1, R1, R1mul R2, R2, R2ADD R4, R1, R2Add R0, R0, R4RETURN There are two methods to save registers are not broken in the call. 1 The number of registers to be saved after the calorker saves the call to save the call, and the registers to be saved are: a. R0, R1, R2 B.R1, R2, R4 C.R4 29. The value of A [i] in the topic, A initial value is 10000000, i is not destroyed in R2, each element is 4 bytes, how to program? A. MOV R0, 10000000MOV R3, R2SHL R3, R3, 2 (left shift two) LOAD R1, (R0 R3) 30. The CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CACHE is 95%, and 90% remaining in Cache Memory, and the rest can be found in Memory. CPU sent 107 visit requests per second, and how many of Memory received each second? 31. BUS is known per second. . . Asking for a request, BUS is busy: 50% 32. Which is wrong? A. L1 can be identified by DFA, B. L2 can be identified by DFA, C. Then L1∩L2 can be identified by DFA D. L1 can be identified by NFA, e. L2 can be identified by NFA, f. Then L1∩L2 can be recognized by NFA G. L1 is unrelated to the context, h. L2 is also, i. Then L1∩L2 is also a context-independent 33. A program is 5 seconds, must serial, the calculation takes 16 seconds, can be in parallel, output takes 10 seconds, and 5 CPUs can be used in parallel, but it cannot be used. Q: Serial time and running time in 16CPU SYSTEM: 45/7 34. Single-link table, with head pointer H T Realize the time required for the following structure? I. STOCK II. Queue III. Optimize Queue, take MIN each time. 35. The number of language L, O is a multiple of 12, the number of L is a multiple of 10, identifying its DFA needs a few states? A. 12 B. 10 C. D. E 120 [E] 36 NFA in n state, converted into DFA, must not exceed A. N B. N2 C. 2N D. Nlogn E.2N [E] 37. IF P ≠ NP, THEN: I. SAT IS P II. IS P III. Sat is np [iii] 38. Recycling unused units with reference count, doing P: = Q, what to do in order? A. P refers to B., ref count minus 1, p: = q, Q refers to C., ref count plus 1 39. When testing, there is a three degree of three levels of statement: Each statement is executed by II. Branch poor: No III in the condition transfer is also Iv. Branch is tested v. Expressive Poor: Each expression is tested in a value of VI. With VII (Expression in a branch statement or assignment statement), then the relationship is: II contains I. III and I II without inclusive relationship 40. A few execution order of several concurrent executions If the result is the same as the result of a serial execution order, it is called sequential. Use R2 (X) to represent the read operation of the Task 2 pair X, Then, the following execution is inseparable? I. R1 (x) R1 (x) W1 (Y) W1 (Y) II.II. R1 (x) R1 (Y) R2 (Y) W1 (Y) W1 Y) 41. A. (p Q) (7P Q) B. (P Q) Q Ask the formula A.B can be satisfied? Yongzhen? Or forever?
