Publicité

# 4th semester Computer Science and Information Science Engg (2013 December) Question Papers

Deputy Librarian à BGS Institute of Technology, Adichunchanagiri University (ACU)
14 Feb 2014
Publicité
Publicité
Prochain SlideShare
4th Semester (June; July-2014) Computer Science and Information Science Engin...
Chargement dans ... 3
1 sur 13
Publicité

### 4th semester Computer Science and Information Science Engg (2013 December) Question Papers

1. .r() t 1OMAT4l USN Fourth Semester B.E. Degree Examination, Dec.2013 lJan.2014 Engineering Mathematics - lV Time: 3 hrs. Max. Marks:100 Note: Answer FIVEfull questions, selecting at least TWO questions from eoch port. 0.) o PART _ A (f a" I a. () = () L 3e d9 -.o ool troo .=N O Y:J Employ-Taylor's series method to obtain the value of y at x:0.1 and 0:2 for the differential .dv ? ox : (06 Marks) terrn. b. Determine the value of y whenx:0.i, giventhat y(0): I and y" : x2 + f using modified Euler's formula. Take h: 0.05. (07 Marks) dv, c. Apply Adams-Bashforth method to solve the equation i=x'(1+y), given y(1): 1, ox : l.gTg.Evaluate y(1.4). (07 Marks) v(1.1)= 1.233,y(1.2): 1.548, y(I.3) equation = 2y + 3e* , y(0) 0 considering upto fourth degree oC: eO 2 a. a o() (60 -! 50tr -o !o 5 .:i >,= tr orJ o= o. ;; tr> o U< -i o c.i : 1 at x : 0.3 by taking h : 0.3. Applying (06 Marks) Using the Mitni's methqd bbtain an approximate solution at the point x += l-Zy+. ox ox give that y(0) : 0. y'(0) : 0. y(0.2) y(0.4) :0.0795, y'(0.4) :0.3937. y(0.6) :0.1762, y'(0.6) 3 a. b. : 0.8 of the problem 0.02. y'(0.2) :0,5689. Give u'- v (* - yX*' + 4xy + 0.1996. (07 Marks) Derive Cauchy-Riemann equations in Cartesian form. c. If(z) :u+iv (06 Marks) y2; find the analytic function f(z): u * / ^ 12 / ^ (07 Marks) .l*lfe)l / tdy isananaly,tictunctionthenprovethat[*lf(z)l] dx iv. ' )| =1r'1zll' (07 Marks) 1"4 a. Find the image of the straight lines parallel to transformation b. o Z o r*. 9- c. o.r alE * Applying Picard's method to compute y(l.l) from the second approximation to the solution of the differential equation y,l'*'y'y': x3. Given:,ihaty(1): 1, y'(l) : 1. (07 Marks) 3 5i3 -:Y p- 5o -.i 9.Y o= , b. 26 6- tro. {I: dx -xy . y(o) = 0, z(0) dx Runge-Kutta method of fourth order. .. Solve c. w: zj coordinate axes Find the bilinear transformation which maps the points z w: 0, in . 1, .o. : l, i, -l z-plane under the (06 Marks) on to the points (07 Marks) Evaluate J,l--j:-. (z + l)(z + 2l where c is the circle I zl :3. I of2
2. 1OMAT4l PART _ B 5a. Find the solution of the Laplace equation in cylindrical system leading to Besseis differential (06 Marks) equation. ,,', b. If cr and B are two distinct roots of Jn(x) : I that Jx 0, then prove J" (ax) J* (px)dx = 0, 0 El c. 6a. b. c. 7 a. * n. E s ,'., (07 Marks) (x) : *o -2*' + 3* - 4x + 5 in terms of legendre polynomial. (07 Marks) A co ittee consists of 9 students, 2 from frst year, 3 from second year and 4 from third year. 3 students are to be removed at random. What is the probability that (i) 3 students belongs to difbrent class (ii) 2 belongs to the same class and third belongs to different class. (iii) All the 3 belongs to the same class. (06 Marks) State and prove Baye's theorem. (07 Marks) The chance that a doiteii will diagnose a disease colrsctly is 60Yo. The chance that a patient will die after correct diafnose is 40% and the chance bf death after wrong diagnose is 70oh. If a patient dies, what is the chance that disease *as correctly diagnosed. (07 Marks) " ,,::" The probability distribu tron of finitb' random variable x is siven bv the following table: finrte a x 0 1 ..2.... J 4 6 5 7 i) l{: ZK 2k 3k k' 2k" 7k'+k o(x) Find k, p(x < 6), p(x > 6), p(3 < x 5,6) (06 Marks) distrffiion. b. Obtain the mean and varianc+6f Poisson c. The life of an electric UUlo' is normally distributed with average life of 2000 hours and standard deviation of 50 hours. Out of 2500 bulbs, find the number of bulbs that are likely to last between 1900"dfid 2100 hours. Given that p(0 < z < tS'l"J:0.4525. (07 Marks) 8a. b. Explain the foliowing i) Null (ii) Tlpe I and Type II error ' ', (iii) Confidence limits. (06 Marks) fhe weighi of workers in a large factory are normally distributed with mean 68 kgs, and tl3letd deviation 3 kgs. If 80 samples consisting of 35 workers each are qhosen, how many of, 80 samples will have the mean between 67 and 68.25 kgs. Given p(0 < z < 2) : 0.4772 and p(0 S z < 0.5) c. ' terms: hyp,qthesis (07 Marks) : 0.1915. (07 Marks) Eleven students were given a test in statistics. They were provided additional coaching and then a second test of equal difficulty was held at the end of coaching. Marks scored by then in the two tests are given below. ven Delow. Test I 23 20 19 21 18 20 22 18 t7 23 t6 19 Test II 24 t9 22 l8 20 20 20 23 20 t7 Do the marks give evidence that the student have benefited by extra coaching? Given toos(l0):2.223.Testthehypothesis at5Yolevelofsignificance. (07Marks) **ri<rk{< 2 of2
3. MATDIP4Ol USN Fourth Semester B.E. Degree Examination, Dec.2013lJan.20l4 Advanced Mathematics - ll ,,::, Time: 3 hrs. Max. Marks:100 Note: Answer any d o o o. o FIVEfull questions. I a. Prove that sin' cr + sin' B + sin' y = 2. (06 Marks) b. If ,tr,.trrr, n1 and 1,2, m2, n2 are direction cosines of two lines then prove'that the angle (07 Marks) betwsenthem is cos 0:|&z* m1fii2 t n1n2. i, :, c. Find the equation of the plane through the interaction of the planos 2x + 3y - z : 5 and (07 Marks) x-2y -321- 8, also perpendicular to the plane x + y -z:2. (.) te -ya Jh -o0 2 a. b. I troo c. Prove thatthe equationof the plane inthe interceptformis 'abc the plane 2x - y - z-t $= g. Find the angle between the following lines: x-2 Y(r 3* 6= ocJ =2 o0c 3 c. -? .) 'Ea 4 a. ^X t^E !o o.r >,q be. do! *o tr> '.t, _",,2.0 b. c. 5 a. : b. c. (r< -an are coplanar Prove the following: G'a -2blx (4a + 261 it (07 Marks) =t+ta+6t o (07 Marks) A particle,inroves along the curve i = (t' -4r1+ (t2 + at)j+1tt, -itt;[. Find the velocity (06 Marks) and acceleration at t : I and also find their magnitude. Find the unit normal vector to the surface xyszz : 4 atthe point (-1, -1,L), (07 Marks) :.-:: f ind the directional derivative of x2yz3 at (1, 1, 1) in the direction of i + j+2T. (07 Marks) . FinddivF andcurlF, where F=xti+ytJ+z'[. (06Marks) Prove that curl grad Q : 0. (07Ma.rkg Find the constants a. b. c such that the vectorF=(x +y+a211+(x+ cy+22)k+(bx+ 2y-.)j is irrotational. (07 Marki) Find the Laplace transform of the following: sin 4t cos3t b. Z (07 Marks) , a. cos hat c. t e-t sin t o o | ii) (2a+ 36) x (4+'aE) = 5(a + 6) Ed a-- y-1 _r-3 x+l _ y-3 and 1 2 2 *1 '.., ;= o.. oj = (07 Marks) -i 3 a' Findthe sine oftheanglebetween d=i Zl-Zj+[ and i=1-Zj+2k. (06Marks) b. Find the value of i if the vectors a:4i+6J+2[. 6=3i+l0J+5k-and e =-4i+5J+i[ 9= OE (06 Marks) Find the equation of the plane through the points (1, 12,2) (-3, 1, -2) and perpendicular to OE: -o o> xyz " - +++ -1. d. 1 - cost (20 Marks) 4. l MATDIP4Ol Find the inverse Laplace transform b"rrL) "[s-l/ a. - ,f of s+1 b. s2 iki. +2s+2 S It' "':9',:::l' C. ",'i j _,i (s+1)(s+2)(s-3) ;l;'s ;, b. , ..,,...- Solve the Given that x: {<X{.{<* ' .::::::. ,r*qr, ' .:,".,ti ! :.:: :::::: ::: .tr'fu ::::" .. :;../ff ;:ji ',,::::' ,,.::' t.1., "' 1,,,',,,,:: "!1r 2 of2 5. 10cs42 USN Fourth Semester B.E. Degree Examination, Dec. 20l3lJan.2014 Graph Theory and Gombinatorics rlt: Max. Marks:,,,100,:' Note: Answer FIYE full questions, selecting atleast TWO questions from each part. o o o DANT PART _ A la.Prgvethatineverygraph,thenumberofverticesofodddegreeiseven. of order n:4 () (f Show'-1hat a simple graph c. (04 Marks) and sizem= 5 do not exist. Define isomorphism of two graphs. Show that the two graphs given below are isomorphic. of order n: :7 b. 4 and size m and a completograph " ',,,,, (05 Marks) oX bo* 6(r) 1: li on troo .= c (B r{' 69! otr FO o> 3z a= d 2a. b. OO (06 Marks) Show that Kuratowski's first graph, Ks is non - planar. (05 Marks) Show that in a complete graph,with"n' veriices where n is an odd number and n ) 3, there are botr ,' . Fie, Ql(c) Discuss Konigsberg bridge problem ana tfreisoiution of the problem. ' n-l 2 disjont HamiJtoa cycles. ,, , '.,' (05 Marks) -edge c. Define dual of a planargr,4ph. Draw the geometric dual of the given graph. d Fig. Q2(c) Definb,ehromatic number. Find P(G, ),) for the Fig. Q2(d). a6 (05 Marks) 5s p- 6o'e o; o= 6E LO 5.Y >' (r c50 o= 90 3 a. b. tr> o U< - L (05 Marks) (06 Marks) 1 edges. _n: wv t* ..v e.l () z ....... Define a tree. Prove that the tree with P vertices has P 'Find allthe spanning trees of the graph shown below : Fis. Q2(d) Fig. Q3(b) c. o d. (04 Marks) Construct an optimal prefix code for the symbols A, B, C, D, E, F, G, H, I, J that occur with respective frequencies 78, 16, 30, 35,125,31,20,50, 80, 3. (06 Marks) If a tree T has four vertices of degree 2, one vertex of degree 3, two vertices of degree 4 and one vertex of degree 5, find the number of leaves in T. (04 Marks) 6. 10cs42 4a. Define i) cut set examples. (04 Marks) Apply Dijkstra's algorithm to the following weighted graph shown in below Fig. Q4(b) and determine the shortest distance from vertex 'a' to each of the other six vertices in the graph. b. ' , ii) edge connectivity , iii) bridge connectivity , iv) matching with "'' le.: FiS. Qa(c). .j* d and hence deiermine the maximuY"Y"weena mU. (05 Marks) Foi'fhe network shown in Fig. Q4(d), hnd the capacities of all the cutrsets between the d vertiCo*epand +z ::,,,:: ":' '"""""'::, .. .; Fig. Qa(d) ,,1. t." ti 5 a. A woman has 1 1 close ,elatlVe, (05 Marks) PART _ B'..... ,ra ,n. *irU*, to invite 5 of them to diner. In how many ways can she invite them in the following situations : There are no restrictions on the choice ii) Two particular persons will not attend separately iii) Two particular persons will not attertd together. (06 Marks) Find the co-efficient of xI yo ,'in the expansion of (2x3 - 3*l + ,')u. (07 Marks) Define Catalan numbers. Ugi the moves : R(x, il -+ (x r 1, y) and U(x, y) ) (x, y + 1) find in how many ways ca-n one go from : iX0, 0)d'"(6,6) and not rise above the line y : x 11) (2,l)to (7,6) and no-trise above the line y: x - I..,.,,,,:..,.,: (07 Marks) i) b. c. 6a. ln how many ways can the 26letters of the English alphabet be permitted so that none olthe patterns CAR, DQG, PIIN or BYTE occurs? (07 Marks) . For the posj{ive integers 1, 2,3, . n there are 11660 derangements where 1,2,3, 4, 5 appear inthefrrst five positions. What is the value of n? (06 Marks) Four pe*ons Pr, Pz, P3, Pa who arrive late for a dinner party find that oniy one chair at each of five tables Tr, Tz, T:, T+ and T5 in vacant. Pr will not sit at Tr or Tz,Pz will not sit at T2, P:'w111 not sit at T: or T+ and P+ will not sit at Ta or Ts. Find the number of ways they can b. c. ,,,occupy the vacant chairs. la. .. i. b. c. 8a. Marks) ,(07 tli Find the generating function for the sequence 0,2,6, 12,20,30, 42, (07 Martrs; lnhow many ways can 12 oranges-be distributed among three children A, B, C so that A gets at least four, B and C get out least two, but C gets no more than five? (06 Marks) Define exponential generating functions. Find the exponential generating function for the number of ways to arrange n letters selected from MISSISSIPPI. (07 Marks) Find the recurrence relation and the initial condition for the sequence Hence find the general term of the sequence. 2, 10,50, 250, ....... (06 Marks) b. Solvetherecurrencerelation&rfon-l-6an-z:0forn>2giventhatao:-1 c. Using the generating function solve the recurrence relation an- 3an-1 : and&r:8. (07 Marks) fl, fl > 1 given ao : 1. (07 Marks) *rt<{<** 7. l0cs43 USN Fourth Semester B.E. Degree Examination, Dec. 2013/Jan.2014 Design and Analysis of Algorithms Time: 3 hrs. Max. Marks:100 Note: Answer FIVEfull questions, selecting atleast TWO questions from each port. (J o () o PART-A , ,, () () !Qo 1 a. With the help of a flow chart, explain the various steps of algoritfim design and analysis (08 Marks) _ process. b. If fi(n) € O(gr(n)) c. 6U 6 o0 gca and fz(n) e O(g2(n)) prove that fi(n) + fz(n) e O(max {g(n), gz(n)}). (04 Marks) Write an algorithm for selection soft and show that the time complexity of this algorithm is quadratic. (08 Marks) I .= .-..1 (6$ nbo go eO 2 a. b. What is divide and conquer method. Show that the worst case efficiency of binary search (10 Marks) algorithm is 0(log n). Explain quick sort algorithm. Find the time complexity of quick sort for best case, worst case and average case. 71, ^ aI oO 3 a. b. (10 Marks) :::,,, Write Krushal's algorithm to construct a minimum spanning tree and show that the time (08 Marks) efficiency is O(l e llogl e l). Apply Kruskal"s algorithm to find the min spanning tree of the graph. !oi -o 'O (6 -? .) 'Ca OE :9 o'v oj d .e, o= Fie. Q3(b) Dijikstra's algorithm to find single source shortest path. Write irE (04 Marks) !o 5.v >- (F a. tr> b. bo-oo o= so o Write the dynamic programming algorithm to compute binomial co-efficient and obtain its (04 Marks) time complexity. Explain Warshall algorithm to find the transitive closure of a directed graph. Apply this (08 Marks) algorithm to the graph given below. L U< J c'i o '7 o a Fig. Qa(b) c. Fig. Qa(c) State Floyd's algorithm. Solve all pairs shortest path problem for the given graph using (08 Marks) Floyd algorithm.
8. 10cs43 PART _ B 5a. b. (04 Marks) Explain decrease and conquer method, with a suitable example. problem for given graph. Apply the DFS - based algorithm to solve the topological sorting (0E Mzrks) c. , :" Fig. Q5(b) State Horspoolzs algorithm for pattern matching. Apply the same to search for the pattern (08 Marks) BARBER in a given text. a. Prove that the classic recursive algorithm for the tower of :' b. number of disks moves needed to solve it. Write shoft notes on : i) Tight lower bound ii) Trivial lower bound iii) Information theoretic lower bound" , Hanoi puzzlemakes the minimum (08 Marks) (12 Marks) a. b. c. Explain how the TSP problem can be solved, using branch and bound method. (06 Marks) (08 Marks) Explain back-tracking concept'and apply the,sq,np to n-queens problem. (06 Marks) Solve 8 - queens problem for a feasible sequence (6, 4,7, 1). a. Write short notes or, ," """'' ' i) Hamiltonian proptbm , . ii) M - Coloring.',,.,.,. "' (10 Marks) Explain prefix,Computation problem and list ranking algorithm, wilh suitable examples. b. (10 Marks) ,.{<**{<
9. 10cs44 USN Fourth Semester B.E. Degree Examination, Dec.20l3 /Jan.Z0l4 UNIX and Shell Programming ',:",,' Time: 3 hrs. i o o Notez Answe';;[W:;:;:!::;;:::;';:f, o PART _ A of the UNIX operating L a I a. b. () c. () 2 a. 6v -tL o0" troo .= dt C.l d?p otr _c() o> o!) Max. Marks:100 system. (08 Marks) DesCribe briefly the major features Define. a: fiIe. With examples, explain the three categories of files supported by LINIX. ' "'..,.," (06 Marks) , ,,- ',,,, desei,ihe: i) System calls ii) PATH Briefly iii) HOME ,,,',,1, ' (06 Marks) Explain the significance of all the fields of ls -l output. Which of the attributes can be changed only by the super user? (08 Marks) With a neat diagram, explain the three modes of,vj editor. (06 Marks) .: Assuming that a file's current'pmissions are pqy.,,i r - x r - -, specify (using both relative and absolutb,rnethods; required to change theffi;at i) rwx rwx rwx ii) r--r iii) ---r--r-- a: oo) do Marks) Devise wild - card patterns to match filenames: i) Comprising of atleast three characters where the first char is char is not alphabetic. ii) With three character extensions except the ones with .log extension. iii) Containing2,A{A4 as an embedded string except at the beginning or end. (06 Marks) Explain the threc$stinct phases of process creation. How is the shell created? (08 Marks) What are e.,nyirQnment variables? Briefly describe any five ot,tr.. (06 Marks) oQdd : a6 'o(n 2a o .J= ^X tro. J< -N o o -7 o ,. .,1,t,,,,. 4 LO o.>,? ootrbo o= o. tr>:i o- , Distinguish between hard links and symbolic links with suitable examples. .,r. o.' o.j uio o= i, lE cE ..::. 1 _ .,1i (08 Marks) Deqcribe the sort filter and illustrate its usage with -k, -u, -fl, -r and -c options. (06 Marks) i) Use find to locate all files named a.out and all C source files in your honre directory tree and remove them interactively. il) Display only'the names of all users who are logged in and also store the result in users.txt. (06 Marks) iii) Invoke the vi editor with the last modified file. ,i11,, :...:: "t.,.,,' PART-B 5 "i '"rl''"'lrri' Explain with suitable examples, the sed filter along with its two forms of addressing. Also (08 Marks) describe in brief the substitution feature provided by sed. Describe the grep filter along with any five options. (06 Marks) i) Use sed to delete all blank lines from a file named sample. ii) Use grep to list only the sub-directories in the current directory. iii) Replace all occurrences of the word "IINIX" with "LINUX" in a file named sample. (06 Marks) 10. 10cs44 a. b. c. ,,,:l' :i t Define a shell script. What are the two ways of running a shell script? Write a shell script to accept pattern and a file and search for the pattem in the file. (08 Marks) Explain the shell's for loop giving the possible sources of the list. (06 Marks) Write a menu-driven shell script to perform the following: List of users who are logged in. ii) List of files in the current directory. iii) List of processes of user. ' iv) Today's date. ,,,.-,.'rl1',.,,. v) Quit to LTNIX. ,Ot Marks) i) :ll|" ,'::1, 7 a. c. 8 a. b. c. , Deseribe the awk filter with syntax and example. How are awk affays different from the one'!'used in most programming languages? (08 Marks) (06 Marks) Briefly describe the built-in functions supported by awk for arithmetic and string operations. (06 Marks) i "/-.,, e4lfu ",_,,,1 ' With examptes, the string handling functions *ppotaa by perl. How are split and join;r*sed in perl scripts? ,,,j-,,, Write a perl script to deteimine whether a year is leap year or not. . *d<*** ii .. ,,: j .,,',';s'' . t , ,:,...,., '' (08 Marks) (06 Marks) (06 Marks) 11. 06cs45 USN Fourth Semester B.E. Degree Examination, Dec. 20l3/Jan.2014 Microprocessor Time: 3 hrs. Max. Marks:100 Note: Answer FIVE full questions, selecting atlesst TWO questions from each part. :.1 PART _ d, I ftt I _ A (.) o o a L a. MOv AL, [234PH] ool troo 2 a. b. (!+ gil E* 3 a. b. c. 50i 9= ,6 -?o or= 4 a. b. c. o. 6. tra. o." ;o o= a,i 5 a. Gi !o 5.v >'! bov co0 o= b, EE tr> o- tr< :() 6a. b. AL Write an ALP to sort five 16 - bit number stored in an array in ascending order using bubble sofi algorithm. (10 Marks) Explain the following jump instruction of 8086. Give the format for each : D JA/JNBE ii) JAE/JNB iii) JG/ JNLE iv) JMP v) JNC vi) JNE/JNZ. (06 Marks) Write a delay procedure for producing a delay of 1 sec for 8086 microprocessor working at 10 MHz. (04 Marks) What are macros? Explain the various types of 8086 macros with each. (10 Marks) Explain the 8086 CALL and RET instruction. Write an 8086 procedure to add two l6 - bit number. . ()j (04 Marks) Explain any ltve move instruction coding formats, with examples for each. (10 Marks) Construct the binary code for 8086 following instruction. Express the result in Hexa decimal notation. i)MOV Bt, ii) MOV DS, AX iii) IN AL, 05H iv) ADD AL, v) MOV CS : [BX], DL. (10 Marks) 07H a: oO reads. of DL to address 74B2CH. .:N 6Jtr _co and list out its various features. ii) If the S036 DS registei contain 7000H. Write the instruction that will copy the content 3e j - processor b. What are addressing modes? Explain any three addressing modes. [;:ffifi] c. D If a data segment register contain 4000H what physical address will the instruction o o ! -y> Draw the block diagram of 8086 micro Marks) ,1s'' PART_B -.(04 *, Nutarks; I Write an ALP to read a string check whether it is a Display the alrpropriate message on the monitor (10 Marks) What are assembler directive? Explain the following assembler directive, with example for each: i) ASSUME ii) DB, DD AND iii) SEGMENT and ENDS iv) PROC and ENDP v) PUBLIC. (10 Marks) DQ With a timing diagram, explain 8086 BUS - activity during a write operation. (t0 Marks) INTERFACE 8K ROM using 2732 chips and 4 K RAM using 6116 chip to 8086 assuming starting address for ROM as 40,000H and for RAM at is 44,000H. (10 Marks) o '7 a. o a b. E a. b. Explain with block diagram, the working of 8259 - A priority interupt controller. (10 Marks) What is an interrupt? Explain the various types of 8086 interrupt. (10 Marks) Explain 8255 internal block datagram. Explain its various operational modes. (10 Marks) lnterface DAC to 8086 micro-processor write an ALP to generate a square waveform using DAC. (10 Marks) 12. 06cs46 USN Fourth Semester B.E. Degree Examination, Dec. 20l3/Jan.2OL4 Gomputer Organization Max. Marks:100 Time: 3 hrs. Note: Answer FIYEfull questions, selecting utlesst TWO questions from each part. PART C) o o d I *t a. ,, -A ,''',,,.,"""' n a general block diagram, explain the functions of each of the processor ret*o?[i *r*, b. Highlighting important technological features and advances, explain :"the evolution of c. o (08 Marks) computer over different generations. With suitable example, explain how performance is measured using SPEC rating and give its (04 Marks) significanCe. 6a) oE E"g vO 2 a. ^'oo -'E r' 6l b. EOO o+ !C ()+ ebO tr(f 64) (JE o.: =(i c. 3 a. b. Convert the followjng pair of decimal numbers into 5 bft singed 2's complement binary numbers and perform operations indicated. Also state if overflow occurs. i) - 10 and -_ 13 (additio.n) ii) - 14 and 11 (subtraction) iiD - 3 and - 8 (addition) (08 Marks) iv) - 10and - 13 (subtraction) . .:,, Given the following instrtrotion, rewrite using only,difect, indirect and immediate addressing (05 Marks) modes to achieve the same effest : move 123 (Rr, R ), (&, &). (07 Marks) What is a stack frame? Explain its use in subroutines. What is an interrupt? Explain its ;oncepts and the hardware used to realize it. What is the necessity of DMA? Explain the two modes in which DMA interface transfer data. , Explain the bus arbitration approaches with thoihelp of neat sketches. ' b0: >C tr(d c. 4 a. Explain the combined input/output interface circuit, with help of a neat logic block diagram. b. With respect to USB, di;;;r the USB architecture, addressing and protocol adopted. ' PARr-B 5a. L!! b. >,= c. d. ood -e Z o.tr 6',, a. 7a. o b. > ;lr2ix With a block diagram, explain the organization of 8 M x 32{iffiSfflgSpg {f2fiK tpl:* 8a. b. x 8 memory ohips. .I05 M Explain the working of a dynamic memory cell. What is memory interleaving? {Gp---(on uarrrs) -- ---e- J r -_ Calculate the average access time experienced by a processor if cache hit rate is 0.88, miss penalty is 0.015 milliseconds and cache access time is 10 micros seconds. "". {{4 Marks) Explain. Explain how virtual memory addres-s aS$S translation based on fixed - length pages is organized and achieved. b. c. ':: ffi :E >(10 Marks) ""i".."6tS;: :'':' Aa -E od Foo oE tr9 Vo -,; >r o.r ( operates to (06 Marks) (08 Marks) (10 Marks) -o >! ':.3 6> oqB q= (06 Marks) Explain the design of a 4 - bit carry - lookahead adder. Write a note on optical technology used in CD systems. (08 Nlarks) (08 Marks) (04 Marks) Draw the circuit diagram for binary division. Explain the non - restoring division algorithm, (10 Marks) with suitable example. (10 Marks) Explain the IEEE standard for floating point number representation. Mention and explain the control sequences for execution of an unconditional branch instruction. (10 Marks) With a block diagram, explain the basic organization of a micro-programmed control unit. (10 Marks) ,,