Questions 111–120 of 130. Imported answers require independent review unless marked reviewed.

Topic practice 130 questionsPage 12 of 13

Question 56

Open question
CS1NAT2 marksNeeds review
A given program has 25% load/store instructions. Suppose the ideal CPI (cycles per instruction) without any memory stalls is 2. The program exhibits 2% miss rate on instruction cache and 8% miss rate on data cache. The miss penalty is 100 cycles. The speedup (rounded off to two decimal places) achieved with a perfect cache (i.e., with NO data or instruction cache misses) is ________

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 56

Open question
CSNAT2 marksNeeds review
A functional dependency F: X → Y is termed as a useful functional dependency if and only if it satisfies all the following three conditions: • X is not the empty set. • Y is not the empty set. • Intersection of X and Y is the empty set.
For a relation R with 4 attributes, the total number of possible useful functional dependencies is ________

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 57

Open question
CS1NAT2 marksNeeds review
Consider the following code snippet using the

and

system calls. Assume that the code compiles and runs correctly, and that the system calls run successfully without any errors.
int x = 3;
while(x > 0) {
fork();
printf("helo");
wait(NULL);
x--;
}
The total number of times the

statement is executed is ________

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 57

Open question
CSNAT2 marksNeeds review
A processor with 16 general purpose registers uses a 32-bit instruction format. The instruction format consists of an opcode field, an addressing mode field, two register operand fields, and a 16-bit scalar field. If 8 addressing modes are to be supported, the maximum number of unique opcodes possible for every addressing mode is ________

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 58

Open question
CS1NAT2 marksNeeds review
Consider the entries shown below in the forwarding table of an IP router. Each entry consists of an IP prefix and the corresponding next hop router for packets whose destination IP address matches the prefix. The notation “/N” in a prefix indicates a subnet mask with the most significant N bits set to 1.
Prefix
Next hop router
10.1.1.0/24
R1
10.1.1.128/25
R2
10.1.1.64/26
R3
10.1.1.192/26
R4
This router forwards 20 packets each to 5 hosts. The IP addresses of the hosts are 10.1.1.6, 10.1.1.72, 10.1.1.132, 10.1.1.191, and 10.1.1.205. The number of packets forwarded via the next hop router R2 is ________

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 58

Open question
CSNAT2 marksNeeds review
A non-pipelined instruction execution unit operating at 2 GHz takes an average of 6 cycles to execute an instruction of a program P. The unit is then redesigned to operate on a 5-stage pipeline at 2 GHz. Assume that the ideal throughput of the pipelined unit is 1 instruction per cycle. In the execution of program P, 20% instructions incur an average of 2 cycles stall due to data hazards and 20% instructions incur an average of 3 cycles stall due to control hazards. The speedup (rounded off to one decimal place) obtained by the pipelined design over the non-pipelined design is ________

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 59

Open question
CS1NAT2 marksNeeds review
Let

be a context-free grammar in Chomsky Normal Form with

and

containing 10 variable symbols including the start symbol

. The string

is derivable from

. The number of steps (application of rules) in the derivation

is ________

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 59

Open question
CSNAT2 marksNeeds review
The number of distinct minimum-weight spanning trees of the following graph is ________
Diagram for Computer Science and Information Technology question 59


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 60

Open question
CS1NAT2 marksNeeds review
The number of edges present in the forest generated by the DFS traversal of an undirected graph

with 100 vertices is 40. The number of connected components in

is ________.

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 60

Open question
CSNAT2 marksNeeds review
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. The chromatic number of the following graph is ________
Diagram for Computer Science and Information Technology question 60


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