Information Buildings & C Programming – GATE CSE Earlier Yr Questions

Additionally, right here we’re going to talk about some primary PYQs associated to Information Buildings & C Programming.

1. The preorder traversal of a binary search tree is 15, 10, 12, 11, 20, 18, 16, 19. Which one of many following is the postorder traversal of the tree? [GATE CSE 2020]

(A) 10, 11, 12, 15, 16, 18, 19, 20

(B) 11, 12, 10, 16, 19, 18, 20, 15

(C) 20, 19, 18, 16, 15, 12, 11, 10

(D) 19, 16, 18, 20, 11, 12, 10, 15

Resolution: Right reply is (B)

For extra, confer with GATE | GATE CS 2020 | Query 15.

2. What’s the worst-case time complexity of inserting n parts into an empty linked listing, if the linked listing must be maintained in sorted order? A couple of reply could also be right. [GATE CSE 2020]

(A) Θ(n)

(B) Θ(n log n)

(C) Θ(n²)

(D) Θ(1)

Resolution: Right reply is (C)

For extra, confer with GATE | GATE CS 2020 | Query 26.

3. What’s the worst-case time complexity of inserting n² parts into an AVL tree with n parts initially? [GATE CSE 2020]

(A) Θ(n⁴)

(B) Θ(n²)

(C) Θ(n² log n)

(D) Θ(n³)

Resolution: Right reply is (C)

For extra, confer with GATE | GATE CS 2020 | Query 16.

4. Contemplate the next C program. [GATE CSE 2018]

#embody<stdio.h>
struct Ournode{
    char x,y,z;
};
int fundamental(){
    struct Ournode p = {'1', '0', 'a'+2};
    struct Ournode *q = &p;
    printf ("%c, %c", *((char*)q+1), *((char*)q+2));
    return 0;
}

The output of this program is:

(A) 0, c

(B) 0, a+2

(C) ‘0’, ‘a+2’

(D) ‘0’, ‘c’

Resolution: Right reply is (A)

For extra, confer with GATE | GATE CS 2018 | Query 33.

5. Contemplate the next C Program [GATE CSE 2016]

void f(int, quick);
void fundamental()
{
    int i = 100;
    quick s = 12;
    quick *p = &s;
    ___________ ; // name to f()
}

Which one of many following expressions, when positioned within the clean above, will NOT end in a type-checking error?

(A) f(s, *s)

(B) i = f(i,s)

(C) f(i, *s)

(D) f(i, *p)

Resolution: Right reply is (D)

For extra, confer with GATE | GATE-CS-2016 (Set 1) | Query 22.

6. A queue is applied utilizing an array such that ENQUEUE and DEQUEUE operations are carried out effectively. Which one of many following statements is CORRECT (n refers back to the variety of gadgets within the queue)? [GATE CSE 2016]

(A) Each operations could be carried out in O(1) time

(B) At most one operation could be carried out on O(1) time however the worst-case time for the opposite operation can be Ω(n)

(C) The worst-case time complexity for each operations can be Ω(n)

(D) Worst case time complexity for each operations can be Ω(log n)

Resolution: Right reply is (A)

For extra, confer with GATE | GATE-CS-2016 (Set 1) | Query 20.

7. The end result evaluating the postfix expression 10 5 + 60 6/ * 8 – is [GATE CSE 2015]

(A) 284

(B) 213

(C) 142

(D) 71

Resolution: Right reply is (C)

For extra, confer with GATE | GATE-CS-2015 (Set 3) | Query 65.

8. Let A be a sq. matrix of measurement n x n. Contemplate the next program. What’s the anticipated output? [GATE CSE 2014]

C = 100
for i = 1 to n do
    for j = 1 to n do
    {
        Temp = A[i][j] + C
        A[i][j] = A[j][i]
        A[j][i] = Temp - C
    }
for i = 1 to n do
    for j = 1 to n do
        Output(A[i][j]);

(A) The matrix A itself

(B) Transpose of the matrix A

(C) Including 100 to higher diagonal parts and subtracting 100 from diagonal parts of A

(D) Not one of the above

Resolution: Right reply is (A)

For extra, confer with GATE | GATE-CS-2014-(Set-3) | Query 20.

9. Contemplate the next program in C language: [GATE CSE 2014]

#embody<stdio.h>
fundamental()
{
    int i;
    int *pi = &i;
    scanf("%d", pi);
    printf("%dn", i+5);
}

Which one of many following statements is TRUE?

(A) Compilation fails

(B) Execution ends in a run-time error

(C) On execution, the worth printed is 5 greater than the tackle of variable i

(D) On execution, the worth printed is 5 greater than the integer worth entered

Resolution: Right reply is (D)

For extra, confer with GATE | GATE-CS-2014-(Set-1) | Query 19.

10. A program P reads 500 integers within the vary [0, 100] representing the cores of 500 college students. It then prints the frequency of every rating above 50. What could be one of the simplest ways for P to retailer the frequencies? [GATE CSE 2005] 

(A) An array of fifty numbers

(B) An array of 100 numbers

(C) An array of 500 numbers

(D) A dynamically allotted array of 550 numbers

Resolution: Right reply is (A)

For extra, confer with GATE | GATE-CS-2005 | Query 5.

GATE CSE Earlier Yr Query Papers

These earlier yr’s questions enable you in understanding the query patterns adopted by GATE that instantly assist a candidate in scoring good marks in GATE. Under are the talked about hyperlinks of year-wise GATE Earlier Query Papers.