81.
If we want to resize a 1024 × 768 pixels
image to one that is 640 pixels wide with the same aspect ratio, what would be
the height of the resized image?

(1) 420 Pixels (2) 460 Pixels

(3) 480 Pixels (4) 540 Pixels

Answer: 3

82.
An instruction is stored at location 500 with
its address field at location 501. The address field has the value 400. A
processor register R1 contains the number 200. Match the addressing mode
(List-I) given below with effective address (List-II) for the given
instruction:

**List-I List-II**

(a) Direct (i) 200

(b) Register Indirect (ii) 902

(c) Index with R1 as the index register (iii) 400

(d) Relative (iv)
600

Choose the correct option from those given
below:

(1) (a)-(iii), (b)-(i), (c)-(iv), (d)-(ii) (2) (a)-(i), (b)-(ii), (c)-(iii),
(d)-(iv)

(3) (a)-(iv), (b)-(ii), (c)-(iii), (d)-(i) (4) (a)-(iv), (b)-(iii),
(c)-(ii), (d)-(i)

Answer: 1

83.
A tree has 2n vertices of degree 1, 3n
vertices of degree 2, n vertices of degree 3. Determine the number of vertices
and edges in tree.

(1) 12, 11 (2)
11, 12

(3) 10, 11 (4)
9, 10

Answer: 1

84.
Match List-I with List-II:

**List-I List-II**

(a) Micro operation (i) Specify micro operations

(b) Micro programmed control unit (ii) Improve CPU utilization

(c) Interrupts (iii) Control memory

(d) Micro instruction (iv) Elementary operation performed
on data

stored in registers

Choose the correct option from those given
below:

(1) (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i) (2) (a)-(iv), (b)-(iii), (c)-(i),
(d)-(ii)

(3) (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii) (4) (a)-(iii), (b)-(iv),
(c)-(ii), (d)-(i)

Answer: 1

85.
Suppose a system has 12 magnetic tape drives
and at time t

_{0}, three processes are allotted tape drives out of their need as given below:
At time t

_{0}, the system is in safe state. Which of the following is safe sequence so that deadlock is avoided?
(1) ⟨p

_{0}, p_{1}, p_{2}⟩ (2) ⟨p_{1}, p_{0}, p_{2}⟩
(3) ⟨p

_{2}, p_{1}, p_{0}⟩ (4) ⟨p_{0}, p_{2}, p_{1}⟩
Answer: 2

86.
Consider the following statements:

(a) Fiber optic cable is much lighter than
copper cable.

(b) Fiber optic cable is not affected by
power surges or electromagnetic interference.

(c) Optical transmission is inherently
bidirectional.

Which of the statements is (are) correct?

(1) Only (a) and (b) (2) Only (a) and (c)

(3) Only (b) and (c) (4) (a), (b) and (c)

Answer: 1

87.
Consider the following models:

M

_{1}: Mamdani model
M

_{2}: Takagi-Sugeno-Kang model
M

_{3}: Kosko's additive model(SAM)
Which of the following option contains
examples of additive rule model?

(1) Only M

_{1}and M_{2}(2) Only M_{2}and M_{3}
(3) Only M

_{1}and M_{3}(4) M_{1}, M_{2}and M_{3}
Answer: 2

88.
Give asymptotic upper and lower bound for

*T*(*n*) given below. Assume*T*(*n*) is constant for*n*≤2.*T*(

*n*)= 4T(√n)+lg

^{2}n

(1)

*T*(*n*)=*Î¸*(lg*(lg^{2}*n*)lg*n*) (2)*T*(*n*)=*Î¸*(lg^{2}*n*lg*n*)
(3)

*T*(*n*)=*Î¸*(lg^{2}*n*lg lg*n*) (4)*T*(*n*)=*Î¸*(lg (lg*n*)lg*n*)
Answer: 2

89.
The Boolean expression

(1) A (2)
B

(3) C (4)
A, B and C

Answer: 2

90.
Let A be the base class in C++ and B be the
derived class from A with protected inheritance.

Which of the following statement is false for
class B?

(1) Member function of class B can access
protected data of class A

(2) Member function of class B can access
public data of class A

(3) Member function of class B cannot access
private data of class A

(4) Object of derived class B can access
public base class data

Answer: 4

**Comprehension:**

**Answer the following questions (91 - 95) based on flow graph F.**

A flow graph F with entry node (1) and exit
node (11) is shown below:

91.
How many nodes are there in the longest
independent path?

(1) 6 (2) 7 (3)
8 (4) 9

Answer: 3

92. How
many regions are there in flow graph F?

(1) 2 (2) 3 (3) 4 (4)
5

Answer: 3

93.
How many nodes are there in flow graph F?

(1) 9 (2)
10 (3) 11 (4) 12

Answer: 1

94.
What is the cyclomatic complexity of flow graph
F?

(1) 2 (2)
3 (3) 4 (4) 5

Answer: 3

95.
How many predicate nodes are there and what
are their names?

(1) Three: (1, (2,3), 6) (2) Three: (1, 4, 6)

(3) Four: ((2,3), 6, 10, 11) (4) Four: ((2,3), 6, 9, 10)

Answer: 1

**Comprehension:**

**Answer question (96 - 100) based on the problem statement given below:**

An organization needs to maintain database
having five attributes A, B, C, D, E. These attributes are functionally
dependent on each other for which functionally dependency set F is given as: F:
{A→ BC, D → E, BC → D, A →D}. Consider a universal relation R(A, B, C, D, E)
with functional dependency set F. Also all attributes are simple and take
atomic values only.

96.
Minimal cover F’ of functional dependency set
F is

(1) F’ = {A → B, A → C, BC → D, D →E}

(2) F’ = {A → BC, B → D, D → E}

(3) F’ = {A → B, A → C, A → D, D → E}

(4) F’ = {A → B, A → C, B → D, C → D, D → E}

Answer: 1

97. Assume
that given table R is decomposed in two tables.

R

_{1}(A,B,C) with functional dependency set F_{1}= {A → B, A → C} and
R

_{2}(A,D,E) with FD set F_{2}= {A → D, D → E}
Which of the
following option is true w.r.t. given decomposition?

(1) Dependency preservation property is
followed

(2) R

_{1}and R_{2}are both in 2 NF
(3) R

_{2}is in 2 NF and R_{3}is in 3 NF
(4) R

_{1}is in 3 NF and R_{2}is in 2 NF
Answer: 4

98.
Identify the redundant functional dependency
in F

(1) BC→D (2)
D→E

(3) A→D (4)
A→BC

Answer: 3

99.
Identify primary key of table R with
functional dependency set F

(1) BC (2)
AD

(3) A (4)
AB

Answer: 3

100.
Identify the normal form in which relation R
belong to

(1) 1 NF (2)
2 NF

(3) 3 NF (4)
BCNF

Answer: 2

## 0 Comments