Paper / Subject Codé: 49315 / Computer Graphies S.E. SEM III / COMP / AIDS / MAY 2023 / 05.06.2023 (Requtor (3 Hours) N.B: 1) Question number 1 is compulsory. 2) Attempt any three out of the remaining, 3) Assume suitable data if necessary and justify the assumptions. 4) Figures to the right indicate full marks. Qa) What are homogeneous coordinates? Write a homogenous transformation matrix for translation, scaling, and rotation. b) Explain the working of the Raster scan system with a neat diagram, ©) Explain any 5 principles of animation. @) Scale a triangle A(4,4), B(12,4) and C(8,10) with scaling factor Sx= 2 and Sy= Q2a) Write a midpoint cirele drawing algorithm. Apply this algorithm to find pixel coordinates of the circular boundary only forthe first quadrant, whose radius is 8 units. b) Rotate a line segment with endpoint A (3,3) to B(10, 10) in a clockwise direction by ‘an angle 45 degrees by keeping A (3.3) as fixed point. Find new transformed ‘coordinates ofa fine Qa) _ Explain Flood fill and boundary fill algorithm with a suitable example. Write merits and demerits of the same. b) Derive transformation matrix for 2D rotation about a fixed point. Q4.a) Explain the z-buffer algorithm for hidden surface removal with a suitable example. b) Explain Sutherland-Hodgeman polygon clipping algorithm with a suitable example. QS .a) What is Bezier curve? Write important properties of the Bezier curve b) What do you mean by line clipping? Explain Cohen-Sutherland line clipping algorithm with a suitable example. Q6a) Write a note on 3D projections. b) What is animation? Explain key frame animation. ©) What are the properties of fractals? Explain how the Koch curve is constructed. Calculate the dimensions of Koch curve. 4) What do you mean by aliasing? Explain any two Anti-aliasing techniques. 27037 371A201D27E2008C8663E429CB878A6D Total Marks 80 [05] [05] [05] [05] [10] 10] {10} {19} {10} {10} {10} {10} 05] 105} 105] {05}Qi Q@ 3 Qs B hours) 7 >On> Paper / Subject Code: 50924 / Di ital Logic & Computer Architecture ‘SEVREGULARISEM Il COMPIAIDSIC SCH N.B. 1. Question No. 1 is compulsory 2. Attempt any three questions from 3. Assume suitable data if necessary and 4, Figures to the right i Convert ’) 147 into binary ii) Q3A) in t0 Decimal ii) (135)e in to decimal iv) 234 in to BCD \) 23 into gray code Write a short note on Encoder Differentiate between Hardwired control unit Differentiate between SRAM & DRAM ind Micro programmed control unit, Draw the flow chart of Non Restoring division algorithm and Perform 4 +2 Explain Flynn’s classification Explain the instruction eycle with the help ofa neat state diagram Explain the various addressing modes Using booths algorithm perform -5 x-3 Represent -786.25 using IEEE 754 standards (both single and double precision format) Explain different memory Mapping Techniques List & Explain the Characteristics of Memory What do you mean by cache coherence Draw and explain 4 stage instruction pipelining and briefly describe the hazards associated with it Describe various Bus Arbitration methods 32285 [AS316D9040AA80330B960BCA29706798, Total Marks: 80 os 05 05 05 10 10 10 10 10 10 10 05 05 10Paper / Subject Code: 50923 / Data Structure S.E. SEM Ill / COMP / C SCHEME / REGULAR / MAY 2023 / 30.05.2023 (2) Attempt any three questions out of the remaining five questions QA (@) Explain various types of data structures with example (©) Define Graph and explainvarious graph representationtechnique. 1 Convert the following expresion to postfix. 7 (£4) * (ab) * (eye © itterentiate between B tree and B+ tee. s 2 (@) Apply linear probing and quadratic probing hash function to inset values inthe Hash table of size 10. Show number of collisions occurs in each technique. 10 27, 72, 63,42, 36, 18, 29,101 (©) Construct B+ ree of order 3 forthe following dataset _ 90,27, 7,9, 18,21, 3,4, 16,11, 1,72 3. (@) Write BFS algorithm. Show BFS traversal forte following graph with ll the steps 1 2 G S 10 ¢ 4 5 (©) Write aC program to implement linear queue using aray 10 Q4 (a) Write a program to perform the following operations on the Singly linked list: i. Insert a node atthe end ii, Delete a node from the beginning 10 Search foragiven element in the list iv, Display the ist (b) Write a C program to implement Stack using Linked List é 5 (Write a program to evaluate postfix expression using stack data structure 10 (b) Construct AVL for following elements 10 50, 25, 10, 5, 7,3, 30, 20, 8,15. 6 (@) Construct Binary Tre from following traversal In-order Traversal: DBHETAF ICG 10 Post order Traversal: DHIEBJFGC A ©) Write a C program for polynomial adtion using & Linked 10 27655, Page lof 1 SD7SEA15785AFFAFESS8SF3B3A6B2439Paper / Subject Code: 49322 / Discrete Structures & Graph Theory (3 Hours) N.B. : (1) Question Number 1 is comput (@) Solve any three questions from the remaining questions (3) Make suitable assumptions if needed (4) Assume appropriate data whenever required. State all assumptions clearly. a. Define the following with suitable example a)Ring b) Cyclic Group c) Monoid d)Normal Subgroup e) Planar Graph b. Check whether [(p->q) *-a]> ~p is a tautology c. Determine the number of positive integers n where I< n <100 and n is not divisible by 2,3 oF 5. 4, Prove by mathematical induction that 245+84.....+Bn-1) = nGnt]y2 a Define Equivalence Relation. Let A be a set of integers, Let R be a Relation on AXA defined by (a,b) R (¢,d) if and only if ad = be. Prove that R is an Equivalence Relation ={a, b,c, de} oooll Find the transitive closure of it using Warshall’s algorithm © LetG be a group. Prove that the identity element ‘e” is unique. , Prove that set G = {1,2,3 multiplication module 7 {6} is a finite abelian group of order 6 with respect to b Give the exponential generating function for the sequences i) (LLL. ii) {0,1,0,-1,0,1,0,-1...}. ¢ Determine whether the following graphs are isomorphic. Justify your answer. * A Function f: R- {7 JR — (is defined as f@)= (4x — 5)/@x - 7) 3 3 Prove that fis Bijective and find the rule for f* 30226 1 '832B53B5C36918DC5921A86F ITEASIBIPaper / Subject Code: 49322 / Discrete Structures & Graph Theory Show that (2,5) encoding function e(00)=00000 (0101110 e(10)=10101 e101 is a group code. Check whether Euler cycle and Euler Path exist in the Graph given below. If yes Mention them > BS defined by 6 Consider the Set A=(1,2,3,4,5,6} under multiplication Modulo 7. 1) Prove that itis a Cyclic group. 2) Find the orders and the Subgroups generated by (2,3}and {3.4} State and explain the extended Pigeonhole principle. How many friends must you have to ‘guarantee that at least five of them will have birthdays in the same month. Functions fg.h are defined on a set X= {a,b,c} as F{(@b),b.0)(c.a)) B-(ab)(ba),0.b)) hef(a.a)(b,b),(c.0)} i) Find fog, gof . Are they equal? ii) Find fogoh and fohog? Draw the Hasse Diagram of Drz and Dyos and check whether they are Lattice. Define Bounded Lat Lattice or not and Distributive Lattice. Check if the following diagram is a Distributive Define the following with suitable example. )Hamiltonian path) Euler Circuit c) Sub Lattice d)Group e) Surjective Function 30226 2 832B53B5C36918DC5921 A86F ITEAGIBIS.E. SEMIIL/I7 /-COMP / AIDS / MAY 2023 / 24.05.2023 (Regular) (Time: 3 hours ) NB. (1) Question No. 1 is compulsory (2) Answer any three questions from Q.2 to. Q.6. (3) Use of Statistical Tables permitted. (4) Figures to the right indicate full marks Qi (a) Find the Laplace transform of tV1+sint 5] () Find the constants a, b,c, d, eif [5] fla)= (ax? +bxy?+3x?+ey?+x) + i(dx?y—2y3 texy+y) is analytic (©) Calculate the Spearman's rank correlation coefficient R 0) X : 85, 74, 85, 50, 65, 78, 74, 60, 74, 90 Y 78 91, 78, 58, 60, 72, 80, 55, 68 70 (@)_ Find inverse Laplace transform of tan? (£*#) (3) @. (a) Find the Laplace transform of e~* f) wsin 3u du [61 (b) find the value of kif the function (x)= ka? (1-x4), OS x <1 Faso otherwise Is a probability density function. find mean and variance. [6] (©) Obtain the Fourier series to represent f(x) = x? in (0, 2) m 2 Hence show that = =2 - 5 [8] @. (@) Find the analytic funetion f(z) = u + iv such that (6] 27291 Page 1 of 2 B48727C470D07D6RSES62CAFECBC24EAPaper / Subject Code: 19921 / Engineering Mathematics-II ’ (b) Using convolution theorem Find inverse Laplace transform of Saray (6) (©) Fit a second-degree parabolic curve to the following data Year (x) 1974 1975 1976 1977 1978 1979 1980. 1981 Production (y)-:12 14-26 «| 4240 50 252 $8) [8] 4 (a) Obiain the Fourier series to represent f(x) = 9-x? in(-3,3). [6] (b) Find the coefficients of regression and hence obtain the equation of the lines of, Regression for the following data X: 78, 36, 98, 25, 75, 82, 90, 62, 65, 39. y 84, 51, 91, 60, 68, 62, 86, 58, 53, 47. {6} (©) Prove that fo°e7t S2HSE™ ge = [8] Qs. (a) Find the orthogonal trajectories of the family of curves 3 x2y+2x* -y9-2 y?=c. [6] (b) IFX denotes the outcome when a fair die is tossed, find Moment generating function ‘OFX and hence find the mean and variance of X. [6] (©) Obtain the half range cosine series of f(x )=x(—x) in( 0,7) [8] Q6,a) Find inverse Laplace transform of (6] (b) The probability density function of a random variable X is 7% o 123 4 5 6 P(X=x):k 3k Sk 7k 9k Wk 13k Find k , p(X<4), P(3 Correction in Q.P.Code 10027291 ‘11 message support@muapps.in Wed, May 24, 2023 at 4:45 PM Reply-To: sypport@muapps.in To: exam@kgce.edu.in ee University of Mumbai Enginering Mathematics Ill Correction in Q.P.Code 10027291 Please click on the link given below https: //drive.google. com/file/d/18BE FNwsiLdjBoNbgMAiMry VsDLjSCrAN/view?usp=sharing University of Mumbai bttps://qpm.muapps.in support@muapps.in You have received this email because you are registered with us. To unsubscribe; please reply to this mail with subject "Unsubscribe"% a. -- ; t TTT PEED 10 Fep. Bsent F(x) i 0, Qn) . ‘ . Hence show that @ .1 4,4 4 . Mask Hy SF FESIEO. ge. - (a) Find the analytic function (2) =u | iv such that zs 2sin 2x WAV = ayy nao | en's ieee a OChVE L 27291 a Page | of 2 ‘ 1C4TODOTD: