GATE CSE Programming and Data Structures PYQs & Answers — Page 5

Questions 41–50 of 106. Imported answers require independent review unless marked reviewed.

Consider the following C function definition.

int f(int x, int y) {

for (int i=0; i<y; i++) {

x=x+x+y;

}

return x;

}

Which of the following statements is/are TRUE about the above function?

Your answerSelect all correct options. You can choose more than one.

If the inputs are x=20, y=10, then the return value is greater than

If the inputs are x=20, y=20, then the return value is greater than

If the inputs are x=20, y=10, then the return value is less than

If the inputs are x=10, y=20, then the return value is greater than

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Let S1 and S2 be two stacks. S1 has capacity of 4 elements. S2 has capacity of 2 elements. S1 already has 4 elements: 100, 200, 300, and 400, whereas S2 is empty, as shown below.

Diagram for Computer Science and Information Technology question 48

Only the following three operations are available: PushToS2: Pop the top element from S1 and push it on S2. PushToS1: Pop the top element from S2 and push it on S1. GenerateOutput: Pop the top element from S1 and output it to the user.

Note that the pop operation is not allowed on an empty stack and the push operation is not allowed on a full stack.

Which of the following output sequences can be generated by using the above operations?

Your answerSelect all correct options. You can choose more than one.

100, 200, 400, 300

200, 300, 400, 100

400, 200, 100, 300

300, 200, 400, 100

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Which one of the following sequences, when stored in an array at locations A[1], . . . , A[10] forms a max-heap?

Your answerChoose one option.

23, 17, 10, 6, 13, 14, 1, 5, 7, 12

23, 17, 14, 7, 13, 10, 1, 5, 6, 12

23, 17, 14, 6, 13, 10, 1, 5, 7, 15

23, 14, 17, 1, 10, 13, 16, 12, 7, 5

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Let SLDel be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let DLDel be another function that deletes a node in a doubly-linked list given a pointer to the node and a pointer to the head of the list. Let n denote the number of nodes in each of the linked lists. Which one of the following choices is TRUE about the worst-case time complexity of SLDel and DLDel?

Your answerChoose one option.

SLDel is O(1) and DLDel is O(n)

Both SLDel and DLDel are O(log(n))

Both SLDel and DLDel are O(1)

SLDel is O(n) and DLDel is O(1)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

The integer value printed by the ANSI-C program given below is ______.

#include<stdio.h>

int func(){

static int x = 1;

x++;

return x;

}

int main(){

int x,y;

x = func();

y = func()+x;

printf("%d\n", (x+y));

return 0;

}

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the following program:

int main() int f1() int f2(int x) int f3()

{ { { {

f1(); return(1); f3(); return(5);

f2(2); } if (x==1) }

f3(); return f1();

return(0); else

} return (x*f2(x-1);

}

Which one of the following options represents the activation tree corresponding to the main function?

Your answerChoose one option.

Diagram for Computer Science and Information Technology question 36

Diagram for Computer Science and Information Technology question 36 (figure 2)

Diagram for Computer Science and Information Technology question 36 (figure 3)

Diagram for Computer Science and Information Technology question 36 (figure 4)

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Let A be a priority queue for maintaining a set of elements. Suppose A is implemented using a max-heap data structure. The operation Extract-Max(A) extracts and deletes the maximum element from A. The operation Insert(A,key) inserts a new element key in A. The properties of a max-heap are preserved at the end of each of these operations.

When A contains n elements, which one of the following statements about the worst case running time of these two operations is TRUE?

Your answerChoose one option.

Both Extract-Max(A) and Insert(A,key) run in O(1).

Both Extract-Max(A) and Insert(A,key) run in O(log(n)).

Extract-Max(A) runs in O(1) whereas Insert(A,key) runs in O(n).

Extract-Max(A) runs in O(1) whereas Insert(A,key) runs in O(log(n)).

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the C function foo and the binary tree shown.

typedef struct node {

int val;

struct node *left, *right;

} node;

int foo(node *p) {

int retval;

if (p == NULL)

return 0;

else {

retval = p->val + foo(p->left) + foo(p->right);

printf("%d ", retval);

return retval;

}

When foo is called with a pointer to the root node of the given binary tree, what will it print?

Diagram for Computer Science and Information Technology question 47

Your answerChoose one option.

3 8 13 11 10

3 8 10 11 13

3 8 16 13 24 50

3 16 8 50 24 13

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider a sequence

of elements

, and

. The following operations are performed on a stack

and a queue

, both of which are initially empty.

I: push the elements of

from

in that order into

II: enqueue the elements of

from

in that order into

III: pop an element from

IV: dequeue an element from

V: pop an element from

VI: dequeue an element from

VII: dequeue an element from

and push the same element into

VIII: Repeat operation VII three times.

IX: pop an element from

X: pop an element from

The top element of

after executing the above operations is __________.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the problem of reversing a singly linked list. To take an example, given the linked list below,

Diagram for Computer Science and Information Technology question 15

the reversed linked list should look like

Diagram for Computer Science and Information Technology question 15 (figure 2)

Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in

space?

Your answerChoose one option.

The best algorithm for the problem takes

time in the worst case.

The best algorithm for the problem takes

time in the worst case.

The best algorithm for the problem takes

time in the worst case.

It is not possible to reverse a singly linked list in

space.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

GATE CSE Programming and Data Structures PYQs

Question 48

Question 48

Question 12

Question 13

Question 35

Question 36

Question 46

Question 47

Question 59

Question 15