(67) How many key comparisons occur in searching for key 35 in the given hash table (2分)3 M( B, H8 m6 w7 Z* W3 |- I) n4 R
A) 0 B) 1 C) 2 D) 38 y% t4 c! i4 ^ L7 s
(68)& If a new key 67 is inserted into the given hash table, what will be its address (2分). o( K0 m- B" q2 d
A) 3 B) 4 C) 5 D) 69 P; t# T7 y$ }) J& _" q b- K' ?
(69) Suppose the contents of the DOS IF1.BAT file on the hard disk is as follows.) Z B5 w( v8 r" P5 D4 B: }
@ECHO OFF# T& Z0 r# h! u; Y3 w
MEM>FILE1
) I. s7 e& i( O3 `7 m SORTFILE2* e) G% i, x8 O3 ], i$ ]! R
DEL FILE1* d1 J+ h* Z' O- W8 m
@DATE
) u5 S$ v4 h0 C+ L( ?( c2 D/ X @TIME2 e+ v/ v" |! n- o
IF EXIST %1 ECHO % IF FOUND+ u! F0 e7 V* P
If all of the commands are successfully executed after IF1 FILE1 is/ W9 G# z+ |: O, C$ O. y6 D: p9 u
typed, then the screen displays2 z6 Q( T: q! C* \3 t% C
A) None B) Date and time C) FILE1 IS FOUND D) FILE2 IS FOUND7 m. y4 }& P C- q- |/ r
(70) If the files in the current directory are: Q8 N d6 N. e$ Z# J/ `
aac, abc, acb,acc, aca, ao, al, a2, ab, ac, aa,# [1 l- X! B5 I, Z7 \
and the command ls a[bc] is executed, how many files will be listed1 I/ U- J3 y& h2 Q5 q9 \% z
(2分)0 ?0 W% }+ K( J! J
A) 3 B) 4 C) 5 D) 6
4 v$ y1 A9 L# g (71) In order to append a standard output to an existing file, which of the following operators is used in the UNIX system
& m0 s3 Q9 J- I9 U# r+ B, y A) | B) & C) > D) >>
2 l1 b- U z- o; E (72) Consider the following figure, where the shaded parts represent already assigned blocks of memory, and the unshaded parts represent free blocks. (2分) If there is a request for 40KB of memory and the best-fit algorithm is used, then the beginning address of memory that is allocated in response to the request is$ r6 N4 h( x" A; R; Z& F
A) 100KB B) 190KB C) 330KB D) 410KB
5 ^0 X1 [) Q4 g8 \2 t& d (73) On a certain disk, there are 200 tracks, numbered 0-199, the current position of the disk head is track 53. If the shortest-seek-time-first scheduling algorithm is used when the tracks. H4 M) Z3 y+ u, H
98, 183, 37, 122, 14, 124, 65, 677 J% Y' i% @/ x& O8 _, A6 r0 b/ {
are requested, then the head-moving sequence that results will be (2分)5 M4 x8 T; `. [. `, U, |
A) 65, 67, 37, 14, 98, 122, 124, 183
6 b4 N7 V: j5 J; t1 D% j B) 65, 67, 37, 98, 122, 124, 183, 14
1 X4 U! Q0 D( _- e8 Q5 p) O% M- z C) 65, 67, 98, 122, 124, 183, 37, 14
; ^4 n" ]/ o5 F8 v D) 98, 183, 37, 122, 14, 124, 65, 67
' ?2 w+ w Y' D/ V! g! H (74) Whant operation on relations R and S produces the relation shown below
( m0 e, ]7 k! g6 @! J9 ]1 | {tuple│tuple∈Rtuple∈\ S}5 @+ U* i8 S, x- q
A) Union B) Difference C) Intersection D) Division8 f9 p4 U" F! r, @4 Z* }. y& Z! x4 l- f E
(75) When embedding SQL in a C language program, the prefix that should be added to all SQL statements in order to distinguish SQL statements from the host language statements is* Z, L/ r' u* S4 [: \, E' S
A) : B) EXEC C) EXEC SQL D) SQL
! [! U6 C5 A" K$ v$ ^/ z- G (76) In the ORACLE system,sets of SQL statements and control flow statements that have been named,compiled,and stored tn the database are referred to as stored/ p% p- a/ \3 G$ K: f
A) batches B) procedures C) triggers D) transactions
+ H% ~; N7 j- A0 E) f2 x8 N (77) Which of the following statements about object oriented databases is NOT correct (2分)8 q; J/ ~' z0 r, o5 c0 z9 r. S
A) Each object has a unique object identity in the system.
! t5 J; f6 m" X- u9 ?* Y7 O3 n B) Encapsulation and inheritance are two important features of object oriented databases.
- H* q* `! x5 P5 Y+ i C) A subclass can inherit the attributes and methods of all its superclasses.
# Q# y0 s% T, m- f! K1 V D) A superclass includes the attributes and methods of all its subclasses.& k3 c8 g; ?4 c
(78) In the design phase of software engineering, decomposition of the program into modules should follow the principles of; Y O& I$ Q& A( @' u
A) low cohesion with low corpling B) low cohesion with high coupling
4 x& D# k0 t0 m! Y* s9 A- S C) high cohesion with low coupling D) high cohesion with high coupling2 L% G B7 h$ U5 v7 k1 z
(79) Specifications for software should contain&nbs p;several components, e.g., specifications of' q1 I3 w1 M' h! }% z# [
information flow,, I) ]8 s0 D! ^
user interface,2 O% l4 J2 {3 s4 d
functional requirements, and
) r& @: w& D7 u9 H% m design constraints.$ A2 O8 L8 c- b+ G+ q
Two other important components are specifications of the (2分)
% z$ G$ ?7 |. q0 j; d* n A) methods of testing and ways to obtain quality assurance
' _6 a H) Y: d u2 H7 K& O B) criteria for testing and ways to obtain quality assurance7 @* u" ?2 h: E# X G q$ I) q6 `1 ^
C) methods of testing and criteria for function assurane
+ }( v/ @# n U- A4 @) h D) criteria for testing and methods of function assurance |