MOCK TEST : SET 1

COMPUTER SCIENCE

SET 1 COMPUTER SCIENCE

A decimal number has 30 digits. Approximately, how many digits would the binary representation have?

A) 3.3

B) 66.6

C) 90

D) 99.6
A pipeline P operating at 400 MHz has a speedup factor of 6 and operating at 70% efficiency. How many stages are there in the pipeline?

A) 5

B) 6

C) 8

D) 9
Two eight bit bytes 1100 0011 and 0100 1100 are added. What are the values of the overflow, carry and zero flags respectively, if the arithmetic unit of the CPU uses 2’s complement form?

A) 0, 1, 1

B) 1, 1, 0

C) 1, 0, 1

D) 0, 1, 0
Consider a computer system with ten physical page frames. The system is provided with an access sequence a1, a2, …, a20, a1, a2, …, a20), where each ai number. The difference in the number of page faults between the last-in-first-out page replacement policy and the optimal page replacement policy is __________

A) 0

B) 1

C)2

D) 3
The cardinality of the power set of {0,1,2,3,...,10} is _______

A) 512

B) 1024

C) 2048

D) 128
Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be

A) 4, 5

B) 5, 4

C) 3, 1

D) 13, 8
Which speed up could be achieved according to Amdahl’s Law for infinite number of processes if 5% of a program is sequential and the remaining part is ideally parallel ?

A) Infinite

B) 5

C) 20

D) 50
The cyclomatic complexity of each of the modules A and B shown below is 10 What is the cyclomatic complexity of the sequential integration shown on the right hand side?

A) 19

B) 21

C) 20

D) 10
Consider the following binary search tree T given below:
Which node contains the fourth smallest element in T?

A) Q

B) V

C) W

D) X
Output of the following Program: #include
int main() {
int a = 5;
printf("%d%d%d", a++, a++, ++a);
}

A) 566

B) 766

C) 765

D) Compiler Dependent
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D.

A) Network layer – 4 times and Data link layer – 4 times

B) Network layer – 4 times and Data link layer – 3 times

C) Network layer – 4 times and Data link layer – 6 times

D) Network layer – 2 times and Data link layer – 6 times
Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alpha-beta pruning?

A) I

B) HI

C) CHI

D) GHI
The coupling between different modules of a software is categorized as follows:
I. Content coupling
II. Common coupling
III. Control coupling
IV. Stamp coupling
V. Data coupling
Coupling between modules can be ranked in the order of strongest (least desirable) to weakest (most desirable) as follows:

A) I-II-III-IV-V

B) V-IV-III-II-I

C) I-III-V-II-IV

D) IV-II-V-III-I
How many programmable fuses are required in a PLA which takes 16 inputs and gives 8 outputs? It has to use 8 OR gates and 32 AND gates.

A) 1032

B) 766

C) 1280

D) 1536
Which of the following statement is the negation of the statement,"2 is even and -3 is negative" ?

A) 2 is even and -3 is not negative

B) 2 is odd and -3 is not negative

C) 2 is even or -3 is negative

D) 2 is odd and -3 is negative
Consider the following LPP :
Min Z = 2x1 + x2 + 3x3
Subject to :
x1 - 2x2 + x3 ≥ 4
2x1 + x2 + x3 ≤ 8
x1 - x3 ≥ 0
x1, x2, x3 ≥ 0
The solution of this LPP using the Dual Simplex Method is :

A) x1 = 0, x2 = 0, x3 = 3 and Z = 9

B) x1 = 0, x2 = 6, x3 = 0 and Z = 6

C) x1 = 4, x2 = 0, x3 = 0 and Z = 8

D) x1 = 2, x2 = 0, x3 = 2 and Z = 10
Suppose the time to service a page fault is on the average 10 milliseconds, while a memory access takes 1 microsecond. Then a 99.99% hit ratio results in average memory access time of

A) 1.9999 milliseconds

B) 1 millisecond

C) 9.999 microseconds

D) 1.9999 microseconds
Which of the following statement is true?

A) SLR parser is more powerful than LALR.

B) LALR parser is more powerful than Canonical LR parser.

C) Canonical LR parser is more powerful than LALR parser.

D) The parsers SLR, Canonical LR, and LALR have the same power.
If G is an undirected planar graph on n vertices with e edges then

A) e ≤ n

B) e ≤ 2n

C) e ≤ 3n

D) None of the option
In an IPv4 packet, the value of HLEN is 1000 in binary. How many bytes of options are being carried by this packet?

A) 8

B) 16

C) 32

D) 64
In a binary Hamming Code the number of check digits is r then number of message digits is equal to:

A) 2^r – 1

B) 2^r – r – 1

C) 2^r – r + 1

