C) R is an equivalence relation D) R is a function
(63) If p and q are Boolean variables, which of the following formulas is (are) tautological?
Ⅰ. (┐p→q)↔ (p∨q)
Ⅱ. ((p→q))∧(q→r))→(p→r))
A) none B) Ⅰ only C) Ⅱ only D) Ⅰ and Ⅱ
(64) Which of the following statements is (are) true?
Ⅰ. The number of cyclic subgroups of the additive group of integers is infinite.
Ⅱ. The number of cyclic subgroups of the additive group of real numbers is infinite.
A)&nb sp;Neither B) Ⅰ only C) Ⅱ only D) Ⅰ and Ⅱ
Questions 65- 66 refer to the space requirements of different methods of storing graphs. The choices for these questions are combinations of the following statements.
Ⅰ. The space required depends on the number of vertices.
Ⅱ. The space required depends on the number of edges.
(65) When the adjacency matrix method is used to store a graph, which of the statements is (are) true?
A) None B) Ⅰ only C) Ⅱ only D) Ⅰ and Ⅱ
(66) When the adjacency list method is used to store a graph, which of the statements is (are) true?
A) None B) Ⅰ only C) Ⅱ only D) Ⅰ and Ⅱ
Questions 67-68 are based on the following information,
A hash table with hash function
h1(k)=k mod 13
is shown below.
0 1 2 3 4 5 6 7 8 9 10 11 12
35 33 48 25
Collision is resolved using the hash function h2(k)=(k mod 11)+1.
|
