EC Mains-2018 Paper-2 Solutions

Detailed Solutions
ESE-2018 E & T Engineering

Mains Test Series Test No : 8
Section A : Advanced Communication Topics + Computer Organization and Architecture

Q.1 (a) Solution:
Given data:
Core radius, a = 25 μm
Core refractive index, n1 = 1.48
Index difference, Δ = 0.01
The number of modes in a fiber for a step-index fiber can be given by,
V2
M ≈
2
Where, V = normalised frequency
2 πa
= n1 2 Δ
λ
λ = wavelength
For λ = 860 nm :
2 π(25 × 10−6 )
V = (1.48) 2 (0.01) = 38.23
(860 × 10 −9 )
V2
Number of modes, M ≈ = 730
2
10 | ESE 2018 : MAINS TEST SERIES
For λ = 1310 nm :
2 π(25 × 10−6 )
V = (1.48) 2(0.01) = 25.1
(1310 × 10 −9 )
V2
2
For λ = 1550 nm :
2 π(25 × 10 −6 )
V = (1.48) 2 (0.01) = 21.2
(1550 × 10−9 )
V2
2
Q.1 (b) Solution:
(i) The minimum distance between cochannel cells, which allows the same frequency
to be reused in these cells, depends on many factors such as the number of cochannel
cells in the vicinity of the centre cell, the type of geographic terrain contour, the cell-
side antenna height and the transmitted power at each cell-site. Usually, the size of
all the cells is approximately same and fixed. Then the cochannel interference is
independent of transmitter power of each cell.
(ii) The methods to reduce cochannel interference in cellular communication network
include using the higher value of cluster size (resulting in increased separation
between two cochannel cells and hence reduction in cochannel interference), lowering
the antenna heights at the cell-site institutions like high hill or a valley, using
directional antennas at the cell-site (sectoring the omnidirectional cell), down tilting
of the antennas at cell-site, providing a notch in the centre of the antenna pattern at
the interfering cell-site, using umbrella pattern of a staggered discone antenna or
using a parasite antenna with a single active element, and use of diversity antenna
system the receiver.
(iii) In most of the mobile radio environments, use of cluster size K = 7 is not sufficient to
avoid cochannel interference. But increasing the value of K more than 7 would reduce
the number of channels per cell, assuming the available spectrum fixed in the system.
This would result in reduction in the cell capacity and hence the spectrum efficiency.
Therefore, there is trade-off among various system performance parameters such as
system capacity, spectrum efficiency and signal quality so as to determine the
optimum value of the cluster size.
© Copyright: www.madeeasy
www.madeeasy.in
.madeeasy.in
Test No : 8 E & T ENGINEERING | 11
Q.1 (c) Solution:
DEADLOCK : Deadlock is a situation where a set of processes are blocked because each
process is holding a resource and waiting for another resource acquired by some other process.
Consider an example when two trains are coming toward each other on same track and
there is only one track, none of the trains can move once they are in front of each other.
Similar situation occurs in operating systems when there are two or more processes
hold some resources and wait for resources held by other(s). For example, in the below
diagram, process 1 is holding resource 1 and waiting for resource 2 which is acquired
by process 2, and process 2 is waiting for resource 1.
T0 thread has a
LOCK on resource1, resource1 not available
but requires
resource2 for
finishing execution
T0 T1
T1 thread has a
LOCK on resource2,
not available resource2 but requires
resource1 for
finishing execution
• Deadlock Prevention : We can prevent Deadlock by eliminating any of the above

four condition.
Eliminate Mutual Exclusion: It is not possible to dissatisfy the mutual exclusion because
some resources, such as the tap drive and printer, are inherently non-shareable.
• Eliminate Hold and Wait:
1. Allocate all required resources to the process before start of its execution, this way hold
and wait condition is eliminated but it will lead to low device utilization. for example, if
a process requires printer at a later time and we have allocated printer before the start of
its execution printer will remained blocked till it has completed its execution.
2. Process will make new request for resources after releasing the current set of resources.
This solution may lead to starvation.
R1
P1 is holding R1
P1
P1 is waiting R2
R2
HOLD and WAIT
www.madeeasy.in
.madeeasy.in
• Eliminate No Preemption: Preempt resources from process when resources required

by other high priority process.
• Eliminate Circular Wait : Each resource will be assigned with a numerical number. A
process can request for the resources only in increasing order of numbering. For Example,
if P1 process is allocated R5 resources, now next time if P1 ask for R4, R3 lesser than R5
such request will not be granted, only request for resources more than R5 will be granted.
Q.1 (d) Solution

Transaction : A transaction is a single logical unit of work which accesses and possibly
modifies the contents of a database. Transactions access data using read and write operations.
In order to maintain consistency in a database, before and after transaction, certain
properties are followed. These are called ACID properties.
• Atomicity : By this, we mean that either the entire transaction takes place at once or
doesn’t happen at all. There is no midway i.e. transactions do not occur partially.
Each transaction is considered as one unit and either runs to completion or is not
executed at all. It involves following two operations.
- Abort: If a transaction aborts, changes made to database are not visible.
- Commit: If a transaction commits, changes made are visible.
Atomicity is also known as the ‘All or nothing rule’.
Partially
Committed
Committed
Begin
Active End
Failed Aborted
Consider the following transaction T consisting of T1 and T2: Transfer of 100 from account
X to account Y.
Before : X : 500 Y : 200
Transaction T
T1 T2
Read (X) Read (Y)
X: = X – 100 Y: = Y – 100
Write (X) Write (Y)
After : X : 400 Y : 300
www.madeeasy.in
.madeeasy.in
If the transaction fails after completion of T1 but before completion of T2.( say, after
write(X) but before write(Y)), then amount has been deducted from X but not added to
Y. This results in an inconsistent database state. Therefore, the transaction must be
executed in entirety in order to ensure correctness of database state.
• Consistency : This means that integrity constraints must be maintained so that the
database is consistent before and after the transaction. It refers to correctness of a
database. Referring to the example above,
The total amount before and after the transaction must be maintained.
Total before T occurs = 500 + 200 = 700.
Therefore, database is consistent. Inconsistency occurs in case T1 completes but T2 fails.
As a result T is incomplete.
• Isolation : This property ensures that multiple transactions can occur concurrently
without leading to inconsistency of database state. Transactions occur independently
without interference. Changes occurring in a particular transaction will not be visible
to any other transaction until that particular change in that transaction is written to
memory or has been committed. This property ensures that the execution of
transactions concurrently will result in a state that is equivalent to a state achieved
these were executed serially in some order.
Let X= 500, Y = 500.
Consider two transactions T and T”.
T T′′
Read (X) Read (X)
X: = X * 100 Read (Y)
Write (X) Z: = X + Y
Read (Y) Write (Z)
Y: = Y – 50
Write
Suppose T has been executed till Read (Y) and then T’’ starts. As a result , interleaving
of operations takes place due to which T’’ reads correct value of X but incorrect value of
Y and sum computed by
T’’: (X+Y = 50, 000+500=50, 500)
is thus not consistent with the sum at end of transaction:
T: (X+Y = 50, 000 + 450 = 50, 450).
This results in database inconsistency, due to a loss of 50 units. Hence, transactions
must take place in isolation and changes should be visible only after they have been
made to the main memory.
www.madeeasy.in
.madeeasy.in
• Durability : This property ensures that once the transaction has completed execution,
the updates and modifications to the database are stored in and written to disk and
they persist even if system failure occurs. These updates now become permanent and
are stored in a non-volatile memory. The effects of the transaction, thus, are never lost.
Q.1 (e) Solution

