All Programming & Data Structures questions

Single correct

• A63 and 6, respectively
• B64 and 5, respectively
• C32 and 6, respectively
• D31 and 5, respectively

Single correct

• AP-ii, Q-iii, R-i, S-iv
• BP-iii, Q-iv, R-ii, S-i
• CP-iii, Q-i, R-iv, S-ii
• DP-iii, Q-i, R-ii, S-iv

Single correct

• AI and IV only
• BII and III only
• CII and IV only
• DII only

void f1(int a, int b) {
    int c;
    c=a; a=b; b=c;
}
void f2(int *a, int *b) {
    int c;
    c=*a; *a=*b; *b=c;
}
int main(){
    int a=4, b=5, c=6;
    f1(a,b);
    f2(&b, &c);
    printf("%d",c-a-b);
}

Numerical answer

Single correct

• A$\Theta(\log n)$ for both insertion and deletion
• B$\Theta(n)$ for both insertion and deletion
• C$\Theta(n)$ for insertion and $\Theta(\log n)$ for deletion
• D$\Theta(\log n)$ for insertion and $\Theta(n)$ for deletion

Single correct

• A40, 30, 20, 10, 15, 16, 17, 8, 4, 35
• B40, 35, 20, 10, 30, 16, 17, 8, 4, 15
• C40, 30, 20, 10, 35, 16, 17, 8, 4, 15
• D40, 35, 20, 10, 15, 16, 17, 8, 4, 30

while(first <= last)
{
    if (array[middle] < search)
        first = middle + 1;
    else if (array[middle] == search)
        found = TRUE;
    else last = middle - 1;
    middle = (first + last)/2;
}
if (first > last)  notPresent = TRUE;

Numerical answer

Single correct

• AUnsorted array
• BMin-heap
• CSorted array
• DSorted doubly linked list

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);
}

Single correct

• A2036, 2036, 2036
• B2012, 4, 2204
• C2036, 10, 10
• D2012, 4, 6

begin
    q := 0
    r := x
    while r >= y do
        begin
            r := r - y
            q := q + 1
        end
end

Single correct

• A$\{r = qx + y \land r < y\}$
• B$\{x = qy + r \land r < y\}$
• C$\{y = qx + r \land 0 < r < y\}$
• D$\{q + 1 < r - y \land y > 0\}$

void foo(char *a){
    if ( *a && *a != ' '){
        foo(a+1);
        putchar(*a);
    }
}

Single correct

• AABCD EFGH
• BABCD
• CHGFE DCBA
• DDCBA

Single correct

• A$\Omega(\log n)$
• B$\Omega(n)$
• C$\Omega(n \log n)$
• D$\Omega(n^2)$

Numerical answer

int fun(int n){
    int x=1, k;
    if (n==1) return x;
    for (k=1; k<n; ++k)
        x = x + fun(k) * fun(n-k);
    return x;
}

Numerical answer

Single correct

• AUser interface issues
• BNon-functional requirements
• CDesign specification
• DInterfaces with third party software

Single correct

• A$E = a_b(KLOC)\exp(b_b)$, $D = c_b(E)\exp(d_b)$
• B$D = a_b(KLOC)\exp(b_b)$, $E = c_b(D)\exp(d_b)$
• C$E = a_b\exp(b_b)$, $D = c_b(KLOC)\exp(d_b)$
• D$E = a_b\exp(d_b)$, $D = c_b(KLOC)\exp(b_b)$

Numerical answer

Single correct

• A$h(i) = i^2 \bmod 10$
• B$h(i) = i^3 \bmod 10$
• C$h(i) = (11 * i^2) \bmod 10$
• D$h(i) = (12 * i) \bmod 10$

#include <stdio.h>
int *A, stkTop;

int stkFunc(int opcode, int val)
{
    static int size=0, stkTop=0;

    switch (opcode) {
        case -1: size = val; break;
        case  0: if (stkTop < size) A[stkTop++] = val; break;
        default: if (stkTop) return A[--stkTop];
    }
    return -1;
}

int main()
{
    int B[20]; A = B; stkTop = -1;

    stkFunc (-1, 10);
    stkFunc ( 0, 5);
    stkFunc ( 0, 10);
    printf ("%d\n", stkFunc(1, 0) + stkFunc(1, 0));
}

Numerical answer

Single correct

• ACode inspection is carried out once the code has been unit tested
• BCode inspection and code walkthrough are synonyms
• CAdherence to coding standards is checked during code inspection
• DCode walkthrough is usually carried out by an independent test team