Quiz II - UCS415  aagarwal6_be19@thapar.

edu

You can view this report online at : https://www.hackerrank.com/x/tests/1109805/candidates/25969544/report

Full Name: ARNAV AGARWAL

Email: aagarwal6_be19@thapar.edu
50% scored in Quiz II - UCS415 in 16
Test Name: Quiz II - UCS415 min 59 sec on 25 May 2021
5/10 23:24:17 CST
Taken On: 25 May 2021 23:24:17 CST

Time Taken: 16 min 59 sec/ 17 min

Student Roll Number: 101917097

Group: CSE4

Personal Email Address: arnavagarwal280901@gmail.com

Contact Number: 09958035905

Invited by: Dr.

Invited on: 25 May 2021 23:20:02 CST

Skills Score:

Tags Score: .NET 0/1

DAA 1/2

Recruiter/Team Comments:

No Comments.

Question Description Time Taken Score Status

Q1 Q1  Sentence Completion 4 min 44 sec 1/ 1 

Q2 Q2  Multiple Choice 2 min 2 sec 0/ 1 
Q3 Q3  Sentence Completion 51 sec 0/ 1 
Q4 Q4  Sentence Completion 1 min 48 sec 0/ 1 
Q5 Q5  Multiple Choice 35 sec 0.5/ 1 
Q6 Q6  Sentence Completion 20 sec 0/ 1 
Q7 Q7  Multiple Choice 2 min 46 sec 1/ 1 
Q8 Q8  Multiple Choice 1 min 16 sec 0.5/ 1 
Q9 Q9  Multiple Choice 2 min 15 sec 1/ 1 
Q10 Q10  Multiple Choice 30 sec 1/ 1 

1/8
 QUESTION 1 Q1 

Sentence Completion DAA

Correct Answer
QUESTION DESCRIPTION

Problem Statement
Score 1
Read the following statements and fill T/F

Complete String

I. The largest element in a min-heap is always at a leaf node. {blank} II. The second largest element in a
max-heap is always the root node. {blank} III. A max-heap can be constructed from a BST in Θ(n) time.
{blank}

CANDIDATE ANSWER

I. The largest element in a min-heap is always at a leaf node. t


II. The second largest element in a max-heap is always the root node. f 
III. A max-heap can be constructed from a BST in Θ(n) time. t 

No Comments

QUESTION 2 Q2 

Multiple Choice DAA

Wrong Answer
QUESTION DESCRIPTION

The rate of growth of the following code can best be described as

Score 0
int fun(int a)
{ if(a<1)
return 1;
else
return fun(a-1) + fun(a-1);
}

CANDIDATE ANSWER

Options: (Expected answer indicated with a tick)

Logarithmic

Linear

Quadratic

Exponential

No Comments

2/8
 QUESTION 3 Q3 

Sentence Completion .NET

Wrong Answer
QUESTION DESCRIPTION

Problem Statement
Score 0
Let there be 3 sorted lists having 42 elements in each.

Complete String

The total number of key comparisons required to merge these lists into a single sorted list of 126
elements using standard merge sort algorithm in the worst case is {blank}.

CANDIDATE ANSWER

The total number of key comparisons required to merge these lists

into a single sorted list of 126 elements using standard merge sort algorithm
in the worst case is 27 ✖ .

No Comments

QUESTION 4 Q4 

Sentence Completion

Wrong Answer
QUESTION DESCRIPTION

Problem Statement
Score 0
Determine the index of the mid element computed in the third round of binary search algorithm on a
sorted array A[0..63] of 64 integer elements, when the searching is for an element present at A[63].
(Note: Consider floor function to compute mid).

Complete String

The index is {blank}.

CANDIDATE ANSWER

The index is 7 ✖ .

No Comments

3/8
 QUESTION 5 Q5 

Multiple Choice

Correct Answer
QUESTION DESCRIPTION

Given 11 activities along with their start and finish time as: A = (A1, A2, A3, A4, A5, A6, A7, A8, A9,
Score 0.5
A10, A11), S = (3, 5, 5, 8, 2, 12, 8, 6, 3, 0, 1), F = (5, 7, 9, 11, 13, 14, 12, 10, 8, 6, 4). Which of the
following represents valid schedule(s) for the given scenario? Select all possible options.

CANDIDATE ANSWER

Options: (Expected answer indicated with a tick)

A11, A2, A9, A6

A11, A2, A4, A6

A1, A2, A7, A6

A9, A2, A4, A6

No Comments

4/8
 QUESTION 6 Q6 

Sentence Completion

Wrong Answer
QUESTION DESCRIPTION

Problem Statement
Score 0
Determine the value of maximum flow for the following cuts in the given flow network.

Complete String

For the cut with vertices on the s side as {s, 1, 2, 3}, the maximum flow is {blank}. For the cut with vertices
on the s side as {s, 1, 2, 3, 4}, the maximum flow is {blank}.

CANDIDATE ANSWER

For the cut with vertices on the s side as {s, 1, 2, 3}, the maximum
flow is 5 ✖ .
For the cut with vertices on the s side as {s, 1, 2, 3, 4}, the maximum flow
is 4 ✖ .

No Comments

5/8
 QUESTION 7 Q7 

Multiple Choice

Correct Answer
QUESTION DESCRIPTION

Consider the following statements for a Backtracking algorithm and choose the correct option.
Score 1
S1: On reaching a final solution, algorithm either stops or continues searching for other possible
solutions.

S2: State-space tree is constructed in a Depth-first search manner.

CANDIDATE ANSWER

Options: (Expected answer indicated with a tick)

S1: False, S2: False

S1: False, S2: True

S1: True, S2: False

S1: True, S2: True

No Comments

QUESTION 8 Q8 

Multiple Choice

Correct Answer
QUESTION DESCRIPTION

Assuming every queen is placed in a different row on a 8×8 grid, which of the following sequence(s) of
Score 0.5
column numbers does not lead to an optimal solution? Select all possible options.

CANDIDATE ANSWER

Options: (Expected answer indicated with a tick)

[8 4 1 3 6 2 7 5 ]

[7 2 6 3 1 4 8 5 ]

[8 4 1 3 6 5 7 2 ]

[7 2 6 3 1 5 8 4 ]

No Comments

6/8
 QUESTION 9 Q9 

Multiple Choice

Correct Answer
QUESTION DESCRIPTION

Correct matching for the following pairs is

Score 1
i. Floor designs. (a) Eulerian graph
ii. Deadlock in an operating system. (b) Hamiltonian graph
iii. Traveling salesman problem. (c) Topological sort

CANDIDATE ANSWER

Options: (Expected answer indicated with a tick)

i – (a), ii – (b), iii – (c).

i – (b), ii – (c), iii – (a).

i – (c), ii – (a), iii – (b).

i – (a), ii – (c), iii – (b).

No Comments

7/8
 QUESTION 10 Q10 

Multiple Choice

Correct Answer
QUESTION DESCRIPTION

Choose the correct option:

Score 1

Fig 1:

Fig 2:

CANDIDATE ANSWER

Options: (Expected answer indicated with a tick)

Fig 1 is a Euler graph and Fig 2 is a Hamiltonian graph.

Fig 1 is a Euler graph and Fig 2 is not a Hamiltonian graph.

Fig 1 is not a Euler graph and Fig 2 is a Hamiltonian graph.

Fig 1 is not a Euler graph and Fig 2 is not a Hamiltonian graph.

No Comments

PDF generated at: 25 May 2021 15:48:55 UTC

8/8