Information Science. No. For each question, choose one correct answer and write its symbol (A E) in the box.

Transcription

1 For each question, choose one correct answer and write its symbol (A E) in the box. (A E) Q16. When compiling the program below, the name of which is prog.c, the following error is reported. Which program reported this error message? ( prog.c) #include <stdio.h> void sub(void); int main(void) { sub(); return 0; $ cc -o prog prog.c /tmp/ccpfk6vw.o: In function main : prog.c:(.text+0x7): undefined reference to sub (A) Preprocessor (B) C language compiler (C) Linker (D) Loader 1

2 Q17. Select the value that will be printed when the following C program is executed. C #include <stdio.h> struct sample { int x, y; ; int func(struct sample *a, int n) { int i = n - 1; while (--n >= 0) if ((a + i)->x * (a + i)->y < (a + n)->x * (a + n)->y) i = n; return i; int main() { struct sample val[] = { {3, 8, {5, 6, {7, 4, {9, 2 ; printf("%d\n", val[func(val, 4)].x); return 0; (A) 3 (B) 5 (C) 7 (D) 9 Q18. What is the output of the following Java program? Java class A { int f() { return 1; int g() { return 2; class B extends A { int f() { return 10; int g() { return 20; class C extends B { int f() { return 100; int g() { return 200; class Test { public static void main(string[] args) { A x = new A(); B y = new C(); A z = y; System.out.println(x.f() + z.g()); (A) 3 (B) 21 (C) 201 (D) 30 (E) None of them 2

3 Q19. Which gives the tight estimate on the worst case time complexity of heap sort? (A) O(log n) (B) O(n 2 ) (C) O(n 3 ) (D) O(n log n) Q20. Choose the expression for the output f of the following circuit. f (A) (X +Y )(Y +Z) (B) XY +Y Z (C) XY +Y Z (D) (X +Y )(Y +Z) Q21. Choose the operator that is not associative. (A) AND (B) OR (C) EXOR (D) NAND Q22. Select the Newton iteration formula for solving the equation x 2 6 = 0. x 2 6 = 0 (A) x n+1 = x3 n 8x n x 2 n 6 (B) x n+1 = 1 ( x n + 6 ) 2 x n (C) x n+1 = x 2 n + x n 6 (D) x n+1 = x n 2 x2 n 2x n 3

4 Q23. Define five functions T i (n) (i = 1,..., 5) over natural numbers as follows: T i (n) = 1 (i = 1,..., 5) for n = 1. For n 2, T 1 (n) = T 1 ( n/2 ), T 2 (n) = T 2 ( n/2 ) + 1, T 3 (n) = T 3 ( n/2 ) + 1, T 4 (n) = 2T 4 ( n/2 ), T 5 (n) = 2T 5 ( n/2 ). Which of the following is the largest? 5 T i (n) (i = 1,..., 5) n = 1 T i (n) = 1 (i = 1,..., 5). n 2 T 1 (n) = T 1 ( n/2 ), T 2 (n) = T 2 ( n/2 ) + 1, T 3 (n) = T 3 ( n/2 ) + 1, T 4 (n) = 2T 4 ( n/2 ), T 5 (n) = 2T 5 ( n/2 ). (A) T 1 (10) (B) T 2 (10) (C) T 3 (10) (D) T 4 (10) (E) T 5 (10) Q24. Let x i, y i {0, 1 for each 1 i 3 and P = {(x 1, y 1 ), (x 2, y 2 ), (x 3, y 3 ). We say that P has a solution if there exist an integer n and (x ij, y ij ) P for 1 j n such that x i1 x i2 x in = y i1 y i2 y in. Choose one that has no solution. 1 i 3 x i, y i {0, 1 P = {(x 1, y 1 ), (x 2, y 2 ), (x 3, y 3 ). n (x ij, y ij ) P (1 j n) x i1 x i2 x in = y i1 y i2 y in P (A) {(1, 1111), (11, 1), (10, 0) (B) {(1, 111), (10111, 10), (10, 0) (C) {(1, 101), (10, 00), (011, 11) (D) {(10, 101), (011, 11), (101, 011) 4

5 Q25. For a regular expression E, we write L(E) for the language that E denotes. Suppose that E 1 = ϕ and E 2 = ((ε + 0) + ( ) )ϕ. Then let S 1 = L(E 1 ) L(E 2 ) and S 2 = L(E 1 ) L(E 2 ). Choose the correct one. E L(E) E 1 = ϕ E 2 = ((ε + 0) + ( ) )ϕ S 1 = L(E 1 ) L(E 2 ) S 2 = L(E 1 ) L(E 2 ) (A) S 1 = ϕ = S 2 (B) S 1 = {ε = S 2 (C) S 1 = {ε, S 2 = ϕ (D) S 1 = {ϕ, S 2 = ϕ (E) S 1 = ϕ, S 2 = {ε Q26. For MIPS architecture, we assume the register $s0 initially has the value 5. Choose the assembly code which multiplies the value in $s0 by ten. The instruction sll shifts a register to the left by a constant number of bits, and the instruction add adds two registers. For example, sll $t0, $s0, 2 shifts the value of $s0 to the left by two bits and puts the result into $t0, and add $s0, $t0, $t1 adds the values of $t0 and $t1 and puts the result into $s0. MIPS $s0 5 $s0 10 sll add sll $t0, $s0, 2 $s0 2 $t0 add $s0, $t0, $t1 $t0 $t1 $s0 (A) sll $t1, $s0, 2 add $t2, $s0, $s0 add $s0, $t1, $t2 (D) add $s0, $s0, $s0 sll $s0, $s0, 2 add $s0, $s0, $s0 (B) sll $s0, $s0, 3 add $t1, $s0, $s0 add $s0, $s0, $t1 (C) sll $t1, $s0, 2 add $s0, $s0, $t1 sll $s0, $s0, 1 5

6 Q27. Consider the following linear programming. How many feasible solutions are there in the set S = {(x 1, x 2, x 3 ) x 1, x 2, x 3 {0, 1? S = {(x 1, x 2, x 3 ) x 1, x 2, x 3 {0, 1 Minimize: x 1 + 2x 2 + 3x 3 Subject to: 2x 1 + 3x 2 5x 3 2 (A) 0 (B) 1 (C) 2 (D) 3 3x 1 + 4x 2 2x 3 0 2x 1 4x 2 + 3x 3 0 x i 0 (i = 1, 2, 3) Q28. A database designer defined the following functional dependencies on the relation R(A, B, C, D, E, F, G). Here, we suppose that R is defined in the 1st normal form. Which is the 2nd normal form of R? R(A, B, C, D, E, F, G) R R 2 Functional dependencies : ABC D, AB E, BC F, F G (A) {A, B, C, D, E, F, G (B) {A, B, C, D, E, F, {F, G (C) {A, B, C, D, E, {B, C, F, {F, G (D) {A, B, E, {A, B, C, D, {B, C, F, G Q29. Suppose that variables x and y are binary (0 or 1). How is max(x, y) given? x y 0 1 max(x, y) (A) x + y xy (B) (1 x)(1 y) (C) xy (D) x + y Q30. Select the single error correcting code. (A) {00000, 01110, 10111, (B) {00000, 01010, 10101, (C) {00000, 11000, 00111, (D) {01000, 10001, 00110,

7 (Use the space below for your calculations) ( ) 7