This document contains the questions for the Seventh Semester B.E. Degree Examination in Optical Fiber Communication. It is divided into two parts, with five questions in each part. The questions cover topics related to optical fiber communication systems including properties of optical fibers, fiber components and devices, fiber links, noise in optical receivers, analog fiber optic transmission, and microwave photonics. Students are instructed to answer five full questions total, with at least two questions from each part. The document provides the framework and topics for the exam, but does not include any answers.
By Tobias Grosser, Scalable Parallel Computing Laboratory
The COSMO climate and weather model delivers daily forecasts for Switzerland and many other nations. As a traditional HPC application it was developed with SIMD-CPUs in mind and large manual efforts were required to enable the 2016 move to GPU acceleration. As today's high-performance computer systems increasingly rely on accelerators to reach peak performance and manual translation to accelerators is both costly and difficult to maintain, we propose a fully automatic accelerator compiler for the automatic translation of scientific Fortran codes to CUDA GPU accelerated systems. Several challenges had to be overcome to make this reality: 1) improved scalability, 2) automatic data placement using unified memory, 3) loop rescheduling to expose coarse-grained parallelism, 4) inter-procedural loop optimization, and 5) plenty of performance tuning. Our evaluation shows that end-to-end automatic accelerator compilation is possible for non-trivial portions of the COSMO climate model, despite the lack of complete static information. Non-trivial loop optimizations previously implemented manually are performed fully automatically and memory management happens fully transparently using unified memory. Our preliminary results show notable performance improvements over sequential CPU code (40s to 8s reduction in execution time) and we are currently working on closing the remaining gap to hand-tuned GPU code. This talk is a status update on our most recent efforts and also intended to gather feedback on future research plans towards automatically mapping COSMO to FPGAs.
Tobias Grosser Bio
Tobias Grosser is a senior researcher in the Scalable Parallel Computing Laboratory (SPCL) of Torsten Hoefler at the Computer Science Department of ETH Zürich. Supported by a Google PhD Fellowship he received his doctoral degree from Universite Pierre et Marie Curie under the supervision of Albert Cohen. Tobias' research is taking place at the border of low-level compilers and high-level program transformations with the goal of enabling complex - but highly-beneficial - program transformations in a production compiler environment. He develops with the Polly loop optimizer a loop transformation framework which today is a community project supported throught the Polly Labs research laboratory. Tobias also developed advanced tiling schemes for the efficient execution of iterated stencils. Today Tobias leads the heterogeneous compute efforts in the Swiss University funded ComPASC project and is about to start a three year NSF Ambizione project on advancing automatic compilation and heterogenization techniques at ETH Zurich.
Email
bgerofi@riken.jp
For more info on The Linaro High Performance Computing (HPC) visit https://www.linaro.org/sig/hpc/
By Tobias Grosser, Scalable Parallel Computing Laboratory
The COSMO climate and weather model delivers daily forecasts for Switzerland and many other nations. As a traditional HPC application it was developed with SIMD-CPUs in mind and large manual efforts were required to enable the 2016 move to GPU acceleration. As today's high-performance computer systems increasingly rely on accelerators to reach peak performance and manual translation to accelerators is both costly and difficult to maintain, we propose a fully automatic accelerator compiler for the automatic translation of scientific Fortran codes to CUDA GPU accelerated systems. Several challenges had to be overcome to make this reality: 1) improved scalability, 2) automatic data placement using unified memory, 3) loop rescheduling to expose coarse-grained parallelism, 4) inter-procedural loop optimization, and 5) plenty of performance tuning. Our evaluation shows that end-to-end automatic accelerator compilation is possible for non-trivial portions of the COSMO climate model, despite the lack of complete static information. Non-trivial loop optimizations previously implemented manually are performed fully automatically and memory management happens fully transparently using unified memory. Our preliminary results show notable performance improvements over sequential CPU code (40s to 8s reduction in execution time) and we are currently working on closing the remaining gap to hand-tuned GPU code. This talk is a status update on our most recent efforts and also intended to gather feedback on future research plans towards automatically mapping COSMO to FPGAs.
Tobias Grosser Bio
Tobias Grosser is a senior researcher in the Scalable Parallel Computing Laboratory (SPCL) of Torsten Hoefler at the Computer Science Department of ETH Zürich. Supported by a Google PhD Fellowship he received his doctoral degree from Universite Pierre et Marie Curie under the supervision of Albert Cohen. Tobias' research is taking place at the border of low-level compilers and high-level program transformations with the goal of enabling complex - but highly-beneficial - program transformations in a production compiler environment. He develops with the Polly loop optimizer a loop transformation framework which today is a community project supported throught the Polly Labs research laboratory. Tobias also developed advanced tiling schemes for the efficient execution of iterated stencils. Today Tobias leads the heterogeneous compute efforts in the Swiss University funded ComPASC project and is about to start a three year NSF Ambizione project on advancing automatic compilation and heterogenization techniques at ETH Zurich.
Email
bgerofi@riken.jp
For more info on The Linaro High Performance Computing (HPC) visit https://www.linaro.org/sig/hpc/
Engineering Mathematics [Y
Q P Code: 60401
Additional Mathematics - II
Q P Code: 604A7
Analysis and Design of Algorithms
Q P Code: 60402
Microprocessor and Microcontroller
Q P Code: 60403
Object Oriented Programming with C++
Q P Code: 60404
Soft skills Development
Unix and Shell Programming,
Q P Code: 60305.
Additional Mathematics I
Q P Code: 60306
Computer Organization and Architecture
Q P Code: 62303
Data Structures Using C
Q P Code: 60303
Discrete Mathematical Structures
Q P Code: 60304
Engineering Mathematics - III
Q P Code: 60301
Soft Skill Development
Q P Code: 60307
Unix and Shell Programming,
Q P Code: 60305.
Additional Mathematics I
Q P Code: 60306
Computer Organization and Architecture
Q P Code: 62303
Data Structures Using C
Q P Code: 60303
Discrete Mathematical Structures
Q P Code: 60304
Engineering Mathematics - III
Q P Code: 60301
Soft Skill Development
Q P Code: 60307
Unix and Shell Programming,
Q P Code: 60305.
Additional Mathematics I
Q P Code: 60306
Computer Organization and Architecture
Q P Code: 62303
Data Structures Using C
Q P Code: 60303
Discrete Mathematical Structures
Q P Code: 60304
Engineering Mathematics - III
Q P Code: 60301
Soft Skill Development
Q P Code: 60307
Unix and Shell Programming,
Q P Code: 60305.
Additional Mathematics I
Q P Code: 60306
Computer Organization and Architecture
Q P Code: 62303
Data Structures Using C
Q P Code: 60303
Discrete Mathematical Structures
Q P Code: 60304
Engineering Mathematics - III
Q P Code: 60301
Soft Skill Development
Q P Code: 60307
Unix and Shell Programming,
Q P Code: 60305.
Additional Mathematics I
Q P Code: 60306
Computer Organization and Architecture
Q P Code: 62303
Data Structures Using C
Q P Code: 60303
Discrete Mathematical Structures
Q P Code: 60304
Engineering Mathematics - III
Q P Code: 60301
Soft Skill Development
Q P Code: 60307
Unix and Shell Programming,
Q P Code: 60305.
Additional Mathematics I
Q P Code: 60306
Computer Organization and Architecture
Q P Code: 62303
Data Structures Using C
Q P Code: 60303
Discrete Mathematical Structures
Q P Code: 60304
Engineering Mathematics - III
Q P Code: 60301
Soft Skill Development
Q P Code: 60307
Unix and Shell Programming,
Q P Code: 60305.
Additional Mathematics I
Q P Code: 60306
Computer Organization and Architecture
Q P Code: 62303
Data Structures Using C
Q P Code: 60303
Discrete Mathematical Structures
Q P Code: 60304
Engineering Mathematics - III
Q P Code: 60301
Soft Skill Development
Q P Code: 60307
Unix and Shell Programming,
Q P Code: 60305.
Additional Mathematics I
Q P Code: 60306
Computer Organization and Architecture
Q P Code: 62303
Data Structures Using C
Q P Code: 60303
Discrete Mathematical Structures
Q P Code: 60304
Engineering Mathematics - III
Q P Code: 60301
Soft Skill Development
Q P Code: 60307
Synthetic Fiber Construction in lab .pptxPavel ( NSTU)
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
Embracing GenAI - A Strategic ImperativePeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
7th Semester Electronic and Communication Engineering (2013-December) Question Papers
1. O6EC7T
USN
Seventh Semester B.E. Degree Examination, Dec.2013 lJan.20l4
,,:
Time: 3 hrs.
Max. Mark"$100
Note: Answer FIVEfull questions, selecting
at least TWO questions from each part.
ai
o
o
a
PART _ A
I a.
b.
c.
2a.
o
o
With la:yer diagram, explain th. ,.rpo.rribFyof each layer in oSI model,
(10 Marks)
How daiatransfer is achieved using CM and CMIS in CATV channel?
(06 Marks)
Calculate fur minimum time required to download one million bits of information using
each of the fuUOwing techniques:
i) V.32 modem
ii) V.32 bis modem
iii) V.90 modem rl ,, .
(04 Marks)
What are the different types of framing? Explain bit stuffing with an example. (06 Marks)
With design and sliding windo* diagrams, explain Go back - N ARQ protocol. (10 Marks)
In a stop and wait ARQ system, the bandwidth-delay product is 20000 bits and 1 bit takes 20
ms to make a round trip. What is the B.W. of the line? If the protocol that can send 10
frames are 1200 bits in length then what is the percentage of utilizationof the link?10+ Marks)
3q
69
5
ool
eca
.-I
.= c
b?p
otr
-c
o>
o
b.
a-)
c.
1,1
;;I
oc)
3a.
5Ai
b.
c.
d.
,6
.r?
6)
One hundred stations on a slotted ALOHA network share 1 Mbps channel. If frames are
1000 bits long, find the throughput if each station is sending 5 frames/second; (05 Marks)
With flow diagram, explain.the procedure for CSMA/CD protocol.
(06 Marks)
Explain polling method of controlled access of the channel.
(04 Marks)
Describe the encoding and decoding scheme in CDMA techniques lor channel sharing.
:'::::"""""'
OE
:9
o''
o_i
,i
a=
4 a.
b.
c.
.9.
6,i
C'!o
=-6
o.r
>'t
tr>
=o
a-
t<
*
...l
I
,,
"'
",
b.
6a.
b.
0)
o
o
c.
(05 Marks)
Explain the frame formats of IEEE 802.3. What are the minimurn and maximum frame
lengths?
What are the characteristics of fast Ethernet?
Desoribe the address mechanism of IEEE 802.11.
- ,,-',,'
5 t-,+l Wlrt is transparent bridge?
bo"
cbo
(J=
=6
90
,
"',, " "'
PART
(10 Marks)
(04 Marks)
(06 Marks)
-B
Explain the process of learning in transparent bridge. (10 Marks)
What is VLAN? Explain in detail. What are the advantages of
(10 Marks)
VLAN?
What is classful addressing in IPV4? What is its mask? Explain.
Find the class of each address:
i)
ii)
ii,
14.23.120.8
252.5.1s.1 1 1
11000001 10000011 00011011 11111111
iv) 00000001 00001011 00001011 11101111
What is network address translation (NAT)? Give the NAT imp
I of2
(06 Marks)
2. 06EC71
7 a.
b.
Explain different forwarding techniques used in network layer.
Explain the distance vector routing for the graph shown in Fig.eZ(U).
(10 Marks)
r
=%
f'.::.::':::j..,.
E-;
u)
fu_
.4,N.
Fig.Q7(b) Topology ofNetwork
of Network
"Lffi=
'f.,r.=-* *
.9" .:;':a.
-
,;
f **
.*
E
(10 Marks)
%
Lfp,
g &--
t
.*".1*
8 a. What ar6@Oitterent TCP services and features? Explain them" r*,,,q=*
b. Describe l-lb.F'.-tser datagram format.
#
=;'i
c. What are the afrytions of multicast routing?
F*=
'lee
(10 Marks)
(06 Marks)
::: 6U
t*i1*=_
''.=,:
{'{<{<*-
"
iol
")
rvlarrrsy
,t
{":=.1
*
"
;;;
th*'
::: al
Ma:
*E
1L
'i."
.,i.4
-'s1S
-w.
$
-:'
*
!
. ffi'}
;:::E
;4i*.
s=
,.,,*i*3
Lh
;
"!j
d%,
''-t
=,.''";t*-i
,,r h
S-
,- r's
;i:--M
w
i::::.:: $
-M
d i:::::
= 4-dd
,q
2
of2
3. IOECITET2
USN
Seventh Semester B.E. Degree Examination, Dec.2013 tJan.2ll4
,..,
Optical Fiber Gommunication
.
i{=.'fr[me: 3
"'.,.
ni
hrs.
,t,,*
="'".,,t'",,
g
Max. Marks:ioo
selecting
Note: Answer FIVEfull questions,
at least TWO questionsfrom eoch
..=
.H
::
,..'',,,,,,
part.
,
PART _ A
.'..
,
,,"..,,,,'
,.'",... I
E 1 a. _., .. block diagram of an optical fiber transmission link
Desq'ribe
and explain:the function of each
E
S
E
g
.$i
6-:
gi
element in
link.
(08 Marks)
b.
Explain*fut'is meant by graded index optical fiber using simpte.rfi*nlory concept indicate
c.
the major advantages of this type of fiber with regard to multimodopropagation. loo naarrs;
A Graded index fiber with parabolic refractivelndex f,urnr: t.+g urjn, :1.46 if core
radius is 20 pm. Fhd,the number of modes at 1300nm and lf 50
(06 Marks)
nm.
Cgu
-h ..'
-o -'
Describe Rayleigh ou4lllrldr.rB [r ulJtruar fiber.
(06 Marks)
(ub
.H+ 2 a. uwou ruv roJ rvrEu Scatti"6ing in optical lluEr . i ,:,
?
b. Briefly explain intramodal and intermodaldispersion.
(06 Marks)
$
E
/ d-'rl
.)
F Pp
-,,t'tt'z'', ^1a2.
':::t::'
ES
c. Glass fiber exhibits materiar dispersion gir.; by, r'[
;H
of 0.025. Determine material
.E-
if4:
':"',,,1:1f
tr'tr
o>
dispersion parameter at a wavelength of 0,85 pm and estimate rms pulse broadening / km for
good LED source with an rms spee+@id{h of 20 nm at this
(08 Marks)
A
;€
9
waveiength.
I
3 a.
;€
Sketch and explain Fabry p.rq, ,.ronutor cavity of
Discuss rhe operation of ,itb.n RApD *itn
laser.
(07 Marks)
b.
n.ltad;;;.
eTMarks)
c. Consider a photodiod,e;wi,ttri quantum efficiency 75Ya, when photon of energy 1.6x10-roJ,
photodiode with
i5%r-,
1.6x 10-te J.
$?
:E
; !
are incident on the surface then calculate operating wavelength and it 2.6 pA photo current
through detector.coSr€sponding, determine incideni optical p-ower when deiector is operated
"''^-*'-l-r *^' svrvvrvr
^ ----- o'
^* sarie wavebl$h.'--r
at -^*^ ,..^-.^r^--.L
lr;;;;
t
aS
i
5
*
E
ag.
S
Eo
8"
4 a. Describg with aid of suitable diagram, three common techniqu" ,3tid6r,-"chanical splicing
of optical fibers.
(06 Marks)
lrrr.rt,
,
b. WitEaiar of^ simple sketches, outline major categories of fiber couplers.
Wrltt d
CI6 Marks)
"oupt..r.
c. A. GaAs optical source that has a refractive index of 3.6 is closelycoupled to qtrp index fiber
.lil t aAs optlcal
retracttve rndex
closely coupled
'
I
6E
< O
g
U*
E
-E
i b
=ai
ir*
.
'ich has a core refractive index of 1.465, if the source size is smaller than'fibercore, and
uqDs vvrw rvuovlrvv lllLte. Jr r.'ruJ, rr ttlg suututr slzg rs slllallcr tnan nDcFcorg, ano
.,"".::.
"".Wn
-^'o
^:
*tWhatisthepowerlossindecibe1sfromsourceintofiber?@X,q#,"t'1
=v
EE
; >
:
nrr! rI
PARr-B
//-+-f
Ll
/{9"{ _orJh'
-.l c.i 5 a. Briefly d,iscuss the possible sources of noise in optical fiber receiffi..*,q[d )g,f;nnu.rrl
b. Discuss how the eye diagram is powerful measurement tool fod&stil[gttft da/#dandling
.g
capability in digital transmission system.
2.
oL*- /r,6ilrvra*j
o{
Da
E
n:
E
E
c.
'E
6 a.
b.
c.
e
n
write a note on analog
receivers.
^
Wt06
Explain the multi AM techniques employed in broadband analog application.
Explain : (i) Microwave photonics (ii) RF over fiber.
Explain in brief : (i) Short wavelength band
(ii) Chirping.
I of2
Marks)
(0E Nrarks)
(06 Marks)
(06 Marks)
5. 06EC73
USN
Seventh Semester B.E. Degree Examination, Dec.20L3 tJan.2ol,A
Power Electronics
=,
=.'1.,.
Time: 3 hrs.
Note: Answer FIVEfull questions, selecting
at least TWO questionsfrom each part.
a .:a: ,i:.
1::_rj;i.r::
..
l.r.::: _i
Max. Marks:10O!'-,,,
_il
,h
't:'
11
,t;,r,.,,,,i;.*,,t1
. r.dr
.g
PARr_A
%
fi I a. Eyl"]ain control characteristic features of the following power devices: (
ifSqB.. ii) MCT iii) IGBT
(r2 Marks)
3
u lpfueperipheral effects of converters.
!
.,.._''*, 1o+ lvtarhsy
I *""
c. Th; #t#; j;;"ii9, temperature of a transistor is T.1 :..-11f0'c and the ambient
i
temperatur6,isla:25oC. If the thermal impedance are &c :O,$,?.bW, &A: 0.1oC/W and
g
l(sa : O.S"Ci*;tplculate:
Es
'.r !
B'=
;i the maximum p,ower dissipation
o'=
ii)
i5
E
Jh
tempefurre.
The case
ur) Also draw the
l,'
th6r
aT
u
! equivalent circuit of a
'-,,1
transistor.
(04 Marks)
Lal
a. Explain
(06 Marks)
iB' 2 b. Explain switching charactetistics of BJT with models.
E
working with basic-$bflrtur. of OexitdtiOn type n and p channel MOSFETs with
Jr---,.f"r"rr..totran-sfercharacteristie." *""'
(0gMarks)
tg
c. The base drive circuit in Fig.e2f.)=fruiqt. : 100 V, %, :2.ty, %,: 0.9V, VBE : 0.7y,
EI
o
/
o
VB: 1<r and B: 1z n^l^--t^r^- 15V ^.^l
- 16. Calculate:
;= €
i) The collector current withMeldmping -=
H+
do
vr vrurlrvr
v[q*!y}}r6
vvrlqSw
g €
utsi;.
t
iil The collector-emitter c$nnu,e voltage Vi".
iii) The collector current wglh clamping.
E
y
E€
# #r
F^
==
&"8
;5
bE
3
A f;
iE
iE
g ry
*t
=()
H f . ut
5 5;
4
i"E
2
Fig.Q2(c)
Fig.Q2(c)
(06 Marks)
a. Elpltin
turn-on mechanism of a thyristor using two transistor ana{5gy= and derive an
rcx@ssion for the anode current in terms of transistor parameters.
.. (0s Marks)
the help of neat circuit diagram and waveforms, explain the UJT-triggeri5rg circuit.
9,-.'With
': Also mention its advantages over RC triggering.
rio Marks)
c. If the latching current for SCR iruerted in between a dc voltage source of 100 V and an
inductance load L:0.1 H is 4 mA. Calculate the minimum width vr gate pulse'cfubnt
- - '"
rrr vYrsrrr of bqlw yqrr
,,1-^-l
required +^ turn-on
to :------- ^,-
SCR.
-^--^
(02 Marmi==
a. If a converter shown in Fig.Q4(a) has a purely resistive load of R and the delay angle is
.:_r .-
a: xl2. Determine: i) 11, ii) Form factor, iii) Ripple factor, iv) TUF, v) PIV ofthyristor.
{,
E11
o.td
-E
,4,,
A
*r3
Lcon
r;too$+:-a#
Fig.Qa(a)
I of2
6. k
4 b'
Explain the working of dual converter with a neat circuit diagram. Also obtain
waveform for
voltage generating circulating current.
(10
Marks)
PART-B
'':':j
*oi;rr,,..
"
-- .:- 1 r
5 ?. MenJion drawbacks of self commutation (any three).
(03 Maffir,
... b. Explain the operation of complementary commutation with neat circuit and wavefor*r.rffi'
':i'" ,. -'
(rlMarks)
, Find theequation of c for design consideration.
*dy.. value of C for
'";;'+c'
the commutation circuit shown in Fig.e5(c). Given Ir.*. :t0 A, ton
""','"'"',
:
"-
.::::'.,|''
ru
D4s
)U v.
)u7o
f'of SCRI : 30 psec, E4. : 50 V. Assume 50oZ tolerance on turn-off time.
:.t,ir-^, "'...,,ri ,''.,
.,
tL/
'
t':
=
.
':rN
I * LVt
lrnll
I
i
I
I
Iil.
I
t,r'I
u,.;.,.*'1.-U:--l-.,:;',r,,,:.:i lr.
ttA-l
.""';.--r,-,,,,.€)t
6 a'
b.
f o.,,u'
I
tt
Fig.Q5(c)
" +,
.j"'r'
(05 Marks)
Explain the working of sirigfu phase bidirectional AC voltage controller for
RL load
considering discontinuous current flow tlrough load with a nJat circuit
and waveforms.
Derive equation for vor,or.
(r0 Marks)
,ii:::::::: ::
An ac voltage controller has a resistive igad of
10 e and %*": I20y,60 Hz. The
thyristors switch is on for n 25 cycles apd off for m 75 cycles. Determirre:
i) Vo.*,,
ii) load power, iii) input po-ei factor, iv) Ir"_,
(10 Marks)
.v)
R:
;
:
Ir*,
7 a'
Explain the principle cf operation of step-down
with a neat circuit and waveform.
Derive the equationl&t %"" , %-,, input power "n"fi$;ti effective resistance.
r"nT
(10 Marks)
b. Find the
efficiency if the load resistance R i0 Q,lnput supply dc voltage is 220,
duty cycle is 50% and chopper voltage drop V.6 :2y. (Converter is ,t.p_ao*r,
choiper).
f-rl'. -.
(06Marks)
Draw-1.]i..:'oircuit diagram and waveforms for step-up chopper.
(04 Marks)
''ttt''"
current source inverter circuit with
.::..,.!j. (10 Marks)
.E"xqpin
b' .,4"{10 full bridge inverter has resistive load R:2.4 e the dc input
-r ---voltpge
-
*
*"YI:l
:
-i'-i,,:
c.
8 ?
waveform.
e
Determine:
' .," il
ii)
iii)
RMS output voltage at fundamental frequency.
The output power.
The average and peak current of each transistor.
n;":';;
n't":..
'::i
:
'irll
:: ::.'
'':'::::
(10 Mrir[q),,.
!
.:
:::....
{<**!kx
2
of2
.,ji::,:
-|F
7. r0EC74
USN
Seventh Semester B.E. Degree Examination, Dec.2013 lJan.201,4
Embedded System Design
I
Time:3 hrs.
:l
qi
o
o
a
,
,
PART-A
'::i'.,,'""'
1 a.
Max' Marks:100
Note: Answer FrvEfull questions, selecting
at least TWO questionsfrom each part.
Explain: i) Embedded system, ii) Hard RTS,
iii) Watch Dog Timer, with an example for
(06 Marks)
eachl.".,,
b.
o
()
c.
!
E9
6e
-o
oo
ll
trop
.=N
6+
b9p
og:
-co
o>
Es
Wit[ a:ibbck
diagram, explain briefly the various components in 1 miCroprocessor based
(06 Marks)
... 'l
Differentiatb',$etween the two design approaches for an embedded system development.
Explain the vang, gllstages with a flow diagram.
(08 Marks)
interface. Also explain fetch, exep,utg aiid next control operations with RTL instructions.
(08 Marks)
c)
3 a.
b0c
CB6
b.
c.
-o
a6
'od
3o
Explain the internal diagram,;of SRAM and writb the timing diagram for read operation.
(06 Marks)
i..i i
Explain associative mappi1rg cache implementation.
(06 Marks)
Write the inside and outSide diagrams for DRAM along with read and write operations. Also
(08 Marks)
explain refresh operation.
613
o.A
o''
oj
()
o
Z
o
a
c'i
,,iir'r.,.
5
Diterentiare
steps. , ' ..,
(06 Marks)
.:'. .t|.t,,,,,
,the characteruing and identifuing the requirements of a system with respect to a
b. Explain
(06 Marks)
digital counter.
c. Write the hardware architecture and data and control flow diagram of a counter system and
(08 Marks)
-;,,explain briefly the flow diagram.
,;
!ol
-i
."
"'
Write the flbw'diagrams for waterfall and V life cycle models artd briefly explain Waterfall
<o
otE
U<
.1,,,,,,.,.
4 a.
o=
>,q
oot
iou
o=
o. ;i
tr>
=o
5L
.ii
embedded*.ystem.
. ',,
2 a. Compare:
i) Big Endian and Littie Endian formats.
ii) RISC and CISC registers.
iii) Truncation and rounding ertors.
(06 Marks)
b. Explain direct and register indirept'addrepsihg"inodes with diagrams. Also write the timing
diagram for a serial write operation with an 8 bit register.
(06 ivlarks)
c. Write the block diagram of RTN model for a microprocessor data path and memory
BS
ci
i
''"
a.
betrveen'
i[::H#looi,l,'.',I;,
ll,
ilt rightweight and heavy weight threads
-
b. Describe:
i)
code,
,K"9tr0:
i,{fl",.1l*$l
((il
LTBRF*'
l: I
._-.-,{.7
g*Z
(06 Marks)
Reentrant
ii) Foreground/background system,
(06 Marks)
iii) Multithreading system.
Describe the task state transition with a diagram and TCB structures. Explain the function of
(08 Marks)
the scheduler and also dispatcher.
I of2
8. loE C74
6a,
b.
c.
Explain any 6 functions of an operating system in brief.
(06 Marks)
Describe virtual model and highL level irodel for
oS architectures.
(06 Marks)
write the algorithm for a simple oS Kernel, using c rurgrug"
notation for 3 asynchronous
tasks using TCBs only. The 3 tasks use a common
daia buffer for read, increment and
rvr rvqs'
display
ta.
"^-'i;il;.;
operations.
write the Amdahl's law limitation for performance improvement/optimization.
consider
a
system with the following characteristics.
The task to be improved takes 200 time units and
the gral is to reduce the execution time
"Determine
to 160 time units. The algorithm under considerati"r;;;;d;
i)
ii)
il;;"r" '
*"""'
the
ylpown-narameter vahJ in the equation and write th.l;f.;;;;,*
Ifth{goal is to reduce the execution time to r00 tir"" r;;;;;d;
uulr". in case(i), then
deterini4e-the
value unknown parameter value in the
c.
8a.
b.
equatioiffi#ffi#
write a 'c' funciion to determine the sum of the elements.in
an ar-ray
line for its time complexity
Explain the Big-o nttuti* used for comparing the
algorithms,
and,
inference.
analyzJif
cornmon bounds
write
,Hi?
,j:: TX'f?
complexity.
and analyze a rinear search algorithm for its time
(06 Marks)
The operationto beperformed is (i;:c,o u+ b, (iD
c: a
u= = belse
d_e. Write the
c language construct and. assembly lungurg. statements for the
above 2 cases separately and
*.lf
c:
calculate the total time required-'
PUSH/pop takes g00 nsec, arithmetic
operation/load/store/cmp takes 400 nsec and the
.onJitionut/unconditional branch takes
700 nsec.
(06 Marks)
Describe memory roading with equation, figure
and an exampre.
(08
if
c'
Marks)
*{<X.**
2
of2
9. 068,C7 4
USN
Seventh Semester B.E. Degree Examination, Dec. 20l3lJan.2Ol4
DSP Algorithms and
Architecture
Time: 3 hrs.
Max. Marks:100
Note: Answer FIVEfull questions, selecting
atleast TWO questions from each purt.
o
()
i.
o
a
o
a.
0)
!
Eg
bo-
b.
c.
dU
-.o
bol
ica
.= oi
With a.neht',,,block diagram, explain the scheme of a DSP systemrwith typical signals in
DSP
scheme,,,,,.
,:'.,,,
::::.,,"'
.,,
:.,, ,:''
:,.
a
(10 Marks)
.,..,,.:..
Briefly explain the-,decimation process.
(04 Marks)
An analog signal is"sampled at arate of 8 KHz. If 512 samples of the signal are used to
compute DSP, X(K)l ilelermine the analog and digital frequency spacing between adjacent
X(K) elements. Also, determine analog and digital-ftequencies corresponding to K:64.
:
:,,,:::,
(06 Marks)
t1
goOO
oEl
-o
=fl
o>
a.
aq)
a=
o()
50c
CB6
b.
c.
Investigate to basic features that",should be provided in to DSP architecture to be used to
provided in to DSP architecture to b,ufu$ed to implement to following Nth -order FIR filter.
(06 Marks)
With a neat diagram, explain trr" ;r;i.;" level parallelism and pipelining with pipelined
implementation of an 8 - tap FIR filter using eight MACs and parallel implementation of an
,rr' .,';'
8 - tap FIR filter, using two'MAC units.
(08 Marks)
Explain the indirect addressing mode.
(06 Marks)
'.'rt:
.G
.
,,:::':'
-4()
'Ca
OE
o- 5.
Eo.
oj
a.
b.
c.
processor.
Explain the maiu'arUhitectural features of TMS 320 C 54 XX
(06 Marks)
Explain the bit'ionfiguration of PMST
(08 Marks)
With an ex,ample each, explain immediate addressing mode, absolute addressing mode,
register.
o=
}U
atE
,,
LO
>'=
ootrOO
o=
o.B
tr>
v!
^o
or
'''i'""
:
MPY*ARZ_,*AR4+O,B
SUBxARI+, 14,A
:61
0)
Z
,,.
a- ,. Describe the operation of the following MAC instructions
i,"., MAC x AR 3 +, # 2463 h, A
;.
'i"": MAC * AR 3 * AR 5 +, B, A.
-,
b. Explain the operations of the following instructions :
J<
o
,
c.
m
()
:::
'(O{'Marks)
-c
.
.
..
..,,::,..
suB # 2345h,9, A, B.
(06 Marks)
Write a program to find the sum of sum of series of signed numbers as specified below:
4lFh
A
- Ir(i)
i=4lOh
d.
Assume ARl as pointer to x(i) and AR2 as counter for the numbers.
Briefly explain the clock generator of TMS320C54XX.
I of2
(06 Marks)
(04 Marks)
11. l
068C762
USN
Seventh Semester B.E. Degree Examination, Dec.2013
Real
- Time Systems
':::,:',,.,
tlt... ,,
o
.9
o
(S
',
Time
Note:
6
(6
t..
o
(g
.9
Max. Marks:10-0
3 hrs.
=
E
I Jan.2Ol4
..::...:..:.:1
l.
Answer ony FIYEfull questions, selecting
stleast TWO questionfrom each part.
2. Standars Notations are used.
.:::
.
:.
o
L
3e
a.
v>
by
Real
PART - A
Time systems? Explain the
Jh
bo'
-il
b.
troo
.=N
(!+
l<bo
go)
otr
-o
e'o>
2a.
(06 Marks)
b.
c.
(06 Marks)
(04 Marks)
d.
8z
(04 Marks)
6=
Y5
OO
-
c
-! dO
oE
.oo I
-=-3..-- a.
b.
-o
>P
,6
!-J
E6
d8tro.
o F:'
^E
69
4a.
9E
tolE
i,
E.r
!o
=E
>gr
-;o
6=
o.B
tr>
co0
.-C
Technique
c.
lra)
'io
oe
6-
b.
5
VL
o-
-^
U<
-i 6i
What is code sharing? Explain the serially reusable and reentrant code.
()
o
z
€
.'
..-i6'
L
oi
7
a.
b.
c.
8a.
Explain software design for RTS using software module.
What is the principal difference between pool and channel?
Explain with relevant diagrams, the Ward and Meller method.
b. Explain Yourdon methodolo gy.
c. Write a short note on software modeling.
J&JJJ
(08 Marks)
(06 Marks)
(06 Marks)
"
12. 06F,,C7s6
USN
Seventh Semester B.E. Degree Examination, Dec.2013/Jan.2ol4
lmage Processing
Max. Marks:100
Time: 3 hrs.
Note: Answer FIVEfull questions, selecting
at least TWO questionsfrom each part.
la.
With a neat block diagram, describe various components used in general purpose
processing
b.
c.
o
()
ox
2a.
image
(08 Marks)
(08 Marks)
system.
Briefly.explain the principle of image formation in Human eye.
Let p dnd q be the pixels at coordinates (5, 5) and (10, 15) respectively. Find out which
(04 Marks)
distance',,rneasure gives the minimum distance between the pixels.. . " ,,,
Explain the pfbeess of image sampling and quantization in arq;lallmage formationlro
rvru.t r;
b.
Jh
6
'oo
c.
I
troo
.= 6l
(d<f,
Explain: i) False contouring. iil Checkerboard pattern.
Consider the image se€m€nt shown in Fig.Q2(c). Let V : {2, 3,4}, compute the length of
shortest 4-, 8- and m- path between p and q. If any particular path does not exist between
(05 Marks)
these two points, explain
(05 Marks)
eil
otr
-c
0
cdO
OE
ootr
3 a.
E(o
'Ea
o!3
o. 6.
tra.
b.
oj
6E
!o
5.e
>'q
co0
o=
90
4a.
b.
c.
5a.
=o
oVL
Consider a2
x
a
0
::1
(q)
2
J
a
-)
0
4
''r""'
.
2
U
J
4'
4
::,
f
tl
rrl
U=t
;]
Lr
Ll
I
2)
Calculate the transformed image V and the basis images. Check the image U using basis
(10 Marks)
images and transformed image V.
Define Haar,transform. Find Haar matrix for N : 8 and explain how it is constructed. State
(10 Marks)
its propertids.
Explaiuthe importance of discrete cosine transform with its equations and properties.
Write a short note on KL transform.
Prove that Hadamard transform is a fast transform.
1r,,,
:
(08 Marks)
(06 Marks)
(06 Marks)
.
.PART-B
ii
Consider 8-level grey scale image of size 8 x 8 shown in Fig.Q5(a). Show histogram of t]le
image. Compute equalized hist
and display graphically.
t"*u*"'"'
)4
c'i
0
0
I
1
0
0
I
2
J
J
1
a
-)
0
4
0
o
4,, 2
2transform matrix A and the image U. given below:
^ i[f
a6
z
2
1
oo)
o
t',,
t)
2
(p)
o:
0
4
I
.,
92
()=
J
.
PART _ A
i:
o
o
o
,..
,,,,,,,,
5
a
.,
a
1
I
0
2
I
0
5
4
0
2
7
7
2
0
6
2
1
0
0
1
2
6
0
4
5
J
J
5
4
0
0
1
2
J
J
2
1
0
0
1
1
0
0
1
a
1
a
0
I of2
Fig.Qs(a)
13. 068C756
5 b.
c.
Using the second derivative, develop a Laplacian mask for image sharpening. (06 Marks)
Exptrain in brief any point processing technique implemented in image processing. (04 Marks)
6 a.
Discuss the characteristics of high boost filter for both frequency and spatial domain.
.:=
(l0lv[a*s)
Explain how high boost filtering increases the enhancement of the image.
':r::
,hf
Wilh the help of block diagram, explain homomorphic filters for image enhancemerl-. -j::' = '
_
flO1Yla
flOlVlarks)
tain different image degradation models.
tll ull.l9r9lrt llilaBE us$r4Lr4Lrull lllrrvrr.
in in brief, the inverse filtering
c.
approach and
using Wiener
lirfri*l&ns can be overcome
WhdSffifu order statistics filter? Explain any one such
"",
*d3
its limitations. .E#ft6in how the
filtering.
filter.
. fu
(10 Marks)
(04 Marks)
.
8 a. Explain thffi}{pwing color models:
co6*:$del
i) RG_BgOIOf nio@=
ff, tlDf
ii) HSI color mOge::
b.
c.
dT.
" .:: Marhsl
flh* (06
*qf " ""
"%.ffi#
*w
,..t
^^#s
.
- ..'
Write steps involve=?Ifuonverting colors from HSI
;.Explain pseudo color @ge processing in
to,,$GB.
brief. ''
='*,* *#J**{ffiuw'
ptw
sE
&
$
2 of2
=
(10 Marks)
(rr, lvrarrs,
(05 Marks)
(05 Marks)
14. 06ML753
USN
Seventh Semester B.E. Degree Examination, Dec.2013 lJan.2ol4
Linear Algebra
Time: 3 hrs.
Max. Marks:100
Note: 1. Answer FIVEfull questions, selecting
at least TWO questionsfrom each part.
2. Missing data be suitably assumed.
!
:::
!.,.1S
,,:,.:
d
o
o
, .:$"''
a.
1
,1""
Given:
a
C)
6
(.)
Ls
ll
ioo
.=N
dr+
b9p
)
a.
Eb
>P
,6
GEd
b.
a)
or=
9=
o- 6-
tro.
o=
to
atE
!o
5.e
>'h
lr<
o
o
Z
o
a
a'.1
21
r
(08 Marks)
,,,,,,
1t2 131
113
1l 4
|
"'. . )
using ihe element ary row operations.
Ll/3 U4 Us)"
of
Find an LU factorization
3
.,,.,.,.
if
",
b.
,.
lz -4 -2 3l
I u -e -s 8
a:[ a -7 -3 el.
I o -2 -2 -rl
T -L-6 3 3 4)
,..
c.
ofV.
Are the vectors Vr
:
(1,
|***7 '/6/'*'o
t9(/
N.,.>-{qfii
--==::f
Marks)
{tgctr'
- .'
':;'',
rusq':;::
,,:
,,::'
,,
(10 Marks)
.iit:
'1.=
Given Vr and Vz are vectors in a vector space V,
subspace
ff("'*11:
,-r,,
I
Fl'
=o
o-
8_l
--
Find the inverse of the matrix
I
tt
A:lll2
o0tr
6d
tr>
,1"''
I
.=o
bn"
cb0
o=
so
':::,
'.,'
'1rl,u
l" -r ol. l-:
L; ;'._:l L,',L',l
Ez
o
:::
lz o ol I-r t
og
-c!)
-?
,,,
,r.r1,,
" l'i'
Find the following: [) The row reduced echelon lorm of A; i i) The row rank and nullity of A;
iii) Find the general iolution of the system AX: 0.
(12 Marks)
Prove that the following twg matrices are NO'I ro#'equi valent and mention under what
conditions two matrices are said to be row equivaJent:
GV
6
o(.)
6O
[. n
lo B -4 -8 rl
tt l0
-12 -24
L
E9
a=
-
A
It 2
lt 4 -2 -4 tl
-3 -6 'l
12
A=13 6 -3 -6 1l
L
oo
PART
2,5),Y2: (2,5,
let H:
V::
span {V1, V2}. Show,that H is a
Shoi
iot'm.r..l
(1, 5,2)hnearly independe inR3?s...
endent
1os mar[Si
Find a basis for col A and a basis for nul A for the given matrix
1) and
Ir 4 8 -3 -71
l-,
A=l 2 7 3 4ll.
l-r 2 9 s s I'
[, 6s -s -r)
(10 Marks)
4 a. Determine which of the following functions T from R'+ Bf are linear transformations:
i)
T(x1, xz)
:
(xr * xz, xr)i
ii)
T(x1, x2)
:
(x1x2,
I of2
x1).
(06 Marks)