4th Semester CS / IS (2013-June) Question Papers
Upcoming SlideShare
Loading in...5
×
 

4th Semester CS / IS (2013-June) Question Papers

on

  • 7,443 views

 

Statistics

Views

Total Views
7,443
Views on SlideShare
7,443
Embed Views
0

Actions

Likes
3
Downloads
122
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Adobe PDF

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

4th Semester CS / IS (2013-June) Question Papers 4th Semester CS / IS (2013-June) Question Papers Document Transcript

  • +' ( L st -L-USN Time: 3 hrs. Fourth Semester B.E. Degree Examination, June/July 2013 Engineering Mathematics - lV 1OMAT41 Note: 7. Answer FIVE full questions, selecting at least TWO questions from each part- 2. Use of Statistical tables permitted. b. o g6r *a g+ -a 5.! AE 5 .: (r< ,-i c..i o z tr (07 Marks) c. Using Milne's predictor-corrector method find y(0.3) correct to three decimals given, x -0. r 0 0.1 0.2 v 0.908783 1.0000 f.i1145 1.25253 (07 Marks) Approximate y arrd z at x : 0.2 using Picard's method for the solution "f :: = , , *=*'(y*r) with y(0) = 1,2(0)- Uz. p".foi- t*o steps (yr, !z,zr,h). (r0 Marks) ox Using Runge-Kutta method solve y" : x(Y')2 - f rt r = 0.2 with x0 : 0, y0 : 1, 2a : 0 take 2a. b. a. b. c- 4a. b. c. 5a. b. h:0.2. If (z) : u + iv is anallic prove that Cauchy-Reimann equatiors ux : vy, uy : -vx are true. (10 Marks) Ifw: z3 find dw/dz. If the.potential function is d = log (06 Marks) (07 Marks) . Find the stream function. (07 Marks) Find the bilinear transformation which maps the points z: 1, i, -1 onto the points.w: j, o, -i. (06 Marks) Discuss the conformal transformation w : ez. Any horizontal strip of height 2r in z-plane will map what portion of w-plane. (07 Marks) State and prove Cauchy's integral lbrmula 1 1,1r.t:1*or (07 Marks).,,-*,11,. PART - B ,.I, ,. . t, i r. Prove thar Jl'] =./: ,in*. I i (06 Marks) I 'Tx State and prove Rodrigues formula for Legendre's polynomials. . '-"--, ' ' (07 Marks) Express f(x) : xa + 3x3 - x' + 5r - 2 in terms oflegendre polynomial. (07 Marks) Max. Marks:100 PART-A Use modified Euler's method 1q 561vs :l=x+y. y(0)=l at x = 0.1 for three ilerations dy taking h : 0.1. dx (06 Marks) -dvSolve:r=x+y,x=0, y=1at x:0.2 using Runge-Kutta method. Take h:0.2. dx *t +y' I of 2
  • 1OMAT41 a. The probabilities of four persons A, B, C, D hitting targets are respectively ll2, ll3,ll4, 115. What is the probability that target is hit by atleast one person if all hit simultaneously? (06 Marks) b. i) State addition law ofprobability for any two events A and B. ii) Two different digits from 1 to 9 are selected. What is the probability that the sum of the two selected digits is odd if '2' one ofthe digits selected. (07 Marks) c. Three machine A, B, C produce 50%, 30%, 20%:o of the items. The percentage of defective items are 3, 4, 5 respectively. Ifthe item selected is defective what is the probability that it is . t-om machine A? Also find the total probability that an item is defective. (0? Marks) a. The pdfof x is Find k. Also fu:rd p(x > 5), p(3 < x < 6). A die is tluown 8 times. Find the probability that '3' falls, i) Exactly 2 times ii) At least once ..: iir) At the most 7 times. c- In a certain town the duration of shower has. mean 5 minutes. What is the probability that shower will last for i) 10 minut€s ot more; -ii) less than l0minutes; iii) between l0 and I 2 minutes. (0? Marks) What is null hypothesis, altemative hypothe-sis significance level? (06 Marks) The nine items of a sample have thd following values: 45, 47,50,52,48,47,49,53,51. Does the mean ofthese differ significantly from the assumed mean of47.5. Apply student's (06 Marks) b. 8a. b. (07 Marks) (0? Marks) which predicts proportion of frequencies (07 Marks) t-distribution at 5% level of significance. (to.os for 8df: 2.31). c. In experiments on a peatieading. the fotlowing frequencigs ofseeds were obtained: Is the periment is in the agreement of theory * ln.. 3df = 7.815). x 0 1 2 3 4 5 6 p(x) k 3k 5k 7k 9k 11k 13k 2 of2
  • USN O6MAT41 (07 Marks) (07 Marks) (06 Marks) (07 Marks) (07 Marks) Fourth Semester B.E. Degree Examination, June/July 2013 Engineering Mathematics - IV Time: 3 hrs. Max. Marks:100 Note: 1. lzsper FIVE full questions, selecting ot least TWO questions from each part. 2. Any missing ddta may be suitably ossumed. inaregion, (i) zl < 1, (ii) I < lzl < 2, (iii) zl> 2, (iv) 0< z- 1l< 1, E 2 g YOJ *9 d.9 a,E :9 U< z o E correct to 4 decimal place. (07 Marks) c. If E=2e'-y, yo) :2, y(0.1) : 2.010, y(0.2) :2.040, y(0.3) : 2.090 find y(0.4) dx corrected to 4 decimal places by using Milne's predictor and conector formula (use corrector formula twice). (07 Marks) 2 a. Define an analyic function and obtain Cauchy-Reimann equations in the Cartesian form. (06 Marks) b. Show that the function u=sinxcoshy+2cosxsinhy+x2-y2+4xyisaharmonicfunction and determine the corresponding analltic function. (07 Marks) c. Find the bilinear transformation that maps the points 1, i, -1 respectively onto the points i, 0, -i under the transformation find the image of lzl < 1. (07 Marks) PART - A I a. Employ Taylor's series method to obtain approximate value of y at x : 0.1 and x = 0.2 for the diflerential equation 9 =rr+3e'. y{0) - 0 considering upto founh degree term and dx compare the numerical solution obtained at x: 0.2 with the exact solution y : ,,"',; ir)a.ur, b. Using Fourth order Runge-Kutta method to solve (x+y)+=l, y(0.4) : 1 at x - 0.5,' -dx 3 a. If f(z) : u + iv is an analyic function and f'(z) is continuous at each point with in and on a closed curve c, then show that lf ga, = O . (06 Marks) c b. Expand I ' (z-t)(z-2) (iv) lz- I > 1. c. Evaluate l :!- a, where c : lz = 2 using Cauchy's residue theorem. | (z' -1) a. Obtain a series solution for the diff'erential equation (1 +x'])ql+xqy -y-0.dx' dx b. Obtain the series solution of Legendre's differential equation, 1.u,]:*,'.'1 . rl I (l-xr19 I -2,,q+n(n-11y =6 r,r:, j - dx- dx leading to Legendre's polynomial. 4 c. Prove the following: .r. .t^r=.E{l-l'.i,.,*-l.or*}. J .,1x1 - ,,rxl x' x I ,.r, fT (z 3-x' I -l-{-srn x *-cosx } !nx[x x' )
  • x 0 1 2 J 4 v I 1.8 1.3 2.5 6.3 O6MAT41 PART - B 5 a. Fit a curve ofthe form y-a16v-;cxt to the data bythe method of least squares. (06 Marks) b. Find the lines of regression and hence find the coefficient data: of correlation for the following (07 Marks) (06 Marks) c. Let a and B are any two events, then prove that P(AuB)=P(A)+P(B)-P(AnB)and hence prove, P(AuBr-rC) = P(A) + P(B) + P(C) - P(AnB) - P(BnC) - P(AnC) + P(A^B^C). (07 Marks) a. Find the value of K, such that the following represents a finite probability distribution and find mean and standard deviation also finc I x -3 1 -1 0 1 2 J P(X) K 2K 3K 4K 3K 2K K P(x < 1), (ii) P(x > 1), (ii, P(-1 <x<2) (06 Marks) b. If 10% of the rivets produced by a machine are defective, find the probability that out of 1 2 randomly choosen rivets: i) Exactly 2 will be defective; ii) At least 2 will be defective; iii) None will be defective. (07 Marks) c. 200 students appeared in an examination, distribution of marks is assumed to be normal with mean: p - 30 and S.D. = o = 6.25, how many students are expected to get marks. i) Between 20 and 40 ii) Less than 35. (07 Marks) 7 a. A coin was tossed 400 times and the head tumed up 216 times. Test the hypothesis at 5% level of significance that coin is unbiased. (06 Marks) b. A sample of l2 measurement of the diameter of metal ball gave the mean 7.38 mm with S.D. 1.24 mm. Find 95% and 99%o confidence limits for actual diameter given t6 05(11) : 2.2 and to.or(11):3.11. c. A set of similar coins are tossed 320 times and the observations are (07 Marks) No. ofheads 0 1 2 3 4 5 Frequency 6 27 72 112 71 ) -!. Test the hypothesis that the data follows a binomial distributions. For 5df we have xio, =l1.OZ. (07 Marks) 8 a. The joint probability distribution of two discrete rando- uariable x and y is given by the following table. Determine the marginal distribution of x and y. Also find whether x and y are wtl v x 1 3 6 t//9 t//6 l/ /18 -) 1/ /6 1/ /4 t//12 6 1/ /18 X, %u l0 r 01. rat p=l o 0 tllsan lv, r ,l b. Sho regular stochastic matrix and find the corresponding unique fixed probability vector. s. Explain: i) Regular and irreducible Markov chain ii) Periodic state iii) State distribution and higher transition probabilities. (07 Marks) (07 Marks) 2 of2 x 1 J 4 2 5 8 9 10 13 15 v 8 6 10 8 12 It) 16 10 32 32
  • USN 06cs42 (08 Marks) (06 Marks) (06 Marks) (06 Marks) (08 Marks) Fourth Semester B.E. Degree Examination, June/July 2013 Graph Theory and Combinatorics Time: 3 hrs. Max. Marks:10O:.', *,r",o"'*,1F{[or{:,/,f ,:;:,,;;:;':::f ,;,r,, PART_A I a. Define .isomorphism of graphs. Give an example to show that two- grziphs need not be isomorphic though they have equal number ofedges, equal number of vbrtices with a given q E =v) .= ar io -a o-a EO 6.r i, LE 6.Y aii t< -..i .i o z E degree. b. Write a note on "Konigsberg-Bridge" problem. c. Define the following terms with an examples: i) Spanning subgraph ii) Complement of a graph iii ) Self complementary graph. a. Show that every simple graph has number of vertices of odd degree is even. (06 Marks) b. Prove that a simple connected graph with n vertices (n > 3) is Hamiltonian ifthe degree of a. Obtain a prefix code for the message ROAD IS GOOD using labeled binary tree and hence b. Show that the complete graph K5 is non planar. (05 Marks) c. Using the Kruskal's algorithm, find a minimal spanning tree of the weighted graph shown below: (07 Marks) Bc every vertex is greater than or equal to r/2. c. Find the chromatic polynomial for the graph c. State and prove "Max flow-Min cost" theorem. . . .i:'. .,.. K 4 a. Explain Prims algorithm for finding shorlest sparuring tree of a weighted graph. (06 Marks) b. Show that in any connected planar graph with n vertices, e edges and f faces e -n+2: f. (08 Marks) (06 Marks) 1of2
  • 06cs42 PART-B 5 a. Using the principle of inclusion-exclusion, determine the number of positive integers n, where 1<n< 100 and n is not divisible by2 or3 or 5. (08 Marks) .. b. Find the coefficient of xef in the expansion of (2x - 3y)r2. (06 Marks) ' _... . c. A woman has 11 closed relatives and she wishes to invite 5 of them to dinner. In how niariy ':.-:., way can she invite them in the following situations: i) There is no restriction on the choice. - - iD Two particular persons will not attend separately. , iir) Two particular parsons will not attend together. (06 Marks) ,l]:..' 6 a. Orifb$f! students in a hostel, 15 study history 8 study economics and ( study geography. It is tnOdiifhat 2 student study all three subjects. Show that 7 or more students study none of these suff,.i{s., (06 Marks) b. Define ordLibiy,generating function and the exponential generating function. Give one example lor eaih. (06 Marks) c. Find the coefficidniof Xr8 in the produdt (x+x2+x3+xa+x)1x'+13+v4+...;s. ' , 08 Marks) 7 a. Define reclrrence relation and give two examples. (04 Marks) b. Solve the recunence relation:ao'--3a,-r :5 x 3n, for n > I given that ao: 2. (08 Marks) c. Determine the sequence generateil f5, each ofthe following exponential generating function: i) 6e5* - 3e2' ii) e'* - 3r' + 5x' ,7x. , _,. - (08 Marks) '... 8 a. Using generating function, find th6.iiumber of partition of n = 6. (07 Marks) b. Determine the solution for a, = 7a,-1, where n 2 1, given that a2 : 98. (07 Marks) c. Write the procedure of method of generating functions. (06 Marks) !* ,. !* !t ,. ,,1'1. 2 of2
  • 10cs42I]SN Fourth Semester B.E. Degree Examinationo June/July 2013 Time: 3 hrs. Graph Theory and Gombinatorics Notez Answer FIVE full questions, selecting at leost TVItO questions from each part. PART-A I a. i) Define connected graph. Give an example ofa connected graph G where removing any edge of G results in a disconnected graph. ii) Define complement of a graph. Find an example of a self-complementary graph on four vertices and one on five vertices. b. Find all (loop-free) non-isomorphic undirected graphs these graphs are connected? c. Show that the following graphs in Fig. Q1 (c) are isomorphic: Max. Marks:100 (06 Marks) with four vertices. How many of (05 Marks) (05 Marks) :() 0z q; o; !J; o- :: Q< o z a E 2a. b. Fig. Q1 (c) How many different paths of length 2 are there in the undirected graph G in Fig. Q1 (d)? (04 Marks) 0, e, Fig. Q1 (d) Define Hamilton cycle. How many edge-disjoint Hamilton cycles exist in the complete graph with seven veftices? Also, draw the graph to show these Hamilton cycles. (06 Marks) Define Planar graph. Let G : (V, E) be a connected planar graph or multigraph with lvl = v ana lrl - e. I-et r be the number of regions in the plane determined by a planar embedding 0+G. Then prove that v - e + r = 2. (07 Marks) c. i) Find the chromatic number of the complete bipartite graph K,,n and a cycle, Cn on n vertices, n 2 3. ii) Determine the clromatic polynomial for the graph G in Fig. Q2 (c). (07 Marks) Fig. Q2 (c) I of 3
  • 3a. b. 10cs42 i) Prove that in every tree T = (V, E), lel = lVl- I . ii) Let Fr : (Vr, Er) be a forest of seven trees, where lE,l = +O . Wtrat is lV, I Z (07 Marks) Define : i) Spanning tree ii) Binary rooted tree. Find all the nonisomorphic spanning trees ofthe graph. Fig. Q3 (b). (06 Marks) 4 a. Apply Dijkstra's algorithm to the digraph shown in Fig. Q4 (a) and determine distance from vertex a to each ofthe other vertices in the graph. c. Defi1ie prefix code. Indicite the code. b. Define the following with respect to a graph: i) matching graph in Fig. Q4 (b) has a complete matehing from Vr to Vz. Fig. Q3 (b) Obtain an optimal prefix code for the message ROAD IS GOOD. (07 Marks) the shortest (07 Marks) ii) a cut-set. Show that the Obtain two complete matching. (07 Marks) 5 Fie. Qa @) c. For the network shown in Fig. Q4 (c), find the capacities ofdll the cutsets between A and D, and hence determine the maximum flow between A and D. (06 Marks) Fig. Q4 (c) PART * B How many arrangements ofthe letters in MISSISSIPPI have no consecutive S's? (05 Marks) i) Find the coefficient of iwaxz in the expansion of (3v+2w+x+y+z)8. ii) How many distinct terms arise in the expansion in part (i)? (05 Marks) How many positive integers n can we form using the digits 3,4,4,5,5, 6, 7 if we want n to exceed 5000000? 105 Marks) A message is made up of 12 different symbols and is to be transmitted through a communication channel. In addition to the 12 symbols, the transmitter will also send a total of 45 blank spaces between the symbols, with at least three spaces between each pair of. consecutive symbols. In how many ways the transmitter sends such a message? (05 Marks) 2of3 a. b. d. b, q
  • 10cs42 6 a. In how many ways can the 26 letters ofthe alphabet be permuted so that none ofthe pattems spin, game, path or net occurs? (07 Marks) Define derangement. In how many ways can each of 10 people select a left glove and a right glove out ofa total of 10 pairs ofgloves so that no person selects a matching pair ofgloves? (06 Marks) Five teachers Tr, Tz, Tl, T+, Ts are to be made class teachers for five classes Ct, Cz, C* Cq, Cs. one teacher for each class. Tr and T2 do not wish to become the class teachers for'Cr or C2, T3 and T+ for C+ or Cs and Ts for C: or C+ or Cs. In how many ways can the teachers be assigned the work? . (07 Marks) Find the generating function for the following sequences: i) 12,22,32,42, ..... iD 02. 12, 2',3', ..... iii) 0,2,6.12,i0, ..... (06 Marks) Use generating function to determine how many four element subsets ofS : {l. 2. 3, ... 15} contain no consecutive integers? (07 Marks) Using exponential generating function, find the number of w.ays !n which 4 of the letters in the words given below be arranged: D ENGINE ii) HAWAII (07 Marks) The number of virus affected files in a system is 1000 (to start with) and this number increases 250% every two,lours. Use a recurrence relation to determine the number of virus b. 7a. b. c. 8a. b. c. (05 Marks) (07 Marks) (08 Marks) affected files in the system after one day. Solve the recurrence relat ion: a,,,, - 10a"., +21a,, = 3n' -2. n > 0 Using the generating function method, solve the recurrence relation, a,,-3a,r =D. h2 I given ao =l i'.:* i' * 'f 'r 3 of3
  • 06cs43IJSN Fourth Semester B.E. Degree Examination, June/July 2013 Time: 3 hrs. La. b. c. I 3s ,,i:; bol E.9 9!5 -(J 5r o. 6. 5d aE qi! (J< ...i 6i o z o o E methods. 6 a. What is hashing? Explain the various collision resolution techniques. b. Compare dynamic programming with divide - and - conquer. c. Explain Warshall algorithm, with an example. (08 Marks) (06 Marks) (06 Marks) Analysis and Design of Algorithms Note': Answer FIVE full questions, selecting atleast TWO questions from each ptrt. PART-A (07 Marks) (08 Marks) (05 Marks) a. Explain worst-case, best-case and average-case effrciencies, with a specific example. b. List and explain basic asymptotic effroiency clases. [3: ffifi] c. Give the general plan of analyzing efficibney of non -recursive algorithms. (06 Marks) a. What is Brute force? G ive example. b. State the merge soft algorithm and analyse its efficiency. b. What is decrease - and -conquer? Explain. c. Expiain the following : i) Topological sorting ii) Depth frst search. PART - B a. State and explain four rotation types used in the construction AVL tree for the list 5, 6, 8, 3, 2, 4, 7 by successive insertions. b. State and explain Horspool's algorithnl with an example. c. Discuss whether the traveling sales person problem canbe solved by exhaustive search (06 Marks) a. Design a divide -and -conquer algorithm for computing the nirmber of levels in binary tree. (10 Marks) (04 Marks) , (06 Marks) Max. Marks:I00 (04 Marks) (10 Marks) of AVL tree. Construct an. (10 Marks) (10 Marks) 1of2
  • r I t" "non. ,/Wr, .S"-"'4- d=V-}t .*k) 06cs43 7 a. How is the Kruskals algorithm different from Prim's algorithm? Apply Krushkal's algorithm to find a minimum spanning tree of the following graph. (08 Marks) %^ -ilz S' t. prpru#tbfgncept of decision trees for sorting algorithmr. ,-Q5* (06 Marks) c. Explain HuY#,trees, with example. ^ (,' (06 Marks) '/ ,,. ,'; 't.t I write ,non no," Jf,Q61 m* il Btil;IliiTi,,, % {s c. N-P-hardproblems '+r. ,-h'd. N*P-completesproblems. /lra (j" (20Marks) "1 ", -l r {$ r#"_' -r..* +'+ * ,r ,L i * .1rY=d -r' r'("/- "- t" ) {7t .' {- ? /. - ft^I) hCrJ (l - u ( -r- r-J c v v,-". ]& ..{1} " " } " q',1 " .,S- -fi?'- xr., .G. _ -u ' .., ^ot' .;..J i:v - ,$r ''# " . r' : -XY] '*/f .* "7
  • USN 10cs43 Fourth Semester B.E. Degree Examination, June/July 2013 Design and Analysis of Algorithms Time: 3 hrs. Max. Marks:100 Note: Answer FIVE full questions, selecting ot leosl TllO questions from each part, PART - A 1 a. What is an algorithm? What are the properties of an algorithm? Explain with an example. (08 Marks) b. Explain brute force method for algorithm design and analysis. Explain the brute force string o ,.< -oo I YOJ ts a: bU -@ 9= d"& 9J :; (-) < -i ..i o z ts o matching algorithm with its effrciency. c. Express using asymptotic notation i) n! ii) 6 * 2n + 12. ,- Explain divide and conquer technique. Write the algorithm for binary search and find (10 Marks)average case elfi ciency. What is stable algorithm? Is quick sort stable? Explain with example. (06 Marks) Give an algorithm lbr merge sort. (04 Marks) 3 a. Explain the concept of greedy technique for Prim's algorithm. Obtain minimum cost spanning tree for the graph below Prim's algorithm. (09 Marks) Fig.Q.3(a) shortest path problem assuming vertex 5 as the source. (09 Marks) b. c. (08 Marks) (04 Marks) (02 Marks) graph whose weight c. 1a. Fig.Q.3(b.) Define the following: i) Optimal solution; ii) Feasible solution. ' . solve the all pair shortest problem forUsing Floyd's algorithm matrix is given below: tO co I ool l, o - "ol l"" 7 o rl [u co co o] 1of2 (07 Marks)
  • b. Using dynamic programming, solve the following knapsack instance. N:4 M:5 (Wr, Wz, W:, Wq) : (2, 1,3,2) (Pr, Pz, P:, Pi : (12, 10, 20, 15). Outline an exhaustic search algorithm to solve traveling salesman problem. PART - B Write and explain DFS and BFS algorithm with example. l0cs43 (05 Marks) (08 Marks) (08 Marks) (05 Marks) (07 Marks) (08 Marks) c. 5a. b. Obtain topologies sorting for the given diagraph using source removal method. Fie.Q.5(b) c. Explain Horspool's string matching algorithm lbr a text that comprises letters and space (denoted by hyphen) i.e "JIM-SAW-ME-IN-BARBER-SHOP" with pattem "BARBER". Explain its working along with a neat table and algorithm to find shift table. 6 a. Define the fbllowing: i) Class P ii) Class NP iii) NP complete problem iv) NP hard problem. ta. b. c. d. b. Write the decision tree to sort the.elements using selection sort and find the lower bound. (08 Marks) What is numeric analysis? (02 Marks) Briefoverflow and underflow in numeric analysis algorithms. (02 Marks) What is back tracking? Apply back tracking problem to solve the instance of the sum of subset problem; S = {3, 5, 6, 7} and d: 15. (07 Marks) With the help ofa state space tree, solve the following instanoe ofthe knapsack problem by the branch-and-bound algorithm. (06 Marks) Item Weight Value 1 2 3 4 4 7 5 3 40 42 25 12 Knapsack Capacity w:10 c. Explain how backtracking is used for solving 4-queen's problem. Show the state space table. (07 Marks) 8 a. What is prefix computation problem? Give the algorithms for prefix computation which uses: i) n processors; ii) r/logn processors. Obtain the time complexities of these algorithms. (10 Marks) What is super linear speed up? Obtain the maximum speed up when P: 10 and various values of f= 0.5, 0.1, 0.01. (05 Marks) What are the different ways of resolving read and write conflicts? (05 Marks) 2 of2 b.
  • USN Time: 3 hrs. 10cs44 Max. Marks: 100 (06 Marks) (06 Marks) Fourth Semester B.E. Degree Examination, June/July 2013 UNIX and Shell Programming Note: Answer FIVE full questions, selecting at least TWO questions from each part E E9 Cq .9(n -a or :E 6 .9. -;o 6= 3: U< -l ..i o z E PART _ A I a. With a neat diagram, explain the architecture of unix operating system. (08 Marks) b. With the help of a neat diagranl explain the parent-child relationship. Explain unix file 2a. b. 6a. b. C. system. c. Explain briefly absolute pathname and relative pathname with examples. relative manner with an example. c. Explain the tkee different modes in which "Vi' editor works. Give the significance ofthe seven fields ofthe'/, - /" command. (07 Marks) What is file permission? Explain how to use "Chmod" command to set the permissions in a 3 a. Explain the standard operating system. input, standard output and standard error with (07 Marks) (06 Marks) respect to UNIX (07 Marks) (07 Marks) (06 Marks) b. Explain the mechanism ofprocess creatlon. c. What are environment variables? ExpJain any four. 4 a. Differentiate between hard link and soft link with examples. b. Explain "sort" command briefly. Also discuss its important options five). c. Explain the following commands with example: i) head ii) tr iii) uniq iv) find PART - B 5 a. Explain 'grep' command with its options. (08 Marks) b. Explain line addressing and context addressing in "sed" with examples. (06 Marks) c. W}at are extended regular expression (ERE)? Explain any four ERE sel used by "grep" and "egrep" (06 Marks) Explain the use of"test" and [ ] to evaluate an expression in shell. (06 Marks) Explain the shell features of"while" and "for" with syntax. (06 Marks) Explain the "expr" command applicable to computation and string functions. (08 Marks) 7 a. What is AWK? Explain any three built-in functions in AWK (07 Marks) b. Write short notes on operators and expressions in AWK. (06 Marks) c. Explain built-in variables in AWK. (07 Marks) 8 a. List the string handling functions in PERL. Write a program to find number of characters, words as well as to print reverse ofa given string. (08 Marks) b. Explain "chop( )" and "split( )" functions with examples. (06 Marks) c. Explain file handling in PERL. (06 Marks) (06 Marks) with examples (any (06 Marks) (08 Marks)
  • USN 10cs45 Max. Marks: 100 (08 Marks) (06 Marks) (06 Marks) (06 Marks) Fourth Semester B.E. Degree Examination, June/July 2013 Microprocessors Time: 3 hrs. Notet Answer FIVEfull questions, selecting ot least TWO questionslfrom each part. i:,,9 E 3q --l tq o! '; ^ !'= d3_ 6.n o. ;: !r< z E E 3a. b. c. 4a. PART_A a. Draw the physical memory system diagram for intel Pentium microprocessors. (06 Marks) b. Discuss the functions of segment registers of 8086 with examples. Give some advantages of memtrry segmentation. c. What is pipelining? How is it achieved in 8086? 2 a. Explain how virtual address is translated into physical address with a neat diagram. (08 Marks) b. Identiry the addressing modes ofthe following instructions and explain them briefly: i) Mov woRD PTR [Sr], 20H ii) MOV ES: U000Hl. loH iii) Mov cx. NUMIBX I Dll c. Briefly explain the flat mode memory model with a neat diagram. Write an ALP using 8086 instructions to search a number placed in location NIJM, in an array of ten numbers placed at locdi.ion ARRAY. Give suitable messages. (08 Marks) Describe the lollowing instructions wirh an example: i) LEA i, XCHG iii) DAA iv) MUL (08 Marks) Give the state of all the status flag bits after the addition of 30A2H with F01CH. (04 Marks) Explain the lollor.r ing assembler directives with examples: i) DB ii) EXTRN iiD PROC iv) SEGMENT. (O8Marks) Differentiate between procedures and macros. (04 Mrrks) Write an ALP using 8086 instructions to reverse a four digit number. (08 Marks) PART - B What is inline assembly? Explain its need (06 Marks) State the C language elements that can be used in the arm block (06 Marks) Explain the basic rules for using assembly language with C/C++ for 16-bit DOS applications with the help of examples. (08lrlarks) Explain the functions of the following pins of 8086 microprocessor: D ALE ii) INTR iii) HOLD iv) RESET v) BHE (05 Marks) Explain how address demultiplexing is done in 8086 processor based systems. (07 Marks) With a neat timing diagram, explain memory read cycle. (08 Marks) b. 5a. b., c,._.. 6a. b. c- 1 of 2
  • 10cs45 7 a. List various memory devices. (02 Marks) b. What is memory address decoding? Design a memory system for 8086 for the following specilications: i) 32 Kbles EPROM using 16 Kble devices. - ii) 64 Kbytes SRAM using 16 Kbyte devices. &,. Drawthe memorymap. (loNq{F }- :- . ". What are the sources of intemrpts? Briefly explain the steps taken by a processor to Shit" dirr: m intemrpt instruction. {Ut arks) .J'- -. ,.J 8 a. &iefly explain the control word format of 8255 in l/O mode and BSR* @el Cive the CcAtrnl word format to Drosram Port A and Port C lower as inout and Pbd B and Port Cword format to program Port A and Port C lower as input an{ Rbd B and Port C ygutput parts in mode O. ^ ' (10 Marks) b. iliiffi;iP ,irltrg soSo instructions to read a byte of data mpfr.t A and iisplay its parity stalflfr],s OOH or FFH for odd and even parity respectivel;(dtiFort B. (05 Marks)parity staBp,s OOH or FFH for odd and even parity respectivel;qqnYort B. (05 Marks) c. List the feaidrgnot SZS+ PIT (Programmable Interval Time.l. { }) ' (05 Morks) v, I ''q.' ****{' 'ltt'(l^ 2 of2
  • FRLIII : F.i]{ t.JD. : ll nrr= lEl1f 11:lfFl1 Fourth $emester B.E. Dcgree Eraminatioa, Jurle/July 20!.3 Microprocessors UgN Tinre: J hls. 06cs45 (I0 lllarkr) j.x. 00 r0H. {10 ttprksJ ,c n ; s a& .eH .E r.l Pii B,A '!. a 6v E'i ES EE E r-! -r r.i ; E 1 rt. b. 2 a.. Max, Marks:100 Note: ;{rrsu,er ./i'1VE JtuII questiolqs, aeleeting t-ll<art TW(I questlons fto*t each ltar!, t Alr'{ - A What do you rnean by pipelirrrd ai.chitectui.e of CPU? Erplain thr specific t"unction cf the lcrllcwirrg rcgistcrs. i) AL iiJ Bx iii) DX iv) CI.,. (10 ilrEllis) Explajr ifl deleil, cor)dit;o arrrl conu"r,l {:lags o1808{r. (10 M{rks) Whal are the lvpes o1'nu1n[015 uscd ir'] data stalerllents? f:xplaii] wilh an extrn;:le cash. h. Draw the ton:plate and generate the code lbr the tbilorving ; i) MOv AL, [Sr] ii) lN AX, 83H iii) MoV CX, [437AH] iv) MOV 3 a. Hxp!ain the addressing modes trf 8Q86. h. Dxplait! the ste,ps to conyert an algorithffi to assernl.r)y Ialgurrgc pragxll. o. Iixplain tlle technique$ used lirr dcbugging assrrnbly lauguage progrnrns. a, trltite ru 8086 ALt to find the thc;torial ofanumbcr Lrsing recursive algorithrrr. iro Mtt*si b' write pseudocode iud progrirm 1,, eompa!'e tho user cntcred password with the passrvorti in tha memoty. lf c.orrect allow the user to access the systen, else sound an alarur. (il) M*rks) PART. ts a. L)ifferentiate betlveen th€ fo)lou,ing peir otinsl,rrcriol]s : iii) NOT and NEC (1t Mrrks) (04 M8rks) (G5 llorks) {10 IUarksi i) CMP and SUB iv) MOV and MOVSB ii) AND and TEST v) LAI I.F and SAHF. ii) ALrGN 16 iji) INC BYI-E PTRIBX) v) ASSUME CS ; COIJE. (r0 firksl 6 a. with a neal diagram. descrihe how addrESS sint out 0r tlie E0B6 date bus ere dernultjpicxeri. b. Explaifl thd hus activities 01 8086 duriug a read machine cycle. [:: l;:[jc. Explnin with a diaEtrarrr, rhe rnecharrisrn in 80g6 for acldiessfurg a wrird et *, "r"i uJA.*ir, (06 Msrks) a. Explai'.the sequence of ope*ltion fblrowed arier th* executior] gf.rNTR irte*uor. write rim:ng diagr.nm. , / ij.t, -- ;i; r;;;;;b. Explain thc strudruxe of iirrgrflrp] -vec.tor lalllt /i:_:?::. {t)5 Melks) c. Descrihe the aLrtion takeh hy 808d rvhcn NIr{I pin is uctivflk,(i/,j:; , i;;,iil;j a. Hxplairr thc ftothorls of perEllcl data trauril'er. , ' b. Explain thc control $,ord formats of3255. I l:: lli":'] c. E.rplaln rnodet and moa"i operari.r] orAZ:S, H il:ll:] b. What happcns whcn following asscmblcr directives are rxeotted? j) $ DB I Dup (?) iv) Delay IiNDP
  • l2,L USN 10cs46 Fourth Semester B.E. Degree Examination, June / July 20L3 Gomputer Organization Time: 3 hrs. Max. Marks: I O0 Notet Answer any FIVE full questions, selecting atleast TWO questionfrom each parl PART - A I a. With a neat block diagram, discuss the basic operational concepts of a computer. (06 Marks) b. List the different systems used to represent a signed number and give one example for each. Speci! which number representation system is preferred in a computer and why? (04 Marks) c. Perform the following operations on the 5 - bit signed numbers using 2,s complement representation system. Also indicate whether overflow has occurred. D (-10)+(-13) iD (-10)-(+4) iiD (-3)+(-8) iv) (-10)-(+7). (r0 Marks) 2 a. Define addressing mode. Explain the following addressing modes with an example for each: i) Index addressing mode ii) Indirect addressing mode iii) Relative addressing mode E g CP Eh o; 3 ,t: 99 .sd d.g 5d 0) td- i '+- r.7 < o z 3 a. With neat sketches, explain various methods for handling multiple intemrpt requests b. Define bus arbitration. Explain in detait any one "or."r; ";;; ".u,,."., ' li3 Uflll iv) Auto decrement addressing mode. b. With a neat block diagram, describe the input and output operations. c. Discuss briefly encoding ofmachine instructions. With a neat diagram, explain in detail the input interface circuit. List out the functions ofan I/O interface. Discuss briefly the protocols ofuniversal serial bus. PART - B Briefly explain any two cache mapping functions. (10 Marks) (05 Marks) (05 Marks) (10 Marks) (03 Marks) (07 Marks) (06 Marks) 4a. b. c. 5a. b. With a neat diagram, explain the translation ofa virtual address to a physical address. (08 Marks) c. Discuss in detail any one feature of memory design that leads to improved performance of computer. (06 Marks) 6 a. Perform signed multiplication of numbers (12) and (-11) using Booth,s algorithm. (08 Marks) b. GivenA= 10101 and B:00100 perform A/B using restoring division algorithm. (08 Marks) c. Design a logic circuit to perform addition / subtraction of two ,n, bit numbers X and y. (04 Marks) 7 a. Write down the control sequence for the instruction Add R4, Rs, Rs for three - Bus organization. (04 Marks) b. With a neat sketch, explain the organization of a micro programmed control unit. (08 Marks) c. With an example, explain the field coded microinstructions. (08 Marks) 8 a. Describe the working of message passing multicomputer (MPM) architecture. (08 Marks) b. Briefly explain any two parallel computer architecture. (08 Marks) c. List out any four differences between shared memory mqfiffiqSsor and cluster. (04 Marks)
  • USN 06cs46 Max. Marks:100 Fourth Semester B.E. Degree Examination, June/July 2013 Gomputer Organization Time: 3 hrs. Notez Answer FIVE full questions, selecting atleast TIV'O questions from each port. E E g -^t .EA Y.l -+i'CA .)E 6tZ o. i; rr< o z o E 2 a. What is an addressing mode? Explain four different addressing modes with an example for each. b. Define subroutine. Explain subroutine linkage. using a link register. c. Explain shift operation with example. 3 a. What is the need for disabling interrupts? What are the diflerent can be disabled and enabled? b. Draw neat timing diagrams and explain i) tnput transler on a synch-ronous bus ii) Input transfer, using multiple clock cycles. 4 a. Explain the different phases in the operation ofthe SCSI bus. b. With a neat block diagranl explain a general 8 bit parallel interface circuit. PART_A I a. What are the factors used to judge the performance of a computer? Explain any three of them. (10 Marks) b. Explain the different functional units of a computer, with a neat block diagram. (10 Marks) (10 Marks) (06 Marks) (04 Marks) ways in which interupts (10 Marks) (10 Marks) (10 Marks) (10 Marks) 7 8a. b. c. a. b. PART - B a. Explain the.d,ifferent mapping functions used in cache memory. (10 Marks) b. Draw a neat block diagram and example internal organization of a 2M x 8 dynamic RAM memory chip. (10 Marks) a. Draw a block diagram and explain how a virtual address from the processor is translated into a physical address in the man memory. (10 Marks) b. Explain how a 16 bit carry look ahead adder can be built from 4 - bit adder. (10 Marks) Trace the steps in Booth's implementation to multiply *13 x - 6. 106 Marks) Illustrate the steps for restoring division algorithm and non restoring division algorithm on the following data : Dividend: 1000 and Divisor: 11. (10 Marks) c. List the rules for addition, subtraction, multiplication and division of floating point numbers. (04 Marks) Draw a figure ofthe single bus organization ofthe processor unit. (t0 Marks) List the actions needed to execute the instructions add(R3), R1. Write the sequence of control steps to perform the actions for a single bus structure. ,--,' ', .. (06 Marks) Explain the control unil ola hardr.r ired control unit. . :. (04 Marks) i ,,,. .,. . ,. *+*r<{<