Assume Page Size = x bytes
We know that,
1st Page table size = Number of entries in page table × Page table entry size
2 46 2 48
= × 4B =
x x
2nd Page table size = Number of entries in 1st page table × Page table entry size
2 48
= × 4B = 250
x2
3rd Page table size = Number of entries in 2nd page table × Page table entry size
2 50 2 52
= × 4B =
x3 x3
Since 3rd level page table must fit into single page.
2 52
So, x=
x3
x 4 = 2 52
Take log2 both side
4(log2 x) = 52 (log2 2)
(log2 x) = 13
x = 213 = 8 KB
Q.2 (a) Solution:

The carrier frequency of the received signal can be given by,
fr = fc + fd ...(i)
Where, fc = transmitter carrier frequency
1 v cos θ
fd = Doppler shift = vm cos θ = m fc
λc c
vm = velocity of the mobile = 72 kmph = 20 m/s
θ = angle between the direction of mobile motion and that of arrival of the signal
(i) In this case, θ = 180° as the mobile is moving away from the base-station.
20 cos(180°)
So, fd = × 900 × 106 = − 60 Hz
8
3 × 10
www.madeeasy.in
.madeeasy.in
The received carrier frequency,
fr = fc + fd = 900 × 106 – 60 Hz = 899.99994 MHz
(ii) In this case, θ = 0° as the mobile is moving towards the base-station.
20 cos(0°)
So, fd = × 900 × 106 = 60 Hz
8
3 × 10
fr = fc + fd = 900 × 106 + 60 Hz = 900.00006 MHz
(iii) In this case, θ = 60°.
20 cos(60°)
So, fd = × 900 × 106 = 30 Hz
8
3 × 10
fr = fc + fd = 900 × 106 + 30 Hz = 900.00003 MHz
(iv) In this case, θ = 90°.
20 cos(90°)
So, fd = × 900 × 106 = 0
8
3 × 10
fr = fc + fd = 900 MHz
Q.2 (b) Solution

(i) Given data : P0 = 200 μW, P1 = 90 μW, P2 = 85 μW and P3 = 6.3 nW
P2 85
Coupling ratio = × 100% = × 100% = 48.57%
P1 + P2 90 + 85
⎛ P0 ⎞ ⎛ 200 ⎞
Excess loss = 10 log 10 ⎜ ⎟ = 10 log 10 ⎜ ⎟ dB = 0.58 dB
⎝ P1 + P2 ⎠ ⎝ 90 + 85 ⎠
Insertion loss for coupling from port-0 to port-1 is,
⎛ P0 ⎞ ⎛ 200 ⎞
Insertion loss = 10 log 10 ⎜ ⎟ = 10 log 10 ⎜ ⎟ dB = 3.47 dB
⎝ P1 ⎠ ⎝ 90 ⎠
Insertion loss for coupling from port-0 to port-2 is,
⎛P ⎞ ⎛ 200 ⎞
Insertion loss = 10 log 10 ⎜ 0 ⎟ = 10 log 10 ⎜ ⎟ dB = 3.72 dB
⎝ P2 ⎠ ⎝ 85 ⎠
⎛ P3 ⎞ ⎛ 6.3 × 10 −3 ⎞
Return loss = 10 log 10 ⎜ ⎟ = 10 log 10 ⎜⎜ ⎟⎟ dB = –45 dB
⎝ P0 ⎠ ⎝ 200 ⎠
www.madeeasy.in
.madeeasy.in
(ii)
Star topology: A star topology is a multipoint data Computer
communications network where remote stations

are connected by cable segments directly to a Computer
centrally located computer called a hub, which acts Hub Computer
like a multipoint connector. In essence, a star

topology is simply a multipoint circuit comprised
Computer
of many two-point circuits where each remote Computer
station communicates directly with a centrally Star topology
located computer. With a star topology, remote stations cannot communicate directly
with one another, so they must relay information through the hub. Hubs also have store-
and-forward capabilities, enabling them to handle more than one message at a time.
Bus topology: A bus topology is a multipoint data
Computer Computer Computer
communications circuit that makes it relatively
simple to control data flow between and among
Bus
the computers- because this configuration allows
Computer Computer
all stations to receive every transmission over the
Bus topology
network. With a bus topology, all the remote
stations are physically or logically connected to a single transmission line called a
bus. The bus topology is the simplest and most common method of interconnecting
computers. The two ends of the transmission line never touch to form a complete
loop. A bus topology is sometimes called multidrop or linear bus, and all stations
share a common transmission medium. Data networks using the bus topology
generally involve one centrally located host computer that controls data flow to and
from the other stations. The bus topology is sometimes called a horizontal bus and
is shown in the figure below.
Ring topology: A ring topology is a multipoint data Computer
communications network where all stations are
interconnected in tandem (series) to form a closed Computer
Computer
loop or circle. A ring topology is sometimes called a
loop. Each station in the loop is joined by
point -to-point links to two other stations (the
Computer Computer
transmitter of one and the receiver of the other).
Transmissions are unidirectional and must Ring topology
propagate through all the stations in the loop.

Each computer acts like a repeater in that it receives signals from down-line
computers and then retransmits them to up-line computers. The ring topology is
similar to the bus and star topologies, as it generally involves one centrally located
host computer that controls data flow to and from the other stations.
www.madeeasy.in
.madeeasy.in
Mesh topology: In a mesh topology, every station has a

direct two-point communications link to every other Computer Computer
station on the circuit as shown in the figure below.

The mesh topology is sometimes called fully connected.
A disadvantage of a mesh topology is a fully connected
circuit requires n(n – 1)/2 physical transmission paths Computer Computer
to interconnect n stations and each station must have Mesh topology
n - 1 input/output ports. Advantages of a mesh
topology are reduced traffic problems, increased
reliability, and enhanced security.
Hybrid topology: A hybrid topology is simply Computer Computer Computer
combining two or more of the traditional Bus
topologies to form a larger, more complex Computer Computer
topology. Hybrid topologies are sometimes

Computer
called mixed topologies. An example of a hybrid
Computer Ring
topology is the bus star topology shown in the
figure below. Other hybrid configurations Computer
include the star ring, bus ring, and virtually Computer

