61)What is the decimal value of the following 32-bit two’s complement number?
' n0 L9 V+ f! ^# I6 n% x 1111 1111 1111 1111 1111 1111 1100
/ \0 [7 i% B8 c A) -8 B) -4 C) 4 D) 8
0 I4 @/ [+ f/ \+ ~1 d& y" } (62)How many subsets does A have?
' R6 {% d- H/ x7 y$ u Let A={E,O,A,W,P,V,B}
9 I5 k% f, e5 O2 [ A) 12 B) 36 C) 64 D) 128
7 T4 R$ y8 j& |, M9 r Y (63)Suppose V1=,V2=,where R is the set of real numbres,+, and.are respectively addition2 U- \7 w3 W% m
and multiplication. Let f: R→R and f(x) = ex, which of the following propositions
) k6 x" a8 x* K; d) G: X0 \# x is true?- z" m9 c) I" A! R5 m y2 e ^7 w
A) f is a surjective homomorphism from V1 to V2
1 b0 b) m9 A' z8 [ B) f is an injective homomorphism from V1 to V2
- p, D' v+ O8 k4 B- Q' |; n0 Z6 @ C) f is an isomorphism from V1 to V2( _1 V/ y) L% f% b6 |1 J& Z3 r
D) None of the above2 S3 I1 ?- q& d" b8 A! d
(64) P(n) is the predicate’if 4 divides n then 2 divides n’.What is the truth value of P(12)?. f {; H7 E1 A
A) 10 B) F C) T D) None of the above3 ?. y) B M! Y9 v1 r$ w5 R& h: V
(65) An algorithm to solve a given problem has time complexity
4 g \( L$ t1 L4 _1 X- L" Y/ a T(n)=nlog2n-(n-1)& Z2 @3 |6 Y" b4 Y0 }+ z" {, W' q
Given that the algorithm takes 0.8 second for a problem in which n=1024,how long should- ]( |5 H% g! P
it take for a problem in which n=4096? (2 Points)0 F8 a- `- |9 S" S: ~; K# M: f
A) 39 seconds B) 3.9 seconds C) 3.9 minutes D) 0.8 seconds1 p+ J7 C% M0 h! [. ]6 S7 f( E: g
(66) What is the definition of a Path?: B; z Y$ b) }/ Q: K; L6 h
A) A sequence of vertices and the edges formed by each successive pair of vertices.4 R) U7 a6 K9 p. u6 H+ q; a% E
B) A walk with distinct vertices.
2 x! h9 \' q' Y3 Z* ?! |0 q C) A walk with distinct edges.
$ i: g$ R9 j5 I5 K( Z D) None of the above
/ F2 M/ c# m$ k. i* b! w& p4 S% h (67) The figure below shows a record used for recording information about a named event., P3 { Q$ P% x
Which of the following statement is incorrect? (2 Points)
+ R5 K" r2 Q" q8 a. K VAR r: record/ L' D x: v" z
event:array[1..10] of char;
4 R& ]% J4 O i: g1 a3 H place:array[1..20] o' y' M4 v: K" C- e
f record
9 O9 b$ G9 y0 C plname:array[1..15] of char;- ~& W- c& m8 C6 `2 z1 |' L
date: array[1..5] of record: ?$ ~/ j7 R: a5 T+ T9 S
mo:1..12;8 \6 \ v8 A" `1 i$ _& ~, ?
day:1..31;
" B3 E8 L3 f& V2 D year:integer3 R2 l3 q2 O8 i# p" r
end8 w8 P x: b _8 r; m6 F, ?
end# r4 N6 l9 A3 X1 \5 S& Y
end;) B# x" [( v" d$ I) X
A)This is a one-dimensional array of records,also called a table.
2 s- `, f& q E4 X B)This is so called record of arrays;8 F- y/ U$ C* }
C)The event can occur in up to 20 places and on up to 5 different dates in each place.
. r6 ]' `4 p8 ~) D4 j D)A reference to r.place.date[j].mo will access the month of the jth occurrence,
! E/ j, b6 L& L6 ` in the ith place,of the event named in r.event.
3 L3 g3 i3 q m) z f4 p3 \# @* g (68)Which of the following statements is true regarding simple sort techniques? (2 Points)7 q0 ~! U* U% G
A)Exchange sort is frequently referred to as a bubble sort.8 P& L2 a% s# {7 e+ I
B)Exchange sort is the least expensive
1 G2 D3 z6 i% m" g; k) ] C)If random data are in an array that is to be sorted,an Insertion Sort will give the
% p% Q1 P3 ], N0 ^ best performance for large elements with small sort items.& [; a& m* T, k7 Q" \0 {7 A
D)Both Insertion Sort and Selection Sort require O(n)moves. |