D) 2^r + r – 1
Using the RSA public key crypto system, if p=13, q=31 and d=7, then the value of e is

A)101

B) 103

C) 105

D) 107
Consider the undirected graph below:

Using Prim’s algorithm to construct a minimum spanning tree starting with node a, which one of the following sequences of edges represents a possible order in which the edges would be added to construct the minimum spanning tree?

A) (a,b),(a,h),(g,h),(f,g),(c,f),(c,i),(c,d),(d,e)

B) (a,b),(b,h),(g,h),(g,i),(c,i),(c,f),(c,d),(d,e)

C) (a,b),(b,c),(c,i),(c,f),(f,g),(g,h),(c,d),(d,e)

D) (a,b),(g,h),(g,f),(c,f),(c,i),(f,e),(b,c),(d,e)
Match the following :
I. 2 NF (a) transitive dependencies eliminated
II. 3 NF (b) multivalued attribute removed
III. 4 NF (c) contain no partial functional dependencies
IV. 5 NF (d) contains no join dependency

I II III IV

A) (a) (c) (b) (d)

B) (d) (a) (b) (c)

C) (c) (d) (a) (b)

D) (d) (b) (a) (c)
Choose the correct answer from the options given below:

Choose the correct answer from the options given below:

A) a and b only

B) a only

C) b and c only

D) c only

MOCK TEST : SET 1

Countdown Timer

SET 1 COMPUTER SCIENCE

A decimal number has 30 digits. Approximately, how many digits would the binary representation have?

A pipeline P operating at 400 MHz has a speedup factor of 6 and operating at 70% efficiency. How many stages are there in the pipeline?

Two eight bit bytes 1100 0011 and 0100 1100 are added. What are the values of the overflow, carry and zero flags respectively, if the arithmetic unit of the CPU uses 2’s complement form?

The cardinality of the power set of {0,1,2,3,...,10} is _______

Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be

Which speed up could be achieved according to Amdahl’s Law for infinite number of processes if 5% of a program is sequential and the remaining part is ideally parallel ?

The cyclomatic complexity of each of the modules A and B shown below is 10 What is the cyclomatic complexity of the sequential integration shown on the right hand side?

Consider the following binary search tree T given below: Which node contains the fourth smallest element in T?

Output of the following Program: #include int main() { int a = 5; printf("%d%d%d", a++, a++, ++a); }

Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D.

Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alpha-beta pruning?

How many programmable fuses are required in a PLA which takes 16 inputs and gives 8 outputs? It has to use 8 OR gates and 32 AND gates.

Which of the following statement is the negation of the statement,"2 is even and -3 is negative" ?

Consider the following LPP : Min Z = 2x1 + x2 + 3x3 Subject to : x1 - 2x2 + x3 ≥ 4 2x1 + x2 + x3 ≤ 8 x1 - x3 ≥ 0 x1, x2, x3 ≥ 0 The solution of this LPP using the Dual Simplex Method is :

Suppose the time to service a page fault is on the average 10 milliseconds, while a memory access takes 1 microsecond. Then a 99.99% hit ratio results in average memory access time of

Which of the following statement is true?

If G is an undirected planar graph on n vertices with e edges then

In an IPv4 packet, the value of HLEN is 1000 in binary. How many bytes of options are being carried by this packet?

In a binary Hamming Code the number of check digits is r then number of message digits is equal to:

Using the RSA public key crypto system, if p=13, q=31 and d=7, then the value of e is

Consider the undirected graph below:

Using Prim’s algorithm to construct a minimum spanning tree starting with node a, which one of the following sequences of edges represents a possible order in which the edges would be added to construct the minimum spanning tree?

Match the following : I. 2 NF (a) transitive dependencies eliminated II. 3 NF (b) multivalued attribute removed III. 4 NF (c) contain no partial functional dependencies IV. 5 NF (d) contains no join dependency

I II III IV

Choose the correct answer from the options given below:

Choose the correct answer from the options given below:

Consider the following binary search tree T given below:
Which node contains the fourth smallest element in T?

Output of the following Program: #include
int main() {
int a = 5;
printf("%d%d%d", a++, a++, ++a);
}

Consider the following LPP :
Min Z = 2x1 + x2 + 3x3
Subject to :
x1 - 2x2 + x3 ≥ 4
2x1 + x2 + x3 ≤ 8
x1 - x3 ≥ 0
x1, x2, x3 ≥ 0
The solution of this LPP using the Dual Simplex Method is :

Match the following :
I. 2 NF (a) transitive dependencies eliminated
II. 3 NF (b) multivalued attribute removed
III. 4 NF (c) contain no partial functional dependencies
IV. 5 NF (d) contains no join dependency