Questions 191–200 of 975. Imported answers require independent review unless marked reviewed.

Topic practice 975 questionsPage 20 of 98

Question 31

Open question
CSNAT1 markNeeds review
Consider the given function

.

If the function is differentiable everywhere, the value of

must be ______. (rounded off to one decimal place)

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 31

Open question
CSMSQ1 markNeeds review
Consider the following logic circuit diagram.
Which is/are the CORRECT option(s) for the output function

?
Diagram for Computer Science and Information Technology question 31

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 32

Open question
CSNAT1 markNeeds review
A box contains 5 coins: 4 regular coins and 1 fake coin. When a regular coin is tossed, the probability

and for a fake coin,

. You pick a coin at random and toss it twice, and get two heads. The probability that the coin you have chosen is the fake coin is ______. (rounded off to two decimal places)

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 32

Open question
CSNAT1 markNeeds review
The following two signed 2’s complement numbers (multiplicand M and multiplier Q) are being multiplied using Booth’s algorithm:
M: 1100 1101 1110 1101 and Q: 1010 0100 1010 1010
The total number of addition and subtraction operations to be performed is __________. (Answer in integer)

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 33

Open question
CSNAT1 markNeeds review
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)

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 33

Open question
CSNAT1 markNeeds review
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);

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 34

Open question
CSNAT1 markNeeds review
#include <stdio.h>
void foo(int *p, int x){
*p=x;
}
int main(){
int *z;
int a = 20, b = 25;
z = &a;
foo(z,b);
printf("%d",a);
return 0;
}
The output of the given C program is __________. (Answer in integer)

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 34

Open question
CSNAT1 markNeeds review
In a 4-bit ripple counter, if the period of the waveform at the last flip-flop is 64 microseconds, then the frequency of the ripple counter in kHz is ________. (Answer in integer)

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 35

Open question
CSNAT1 markNeeds review
The height of any rooted tree is defined as the maximum number of edges in the path from the root node to any leaf node.
Suppose a Min-Heap T stores 32 keys. The height of T is ____________. (Answer in integer)

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 35

Open question
CSNAT1 markNeeds review
Suppose the values 10, −4, 15, 30, 20, 5, 60, 19 are inserted in that order into an initially empty binary search tree. Let

be the resulting binary search tree. The number of edges in the path from the node containing 19 to the root node of

is __________. (Answer in integer)

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