I
'U . \
FIFrH SEMESTER B.E. (COE)
B.E. END SEM. EXAMINATION, NovDec. 2008
COE301 : Pri nciple s of Computer Gr a p h ics
Time : 3:00 Hrs . Max . Ma rks : 70
Note: Question NO. 1 is compulsory.
Answer any four questions from the res t.
Assume suitable missin data, i an .
1.
[a) Define the terns
Refresh rare , Video memory , Interlacin g and video
con troller. i2i
[hJ Deline th e nata s t ruct ure if scan line polygon iir
algorithm, tra: erse the scan line ve rticallv and eiYe
example to gen erate a Gl oba l Edge Ta ble . [3j
[e] Discuss a bou t Weighted Area Sampling Met hod ior anti
aliasing. [3]
[d] Give compar is ron of Ras ter Scan and Random Vect or
displays . [3]
[e) Give in brief mechanis m of Beam Penetration CRT and
shadowmas k C:RT. [3J
2.
[a] Us ing MidPo nt scan conver sion algorithm. scan
convert the line with en d points 15 .8\ and 19 . 1] I.
Perform:
i) if it is Traversed from (5 ,8) to (9, 11)
Ii] if it is Traversed from (9, 11) to (5.3)
U t "tJ iCl the in dizi uza tion . it anv, ii i
[0] Digitize a d circle with centre at (5,o) and
equal to 17 ur ts. The dash length is of 2 unit.
'.,
, ' I
, '
3.
[a] Write th e steps for clipp ing the subject polygon against
a clip polvzon (win dow) , if the subject polygon is a dash
polygon u se the Sutherland Hodgman which can clip
t he given (das h ) subj ect polygon. What changes n eeded
in the al gori t h m to incorporate s uch clipping. Trace
any example in support. [81
www.nsitonline.in
r ' " .... .... ... . • (... . " . ,.  .1 1
" " .' , ' . . "" " .,,, . , .,' ., ' ..
L • ....... .... ..r ........ .... ..... ...  0 ........ _.... ""
8. Write s hort not es on any four of the following:
[a] Phon g Model
[b] Recurs ive Ray Traces
[e] Ani mation Techniques
•
" _.. ". ....... ..
[e] Specular Reflec tion
If] LCD Display. [3.5x4]
...... _ ......... c .. ..:... l i =;
.. .... ... ...... ......... .1.""" .., •• .I. .. .t" ..... . .. . l  j
Ib] Discu s s Beizcr Surfaces . Explai n in brief t h eir design
. '6'
properties. 1 J
[e] What is Wire frame model? Give its advantages anti
disadvantages. [3]
6.
[a] Given two triangles:
Triangle 1: 1'11(0,7,5) , 1" 2(6 ,7, 5), 1' 13(0, 1,5)
Triangle 2: 1'21 (0,6,7), 1'22(0, 1,2), 1'23(5, 1,7)
Use Area Subdivision algorithm for hidden s u r face
removal to t raverse the given triangle. [8J
lb] What is 3Dviewing? Give an exam ple explain in g the
, _ ", "' . . ' r '
steps taKen tor ,..:'JUVleWlng. lV;
7.
rOo] Four Control Pointe
are ava ila ble lor drawing a peri ornc cubic b Spil!'.e
Cu rve Segment. Compu te the values of a . b a nd c s uch
that the curve starts from t he point (2.1 , 4.3) and
[7]
e
c
z
. , "".... ", .
t\ lL, u , L.J
B (4 . 0, 2)
C (4, 0, 2)
D(2,0,2)
E (0. 4, 0).
Determine t he proj ected image on t o t he xy plane of a
tetrahedron ABCD:
5 .
[a]
11\1 \11 !
i I
1(' 1 0
1 1
II BeD =' I ' I I
I 0 0 1 1
II I 0 IJ
Using t he st andard single poin t per spective
tran sformati on. The distance of t h e vanish in g point P
from the view plane is 5 units . [4]
[b] Derive the general parallel proj ection matrix for
projection on to a view plane defined by normal vector
ii; =3i2J+ 4k and reference poin t R
o
(6,4,3) in the
 ... ... ...
direction of a given projector V = i  .i + k . [6J
[e) Fino .he t rans formation for cabin et projection with
(J =30
0
. Draw the projection of the unit cube for the
same t ransformation . [4]
lb] Use CyrusBeck lineclipping algorithm, clip the line I
Po( 7, 14) to P, (20,40) agai nst the window h aving
diagonally opposite corners a s (0,0) and (15, 15). [6J
4.
[a] What are homogeneous coordinates? Map a triangle
ABC [A(100 , 100), B(200,200) , C(500 ,300)] displayed on
a screen with resolu tion 640 x480 lO a screen whose
resolu tion is 1280x 1024. [2 +5J
[bl Cons ider t he obj ect given in Fig. l , r otate the object
..... "J · D... .. ...... .. ' I • " 1 1 00"
liyC;.;t ri llLl t"\. ' LUc.. \ V1111 reap..... c .. .o ...;: . <..L' ... s wrtr... di'lgJ.C 7
in anticlockwise direction . Find the coordina t es of new
object.
Given:
www.nsitonline.in
" " :" 1' " 1" '11
7
" '1'1" " ' . 1 I I ., .J " ..0 .J l \,
, 1
IH:' COE)
Time: 3 fl l'S
I'ND RI "MESTER EX;\MIN,HIUN, Nov cmhcr 2008
COE } (P: DI SCRI'TE MATHEMAT ICS 8: IW SICi N 0 1· AI. C;ORITHMS
'vl"x Marks:70
"Ole: Attempt an" ]'l YE Que.uions
Ass ume sui .ablc mi ssin; data, if any.
Q. 1 a.) Using prcd.catc calculi s show that the premi ses Ihat " Every one in the college
has purchased a compu:.cr" and "Il ari is a student in this coll ege" ill1pl:,'s the
concl usion "1lari has purchased a computer".
[6]
b.) Obt ain the principle J):·JF and eNF of (P·>(Q/\R» 1\ H'·>(" Q/\R)) using rules.
[81
Q.2 a.) Among the :ni cgcrs 13'W, how many of themarc no: divi sible hy 3, nor by 5. nor
bv Ti llow manv of them a:" divi si ble bv 3 bUI nor bv 5. nor bv 7"
• .J ".J ' •
b.) What is rcc .rrsion? ,' C the recurrence relation
a.. ·j·Sall _l + 6 all _2= 311
2
2n+I
,
14]
[6j
c.) Prove that among 100.000 people there are IwOwho were born "I exactly the
same lime (I II'S. ru ins, sc:s).
. 14\
Q.3 a.) What is di fference between permutation and combination? \ Vhat is lexicographi c
order? Det ermine the number of ways to adjust live boys in a row of chairs.
" 1
l 
b. ) Pro ve that the set or mil .uul numbers is in onetooil": correspondence with the set
ofsymbols ofthe torrn c l c2 en" , where E: [a.b]
14]
c.) Let {A1,)\ 2,.. .. Ak } be" paru tion or a set A. We define a binarv rel at ion Ron ;\
such that an ordered pai r (a,b) is in R i fand only if a and b arc i n the same block
oft he part ir on. Show tlat R is also an equivalence re lati on.
151
Q.4 a.) Consider the recurrence md li nd it s asympt oti c bound.
,
T(n}> i4 .·( ni2) ; rr
b.}
131
\Vritc a recursi ve al !2orit 1111 /e code lor (i ndi nu maxi.nurn and mini nu u: clement c _
from a l ist of numbers. ;' lso lind the complexity orth is algorithm
171 ..
c.) Apply divide and conquer strategy for fi ndi ng coin with max \\"..i!.!.hl amona
collect ion or coins. I row .nany minimum numberor comparisonsare required if
there arc 8 coins.
14]
Q.5 a.) Apply all pai r shor test p.fh algorithm Oil the given graph below
I
www.nsitonline.in
b.) Discuss knapsack problem. Consider the 01 knap sack l? r 1
4
' = 4 , weight
set is (w l ,\ ' / 2, w3,w4) = (2, 11, 22, 15) and proFit set is ) = .
r.J. l.? 1,3 \. 3,» and m 40. Find the ?ptimal soluti..·n. .
l71
Q,6 a.) Stale traveling salcsman problem. Consider a dircc.cd graph given below and li nd
the optimal tour.
I \ I
0
(0 s
\2
/5 0
7
/
20 0
3
b
(1
(0
0
171
b.) VI' tat arc prefi x code'! Where arc they used? Wrnc an algori thm for const ructing
Huffman code Ior the following alphabet s and their relative probabilities.
Character x a b c d
Frequency 40 18 12 16 14
OR
Anal yze a mul tistage graph problem. Explain the rorward and backward
apr roaches for solving any problem with the hclp ,, 1' exampic, Writ e thc al gorithm
lo r both the approaches,
[7]
Q,7 a.). Determine the Longest Common Subsequence of (A, B,C,D, lJ ,A,C,D,F) and
(C, l,A, F). '
OR
Compute 111'.:; overall computing lime T(I1) of strcs .cn' s matrix multiplication.
[4]
b). W ,at is thc d. Ilcrcncc between Greedy and D)'1I 8,ni,: programming methods?
What arc minimumspanning trees'? Write the cle i+ code for l'rirns and Kruskals
methods. '\1' p:)' both these methods on the given t:mph.
II OJ
I
b
. .
'V
1
•
•
www.nsitonline.in

COE303
Time: 3 Hrs.
Note:
I'NH SEMESTER EXAMINATION, NOVEMBER 2008
V SEMESTER BE (COE)
Computer System Orgauization
Max. Marks: 70
.
,
I a.
b.
•
•
Attempt allYfive out oj sevell questions.
Assume missing data suitably, if ally.
How many passes are required for an assembler? Justify your answer. Draw the
flowchart for the assembler which will generate the machine code. 8
List the assembly language program (of the equivalent binary instructions) generated
by a compiler for the following IF and FOR loop statements:
(i) if(AB) IO, 20, 30
(ii) int X[I OJ, sum;
sum=O;
for (i=O; i<IO; i++)
sum=sum+XCi);
end /
The program branches to statement 10 if A is less than B; to statement 20 if A equals
B; and to statement 30 if A is greater than B. 6
2a. How many times does the control unit refer to the memory when it fetches and
executes an indirect addr essing mode instruction if the instructi on is (i) a
computati onal type requiring an operand from memory, (ii) a branch type. 4
b. Discuss the harcware for xyTo+T,+y' T
2
: AR . AR+1. Incl ude logic gates for
control functions and a block diagram for binary counter with a count enable input. 4
c. A computer based on the relatively simple CPU contains a 16 word associative cache
with FIFO replacement policy. Show the contents of the cache dnring and after the
execution of the following cede. Also give the hit ratio for this program on this system.
6
0:
3 :
6:
7 :
8:
9:
C :
F :
10:
11:
20:
23:
26:
29:
4235:
LDAC 4234
STAC 4235
MVAC
lNAC
ADD
.' PNZ 0020
:flJ MP 0010
NOP
CLAC
JUMP 0020
LDAC 423 5
JUMP 0029
JUMP 0000
AND
:i5
www.nsitonline.in
3a. List the advantages and disadvantages of microprogramrner! control and hardwired
control. . <;
b. Discuss microprogram sequencer with bl ock diagram. 6
c. Write various instruction formats and explain importance of each of them. 3
4a. Discuss and illustrate the Bcoth' s algorithm with block diagram for multiplications of
signed2 's complement numbers. 5
b. Explain the division of floating point numbers showing (complete) block diagram. 9
Sa. Why does the same size of RAM have less memory storage as compare to ROM? Use
suitable block diagram to connect Cl'U with memory. 5
b. What is the difference between random access mernory and associative memory?
Describe the match logic for associative memory. 7
c. What do you mean by memory hierarchy? Why do you need it? 2
6a. What is mappin g processing in context of memory? Discuss different types of
mappings. 6
b. A cache mi ss results in memory access followed by replacement of an exi sting cache
block by the newly brought in cache block. If the old block is dirty (not valid data), a
cache writeback also takes place. Assume that the cache is always full and so
replacement is inevitable. With a hit ratio of90%, a 60% probabili ty of replaced cache
blocks being dirty, a memory access time of 900ns and a cache access time of 100 ns,
calculate the average memory access time. 4
c. Discuss asynchronous and synchronous data transfer briefly. 4
OR
Discuss direct memory access.
7. Write short notes on anyfour of the following:
(i) BCD arithmetic
(ii) RISe and el Se
(iii) Addressi ng modes
(iv) Priority Interrupts
(v) Bus organization
4x3.5
www.nsitonline.in
,  . . ..

ENDSEMESTER EXA\1INAnON. NOVEMBERI>ECEl\1BER2008
Vth Sem. BE (ECE/COE/ICE) ) .L'65s <2 cl (,
ECE/COE/I CE304: Linear Integrated Circuits  I  ., ' '1 ,
Time: 3Hrs 1U:l Max. Marks: 70
Note: Attempt any ter quest ions. All questions call') equal marks. Missing data. i f any . may be suit ably
assumed and should be mentioned in the answer. Assume ideal opamps unless specified
ot herwise. Be conc ise and use space judicious ly. Wastage of paper and usc of supplementary
answer books is strongly disco uraged.
I .
,
J .
4.
5.
6.
7.
8.
10.
II.
I 2.
J 3.
14 .
Us ing the exponential relation between V
hc
and Ie. derive an expression for the current l.,
assuming matched transistors with negligible base currents . (Fig. I )
Show that the circuit of Fig.:! can funct ion as an inductor . Find the value of the equivalent
inductance and draw its equivalent circuit.
Determine the type of filt er the ci rcu it of Fig.':> realises. Assume and
Analyze the ci rcuit of FigA and hence prov e Or disprove that by proper select ion of V,,, I'
and one can real ize any of the th e standard filter funct ions from this ci rc uit.
Wr ite down the transfer functi ons of second order lowpass, band pass. high pass. hand
stop and all pass fil ters. Ana lyze the circuit ofFig.5 and determine which of the fin:
standard filte rs quoted above art' realizable by thi s circuit. Determine the expression... for
gain. bandwidth. Q and angular frequency (1)0 for the fi lters realized b) this ci rcuit.
Whv do we not use differentiator s to make filters? Fi nd the expression for the frequency
response of the di fferent iator shov.. :1 in Fig.6 If A\=':: (J)';s. tind up to what freq uency range
this circuit acts as differentiator.
Assuming ideal oparnps, determine the condition under which the circuit of Fig.7 can
generate sinusoi dal oscil lations. Determine the expression for the oscillat ion fr equency.
Determine \\ het hcr or not the OTA ci rcuit of Fig.8 is a sinusoida l ose illator? If not how
you can modi fy thi s circun ro realise an oscillator? Find out the condition of
osci llation and frequency of osc illat ion.
Show that wit h ideal opamps the circuit of Fig.9 realises a unity gain voltage fol lower.
Wi th determine the phase error of the circuit.
By appropr iate analysis. determine the function performed b: the circui t shown in Fig.IO
Consider the astabl e multi vibrator of Fig.1 1 Where the resistor R, denotes the losses of
the capac itor C. By analysis determ ine in what ".. ay the time per iod otthe ... quare \\3\'C
generated by this circuit is affected by the resistor R
r
.
One method for achievi ng equal high and 10" interva ls for the 1(' 555 timer in astable
rn ult ivibrator mode is shown in Fig.l ::! . ShO'... that for symmetrical cond iti ons (i.e. 1\\0
interva ls being equal). the time peri od T is given b) T= 1.39R
H
C.
What is the d ifference between 2quadrant and 4quadrant multipl ier: Analyze the circuit
of Fig. 13 and determine the condit ion under which the input resistance R", is inversely
proport ional (0 control voltage V
r
.
Write short notes on any two of the foll owing
a. Applicati ons of PLI .
b. Gilbert multiplier
c. Voltagecont rolled oscillators
d. Currer .trnirror as acti veload
   
Elf.
i·
1
f
o
...
II
6\, R,
+
+
N
Rlt
}
J 1'
R.J
FiB· ,
;;r.. ell
\' ( 9' 2
,
www.nsitonline.in
,
"
..;  ,
•
FiO.4
,
"J '1C,
'"I
""02 Jc
•
r_":''' v..
where
A ?= I \ct w>I '}>
u; Ao wp
t
s,!jh1eols haUl ih.;,
usua.l \')\MI\
l n
3 ·
,
n
, 
/A{

'l1R
 _.
  
' 1
}
»
\ .
, .
 
,
\
f:'tV
Co
1
D:r.v
R(1
_ . 89 ,9
,       
1
  
+
"'f
Y
V.
o
  
+VCc:
r
1\ 4
  7
2
3
,
 '
5 I
, ,
• •
11:9 ' 10
www.nsitonline.in
 FIFTH SEMESTER
JT\
B.E. (COE/EC/EE/IC)
END SEM EXAMINATION NOV./DEC.200B
COE/EC/EE/IC305 INDUSTRIAL
ORGANISATION AND MANAGERIAL ECONOMICS
Time: 3:00 Hours Max. Marks : 70
Note: Answer any FIVE questions.
;, Assume suitable mlssino data, if anv.
"
7
Defi ne organization. How is organization chart useful in management?
Discuss different principles of sound organization. 7
[b] Differentiate among the following structures of organization
(i) Line type structure
(ii) Line and staff structure
(iii) Functional structure.
1[a]
2[a] What are the factors considered for plant location? l1Iustrate with a
case study on steel plant. 7
[b] What are the objectives of a good plant layout? Explain the advantages
and limitat ions of product layout and cellular layout. 7
3[a] Discuss assumptions made in breakeven analysis. Defi ne and explain
the following in the context of break even analysis.
(i) Break even point
(ii) Safety margin
(iii) Angle of incidence. 7
[b] A manufacturing firm has three proposals for a product. Either it can
be purchased from an outside vender at RsAOO per unit or it can be
manufactured in plant. There are two alternatives for in plant
manufacturing. Either a fully automatic unit is procured, involving
fixed cost of Rs.30,000 and variable cost of Rs. 2.75 per unit.
Alternatively, a semi automatic unit would cost Rs. 20,000 as fixed
cost and Rs. 3.00 per unit as variable cost Draw a break even chart for
these alternatives. Suggest range of production volume suited for these
alternatives. 7
www.nsitonline.in
14
Explain following types
7
Give five examples of Therbligs
7
[b] Distinguish between moving average and exponential smoothing
methods of forecasting. The demand for the disposable plastic tubing
for a general hospital is 300 units and 350 units for September and
October respectively. Using 200 units as forecast for September,
compute the forecast for the month of November. Assume the value of
smoothing constant (u) as 0.7. 7
Define different steps followed in work study.
of charts used in work study.
(i) Man and machine chart
(ii) Flow process chart
(ii i) Flow diagram and
(iv) SIMO chart.
[b] State principles of motion economy.
and their uses.
7[a]
8 Write short notes on any THREE:
[a] Methods of Job evaluation
[b] Stages of production
[c] Personnel management
[d] Profi t and capital management.

Job Processi!!!:, Time
Mlc A Mlc B Mlc C
I 6 2 4
2 9 3 2
3 10 5 I
4 12 6 3
5 8 2 2
, oat an sac or I erent acnvities.
Activity A B C D E F G H I
Duration 9 9 10 4 7 3 8 7 0
Precedence    A B C DE,F C GH
4[a] What are objectives of production planning and control? Discuss
different steps foll owed in PPC. 7
[b] Define different Johnson's Rule for optimal sequence of N jobs on 2
machines. Following these rules, schedule five jobs on three machines
(TableI). Also find idle ti me for all the machines.
Table I
7
5[a] Differentiate between CPM and PERT and write the objectives of these
methods. Define following time estimate in PERT
(i) Optimistic ti me
(ii) Pessimistic time
(iii) Most likely time
(iv) Expected time. 7
[b] The precedence relationship for nine activities is given below. Find
critical h d I k D diff . ..
7
6[a] Defi ne performance rating. In a time study for a Job done by a worker
whose rating is 90, the data are as follows:
Observed time = 20 minutes.
Personal need allowance = 40% of Basic time
Fatigue allowance = 2.5% of Basic time
Contigency work allowance = 2% of Basic time
Contigency delay allowance = I% of Basic ti me
Find
(i) Basic time (ii) Work content
(ii i) Standard time. 7
www.nsitonline.in