GATE DA Programming, Data Structures and Algorithms PYQs & Answers — Page 2

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

Consider the following Python declarations of two lists.

A=[1,2,3]

B=[4,5,6]

Which one of the following statements results in A=[1,2,3,4,5,6]?

Your answerChoose one option.

A.extend(B)

A.append(B)

A.update(B)

A.insert(B)

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

For which of the following inputs does binary search take time

in the worst case?

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

An array of

integers in any order

A linked list of

integers in any order

An array of

integers in increasing order

A linked list of

integers in increasing order

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

Suppose that insertion sort is applied to the array

and it takes exactly two swaps to sort the array. Select all possible values of

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 Python code snippet.

A={"this","that"}

B={"that","other"}

C={"other","this"}

while "other" in C:

if "this" in A:

A,B,C=A-B,B-C,C-A

if "that" in B:

A,B,C=C|A,A|B,B|C

When the above program is executed, at the end, which of the following sets contains "this"?

Your answerChoose one option.

Only A

Only B

Only C

A, C

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

Let

be a simple, unweighted, and undirected graph. A subset of the vertices and edges of

are shown below.

Diagram for Data Science and Artificial Intelligence question 58

It is given that

is a shortest path between

and

;

is a shortest path between

and

;

is a shortest path between

and

. Which of the following is/are NOT the edges of

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 Python code snippet.

def f(a,b):

if (a==0):

return b

if (a%2==1):

return 2*f((a-1)/2,b)

return b+f(a-1,b)

print(f(15,10))

The value printed by the code snippet 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

Consider the following pseudocode.

Create empty stack S

Set x=0, flag=0, sum=0

Push x onto S

while (S is not empty){

if (flag equals 0){

Set x = x+1

Push x onto S}

if (x equals 8):

Set flag=1

if (flag equals 1){

x = Pop(S)

if (x is odd):

Pop(S)

Set sum = sum + x}

}

Output sum

The value of sum output by a program executing the above pseudocode 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

Consider a directed graph

, where

and

. Suppose the adjacency list of each vertex is in decreasing order of vertex number, and depth-first search (DFS) is performed at vertex 0. The number of vertices that will be discovered after vertex 50 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

Consider performing depth-first search (DFS) on an undirected and unweighted graph

starting at vertex

. For any vertex

is the length of the shortest path from

. Let

be an edge in

such that

. If the edge

is explored first in the direction from

during the above DFS, then

becomes a ______ edge.

Your answerChoose one option.

tree

cross

back

gray

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

Match the items in Column 1 with the items in Column 2 in the following table:

Column 1: (p) First In First Out; (q) Lookup Operation; (r) Last In First Out.

Column 2: (i) Stacks; (ii) Queues; (iii) Hash Tables

Your answerChoose one option.

(p) – (ii), (q) – (iii), (r) – (i)

(p) – (ii), (q) – (i), (r) – (iii)

(p) – (i), (q) – (ii), (r) – (iii)

(p) – (i), (q) – (iii), (r) – (ii)

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

GATE DA Programming, Data Structures and Algorithms PYQs

Question 23

Question 27

Question 29

Question 47

Question 58

Question 63

Question 64

Question 65

Question 14

Question 16