every other combination we can think of. Hybrid topology
2. (c) Solution:
(i)
The decimal number is 0.239 × 213.
We have to find hexadecimal representation without normalization and rounding off.
Biased exponent = 13 + 64 = 77
Representing 77 in binary
(77)10 = (1001101)2
Representing mantissa in binary,
(0.239)10 = 0.00111101000101
Floating point representation is as follows:
Sign Exponent Mantissa
0 1001101 00111101
0100 1101 0011 1101
4 D 3 D
= (4D3D)H
www.madeeasy.in
.madeeasy.in
(ii)
The decimal number is 0.239 × 213.
We have to find hexadecimal representation with normalization.
Binary representation of 0.239 is
0.0011110100101
∴ N is (0.0011110100101) × 213
After normalization we have
1.1110100101 × 210
Then, biased exponent = 10 + 64 = 74
Representating biased exponent 74 in binary
(74)10 = (1001010)2
Floating point representation of number is as follows:
Sign Exponent Mantissa
0 1001010 11101001
0100 1010 1110 1001
4 A E 9
= (4AE9)H
Q.3 (a) Solution
(i)
• Considering an elliptical orbit as shown in the figure below:
elliptical
orbit R
perigee b
Earth
centre centre
apogee
of ellipse of the
earth b
hp
ha
ra rp
a a
Figure-1
Here, R = mean radius of the earth
ra = length of radius vector at apogee
rp = length of radius vector at perigee
ha = apogee height
www.madeeasy.in
.madeeasy.in
hp = perigee height
a = semimajor axis of the elliptical orbit
b = semiminor axis of the elliptical orbit
• The eccentricity (e) of the elliptical orbit can be defined as,
a2 − b 2
e =
a
• Given data : e = 0.15
a = 9000 km
R = 6371 km
To determine the orbital period :
Kepler’s third law states that, the square of the periodic time of orbit (orbital period) is
proportional to the cube of the mean distance (semimajor axis) between the two bodies.
i.e., a3 ∝ T 2
⎛ μ ⎞ 2
a3= ⎜⎜ 2 ⎟⎟ T ...(i)
⎝ 4π ⎠
Where, a = semimajor axis
T = orbital period
μ = Kepler’s constant = 3.986004418 × 1014 m3/s2
• From equation (i), we can write,
⎛ 4 π2 ⎞ 3
T 2 = ⎜⎜ μ ⎟⎟ a
⎝ ⎠
1/2
⎛ a3 ⎞
T = 2 π ⎜⎜ ⎟⎟ ...(ii)
⎝μ⎠
• By substituting the values of “a” and “μ” in equation (ii), we get,
1/2
⎡ (9000 × 10 3 )3 ⎤
Orbital period, T = 2 π ⎢ 14 ⎥
seconds
⎢⎣ 3.986004418 × 10 ⎥⎦
= 2π(1352.368) seconds ≈ 8497.2 seconds
= 2 hours, 21 minutes, 37.2 seconds
To determine the apogee height :
• From the basic properties of ellipse, the radial length from the centre of the earth to
the point apogee (ra ) can be written as,
ra = a(1 + e) ...(iii)
• By substituting the values of “a” and “e” in equation (iii), we get,
ra = 9000(1 + 0.15) km = 10350 km
www.madeeasy.in
.madeeasy.in
• From the elliptical orbit shown in the figure-1, the apogee height can be written as,
ha = ra – R ...(iv)
• By substituting the values of “ra” and “R ” in equation (iv), we get,
ha = ra – R = (10350 – 6371) km = 3979 km
To determine the perigee height :
• Similarly, from the basic properties of ellipse, the radial length from the centre of the
earth to the point perigee (rp) can be written as,
rp = a (1 – e) ...(v)
• By substituting the values of “a” and “e” in equation (v), we get,
rp = 9000(1 – 0.15) km = 7650 km
• From elliptical orbit shown in the figure-1, the perigee height can be written as,
h p = rp – R ...(vi)
• By substituting the values of “rp” and “R ” in equation (vi), we get,
hp = (7650 – 6371) km
= 1279 km
(ii)
Given data:
Free-space loss, [FSL] = 206 dB
Antenna pointing loss, [APL] = 1 dB
Atmospheric absorption, [AA] = 2 dB
Receiver feeder loss, [RFL] = 1 dB
Equivalent isotropic radiated power, [EIRP] = 48 dBW
Figure of merit of the receiver, [G/ T] = 19.5 dB/K
Operating frequency, f = 12 GHz
Calculation of carrier-to-noise spectral density ratio:
⎡C ⎤ ⎡G ⎤
⎢ ⎥ = [EIRP] + ⎢ ⎥ − [Losses] − [ k ] ...(i)
⎣ N0 ⎦ ⎣T ⎦
[k] = Boltzmann constant in dB
= 10log10 (k) = –228.6 dB
[Losses] = [FSL] + [APL] + [AA] + [RFL]
= 206 dB + 1 dB + 2 dB + 1 dB
= 210 dB
• By substituting the values of [EIRP], [G/T], [Losses] and [k] in equation (i), we get,
⎡C ⎤
⎢ ⎥ = (48 + 19.5 – 210 + 228.6) dBHz
⎣ N0 ⎦
= 86.10 dBHz
www.madeeasy.in
.madeeasy.in
Q.3 (b) Solution:
Given that, n1 = 1.50, Δ = 0.01 and L = 6 km.
(i) The delay difference between the slowest and fastest modes can be given by,
Ln1 Δ 6000 × 1.50 × 0.01
δTs ≈ = s = 300 ns
c 3 × 108
(ii) The rms pulse broadening due to intermodal dispersion can be given by,
Ln1 Δ 300
σs = = ns = 86.6 ns
2 3c 2 3
(iii) The maximum bit rate can be estimated in two ways. Firstly, to get an idea of the
maximum bit rate when assuming no pulse overlap, we get,
1 1 1
BT (max) = = = bps = 1.67 Mbps
2 τ 2 δTs 2 × 300 × 10 −9
Alternatively an improved estimate also can be used to get BT (max) using rms pulse
broadening, as
0.2 0.2
BT (max) = = ≈ 2.31Mbps
σs 86.6 × 10 −9
(iv) By using the most accurate estimate of the maximum bit rate from part (iii), and
assuming return to zero pulses, the bandwidth-length product can be given by,
Bopt × L = 2.31 × 106 × 6 × 103 = 13.86 MHz-km
Q.3 (c) Solution

The method that is used to transfer information between internal storage and external
I/O devices is known as I/O interface. The CPU is interfaced using special
communication links by the peripherals connected to any computer system. These
communication links are used to resolve the differences between CPU and peripheral.
There exists special hardware components between CPU and peripherals to supervise
and synchronize all the input and output transfers that are called interface units.
Data transfer to and from the peripherals may be done in any of the three possible
ways
• Programmed I/O.
• Interrupt- initiated I/O.
• Direct memory access (DMA).
www.madeeasy.in
.madeeasy.in
Programmed I/O: It is due to the result of the I/O instructions that are written in the
computer program. Each data item transfer is initiated by an instruction in the
program. Usually the transfer is from a CPU register and memory. In this case it
requires constant monitoring by the CPU of the peripheral devices.
Example of Programmed I/O: In this case, the I/O device does not have direct access
to the memory unit. A transfer from I/O device to memory requires the execution of
several instructions by the CPU, including an input instruction to transfer the data
from device to the CPU and store instruction to transfer the data from CPU to memory.
In programmed I/O, the CPU stays in the program loop until the I/O unit indicates
that it is ready for data transfer. This is a time consuming process since it needlessly
keeps the CPU busy.
Interrupt- initiated I/O: Since in the above case we saw the CPU is kept busy
unnecessarily. This situation can very well be avoided by using an interrupt driven
method for data transfer. By using interrupt facility and special commands to inform
the interface to issue an interrupt request signal whenever data is available from any
device. In the meantime, the CPU can proceed for any other program execution. The
interface meanwhile keeps monitoring the device. Whenever it is determined that
the device is ready for data transfer it initiates an interrupt request signal to the
computer. Upon detection of an external interrupt signal the CPU stops momentarily
the task that it was already performing, branches to the service program to process
the I/O transfer, and then return to the task it was originally performing.
Direct Memory Access: The data transfer between a fast storage media such as
magnetic disk and memory unit is limited by the speed of the CPU. Thus we can
allow the peripherals directly communicate with each other using the memory buses,
removing the intervention of the CPU. This type of data transfer technique is known
as DMA or direct memory access. During DMA the CPU is idle and it has no control
over the memory buses. The DMA controller takes over the buses to manage the
transfer directly between the I/O devices and the memory unit.
High impedance (disable)
when BG is enable
Bus Request BR ABUS Address Bus
DBUS Data Bus
RD Read
Bus Grant BG WR Write

