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

Questions 11–20 of 106. Imported answers require independent review unless marked reviewed.

Consider a stack

and a queue

. Both of them are initially empty and have the capacity to store ten elements each. The elements 1, 2, 3, 4, and 5 arrive one by one, in that order. When an element arrives, it is assigned either to

(pushed on

) or to

(enqueued to

). Once all the five elements are stored, the output is generated in two steps. First, stack

is emptied by popping all elements. Then queue

is emptied by dequeuing all elements. The output obtained by following this process is 4 3 1 2 5.

Given the output, the objective is to predict whether an element was assigned to

Which of the following options are possible valid assignment(s) of the elements?

Note: In the options, the notation

denotes that element

was assigned to

and

denotes that element

was assigned to

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

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

Consider the following ANSI-C program.

#include<stdio.h>

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

Consider the recursive functions represented by the following code segment:

int bar(int n){

if (n == 1) return 0;

else return 1 + bar(n/2);

}

int foo(int n){

if (n == 1) return 1;

else return 1 + foo(bar(n));

}

The smallest positive integer

for which foo(n) returns 5 is _____. (answer in integer)

Note: Ignore syntax errors (if any) in the function.

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

Consider the following ANSI-C function.

int func(int start, int end){

int length=end+1-start;

if((length<1)||(start<0)||(end<0)){ return(0); }

if(length%3==0){

return(func(start+1, end));

} else if(length%3==1){

return(1+func(start, end-1));

} else {

return(func(start+2, end));

}

The maximum possible value that can be returned from this function is __________. (answer in integer)

Note: Ignore syntax errors (if any) in the function.

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

The following sequence corresponds to the preorder traversal of a binary search tree

50, 25, 13, 40, 30, 47, 75, 60, 70, 80, 77

The position of the element 60 in the postorder traversal of

is _____. (answer in integer)

Note: The position begins with 1.

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

Consider a binary tree

in which every node has either zero or two children. Let

be the number of nodes in

. Which ONE of the following is the number of nodes in

that have exactly two children?

Your answerChoose one option.

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

Consider the following C program:

#include <stdio.h>

void strcpy(char *, char *);

int main(){

char a[30] = "@#Hello World!";

strcpy(a, a + 2);

printf("%s\n", a);

return 0;

}

void strcpy(char *s, char *t) {

while(*t)

*s++ = *t++;

}

Which ONE of the following will be the output of the program?

Your answerChoose one option.

@#Hello World!

Hello World!

ello World!

Hello World!d!

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

Which of the following statement(s) is/are TRUE for any binary search tree (BST) having

distinct integers?

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

The maximum length of a path from the root node to any other node is

An inorder traversal will always produce a sorted sequence of elements.

Finding an element takes

time in the worst case.

Every BST is also a Min-Heap.

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

The pseudocode of a function fun() is given below:

fun(int A[0,...,n-1]) {

for i=0 to n-2

for j=0 to n-i-2

if (A[j]>A[j+1])

then swap A[j] and A[j+1]

}

Let

be an array storing 30 distinct integers in descending order. The number of swap operations that will be performed, if the function fun() is called with

as argument, is __________. (Answer in integer)

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

The output of the given C code segment is ________. (Answer in integer)

int x=12,y=10;

do {

if(x>y) x=x-y;

else y=y-x;

} while(x!=y);

printf("%d",x);

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 50

Question 60

Question 61

Question 61

Question 62

Question 13

Question 19

Question 26

Question 33

Question 33