GATE CS 2021 Set 2 — All 65 Questions with Solutions

int main() {
    Integer x;
    return 0;
}

#include <stdio.h>
int main() {
    int arr[4][5];
    int i, j;
    for (i = 0; i < 4; i++)
        for (j = 0; j < 5; j++)
            arr[i][j] = 10 * i + j;
    printf("%d", *(arr[1] + 9));
    return 0;
}

int SomeFunction(int x, int y) {
    if ((x == 1) || (y == 1)) return 1;
    if (x == y) return x;
    if (x > y) return SomeFunction(x - y, y);
    if (y > x) return SomeFunction(x, y - x);
}

question   probability of answering correctly   marks
QuesA               0.8                          10
QuesB               0.5                          20

z = x + 3 + y->f1 + y->f2;
for (i = 0; i < 200; i = i + 2) {
    if (z > i) {
        p = p + x + 3;
        q = q + y->f1;
    } else {
        p = p + y->f2;
        q = q + x + 3;
    }
}

emp(empId, name, gender, salary, deptId)

select deptId, count(*)
from emp
where gender = "female" and salary > (select avg(salary) from emp)
group by deptId;

#include <stdio.h>
#include <stdlib.h>
struct Node { int value; struct Node *next; };
int main() {
    struct Node *boxE, *head, *boxN; int index = 0;
    boxE = head = (struct Node *) malloc(sizeof(struct Node));
    head->value = index;
    for (index = 1; index <= 3; index++) {
        boxN = (struct Node *) malloc(sizeof(struct Node));
        boxE->next = boxN;
        boxN->value = index;
        boxE = boxN;
    }
    for (index = 0; index <= 3; index++) {
        printf("Value at index %d is %d\n", index, head->value);
        head = head->next;
        printf("Value at index %d is %d\n", index + 1, head->value);
    }
}

int x = 0;   // global
Lock L1;     // global
main() {
    create a thread to execute foo();  // Thread T1
    create a thread to execute foo();  // Thread T2
    wait for the two threads to finish execution;
    print(x);
}
foo() {
    int y = 0;
    Acquire L1;
    x = x + 1;
    y = y + 1;
    Release L1;
    print(y);
}

function OwnResource(Resource R)
    Acquire lock L            // a global lock
    if R is available then
        Acquire R
        Release lock L
    else
        if R is owned by another process P then
            Terminate P, after releasing all resources owned by P
            Acquire R
            Restart P
            Release lock L
        end if
    end if
end function

<----------- 39-bit virtual address ----------->
| Level 1 | Level 2 | Level 3 |   Page   |
| offset  | offset  | offset  |  offset  |
|  9 bits |  9 bits |  9 bits |  12 bits |

#include <stdio.h>
int foo(int x, int y, int q) {
    if ((x <= 0) && (y <= 0)) return q;
    if (x <= 0) return foo(x, y - q, q);
    if (y <= 0) return foo(x - q, y, q);
    return foo(x, y - q, q) + foo(x - q, y, q);
}
int main() {
    int r = foo(15, 15, 10);
    printf("%d", r);
    return 0;
}

S' -> S
S  -> S # c S
S  -> S S
S  -> S @
S  -> < S >
S  -> a
S  -> b
S  -> c

ADD, MUL, ADD, MUL, ADD, MUL, ADD, MUL