www.madeeasy.in
.madeeasy.in
Bus Request : It is used by the DMA controller to request the CPU to relinquish the
control of the buses.
Bus Grant : It is activated by the CPU to inform the external DMA controller that the
buses are in high impedance state and the requesting DMA can take control of the
buses. Once the DMA has taken the control of the buses it transfers the data. This
transfer can take place in many ways.
Q.4 (a) Solution:

(i) In FDMA, the output power of the transmitter is divided equally between the
channels. For Ptransponder = 20 W and 500 channels,
20
Power per channel = = 40 mW/channel
500
(ii) Given that, for downlink,
Path loss, L p = 206 dB at 11 GHz
Noise bandwidth, BN = 50 kHz
Transmitter antenna gain, Gt = 30 dB
Receiver antenna gain, Gr = 40 dB
Noise equivalent temperature, Teq = 150 K
So, the power received by the earth station can be given by,
In decilogs, [Pr ] = [Pt] + [Gt] + [Gr ] – [Lp]
From part (i), [Pt] = 10log10(40 × 10–3) ≈ –14 dBW
So, [Pr ] = –14 + 30 + 40 – 206 = –150 dBW
The noise power at the input of the earth station receiver is,
N = kTeqBN = (1.381 × 10–23) × 150 × 50 × 103 W
= 1.036 × 10–16 W
In decilogs, [N] = 10log10(N) = –159.85 dBW
So, the C/N at input of receiver of an earth station can be given by,
⎡C ⎤
In decilogs, ⎢⎣ N ⎥⎦ = [Pr] – [N] = (–150) – (–159.85) dB = 9.85 dB
⎡C ⎤
(iii) Margin = Receiver ⎢ ⎥ − Threshold = 9.85 – 6 dB = 3.85 dB
⎣N ⎦
www.madeeasy.in
.madeeasy.in
4. (b) Solution
Queue : A queue is a useful data structure in programming. It is similar to the ticket
queue outside a cinema hall, where the first person entering the queue is the first
person who gets the ticket.
Queue follows the First In First Out(FIFO) rule - the item that goes in first is the item
that comes out first too.
1 2 1 2
Empty Queue 1
EnQueue EnQueue DeQueue
Queue Specifications : A queue is an object or more specifically an abstract data

structure(ADT) that allows the following operations:
• Enqueue: Add element to end of queue
• Dequeue: Remove element from front of queue
• IsEmpty: Check if queue is empty
• IsFull: Check if queue is full
• Peek: Get the value of the front of queue without removing it
Queue operations work as follows:
1. Two pointers called FRONT and REAR are used to keep track of the first and last
elements in the queue.
2. When initializing the queue, we set the value of FRONT and REAR to -1.
3. On enqueuing an element, we increase the value of REAR index and place the new
element in the position pointed to by REAR.
4. On dequeuing an element, we return the value pointed to by FRONT and increase
the FRONT index.
5. Before enqueuing, we check if queue is already full.
6. Before dequeuing, we check if queue is already empty.
7. When enqueuing the first element, we set the value of FRONT to 0.
8. When dequeuing the last element, we reset the values of FRONT and REAR to -1.
Empty Queue:
FRONT REAR
0 1 2 3 4
–1
Empty Queue
www.madeeasy.in
.madeeasy.in
Partially full:
FRONT REAR
–1 0 1 2 3 4
EnQueue first element
FRONT REAR
–1 0 1 2 3 4
EnQueue
Full Queue:
FRONT REAR
–1 0 1 2 3 4
EnQueue
FRONT REAR
–1 0 1 2 3 4
DeQueue
FRONT REAR
–1 0 1 2 3 4
DeQueue last element
www.madeeasy.in
.madeeasy.in
#include<stdio.h>
#define SIZE 5
void enQueue(int);
void deQueue();
void display();
int items[SIZE], front = -1, rear = -1;
int main(){
//deQueue is not possible on empty queue
deQueue();
//enQueue 5 elements
enQueue(1);
enQueue(2);
enQueue(3);
enQueue(4);
enQueue(5);
//6th element can’t be added to queue because queue is full
enQueue(6);
//deQueue removes element entered first i.e. 1
deQueue();
//Now we have just 4 elements
return 0;
}
void enQueue(int value) {
if(rear == SIZE-1)
printf(“\nQueue is Full!!”);
else {
if(front == -1)
front = 0;
rear++;
items[rear] = value;
printf(“\nInserted -> %d”, value);
}
www.madeeasy.in
.madeeasy.in
}
void deQueue() {
if(front == -1)
printf(“\nQueue is Empty!!”);
else{
printf(“\nDeleted : %d”, items[front]);
front++;
if(front > rear)
front = rear = -1;
}
}
Q.4 (c) Solution:

File Access Methods:
When a file is used then the stored information in the file must be accessed and read into
the memory of a computer system. Various mechanism are provided to access a file
from the operating system.
1. Sequential access
2. Direct Access
3. Index Access
Sequential Access: It is the simplest access mechanism, in which informations stored in
a file are accessed in an order such that one record is processed after the other. For example
editors and compilers usually access files in this manner.
Direct Access: It is an alternative method for accessing a file, which is based on the disk
model of a file, since disk allows random access to any block or record of a file. For this
method, a file is viewed as a numbered sequence of blocks or records which are read/
written in an arbitrary manner, i.e. there is no restriction on the order of reading or writing.
It is well suited for database management system.
Index Access: In this method an index is created which contains a key field and pointers
to the various block. To find an entry in the file for a key value , we first search the index
and then use the pointer to directly access a file and find the desired entry. With large
files , the index file itself may become too large to be keep in memory. One solution is to
create an index for the index file. The primary index file would contain pointers to
secondary index files, which would point to the actual data items.
www.madeeasy.in
.madeeasy.in
File Allocation Methods:

1. Contiguous Allocation
2. Linked List Allocation
3. I-Nodes
Contiguous allocation: It requires each file to occupy a set of contiguous addresses on a
disk. It store each file as a contiguous run of disk blocks. Thus on a disk with 1-KB
blocks, a 50-KB file would be allocated 50 consecutive blocks. Both sequential and direct
access is supported by the contiguous allocation method. Contiguous disk space
allocation has two significant advantages.
(i) First, it is simple to implement because keeping track of where a file's blocks are is
reduced to remembering two numbers: the disk address of the first block and the
number of blocks in the file. Given the number of the first block, the number of any
other block can be found by a simple addition.
(ii) Second, the read performance is excellent because the entire file can be read from the
disk in a single operation. Only one seek is needed (to the first block). After that, no
more seeks or rotational delays are needed so data come in at the full bandwidth of
the disk. Thus contiguous allocation is simple to implement and has high
performance. Unfortunately, contiguous allocation also has a major drawback: in
time, the disk becomes fragmented, consisting of files and holes. It needs compaction
to avoid this.
0 1 29 39
Starting disk
File Size 49 59 6 7
block address
abc.doc 2 4 8 99 109 119
xyz.doc 9 5
129 139 14 15
Linked List Allocation:

