Electronics and Communication Engineering - Exam Questions Papers
- Exam Questions Papers - Exam Paper 12
- Exam Questions Papers - Exam Paper 22
- Exam Questions Papers - Exam Paper 21
- Exam Questions Papers - Exam Paper 20
- Exam Questions Papers - Exam Paper 19
- Exam Questions Papers - Exam Paper 18
- Exam Questions Papers - Exam Paper 17
- Exam Questions Papers - Exam Paper 16
- Exam Questions Papers - Exam Paper 15
- Exam Questions Papers - Exam Paper 14
- Exam Questions Papers - Exam Paper 13
- Exam Questions Papers - Exam Paper 1
- Exam Questions Papers - Exam Paper 11
- Exam Questions Papers - Exam Paper 10
- Exam Questions Papers - Exam Paper 9
- Exam Questions Papers - Exam Paper 8
- Exam Questions Papers - Exam Paper 7
- Exam Questions Papers - Exam Paper 6
- Exam Questions Papers - Exam Paper 5
- Exam Questions Papers - Exam Paper 4
- Exam Questions Papers - Exam Paper 3
- Exam Questions Papers - Exam Paper 2
LXI S, FFFFH
MVI A, 00H
MVI B, 0FH
SUB B
CNC GOLOC
MVI A, FFH
where in the program subroutine labelled ''GOLOC'' introduces delay of 28 T-states only. How many T-states are required to execute above program statement?
Since carry (CY) flag will not be set at the execution of "SUB B" instruction;
check for CY flag fails but this requires 9(= 6 OP - CODE FETCH + 3T - states) T-states
∴ Total T-states = 10 + 7 + 7 + 4 + 9 + 7 = 44.

The mean is 3.
μ1 = 0.2 x 3 = 0.6
μ2 = 0.2 x 4 = 0.8
μ = (0.36) + (0.64) = 1.


Let ax1(t) + bx2(t) = m(t)
where m(t) is new input which causes the output n(t)
n(t) = m(t) -
n(t) = {ax1(t) + bx2(t)} -
add and subtract
n(t) = x1(t) -
a +
x2(t) -
b +
a +
b -
n(t) = +
{a + b - 1}
n(t) = ay1(t) + by2(t) +{a + b - 1}
For linearity, n(t) = ay1(t) + by2(t)
∴ {a + b - 1} = 0 ∴ a + b = 1.
(i) Hari's age + Gita's age > Irfan's age + Saira's age.
(ii) The age difference between Gita and Saira is 1 year. However, Gita is not the oldest and Saira is not the youngest.
(iii) There are not twins.
In what order were they born (Oldest first)?
(i) H + G > I + S
(ii) |G - S| = 1
Meaning G and S will be next to each other in the order. So the option A is ruled out.
G not oldest
S not youngest
(iii) No twins
Going by the options, we will try solve the equation,
Taking as example with youngest aged 1, we can try to solve the equation, and correct the age (started with ages 4, 3, 2, 1) to suit conditions (i) and (ii) which gives 5, 4, 3, 1
S I + 4 Generalizing, we can take their ages in terms of I's age,
G I + 3 In this case, H + G > I + S
H I + 2 Since 2I + 5 > 21 + 4
I I
I In this order, G is always less than I and H always less than S.
So G > I and H < S
S Implies G + H < I + S, all values are positive
H Defies condition i) Hence incorrect.
I In this order H < I, G < S
H Hence H + G < I + S
S Defies condition (i)
G Hence incorrect.