C Programming
C Programming
Answer key☟
A. B. C. D.
gatecse-2011 programming programming-in-c normal array
Answer key☟
What is the output of the following C code? Assume that the address of is (in decimal) and an
integer requires four bytes of memory.
int main () {
unsigned int x [4] [3] =
{{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}};
printf ("%u, %u, %u", x + 3, *(x + 3), *(x + 2) + 3);
}
A. B.
C. D.
gatecse-2015-set1 programming programming-in-c array normal
Answer key☟
Consider the following two C code segments. and are one and two dimensional arrays of size and
respectively, where . Assume that in both code segments, elements of are initialized
to and each element of array is initialized to . Further assume that when stored in main memory
all elements of are in same main memory page frame.
Code segment
// initialize elements of Y to 0
// initialize elements of X[i][j] of X to i+j
for (i=0; i<n; i++)
Y[i] += X[0][i];
Code segment
// initialize elements of Y to 0
// initialize elements of X[i][j] of X to i+j
for (i=0; i<n; i++)
Y[i] += X[i][0];
Which of the following statements is/are correct?
S1: Final contents of array will be same in both code segments
S2: Elements of array accessed inside the for loop shown in code segment are contiguous in main memory
S3: Elements of array accessed inside the for loop shown in code segment are contiguous in main memory
Answer key☟
A. B. C. D.
gatecse-2015-set3 programming programming-in-c normal array
Answer key☟
Answer key☟
Answer key☟
Consider the following C program which is supposed to compute the transpose of a given matrix .
Note that, there is an in the program which indicates some missing statements. Choose the correct option
to replace in the program.
#include<stdio.h>
#define ROW 4
#define COL 4
int M[ROW][COL] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16};
main()
{
int i, j, t;
for (i = 0; i < 4; ++i)
{
X
}
for (i = 0; i < 4; ++i)
for (j = 0; j < 4; ++j)
printf ("%d", M[i][j]);
}
Answer key☟
Answer key☟
A. B. C. D.
gateit-2008 programming programming-in-c normal array
Answer key☟
What should be the contents of the array b at the end of the program?
A.
B.
C.
D.
Answer key☟
Consider the following program. Assume parameters to a function are evaluated from right to left.
#include <stdio.h>
g(x);
h(y);
int main() {
f(g(10), h(20));
Which one of the following options is the CORRECT output of the above program?
A. B. C. D.
gatecse2024-set2 programming programming-in-c functions one-mark
Answer key☟
An unrestricted use of the "go to" statement is harmful because of which of the following reason (s):
Answer key☟
Answer key☟
Consider the following high level programming segment. Give the contents of the memory locations for
variables and after the execution of the program segment. The values of the variables and
are and , respectively. Also indicate error conditions if any.
var
A, B, W, X, Y :unsigned byte;
Z :unsigned integer, (each integer is represented by two bytes)
begin
X :=A+B
Y :=abs(A-B);
W :=A-B
Z :=A*B
end;
Answer key☟
Answer key☟
A. B. C. D.
gatecse-2017-set2 programming-in-c identify-function pointers
Answer key☟
Consider the following snippet of a C program. Assume that swap exchanges the content of
and :
int main () {
int array[] = {3, 5, 1, 4, 6, 2};
int done =0;
int i;
while (done==0) {
done =1;
for (i=0; i<=4; i++) {
if (array[i] < array[i+1]) {
swap(&array[i], &array[i+1]);
done=0;
}
}
for (i=5; i>=1; i--) {
if (array[i] > array[i-1]) {
swap(&array[i], &array[i-1]);
done =0;
}
}
}
printf(“%d”, array[3]);
}
Answer key☟
Answer key☟
A. B. C. D.
gateit-2004 programming easy identify-function
Answer key☟
Answer key☟
Below figure is the flow-chart corresponding to a program to calculate the of two integers, and
respectively, Use assertions at the cut point , and to prove that the flow-chart is
correct.
gate1988 normal descriptive loop-invariants
Answer key☟
a. for
i:=1 to f(x) by 1 do
S
end
b. i:=1;
While i<=f(x) do
S
i:=i+1
end
Under what conditions are these two programs equivalent? Treat as any sequence of statements and as a
function.
Answer key☟
Answer key☟
Consider the following program fragment for reversing the digits in a given integer to obtain a new integer.
Let .
int n, rev;
rev = 0;
while(n > 0) {
rev = rev * 10 + n%10;
n = n/10;
}
A.
B.
C.
D.
Answer key☟
Consider the following pseudo code, where and are positive integers.
begin
q := 0
r := x
while r ≥ y do
begin
r := r - y
q := q + 1
end
end
The post condition that needs to be satisfied after the program terminates is
A.
B.
C.
D.
Answer key☟
while (b != 0) {
if (b % 2 == 0) {a = a * a; b = b/2; }
else {res = res * a; b = b - 1; }
}
return res;
}
Which one of the following conditions is TRUE before every iteration of the loop?
A. B.
C. D.
gatecse-2016-set2 programming loop-invariants normal
Answer key☟
Consider the C program fragment below which is meant to divide by using repeated subtractions. The
variables , , and are all unsigned int.
while (r >= y) {
r=r-y;
q=q+1;
}
Which of the following conditions on the variables and before the execution of the fragment will ensure that
the loop terminated in a state satisfying the condition ?
A.
B.
C.
D.
Answer key☟
A. B. C. D.
gatecse-2021-set2 programming-in-c array output one-mark
Answer key☟
int a[3][3][3] =
{{1, 2, 3, 4, 5, 6, 7, 8, 9},
{10, 11, 12, 13, 14, 15, 16, 17, 18},
{19, 20, 21, 22, 23, 24, 25, 26, 27}};
int i = 0, j = 0, k = 0;
printf(“%d”, a[i][j][k]);
printf (“\n”);
return 0;
}
A.
B.
C.
D.
Answer key☟
char a = ‘P’;
char b = ‘x’;
return 0;
A. B. C. D.
gatecse-2022 programming programming-in-c output two-marks
Answer key☟
int funcp(){
static int x = 1;
x++;
return x;
}
int main(){
int x,y;
x = funcp();
y = funcp()+x;
printf("%d\n", (x+y));
return 0;
}
Answer key☟
int main() {
int a=6;
int b = 0;
while (a<10) {
a = a / 12+1 ;
a += b ;}
return 0 ; }
Answer key☟
void fX () {
char a;
if ((a=g e t c h a r()) ! = '\n')
fX();
if (a ! = '\n')
putchar (a); }
Assume that the input to the program from the command line is followed by a newline character. Which one
of the following statements is CORRECT?
Answer key☟
9.7.7 Output: GATE CSE 2024 | Set 2 | Question: 23
char *b = a;
while (*b)
b++;
return b - a; }
Answer key☟
Answer key☟
int x=126,y=105;
do {
if(x>y) x=x-y;
else y=y-x;
} while(x!=y);
printf("%d",x);
Answer key☟
int g(int n) {
return (n+10);
}
int f(int n) {
return g(n*2);
}
int main() {
int sum, n;
sum=0;
for (n=1; n<3; n++)
sum += g(f(n));
printf ("%d", sum);
return 0;
}
Answer key☟
Show the activation records and the display structure just after the procedures called at lines marked and
have started their execution. Be sure to indicate which of the two procedures named you are referring
to.
Program Test;
Procedure A;
Procedure B;
Procedure A;
begin
……
end A;
begin
y: A;
end B;
begin
B;
end A;
begin
x: A;
end Test
Answer key☟
In which of the following cases is it possible to obtain different results for call-by-reference and call-by-name
parameter passing methods?
What is printed by the print statements in the program assuming call by reference parameter passing?
Program P1()
{
x = 10;
y = 3;
func1(y,x,x);
print x;
print y;
}
func1(x,y,z)
{
y = y + 4;
z=x+y+z
}
Answer key☟
The following program fragment is written in a programming language that allows global variables and does
not allow nested declarations of functions.
global int i=100, j=5;
void P(x) {
int i=10;
print(x+10);
i=200;
j=20;
print (x);
}
main() {P(i+j);}
If the programming language uses static scoping and call by need parameter passing mechanism, the values
printed by the above program are:
A. B. C. D.
gatecse-2003 compiler-design normal runtime-environment parameter-passing
Answer key☟
void main()
{
int c, *b, **a;
c = 4; b = &c; a = &b;
printf("%d", f(c, b, a));
A. B. C. D.
gatecse-2008 programming programming-in-c normal parameter-passing
Answer key☟
int main() {
f(&i, &j);
printf("%d %d\n", i,j);
return 0;
}
A. B. C. D.
gatecse-2010 programming programming-in-c easy parameter-passing
Answer key☟
What is the return value of , if the value of is initialized to before the call? Note that the first
parameter is passed by reference, whereas the second parameter is passed by value.
Answer key☟
Answer key☟
f (&i, j);
printf ("%d", i+j);
}
Answer key☟
#include<stdio.h>
void fun1(char* s1, char* s2){
char* temp;
temp = s1;
s1 = s2;
s2 = temp;
}
void fun2(char** s1, char** s2){
char* temp;
temp = *s1;
*s1 = *s2;
*s2 = temp;
}
int main(){
char *str1="Hi", *str2 = "Bye";
fun1(str1, str2); printf("%s %s", str1, str2);
fun2(&str1, &str2); printf("%s %s", str1, str2);
return 0;
}
A. B.
C. D.
gatecse-2018 programming-in-c pointers parameter-passing normal programming two-marks
Answer key☟
Which one of the choices given below would be printed when the following program is executed?
#include <stdio.h>
void swap (int *x, int *y)
{
static int *temp;
temp = x;
x = y;
y = temp;
}
void printab ()
{
static int i, a = -3, b = -6;
i = 0;
while (i <= 4)
{
if ((i++)%2 == 1) continue;
a = a + i;
b = b + i;
}
swap (&a, &b);
printf("a = %d, b = %d\n", a, b);
}
main()
{
printab();
printab();
}
A. B.
C. D.
Answer key☟
A. B. C. D.
gateit-2008 programming programming-in-c easy parameter-passing
Answer key☟
is:
A. B.
C. D.
gatecse-2000 programming programming-in-c easy match-the-following pointers
Answer key☟
int *g(void)
{
int x = 10;
return (&x);
}
int *g(void)
{
int *px;
*px = 10;
return px;
}
int *g(void)
{
int *px;
px = (int*) malloc (sizeof(int));
*px = 10;
return px;
}
Which of the above three functions are likely to cause problems with pointers?
Answer key☟
I.
II.
III.
IV.
which will not give compile-time errors if used as left hand sides of assignment statements in a C program?
A. I, II, and IV only B. II, III, and IV only C. II and IV only D. IV only
gatecse-2003 programming programming-in-c easy pointers
Answer key☟
int x;
void Q(int z)
{
z+=x;
print(z);
}
A. B. C. D.
gatecse-2003 programming programming-in-c normal pointers
Answer key☟
Answer key☟
Consider this C code to swap two integers and these five statements: the code
void swap (int *px, int *py)
{
*px = *px - *py;
*py = *px + *py;
*px = *py - *px;
}
Answer key☟
main()
{
int i;
int*pi = &i;
scanf("%d",pi);
printf("%d\n", i+5);
}
A. Compilation fails.
B. Execution results in a run-time error.
C. On execution, the value printed is more than the address of variable .
D. On execution, the value printed is more than the integer value entered.
Answer key☟
9.9.8 Pointers: GATE CSE 2015 Set 3 | Question: 26
Answer key☟
void main () {
int *x = malloc(sizeof(int));
if (NULL == x) return;
x = assignval (x,0);
if (x) {
x = (int *)malloc(sizeof(int));
if (NULL == x) return;
x = assignval (x,10);
}
printf("%d\n", *x);
free(x);
}
Answer key☟
Answer key☟
9.9.11 Pointers: GATE CSE 2022 | Question: 11
int *p = NULL;
p = &x;
*p = 10;
p = &z[1];
*(&z[0] + 1) += 3;
return 0;
A. B. C. D.
gatecse-2022 programming programming-in-c pointers output one-mark
Answer key☟
A. B. C. D.
gatecse2024-set2 programming programming-in-c pointers two-marks
Answer key☟
#include <stdio.h>
void foo(int *p, int x) {
*p=x;
}
int main(){
int *z;
int a = 20, b = 25;
z = &a;
foo(z,b);
printf("%d",a);
return 0;
}
Answer key☟
9.9.14 Pointers: GATE CSE 2025 | Set 2 | Question: 52
Answer key☟
i. assignment
ii. for loops where the loop parameter cannot be changed within the loop
iii. if-then-else
iv. forward go to
v. arbitrary go to
vi. non-recursive procedure call
vii. recursive procedure/function call
viii. repeat loop,
which constructs will you not include in a programming language such that it should be possible to program the
terminates (i.e., halting) function in the same programming language
A. B.
C. D.
gate1999 programming normal programming-constructs
Answer key☟
is:
A. B. C. D.
gatecse-2000 programming programming-in-c easy
Answer key☟
In the C language:
A. At most one activation record exists between the current activation record and the activation record for the main
B. The number of activation records between the current activation record and the activation records from the main
depends on the actual function calling sequence.
C. The visibility of global variables depends on the actual function calling sequence
D. Recursion requires the activation record for the recursive function to be saved in a different stack before the
recursive function can be called.
Answer key☟
Answer key☟
A. B. C. D.
gatecse-2002 programming-in-c programming easy
Answer key☟
A. gnirts B. string
C. gnirt D. no output is printed
gatecse-2004 programming programming-in-c easy
Answer key☟
The above code compiled without any error or warning. If Line is deleted, the above code will show:
Answer key☟
Which combination of the integer variables and makes the variable get the value in the following
expression?
A. B.
C. D.
gatecse-2008 programming programming-in-c easy
Answer key☟
Choose the correct option to fill and so that the program below prints an input string in reverse order.
Assume that the input string is terminated by a new line character.
void reverse(void)
{
int c;
if(?1) reverse();
?2
}
main()
{
printf("Enter text");
printf("\n");
reverse();
printf("\n");
}
A. is
is
B. is
is
C. is
is
D. is
is
Answer key☟
void prtFun(void)
{
static int a = 2; /* Line 2 */
int b = 1;
a += ++b;
printf(“ \n %d %d ”, a, b);
}
A. B. C. D.
Answer key☟
void prtFun(void)
{
static int a = 2; /* Line 2 */
int b = 1;
a += ++b;
printf(“ \n %d %d ”, a, b);
}
A. B. C. D.
Answer key☟
Suppose and are unsigned int variables in a C program. We wish to set to . If is large, which
one of the following statements is most likely to set correctly?
A. B.
C. D.
gatecse-2014-set2 programming programming-in-c normal
Answer key☟
9.11.12 Programming In C: GATE CSE 2014 Set 2 | Question: 42
Answer key☟
Answer key☟
Answer key☟
Which one of the following expressions , when placed in the blank above, will NOT result in a type checking error?
A. B. C. D.
gatecse-2016-set1 programming-in-c easy
Answer key☟
The following function computes the maximum value contained in an integer array of size .
while (__________) {
if (p[a]<= p[b]) {a = a+1;}
else {b = b-1;}
}
return p[a];
}
A. B.
C. D.
gatecse-2016-set1 programming-in-c normal
Answer key☟
void main() {
char *x = "abc";
char *y = "defgh";
printlength(x,y);
}
Recall that is defined in as returning a value of type , which is an unsigned int. The output
of the program is __________ .
Answer key☟
9.11.18 Programming In C: GATE CSE 2017 Set 1 | Question: 55
int total(int v) {
static int count = 0;
while(v) {
count += v&1;
v >>= 1;
}
return count;
}
void main() {
static int x=0;
int i=5;
for(; i>0; i--) {
x = x + total(i);
}
printf("%d\n", x);
}
Answer key☟
Answer key☟
Answer key☟
Consider the following C code. Assume that unsigned long int type length is bits.
unsigned long int fun(unsigned long int n) {
unsigned long int i, j=0, sum = 0;
for( i=n; i>1; i=i/2) j++;
for( ; j>1; j=j/2) sum++;
return sum;
}
The value returned when we call fun with the input is:
A. B. C. D.
gatecse-2018 programming-in-c normal programming two-marks
Answer key☟
Which one of the following values will be displayed on execution of the programs?
A. B. C. D.
gatecse-2019 programming-in-c programming two-marks
Answer key☟
The number of times the variable sum will be printed, when the above program is executed, is _________
Answer key☟
Answer key☟
Which of the following statements is/are TRUE about the above function?
Answer key☟
A. B. C. D.
gateit-2004 programming programming-in-c normal
Answer key☟
Choose the correct option to fill the and so that the program prints an input string in reverse order.
Assume that the input string is terminated by a new line character.
#include <stdio.h>
void wrt_it (void);
int main (void)
{
printf("Enter Text");
printf ("\n");
wrt_it();
printf ("\n");
return 0;
}
void wrt_it (void)
{
int c;
if (?1)
wrt_it();
?2
}
A. is '\n'
is
B. is '\n'
is
C. is '\n'
is
D. is '\n'
is
Answer key☟
Let be an array containing integers in increasing order. The following algorithm determines whether
there are two distinct numbers in the array whose difference is a specified number .
i = 0; j = 1;
while (j < n ){
if (E) j++;
else if (a[j] - a[i] == S) break;
else i++;
}
if (j < n) printf("yes") else printf ("no");
A. B.
C. D.
gateit-2005 programming normal programming-in-c
Answer key☟
9.11.30 Programming In C: GATE IT 2006 | Question: 51
Which one of the choices given below would be printed when the following program is executed?
#include <stdio.h>
int a1[] = {6, 7, 8, 18, 34, 67};
int a2[] = {23, 56, 28, 29};
int a3[] = {-12, 27, -31};
int *x[] = {a1, a2, a3};
void print(int *a[])
{
printf("%d,", a[0][2]);
printf("%d,", *a[2]);
printf("%d,", *++a[0]);
printf("%d,", *(++a)[0]);
printf("%d\n", a[-1][+1]);
}
main()
{
print(x);
}
A. B.
C. D.
gateit-2006 programming programming-in-c normal
Answer key☟
A. B. C. D.
gateit-2007 programming programming-in-c normal
Answer key☟
Answer key☟
9.12.2 Programming Paradigms: GATE CSE 2004 | Question: 90
Choose the best matching between the programming styles in Group 1 and their characteristics in Group 2.
A. B.
C. D.
gatecse-2004 programming normal programming-paradigms match-the-following
Answer key☟
The number of times is called (including the first call) for evaluation of is___________.
Answer key☟
The above function is run on a computer with a stack of bytes. Assuming that only return address and
parameter are passed on the stack, and that an integer value and an address takes bytes each, estimate the
maximum value of for which the stack will not overflow. Give reasons for your answer.
Answer key☟
A recursive program to compute Fibonacci numbers is shown below. Assume you are also given an array
with all elements initialized to
fib(n) {
if (n > M) error ();
if (n == 0) return 1;
if (n == 1)return 1;
if (▭)________________________(1)
return ▭__________________(2)
t = fib(n - 1) + fib(n - 2);
▭_____________________________(3)
return t;
}
A. Fill in the boxes with expressions/statement to make store and reuse computed Fibonacci values. Write
the box number and the corresponding contents in your answer book.
B. What is the time complexity of the resulting program when computing
gatecse-2000 algorithms normal descriptive recursion
Answer key☟
main()
{
abc("123");
}
Answer key☟
Answer key☟
A. B. C. D.
gatecse-2004 programming programming-in-c recursion easy isro2008
Answer key☟
double foo(int n)
{
int i;
double sum;
if(n == 0)
{
return 1.0;
}
else
{
sum = 0.0;
for(i = 0; i < n; i++)
{
sum += foo(i);
}
return sum;
}
Suppose we modify the above function and stores the value of , as and when they are
computed. With this modification the time complexity for function is significantly reduced. The space
complexity of the modified function would be:
A. B. C. D.
gatecse-2005 programming recursion normal
Answer key☟
A. B. C. D.
gatecse-2007 programming recursion normal
Answer key☟
Answer key☟
A. B. C. D.
gatecse-2015-set2 programming programming-in-c normal recursion
Answer key☟
printf ("%d",n);
printf ("%d",d);
d++;
if (n>1) count (n-1);
printf ("%d",d);
void main(){
count (3);
}
A.
B.
C.
D.
Answer key☟
Answer key☟
A.
B.
C.
D.
Answer key☟
Answer key☟
int counter=0;
int main() {
calc(4, 81);
printf("%d", counter);
}
Answer key☟
#include <stdio.h>
int foo(int S[],int size) {
if(size == 0) return 0;
if(size == 1) return 1;
if(S[0] != S[1]) return 1+foo(S+1,size-1);
return foo(S+1,size-1);
}
int main() {
int A[]={0,1,2,2,2,0,0,1,1};
printf("%d",foo(A,9));
return 0;
}
Answer key☟
Assuming that arbitrarily large integers can be passed as a parameter to the function, consider the following
statements.
Answer key☟
Answer key☟
define s to be:
Answer key☟
Answer key☟
9.15.3 Structure: GATE CSE 2021 Set 2 | Question: 35
Which one of the following statements below is correct about the program?
Answer key☟
A. B.
C. D.
gateit-2004 programming programming-in-c normal structure
Answer key☟
Which one of the choices given below would be printed when the following program is executed ?
#include <stdio.h>
struct test {
int i;
char *c;
}st[] = {5, "become", 4, "better", 6, "jungle", 8, "ancestor", 7, "brother"};
main ()
{
struct test *p = st;
p += 1;
++p -> c;
printf("%s,", p++ -> c);
printf("%c,", *++p -> c);
printf("%d,", p[0].i);
printf("%s \n", p -> c);
}
A. B.
C. D.
gateit-2006 programming programming-in-c normal structure
Answer key☟
A. No Choice B. Choice A
C. Choice A D. Program gives no output as it is
Choice B No Choice erroneous
gatecse-2012 programming easy programming-in-c switch-case
Answer key☟
Answer key☟
Answer key☟
Assume that the objects of the type short, float and long occupy bytes, bytes and bytes, respectively. The
memory requirement for variable , ignoring alignment consideration, is:
Answer key☟
Consider the program below in a hypothetical programming language which allows global variables and a
choice of static or dynamic scoping.
int i;
program main()
{
i = 10;
call f();
}
procedure f()
{
int i = 20;
call g ();
}
procedure g()
{
print i;
}
Let be the value printed under static scoping and be the value printed under dynamic scoping. Then, and
are:
A. B. C. D.
gateit-2007 programming variable-binding easy ugcnetcse-dec2012-paper3
Answer key☟
Answer Keys
9.1.1 A 9.2.1 C 9.2.2 A 9.2.3 C 9.2.4 C
9.2.5 6 9.2.6 19 9.2.7 C 9.2.8 B 9.2.9 C
9.2.10 B 9.3.1 A 9.4.1 A 9.4.2 A 9.5.1 N/A
9.5.2 C 9.5.3 C 9.5.4 3 9.5.5 26 9.5.6 B
9.6.1 N/A 9.6.2 N/A 9.6.3 N/A 9.6.4 N/A 9.6.5 A
9.6.6 B 9.6.7 C 9.6.8 C 9.7.1 C 9.7.2 A
9.7.3 A 9.7.4 7 9.7.5 C 9.7.6 C 9.7.7 A;B;D
9.7.8 46:46 9.7.9 21:21 9.7.10 46:46 9.8.1 N/A 9.8.2 C
9.8.3 B 9.8.4 D 9.8.5 B 9.8.6 D 9.8.7 6561
9.8.8 2016 9.8.9 30 9.8.10 A 9.8.11 D 9.8.12 C
9.9.1 D 9.9.2 C 9.9.3 A 9.9.4 A 9.9.5 C
9.9.6 C 9.9.7 D 9.9.8 140 9.9.9 D 9.9.10 2
9.9.11 D 9.9.12 B 9.9.13 25:25 9.9.14 111:111 9.10.1 B
9.11.1 A 9.11.2 B 9.11.3 B 9.11.4 B 9.11.5 D
9.11.6 D 9.11.7 A 9.11.8 D 9.11.9 C 9.11.10 D
9.11.11 B 9.11.12 D 9.11.13 -5 9.11.14 230 9.11.15 D
9.11.16 D 9.11.17 3 9.11.18 23 9.11.19 A 9.11.20 0
9.11.21 B 9.11.22 B 9.11.23 5 9.11.24 10 9.11.25 B
9.11.26 B;D 9.11.27 A 9.11.28 D 9.11.29 B 9.11.30 A
9.11.31 C 9.12.1 C 9.12.2 D 9.13.1 41 9.13.2 16
9.13.3 N/A 9.13.4 N/A 9.13.5 N/A 9.13.6 C 9.13.7 B
9.13.8 D 9.13.9 1.72 : 1.74 9.13.10 D 9.13.11 A 9.13.12 3
9.13.13 A 9.13.14 C 9.13.15 4 9.13.16 55 9.13.17 5:5
9.13.18 D 9.14.1 D 9.15.1 A 9.15.2 A 9.15.3 D
9.15.4 B 9.15.5 B 9.16.1 X 9.16.2 10 9.17.1 C
9.18.1 C 9.19.1 A