keep each file as a linked list of disk blocks as shown in the fig. The first word of each
block is used as a pointer to the next one. The rest of the block is for data. Unlike contiguous
allocation, every disk block can be used in this method. No space is lost to disk
fragmentation. The major problem with linked allocation is that it can be used only for
sequential access files. To find the i th block of a file, we must start at the beginning of that
file, and follow the pointers until we get the i th block. It is inefficient to support direct
access capability for linked allocation of files. Another problem of linked list allocation
is reliability. Since the files are linked together with the pointer scattered all over the
disk. Consider what will happen if a pointer is lost or damaged.
www.madeeasy.in
.madeeasy.in
0 1 2 3
Starting disk Ending
File 4 5 6 7
block address Address
abc.doc 1 2 8 9 10 11
xyz.doc 9 8
12 13 14 15
Indexed allocation (I-Nodes): It solves the external fragmentation and size declaration
problems of contiguous allocation. In this allocation all pointers are brought together
into one location called Index block. Each file has its own index block, which is an array
of disk-block addresses. The i th entry in the index block points to the i th block of the file.
The directory contains the address of the index block.
Disk block
address of file 9
0 1 2 3
13
File Index Node 12 4 5 6 7
abc.doc 4 8
End of 8 9 10 11
xyz.doc 9 –1
file
12 13 14 15
Section B : Signals and Systems-1 + Electronic Measurements

and Instrumentation-1+ Electromagnetics-2 + Basic Electrical Engineering-2
Q.5 (a) Solution

A circuit of a voltmeter using full wave rectifier is shown below. When a DC voltage
VDC = V of correct polarity is applied to the rectifier, the current through the meter is
V
which causes the full scale defection of the meter. However, when a
RM + RS + 2 Rd
sinusoidal voltage v = Vm sin ωt = 2 V sin ωt is applied, the average voltage appearing

across the meter is
π
1 2
Va v = ∫ Vm sin ωtd(ωt ) = Vm = 0.636 Vm
π0 π
= 0.9 Vrms = 0.9 V
www.madeeasy.in
.madeeasy.in
RS
Bridge
+ rectifier
Multiplier
resistance
Input
v = V msin ωt
V m = 10 V PMMC meter
– Rm
R m = 50 Ω, Ifsd = 1 mA, Rd → diode resistance = 1000 Ω
0.9 V
Therefore, the average current in meter is and hence the deflection with
RM + RS + 2 Rd
AC is 0.9 times that with DC for the same value of voltage V.
The DC sensitivity is
1 1
SDC = = = 1000 Ω /V
I fsd 1 × 10 −3
For full wave rectifier circuit AC sensitivity
SAC = 0.9 SDC = 0.9 × 1000 = 900 Ω/V
Resistance of series multiplier
Rs = SAC 2 V – Rm – 2Rd
Rs = 900 × 2 × 10 – 50 – 2000 = 10.67 kΩ
(i) Multiplier resistance required for full scale meter deflection with 10 V = 10.67 kΩ
(ii) Sensitivity of DC voltmeter,
S DC = 1000 Ω/V
(iii) Sensitivity in Ω/V with AC
SAC = 900 Ω/V
Q.5 (b) Solution:

• The meter has 100 divisions and the spring constant is 2.5 × 10–6 N-m per division.
So, the controlling torque of the spring at FSD can be given by,
Tc = 2.5 × 10–6 × 100 = 2.5 × 10–4 N-m
• The deflection torque of the coil at FSD can be given by,
T d = NBAIFSD = 150 × 0.15 × (3 × 10–2) × (2.5 × 10–2)IFSD
= 168.75 × 10–4 IFSD
www.madeeasy.in
.madeeasy.in
• When steady state is achieved, Td = Tc . So,
168.75 × 10–4IFSD = 2.5 × 10–4
2.5
IFSD = A = 14.815 mA
168.75
• If R is the total resistance of the meter, then
100 V 100
R = = kΩ = 6.75 kΩ = 6750 Ω
IFSD 14.815
• Given that the coil resistance is 1 Ω. So, the series resistance required is,
RS = R – Rcoil = 6749 Ω
Q.5 (c) Solution:
From clue (i), x(t) is a real and odd signal.
So, x(t) = –x(–t)
Xn = –X–n
T /2
1
X0 =
T ∫ x(t ) dt = 0 ∵ x(t) is odd
−T /2
Since x(t) is real and odd, Xn is purely imaginary and odd.

From clue (iii),
Xn = 0 for ⎥ n⎥ > 1
x(t) = X −1 e − jω0t + X0 + X1 e jω0 t
jω t
( − jω t
= X1 e 0 − e 0 ) ∵ X0 = 0 and Xn = –X–n
From clues (ii) and (iv),

2π
T = 2 and ω0 = =π
T
Using Parseval’s relation,
T ∞
1 2
T ∫ x(t)
2
dt = ∑ Xn
0 n = −∞
2 1
1 2
2
∑ Xn = 1
2∫
x ( t ) dt =
0 n = −1
www.madeeasy.in
.madeeasy.in
2 2 2
So, X −1 + X0 + X1 =1
2
2 X1 = 1
2 1
X1 =
2
1 1
X1 = –X–1 = j or X1 = –X–1 = − j
2 2
The two possible signals which satisfy the given information are,
x1(t) = j
1
2
( )
e jπt − e − jπt = j
1
2
j 2 sin( πt ) = − 2 sin( πt )
x2(t) = − j
1
2
( )
e jπt − e − jπt = − j
1
2
j 2 sin( πt ) = 2 sin( πt )
Q.5 (d) Solution:

(i) The input impedance looking into the section YZ at Y is,
⎡ Z + jZ0 tan(β l ) ⎤
ZY = Z0 ⎢ L ⎥
⎣ Z0 + jZL tan(β l ) ⎦
λ
For section YZ, Z0 = 50 Ω and l = .
2
2π λ
So, βl = × = π ⇒ tan(βl) = tan(π) = 0
λ 2
Z
ZY = Z0 L = ZL = 150 Ω
Z0
The impedance looking into the section XY at X is,

⎡ Z + jZ0 tan(βl ) ⎤
Zin = Z0 ⎢ Y ⎥
⎣ Z0 + jZY tan(βl ) ⎦
λ
For section XY, Z0 = 75 Ω and l = .
4
2π λ π ⎛π⎞
So, βl = × = ⇒ tan(βl ) = tan ⎜ ⎟ = ∞
λ 4 2 ⎝2⎠
www.madeeasy.in
.madeeasy.in
Z02 75 × 75
Zin = = Ω = 37.5 Ω
ZY 150
(ii) The reflection coefficient at Z is,
ZL − Z0 150 − 50 100 1
ΓZ = = = =
ZL + Z0 150 + 50 200 2
The standing wave ratio for section YZ is,
1 + ΓZ 3/2
sYZ = = =3
1 − ΓZ 1/2
The reflection coefficient at Y is
ZY − Z0 150 − 75 1
ΓY = = =
ZY + Z0 150 + 75 3
The standing wave ratio for section XY is,
1 + ΓY 4/3
sXY = = =2
1 − ΓY 2/3
Q.5 (e) Solution::

