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

Topic practice 975 questionsPage 5 of 98

Question 21

Open question
CSMSQ1 markNeeds review
Consider the following Boolean expression of a function

:

Which of the following expressions is/are equivalent to

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

Log in to check the answer

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

Question 21

Open question
CS2MCQ1 markNeeds review
Consider a file of size 4 million bytes being transferred between two hosts connected via a path consisting of three consecutive links of bandwidth 2 Mbps, 500 kbps, and 1 Mbps, respectively. All processing delays and propagation delays are negligible. Assume that there is no other background traffic over the path and no other overhead to transfer the file. Which one of the following is the total time (in seconds) to transfer the file? Note: 1M=

, 1k=

Your answerChoose one option.

Log in to check the answer

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

Question 22

Open question
CSMSQ1 markNeeds review
Consider the 8-bit signed integers

,

and

represented using the sign-magnitude form. The binary representations of

and

are as follows:

Which of the following operations to compute

result(s) in an arithmetic overflow?
Your answerSelect all correct options. You can choose more than one.

Log in to check the answer

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

Question 22

Open question
CS2MCQ1 markNeeds review
Which one of the following protocols may need to broadcast some of its messages?
Your answerChoose one option.

Log in to check the answer

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

Question 23

Open question
CSMSQ1 markNeeds review
Let

be an odd number greater than 100. Consider a binary min heap with

elements stored in an array

whose index starts from 1.
Which of the following indices of

do/does NOT correspond to a leaf node of the min heap?
Your answerSelect all correct options. You can choose more than one.

Log in to check the answer

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

Question 23

Open question
CS2MCQ1 markNeeds review
Which one of the following CPU scheduling algorithms cannot be preemptive?
Your answerChoose one option.

Log in to check the answer

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

Question 24

Open question
CSMSQ1 markNeeds review
Consider a hash table

that is initially empty. The hash table is maintained using open addressing with linear probe. The hash function used is

.
Consider the following sequence of insertions performed on

:

Which of the following positions in the hash table is/are empty after these insertions are performed?
Your answerSelect all correct options. You can choose more than one.

Log in to check the answer

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

Question 24

Open question
CS2MCQ1 markNeeds review
Consider the following functions, where

is a positive integer.

Which one of the following options lists the functions in increasing order of asymptotic growth rate?
Note: Assume the base of log to be 2.
Your answerChoose one option.

Log in to check the answer

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

Question 25

Open question
CSMSQ1 markNeeds review
Consider the following grammar where

is the start symbol, and

and

are terminal symbols.

Which of the following statements is/are true?
Your answerSelect all correct options. You can choose more than one.

Log in to check the answer

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

Question 25

Open question
CS2MSQ1 markNeeds review
Which of the following can be recurrence relation(s) corresponding to an algorithm with time complexity

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

Log in to check the answer

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