@ SOMAIYA Maximum Marks: 100 Examination: ESE Examination Semester: August 2022 - December 2022 Programme code: 116U01 Programme: B.Tech Computer Engineering Class: TY Semester:V (SVU 2020) Name of the Constituent College: K, J. Somaiya College of Engineering Name of the department: COMP Course Code: 116UC501 Name of the Course: Software Engincering Tustructi 3) Assume suitable data wherever necessary 1)Draw neat diagrams 2) All questions are compulsory ‘Que. ] ‘Question Max. No. Marks [Qi | Solve any Four 20 i) | Explain size oriented software product metrics. 5 State and define non-fictional requirement in software engineering. ao Describe refinement in software design process. 5 iv) | Describe the importance of deployment diagram in system implementation, ae v) _| State and define the goals of software testing. 5 vi)__| Explain the different elements of activity diagram. 3 ‘Que. Question Max. No. Marks @A | Solve the following 10 i) | Explain the importance of estimation in software project planning. 5 ii) | What is Scrum? Explain its features. 5 OR @A | Explain the waterfall software development life cycle model and state its 10 advantages and disadvantages. (Q2B | Solve any One 10 i) | Draw the use case diagram for library management system and state the 10 function of extend and include relationship. | Explain the different types of relationship in class diagram with suitable 10 example. | | Que. Question Max. No. Marks Q3_| Solve any Two 20 i) _ | Explain user interface design niles in detail. 10 ii) [Define coupling and cohesion. Discuss the variou8 types of coupling and | 10 cohesion. a | iii) [Explain version control and change control in software configuration | 10 management.Que. Question No. Q4 [Solve any Two ) ei the reficorny yes Tn mapping model io Gale Wil UHGBIC Gods Be required part of the example. 4i)_| State the different sources of tsk aid deseribe ‘management approach, a tii) "| Explain “software maintenance. Describe different types of software | Ti maintenance, ‘Question Max. Marks Write notes on any four 20 State chart di 3 Component based software engineering 3 i 5 COCOMO Model - 3 Boundary value analysis 3 PERT for Risk analysis and management 522-|2-d090(E) O, SOMAIYA Semester: August 2022 — December 2022 Maximum Marks: Examination: ESE Examination Duration:3 hrs. ‘Programme code: 03 Clase: TY ‘Semester: V Programme: B Tech Computer Engineering “ (SVU 2020) Name of the Constituent College: Name of the department: COMP | Kd. Somaiya College of Engineering Name of the Course: Computer Graphics Course Code: 116U01ES11 Instructions: 1)Draw neat diagrams 2)Assume suitable data If necessary Question Max. No. Marks §1_(@) | Explain application of Gmmputer Graphics in Health Gue.| 05 QUCb) _| Compare Random Scan and Raster scan display. 05 QU © _ | Witean algorithm to draw line using Bresenham’s algoritim. 10 a Explain the OpenGL Line Functions citing examples with pseudo code. Q2(@) | Find the transformation matrix that transforms a square ABCD to half of its size | 10 with the center remaining at same position. The co-ordinates of the square are AQD,BG.1),CG,3),DG,3)and center at (2,2).Also find the resultant co- ordinates of the square , @) | Discuss the fixed point 2-D scaling with an example . 10 OR Describe the3D viewing pipeline, Q3(@) | Use the Cohen Sutherland line clipping algorithm to clip two lines PIP? and] 10 P3P4, Given data: P1(40,15)-P2(75,45) and P3(70,20) - P4(100,10) against a window A(50,10), B(80,10), C(80,40), D(50,40). Q@b) | Explain 3 D rotation w.r. all 3 co-ordinate axis « 10 OR Explain Sutherland Hodgeman Polygon clipping with appropriate example, 4) Write in brief about Projections with diagram . 10 Q4@) | Discuss the OpenGL visibility detection famctions. and @ive pseudo Code.| 10 OR ‘Write a short note on Depth Buffer Method wa dingam. Q5(@)__| Discuss Computer Animation and stages of Designing of Animation Sequences 10 ~ [Attempt ony fuse | Q5(b) State the Beziér Spline Curves Properties Oo 10 Weute short nak on Colon Mo dele. (5) Explain the OpenGL curve functions . (sK. J. Somaiya College of Engineering Engineering D721 2022 CY oo Somaya Semester: August 2022 — December 2022 7 Maximum Marks: 100 Examination: ESE Examination Duration:3 Hrs. Programme eode: E ' owen ; Class: TY __| Semester: V (SVU 2020) Name of the Constituent College: Name of the department: Computer Course Code: |) 50 4£ 512. Name of the Course: Advanced Databases and Data Warehousing Instructions: 1)Draw neat diagrams 2) All questions are compulsory 3) Assume suitable data wherever necessary | Que. Question | Max. No. - Marks QI | Solve any Four 20 i) | Draw the different parallel database architecture 4 ii) | Explain bitemporal databases with example 5 iii) | Briefly explain Features of NOSQL 5 iv) | Whatare the advantages of distribuied database 5 v)_ | What ate the characteristics of Data warehouse explain : SS bist the odvactages of OUK? wont OLTP eS Que. Question Max. | No. Marks Q2A | Solve the following - 10 i) | Give the difference between Inter Query and Intra Query Parallelism with an 5 example ii) __| Compare intraoperation Parallelism and interoperation Parallelism withan example 5 OR @A 10 Explain the transparency features ofa DDBMS. Q2B | Solve any One 10 i) 10 Consider the following two sites in distributed database system Site 1 Database : Employee | Number of Records ; 100 Emp id | Name_| Address | Contact No. | Depariment | 4 bytes | 8 bytes | 20 bytes | 5 bytes [4 byes | | | Site 2 :Database: Project Allotted , Number of Records : 80 Project id | Emp id | Project Name | Location bytes [abytes |Sbytes | 8 bytes Comsidy. Br fettors qi |) Q: “Find Name of the Employes working on the projects located “Delhi” OR “Mumbai A Show the strategies of decomposing and executing the above query at site 1 along with data transfer cost using Natural Join B Find the data transfer cost using Semi Join Operation for the ‘optimized strategy ibei) | What are the advantages, applications of spatial database. | List the different data types available in spatial database, es Que. Question Max. | No. Marks Q3_| Solve any Two . 20 i) | Gemepere Se. Y NOSQL databases. What ure the advantages of using NoSQL | “10 |__| explain with example i) | Explain Document type NOSQL and Cup operation for managing library | 10 books ii) Explain Key Value type NOSQL its features for storing products on Amazon | Que. Question Max. | No. Mark 8 Q4_| Solve any Two 20 “))__| Explain the Data warehouse architecture with diagram ——_ 10 ii) _| What are the different ways of Extracting data for Dataware 10 iii) | Why transformation of data required .Show the different types of transformation | 10 { whieh can be applied on facebook users datawarehouse ‘Que. ‘Question Max. No. Mark s Q5_| (Write notes / Short question type) on any four ; = ~, 120 i) lain peers topty rwatkod of Conturledy Corral si, ddfnbiled 5S ii) __| Difference between Star'scheina arf snowtlake schéma 5 iii) | College wants to manages applicants all data w.r.t admissions. Suggest an analysis and 5 an NOSQL database to store data, justify your suggestion | 3 Compare RULAP and MOLAP with-architectufe dagram_ = 5 Give cramp Slice and dice OLAP operation 3 her od age and discdvotoge 4 bopdowrw pptoath % britdrg” ot awoyehouse 2hMaximum Marks: 100 Examination: ESE Examination Programme code: 1601 Programme: B. Tech Computer Engineering ‘Name of the Constituent College: K. J. Somaiya College of Engineering Name of the department: Computer Course Code: 116016514 __| Name of the Course: Soft Computing Instructions: 1)Draw neat diagrams 2) All questions are compulsory | 3) Assume suitable data wherever necessary J Que. No. Question Max. Marks Qi | Solve any Four 20 ‘Draw an explain the MeCulloch-Pitts neuron model 3 Explain windrow-Hoff learning rule. | State and explain Hebb rule_used in training pattern association network 5 iv) | Write a short note on neocognitron model. 5 vy) 5 Consider two fuzzy sots A and B with membership functions a(x ) and pn (x ), respectively defined as above. A= Cold climate with a(x) as the MF B= Hot climate with jy (x Jas the MF. Here, X being the universe of discourse representing entire range of temperatures Plot the fuzzy set representing pleasant climate, extreme climate. vi) | Define defizzification, Explain First of maxima method with an example. 5 ‘Que. No. Question Max. Marks QA _| Solve the following 10 i) | Differentiate between supervised learning and unsupervised leaming 3 ii) | Train the autoassociative network for the input vector [-1 1 1 1] and also test $ the network with one mistake in test vector. ‘OR QZA | Perform two training steps of the network using delta learning rule for) =1 10 and c~0.25. Train the network using the following data pairs 2 t & | 5 sdi=1) and wf} +do= 1) The initial weight are W, ~ 1 =[1_0 1) 11Pageleaving a station, the input are distance from a train and speed of the train. The output is brake power used. a. Define the linguistic variables (use 3 for both input and output) b. Design the fuzzy membership set using appropriate membership function ¢._Fonm the nile base Q2B | Solve any One 10 i) | Using back propogation algorithm, find the new weights for the net shown’ 10 below. It is presented with the input pattern [0 1) and target output is 1. Use the learning rate ¢=0.25 and binary sigmoidal activation function ton) 63 ii) Construct and test 2 BAM network to associate letters E and F with simple 10 bipolar input-output vectors, The target output for F is (-1,1) and for Fis (1,1). The display matrix size is 5 X 3. The input pattems are = Tf * = Que. No. Question Max. Marks: @ | Solve any Two 20 i) [Draw Hopfield network with four output nodes. Also explain Waining and {10 testing algorithm il) ‘Consider the problem of | designing fuzzy controller for a train approaching or 10 2)Pageii) ‘Explain linearly separable and non-linearly separable with suitable examples ‘Que. No. Question Solve any Two i) “What is self-organizing map? Explain the training algorithm of Kohonen self izing. feature maps i» Explain Center of sum and Center of gravity defuzzification methods with suitable example. int) ‘Compare different learning rales ‘Que. No. ‘Question (Write notes / Short question type) on any four i) i), winner takes all learning rule ‘Explain the principle behind simulated annealing network t iii) pc os ‘Consider the following two sets P and D, which represent a set of paddy plants and a set of plant diseases P= {P1, P2, Ps, Pa} a set of four varieties of paddy plants D = {D1, D2, De, Ds} of the four various diseases affecting the plants. Let S = {S1, S2, 83, Si} be the common symptoms of the diseases. Let, R be a relation on PX D, representing which plant is susceptible to which diseases, then R can be stated as 2 mo 06 os o9 08 me 01 02 09 03 09 08 Pepe Also consider be the another relation on D X $ which is given by & a fi oz o7 z=] a | to 10 04 as 00 009 05 09 a, los 10 08 02 a) Obtain the association of plants with the different symptoms of the disease using max-min composition b)_Also obtain R XT iv) ‘Compare and contrast BAM and Hopfield network ») ‘What are the factors that can improve the convergence of leaming in Back Propagation network. 9 ‘Write a short notes on components of fuzzy inference system 3[Pege240+ 22(E) ‘Name of the Constituent College K. J. Somaiya College of ‘Course Code: 116U01CS02__ | Name of the Course: Computer Networks @&S SOMAIYA Semester: August 2022 — December 2022 Maximum Marks: 100 Examination: ESE Examination Duration:3 Hrs. Programme code: 01 amen / [Course Code: 116U01CS03 Name of the Course: Operating System Instructions: 1) Draw neat diagrams 2)Assume suitable data if necessary Questi | Max. on No, | a i _| Marks: S') [Differentiate between monelithic and m icrokeme | QI (b) | Define the term Critical section and Race ‘condition, 0S QI (c) | What is Process Control Block (PCB)? | 0s QI (@) | Explain the effect of page size on the performance of a process, (©2 (a) | Given five memory partitions oF 100 KB. 500 KB, 200 KB, 300 KB, and 600 KB Gn j order), how would each of the firstfit, bestit, and worst-fit algorithms. place i processes of 212 KB, 417 KB, 112 KB, and 426 KB order)? Which algorithm makes the most efficient use of memory? ©) | What are System calls? List and explain file-handling system calls; 10 oR Explain Process control fork(), exec(), and wait(), System calls. Q3 (a) | Explain the following in briefi(anyone) 10 | 1, Semaphores 2. Scheduling in Linux system ‘3 (b) | Assume the following: processes arrive for execution at the Tndicaied time and the | CPU burst time is given in ms. | Process Burst Time | Arrival Time | Priority ; PI 10 0 5 2 6 0 2 ||ps 7 1 4 Pa 4 1 1 | PS 5 2 3 | Find the Average waiting time. and the average turnaround time for FCFS, SJF(Non= | preemptive), and Round Robin(Quantum-3ms)| Explain the difference between Paging an OR | Esplin the hardware support for Paging, { Q4(b) | On a disk with 1000 cylinders, numbers 0-999, compute the number of tacks the 10 disk arm must move to satisfy all requests in the disk queue. Assume the last request received was at track 345 and the head is moving toward i | track 0. The queue in the FIFO order contains requests for the following tracks 123, \ 874, 692, 475, 105, 376. Perform the computation forthe following scheduling algorithms: iFIFO ii, SSTF ii, SCAN | Q5 (a) | Consider the given snap off the System - 10 | Allocation Max Available A |p fe >| A [Ble |p Ja P| c |p | PO }0 2 12 0 3 242: 2. eg 2 oS | | =f | | jel ee 2 [2 7 eee 12 as 4 [as | PS [Ou pile 21 11 1g gle | | pa j2 4 14 3. 6 5 8 Answer the following questions using Bankers algorithm. 1) What is the content of Matrix need? 2) Isthe system in.a safe state? 2) __ Ifa request from process PI arrives for (1,3,2,1) can the request be granted immediately? Q5 (b) | Explain the conditions for deadlock. Suggest techniques to avoid deadlock. 0 OR | Explain an algorithm for the producer-consumer problem. | J