PN s 6 × 1000
f = = = 50 Hz
120 120
Total number of stator conductor = conductors per slot × number of slots = 8 × 90 = 720
720
Stator conductor per phase, Zp = = 240
3
Winding factor, kw = 0.96

Generated voltage per phase,
E p = 2.22 kw f φZp
= 2.22 × 0.96 × 50 × 0.05 × 240
= 1278.7 V
Generated line voltage, EL = 3Ep = 3 × 1278.7 = 2214.7 V
www.madeeasy.in
.madeeasy.in
Q.6 (a) Solution:

(i)
2 sin (ω / 4)
Let Y( ω) = and its inverse Fourier transform is y(t). Then,
ω
⎧1 , t < 1/4
y(t) = rect (2t ) = ⎨
⎩0 , otherwise
Let Y1(ω) = 2sin(4ω)Y( ω) and its inverse Fourier transform is y1(t). Then,
y1(t) = –j[y(t + 4) – y(t – 4)]
d
Now, X (ω) = [Y1 ( ω)]
dω
So, x(t) = –jty1(t) = − t rect ( 2(t + 4)) + t rect ( 2(t − 4))
The signal x(t) can be plotted as shown below.

x(t)
17
4
15
4
17 15
4 4
t
15 17
4 4
15
4
17
4
CTFT
(ii) Given that, x(t) ←⎯⎯⎯→ X(ω)
To determine the CTFT of x1(t):
Using the time-shifting property, we get,
CTFT
→ X(ω)e jω
x(t + 1) ←⎯⎯⎯
CTFT
→ X(ω)e – jω
x(t – 1) ←⎯⎯⎯
Now, using the time-reversal property, we get,
CTFT
→ X(–ω)e –jω
x(–t + 1) ←⎯⎯⎯
www.madeeasy.in
.madeeasy.in
CTFT
→ X(–ω)e jω
x(–t – 1) ←⎯⎯⎯
CTFT
x1(t) ←⎯⎯⎯
→ X1(ω)
So, X1(ω) = X(–ω)[e jω + e –jω] = 2X(–ω)cos(ω)
Using the time-shifting property, we get,
CTFT
→ X(ω)e – j6ω
x(t – 6) ←⎯⎯⎯
Now, using the time-scaling property, we get,
CTFT 1 ⎛ ω ⎞ − j2ω
x(3t – 6) ←⎯⎯⎯
→ X⎜ ⎟e
3 ⎝3⎠
CTFT
x2(t) ←⎯⎯⎯
→ X2(ω)
1 ⎛ ω ⎞ − j2ω
So, X2(ω) = X⎜ ⎟e
3 ⎝3⎠

Using the differentiation in time-domain property, we get,
dx(t ) CTFT
←⎯⎯⎯ → jωX(ω)
dt
d 2 x(t ) CTFT
2 → ( jω)2 X (ω) = −ω2 X(ω)
←⎯⎯⎯
dt
Now, using the time-shifting property, we get,
d 2 x(t − 1) CTFT
2 → −ω2 X ( ω) e − jω
←⎯⎯⎯
dt
CTFT
x3(t) ←⎯⎯⎯
→ X3(ω)
2 − jω
So, X3(ω) = −ω X ( ω) e
www.madeeasy.in
.madeeasy.in
Q.6 (b) Solution:

The phasor form of voltage and current on the line can be given by,
I1 I2
Vs (z) = V0+ e −γz + V0− e γz
V0+ −γz V0− γz V1 Z0 , γ V2

Is(z) = e − e
Z0 Z0
z
V 1 = Vs (z = 0) = V0+ + V0− 0 l ...(i)
V 2 = Vs (z = l) = V0+ e −γl + V0− e γl ...(ii)
V0+ V0−
I1 = Is (z = 0) = − ...(iii)
Z0 Z0
V0+ −γl V0− γl

I2 = –Is (z = l) = − e + e ...(iv)
Z0 Z0
− 1 −γl
From (ii) + (iv) ⇒ V0 = (V2 + Z0 I 2 ) e
2
1
From (ii) – (iv) ⇒ V0+ = (V2 − Z0 I 2 ) e γl
2
By substituting the expressions of V0+ and V0− in equations (i) and (iii), we get,
⎛ e γl + e −γl ⎞ ⎛ e γl − e −γl ⎞
V 1 = V0+ + V0− = ⎜⎜ ⎟⎟ V2 − ⎜⎜ ⎟⎟ Z0 I 2
⎝ 2 ⎠ ⎝ 2 ⎠
V 1 = cosh(γl)V2 – Z0sinh(γl)I2 ...(v)
V0+ V0− 1 ⎛ e γl − e −γl ⎞ ⎛ e γl + e −γl ⎞

I1 = − = ⎜⎜ ⎟⎟V2 − ⎜⎜ ⎟⎟ I 2
Z0 Z0 Z0 ⎝ 2 ⎠ ⎝ 2 ⎠
1
I1 = sinh( γl )V2 − cosh( γl )I 2 ...(vi)
Z0
From equations (v) and (vi), we get,
⎡ cosh( γl) Z0 sinh( γl)⎤

⎡V1 ⎤ ⎢ ⎥ ⎡ V2 ⎤
⎢I ⎥ = ⎢ 1
⎣ 1⎦ sinh( γl) cosh( γl) ⎥ ⎢⎣ − I 2 ⎥⎦
⎣⎢ Z0 ⎦⎥
www.madeeasy.in
.madeeasy.in
Q.6 (c) Solution:
Here, P = 6,
Z = 300,
φ = 0.015 Wb
1800
Speed, n = = 30 rps
60
The average emf per conductor, Pnφ = 6 × 30 × 0.015 = 2.7 V
(i) When the conductors are wave connected, there are only 2 parallel paths, i.e. a = 2.
∴ Total current, Ia = current per conductor × a
= 80 × 2 = 160 A
Z ⎛ 300 ⎞
Emf, Ea = (emf per conductor) ⋅ =⎜ ⎟ × 2.7 = 405 V
a ⎝ 2 ⎠
Power developed in the armature or electromagnetic power
= EaIa = 405 × 160 = 64800 W
= 64.8 kW
Ea I a 64800
Electromagnetic torque, Te = = = 343.5 Nm
ωm 2 π× 30
(ii) When the conductors are lap connected, there are 6 parallel paths,
i.e. a = 6
∴ Total current, Ia = 80 × 6 = 480 A
⎛ 300 ⎞
Ea = (2.7) ⎜ ⎟ = 135 V
⎝ 6 ⎠
Power developed in the armature,
EaIa = 135 × 480 = 6480 W = 64.8 kW
Ea I a 64800
Electromagnetic torque, Te = = = 343.5 Nm
wm 2 π× 30
www.madeeasy.in
.madeeasy.in
Q.7 (a) Solution:

