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

Questions 21–30 of 31. Imported answers require independent review unless marked reviewed.

Consider performing uniform hashing on an open address hash table with load factor

, where

elements are stored in the table with

slots. The expected number of probes in unsuccessful search is at most

. Inserting an element in this hash table requires at most _____ probes, on average.

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 tree traversals on a full binary tree:

(i) Preorder (ii) Inorder (iii) Postorder

Which of the following traversal options is/are sufficient to uniquely reconstruct the full binary tree?

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

(i) and (ii)

(ii) and (iii)

(i) and (iii)

(ii) only

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

Consider sorting the following array of integers in ascending order using an in-place Quicksort algorithm that uses the last element as the pivot.

60 70 80 90 100

The minimum number of swaps performed during this Quicksort is ______.

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

The fundamental operations in a double-ended queue D are:

insertFirst(e) – Insert a new element e at the beginning of D. insertLast(e) – Insert a new element e at the end of D. removeFirst() – Remove and return the first element of D. removeLast() – Remove and return the last element of D.

In an empty double-ended queue, the following operations are performed:

insertFirst(10)

insertLast(32)

a ← removeFirst()

insertLast(28)

insertLast(17)

a ← removeFirst()

a ← removeLast()

The value of a is _____.

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:

def count(child_dict, i):

if i not in child_dict.keys():

return 1

ans = 1

for j in child_dict[i]:

ans += count(child_dict, j)

return ans

child_dict = dict()

child_dict[0] = [1,2]

child_dict[1] = [3,4,5]

child_dict[2] = [6,7,8]

print(count(child_dict,0))

Which ONE of the following is the output of this code?

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 function

whose pseudocode is given below:

computes(X)

S[1] ← 1

for i ← 2 to length(X)

S[i] ← 1

if X[i − 1] ≤ X[i]

S[i] ← S[i] + S[i − 1]

end if

end for

return S

Which ONE of the following values is returned by the function

for

Your answerChoose one option.

[1, 1, 2, 3, 4]

[1, 1, 2, 3, 3]

[1, 1, 2, 1, 2]

[1, 1, 2, 1, 5]

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

Let

denote the maximum number of comparisons made while searching for an entry in a sorted array of size

using binary search.

Which ONE of the following options is TRUE?

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 Python function:

def fun(D, s1, s2):

if s1 < s2:

D[s1], D[s2] = D[s2], D[s1]

fun(D, s1+1, s2-1)

What does this Python function

do? Select the ONE appropriate option below.

Your answerChoose one option.

It finds the smallest element in D from index s1 to s2, both inclusive.

It performs a merge sort in-place on this list D between indices s1 and s2, both inclusive.

It reverses the list D between indices s1 and s2, both inclusive.

It swaps the elements in D at indices s1 and s2, and leaves the remaining elements unchanged.

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

Consider the following sorting algorithms:

(i) Bubble sort (ii) Insertion sort (iii) Selection sort

Which ONE among the following choices of sorting algorithms sorts the numbers in the array [4,3,2,1,5] in increasing order after exactly two passes over the array?

Your answerChoose one option.

(i) only

(iii) only

(i) and (ii) only

(ii) and (iii) only

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

Consider the directed acyclic graph (DAG) below:

Diagram for Data Science and Artificial Intelligence question 51

Which of the following are valid vertex orderings that can be obtained from a topological sort of the DAG?

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

P Q R S T U V

P R Q V S U T

P Q R S V U T

P R Q S V T U

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 21

Question 28

Question 30

Question 32

Question 38

Question 39

Question 40

Question 41

Question 45

Question 51