5
%ΔR1 = ±5% ⇒ ΔR1 = ± × 40 Ω = ± 2 Ω
100
5
%ΔR2 = ±5% ⇒ ΔR2 = ± × 80 Ω = ± 4 Ω
100
5
%ΔR3 = ±5% ⇒ ΔR3 = ± × 50 Ω = ± 2.5 Ω
100
When the resistors are connected in series:
RS = R1 + R2 + R3 = (40 ± 2) + (80 ± 4) + (50 ± 2.5) Ω
= 170 ± 8.5 Ω
Absolute error in RS, εS = 8.5 Ω
8.5
Percentage error in RS, %εS = × 100 = 5%
170
So, RS = 170 ± 8.5 Ω = 170 Ω ± 5%
When resistors are connected in parallel:
1 1 1 1
= + +
RP R1 R2 R3
1 R2 R3 + R1 R3 + R1 R2 X1 + X 2 + X 3 X
= = =
RP R1 R2 R3 Y Y
X 1 = R2R3 = (80 ± 5%) (50 ± 5%) = 4000 Ω 2 ± 10%
X 2 = R1R3 = (40 ± 5%) (50 ± 5%) = 2000 Ω 2 ± 10%
X 3 = R1R2 = (40 ± 5%) (80 ± 5%) = 3200 Ω 2 ± 10%
X = X1 + X2 + X3 = (4000 ± 400) + (2000 ± 200) + (3200 ± 320) Ω
X = (9200 ± 920) Ω 2 = 9200 Ω 2 ± 10%
Y = (40 ± 5%) (80 ± 5%) (50 ± 5%) = 160000 Ω3 ± 15%
Y 160000 ± 15%
So, RP = = = 17.391 Ω ± 25%
X 9200 ± 10%
25
Absolute error in RP, εP = × 17.391 Ω = 4.348 Ω
100
Percentage error in RP, %εP = 25%
So, RP = 17.391 ± 4.348 Ω = 17.391 Ω ± 25%
www.madeeasy.in
.madeeasy.in
Q.7 (b) Solution:
For the given waveguide, b > a. So, TE01 is the dominant mode.
For TE01 mode,
jωμH 0 π ⎛ πy ⎞
Eys = Ezs = 0 and Exs = sin ⎜ ⎟ e − jβ z
h 2b ⎝ b ⎠
2 2 2
⎛ mπ ⎞ ⎛ nπ ⎞ ⎛ π ⎞
h2 = ⎜ ⎟ +⎜ ⎟ = ⎜ ⎟ ∵ For TE01, m = 0 and n = 1
⎝ a ⎠ ⎝ b ⎠ ⎝b⎠
jωμbH 0 ⎛ πy ⎞ ⎛ πy ⎞ − jβz
So, Exs = sin ⎜ ⎟ e − jβz = jE0 sin ⎜ ⎟ e
π ⎝ b ⎠ ⎝ b ⎠
The average power transmitted through the waveguide is,
2 2
a b Exs + Eys a b
E02 ⎛ πy ⎞
∫ ∫ sin 2 ⎜ ⎟ dy dx
2 η x ∫= 0 ∫
Pavg = dy dx =
x=0 y=0
2η y=0 ⎝ b ⎠
E02 ab
= 2 mW
4η
2 × 10 −3 × 4η
E02 = = 10η
2 × 10−2 × 4 × 10−2
η0
For TE01 mode, η = ηTE =
2
⎛f ⎞
1−⎜ c ⎟
⎝ f ⎠
c 3 × 10 8
fc = = = 3.75 GHz
2 b 2 × 4 × 10 −2
120 π
So, η = = 406.7 Ω
2
⎛ 3.75 ⎞
1−⎜ ⎟
⎝ 10 ⎠
E0 = 10 × 406.7 = 63.77 V/m

πE0 π× 63.77
Hence, H0 = = = 63.43 mA/m
ωμb 2 π× 1010 × 4 π× 10 −7 × 4 × 10 −2
So, the peak magnetic field in the waveguide is H0 = 63.43 mA/m.
www.madeeasy.in
.madeeasy.in
Q.7 (c) Solution:

V = 200 V,
P = 30 × 103 W
Ra = 0.05 Ω,
Rsh = 50 Ω,
Pi + f = 1000 W
P 30 × 10 3
I = = = 150 A
V 200
V 200
Ish = = =4A
Rsh 50
Ia = I + Ish = 150 + 4 = 154 A
Generated emf, E = V + IaRa
= 200 + 154 × 0.05
= 207.7 V
2 2
Copper losses = I a Ra + Ish Rsh
= (154)2 × 0.05 + 42 × 50
= 1985.8 W
output
Efficiency, η =
output + copper losses + iron loss + friction loss
30 × 103
= = 0.9095 p.u. or 90.95%
30 × 10 3 + 1985.8 + 1000
Q.8 (a) Solution:

t
(i) Given that, y(t) = ∫ e−2(t − τ ) x( τ − 1) d τ
−∞
For x(t) = δ(t), y(t) = h(t) = impulse response.
t
So, h(t) = ∫ e −2( t − τ ) δ( τ − 1) d τ
−∞
t
−2( t − 1)
= e ∫ δ( τ − 1) d τ ; for t > 1
−∞
www.madeeasy.in
.madeeasy.in
t
∵ ∫ f (t ) δ(t − t0 )dt = f (t0 ) for t > t0

−∞
h (t) = e –2(t – 1) u(t – 1)
• Since h(t) = 0 for t < 0 ⇒ system is causal.
t
• ∫ h(t ) d t = finite ⇒ system is stable
−∞
∴ System is both causal and stable.

(ii)
1
For x(t) = e–4tu(t), X ( s ) = .
s+4
Taking the unilateral Laplace transform on the both sides of the given differential
equation, we get,
⎡s 3 Y (s ) − s 2 y(0− ) − s y (0− ) − y(0 − )⎤ + 6 ⎡s 2 Y (s ) − s y(0− ) − y (0− )⎤ + 11 ⎡sY (s ) − y(0− )⎤ + 6Y (s) = X (s )
⎣ ⎦ ⎣ ⎦ ⎣ ⎦
− −
Given that, y(0–) = 1, y (0 ) = −1 and y(0 ) = 1. So,
1
( s 3 + 6s 2 + 11s + 6) Y ( s ) + ⎡ −s 2 + s − 1 − 6s + 6 − 11 ⎤ =
⎣ ⎦ ( s + 4)
1
( s 3 + 6s 2 + 11s + 6) Y ( s ) − (s 2 + 5s + 6) =
( s + 4)
(s 2 + 5s + 6) 1
Y(s) = +
(s + 6s + 11s + 6) (s + 4)(s + 6s 2 + 11s + 6)
3 2 3
(ZIR component) (ZSR component)
⎡ (s + 2)(s + 3) ⎤ ⎡ 1 ⎤
= ⎢ s ⎥+⎢ ⎥
⎣ ( + 1)(s + 2)(s + 3) ⎦ ⎣ (s + 1)(s + 2)(s + 3)(s + 4) ⎦
Using partial fractions expansion,
1 A B C D
= + + +
( s + 1)( s + 2)( s + 3)( s + 4) ( s + 1) ( s + 2) ( s + 3) (s + 4)
1 1
A= =
(s + 2)(s + 3)(s + 4) s = −1 6
1 1
B= =−
(s + 1)(s + 3)(s + 4) s = −2 2
www.madeeasy.in
.madeeasy.in
1 1
C= =
(s + 1)(s + 2)(s + 4) s = −3 2
1 1
D= =−
(s + 1)(s + 2)(s + 3) s = − 4 6
⎡ 1 ⎤ ⎡ 1/6 1/2 1/2 1/6 ⎤

So, Y(s) = ⎢ (s + 1) ⎥ + ⎢ (s + 1) − (s + 2) + (s + 3) − (s + 4) ⎥
⎣ ⎦ ⎣ ⎦
By taking the inverse unilateral transform of the above equation, we get,
−t ⎡ 1 −t 1 −2t 1 −3t 1 −4t ⎤
y(t) = ⎡⎣ e u(t )⎤⎦ + ⎢ e u(t ) − e u(t ) + e u(t ) − e u(t )⎥
⎣6 2 2 6 ⎦
The zero-input response is,
ZIR = e –t u(t)
The zero-state response is,
⎛ 1 −t 1 −2t 1 −3t 1 −4t ⎞
ZSR = ⎜ e − e + e − e ⎟ u(t )
⎝6 2 2 6 ⎠
Total response of the system is,
⎛ 7 −t 1 −2 t 1 −3t 1 −4t ⎞
y(t) = ⎜ e − e + e − e ⎟ u(t )
⎝6 2 2 6 ⎠
Q.8 (b) Solution:
(i) The direction of the wave is r̂ and the direction of the electric field is θ̂ . So, the
direction of the magnetic field will φˆ .
cos 2 θ − j βr ˆ cos 2 θ − j βr ˆ
Hence, Hs = η r e φ= e φ A/m
0 120 πr
(ii) The Poynting vector,

2
Es cos 2 (2θ)
Pavg = rˆ = 2
rˆ W/m 2
2 η0 240 π r
The total power radiated can be given by,
2π π
cos2 (2θ)
Prad = ∫ ∫ 2
r 2 sin θ dθ dφ W
φ=0 θ=0 240 π r
π
1 2
= 240 π (2 π) ∫ cos (2θ)sin θ dθ W
θ=0
www.madeeasy.in
.madeeasy.in
π
1
= ∫ (2 cos2 θ − 1)2 sin θ dθ W
120 θ=0
Let, u = cosθ ⇒ du = –sinθ dθ

−1 1
1 2 1
2 4
So, Prad = − 120 ∫ (2u − 1) du = 120 ∫ (4u − 4u2 + 1) du W
1 −1
1
2 ⎡4 5 4 3 ⎤ 2 7
= ⎢ u − u + u⎥ = × = 7.78 mW
120 ⎣ 5 3 ⎦ 0 120 15
(iii) The power radiated in the belt 60° < θ < 120° is,
−1/2
1
Pbelt = − ∫ (4u 4 − 4u2 − 1) du W
120 1/2
1/2
2 ⎡4 5 4 3 ⎤ 1 ⎛ 4 4 1⎞
= ⎢ u − u + u⎥ = ⎜ − + ⎟W
120 ⎣ 5 3 ⎦0 60 ⎝ 160 24 2 ⎠
43
= W = 5.972 mW
60 × 120
The required fraction is,
43
Pbelt (60 × 120)
= = 0.7678 (or) 76.78%
Prad 14
(120 × 15)
Q.8 (c) Solution

(i)
Given,
Short circuit armature current, Isc = 250 A,
Open circuit generated emf = 1500 V Zs Ia = 250
Synchronous impedance,
2 + j 5.65
Ef 1500
Zs = = =6Ω Ef
I sc 250 V = 6.6 kV Load
Zs = Xs2 + ra2
Synchronous reactance, 0.8 lag
Xs = Zs2 − ra2 = (6)2 − (2)2
www.madeeasy.in
.madeeasy.in
or X s = 5.657 Ω
V = 6.6 × 103∠0° V
Ia = 250 A
Load p.f., cos φ = 0.8 lag
I a = 250 ∠–36.9°A
Zs = 2 + j5.657 = 6∠70.53° Ω
E = V + I a Zs = 6600 ∠0° + 250 ∠–36.9° × 6∠70.53°

E = 7.892 ∠6.04° kV
Terminal voltage if load is switched off,
V t = Ef = 7.892 kV
(ii)
Hydrograph :
• It shows the variation of stream flow in m3/sec with time for a particular river
site, where time may be in hour week, month or year.
• The area under hydrograph gives the total volume of flow.
Flow duration curve:
• It shows percentage of time during the period when the flow was equal to greater
than the given flow.
• The area under the curve (FDC) gives total quantity of run-off during a period.
Pondage:
• Storing water in small ponds near the power plant as the storage reservoir is
away from plant.
• To meet the power demand fluctuations over short period of time i.e. 24 hrs.

www.madeeasy.in
.madeeasy.in

EC Mains-2018 Paper-2 Solutions

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

EC Mains-2018 Paper-2 Solutions

Загружено:

Авторское право:

Доступные форматы

Detailed Solutions

ESE-2018 E & T Engineering

Section A : Advanced Communication Topics + Computer Organization and Architecture

• Deadlock Prevention : We can prevent Deadlock by eliminating any of the above

• Eliminate No Preemption: Preempt resources from process when resources required

Q.1 (d) Solution

Q.1 (e) Solution

Q.2 (a) Solution:

Q.2 (b) Solution

communications network where remote stations

like a multipoint connector. In essence, a star

station communicates directly with a centrally Star topology

propagate through all the stations in the loop.

Mesh topology: In a mesh topology, every station has a

station on the circuit as shown in the figure below.

combining two or more of the traditional Bus

topologies to form a larger, more complex Computer Computer

topology. Hybrid topologies are sometimes

include the star ring, bus ring, and virtually Computer

0100 1010 1110 1001

Q.3 (c) Solution

Bus Request BR ABUS Address Bus

DBUS Data Bus

Bus Grant BG WR Write

Q.4 (a) Solution:

Queue Specifications : A queue is an object or more specifically an abstract data

EnQueue first element

DeQueue last element

Q.4 (c) Solution:

File Allocation Methods:

Linked List Allocation:

Section B : Signals and Systems-1 + Electronic Measurements

Q.5 (a) Solution

sinusoidal voltage v = Vm sin ωt = 2 V sin ωt is applied, the average voltage appearing

= 0.9 Vrms = 0.9 V

R m = 50 Ω, Ifsd = 1 mA, Rd → diode resistance = 1000 Ω

Q.5 (b) Solution:

Since x(t) is real and odd, Xn is purely imaginary and odd.

x(t) = X −1 e − jω0t + X0 + X1 e jω0 t

From clues (ii) and (iv),

Q.5 (d) Solution:

The impedance looking into the section XY at X is,

Q.5 (e) Solution::

Winding factor, kw = 0.96

Generated line voltage, EL = 3Ep = 3 × 1278.7 = 2214.7 V

Q.6 (a) Solution:

So, x(t) = –jty1(t) = − t rect ( 2(t + 4)) + t rect ( 2(t − 4))

The signal x(t) can be plotted as shown below.

To determine the CTFT of x3(t):

Q.6 (b) Solution:

V0+ −γz V0− γz V1 Z0 , γ V2

V 2 = Vs (z = l) = V0+ e −γl + V0− e γl ...(ii)

V0+ −γl V0− γl

V0+ V0− 1 ⎛ e γl − e −γl ⎞ ⎛ e γl + e −γl ⎞

⎡ cosh( γl) Z0 sinh( γl)⎤

Q.7 (a) Solution:

E0 = 10 × 406.7 = 63.77 V/m

Q.7 (c) Solution:

Q.8 (a) Solution:

∵ ∫ f (t ) δ(t − t0 )dt = f (t0 ) for t > t0

∴ System is both causal and stable.

⎡ 1 ⎤ ⎡ 1/6 1/2 1/2 1/6 ⎤

direction of the magnetic field will φˆ .

(ii) The Poynting vector,