B.Tech/CSEI7" Sem-E/2022/CS-736 Indian Institute of Information Technology Kalyani End-Semester Examination Autumn 2022 Subject: Speech and Natural Language Processing Time: 3 hrs Paper Code: CS-736 Full Marks: 50 Answer any five questions 1, What are Copula and Modal Varbs? Mark all the Aspects and corresponding sentiments in the following paragraphs. 10 “Yesterday, I bought a Nokia phone and my girlfriend bought a moto phone. We called each other when we got home. The voice on my phone was not clear. The camera was good. My girlfriend said the sound of her phone was clear. I wanted a phone with good voice quality. So I was not satisfied and returned the phone to BestBuy yesterday.” 2. Discuss the Earley Algorithm with dotted rule using the following example. At each step, what are the operators applied to a state in Earley Parser? Which of these are Named Entities: Hotel, Rose, School, Prime Minister, Indira Gandhi International airport? 10 S + «VP. 0.0 NP -+ Det« Nominal. |1,2| VP + VNP«, (0.3) 3. Mention the difference with example: Homonymy and Polysemy, Synonymy and Hyponymy, Precision and Recall, Fixed Size and Variable Size Postings, DBMS and IR. 10 4. Mention T-expressions (Ternary expressions) with example, How S-rule can answer a question from T-expressions? What is the difference between Syntax and Semantics (give example)? 10 5. Discuss Extractive and Abstractive summarization, Discuss an unsupervised technique of Extractive summarization. How to do MultiLingual summarization? 10 6. What is Frame? How can it be used by a conversational agent to develop the Chatbot? How the slots are filled? Discuss with an example. 10B.Tech/CSE/7* Sem-E/2022/CS-702 Indian Institute of Information Technology Kalyani End Semester Examination 2022 Subject: Software Engineering Time: 3 hr Paper Code: CS - 702 Full Marks: 70 Answer Question No. I and any five questions from the rest 10+S «12 1 (a) How many phases are there in Spiral model? (b) Which factors helps you to select appropriate SDLC model for a project? (c)What type of project you can use- i. V model ji, Prototype model iii, Spiral model (d) What is logical cohesion. Explain the disadvantages of logical cohesion. (e) Explain data coupling. Compare content coupling with data coupling. Which one is preferable in good design? 141534243 (a) How do you define project size? Describe the major components of Function Point Analysis, (FPA). (b) In institute's academic registration portal, a student will perform registration by providing his/her name, year, and semester. After registration each student will be assigned with unique registration number (REGN). Office assistant will prepare registration-card with signature. After semester examination, grade of every subject will be credited to REGN. Every academic year-end, institute will award prize to top 3 students having highest CGPA. Every student with CGPA>9 will be awarded merit scholarship. A report with subject-wise performance of all students will also be generated through the portal. Identify major components of FPA for registration software and compute the unadjusted function point. Consider average degree of influence (DI with weight 4) and compute the adjusted function point of the software. (244)46 (a) A company wants to launch an online shopping portal, The portal will allow customer to view the products and offers. Registered customers will be allowed to purchase the products through the portal. For every purchase, credit points will be awarded to the customer. Customer will use accumulated points to claim free gifts. The purchase process will be handled by office staff. After every purchase, feedback will be collected from customer. Marketing manager will use the portal to check customer feedback, product sales report, and to launch new products and promotional offers. Warehouse manager will use the portal to maintain the supply chain flow. Draw the use case diagram of the shopping portal and identify the actors and different types of use cases. (b) A project manager is estimating duration of his new project. He has noticed that duration of few activities may be difficult to estimate due to very high degree of uncertainty in duration estimation. Which time estimation technique will be suitable to perform time estimation of such project. Justify your answer. (c) Compare transient and permanent failure with example. 44(243)+3 (a) Define test case. Distinguish between verification and validation. (b) Draw the control flow diagram of the following code snippet and compute the cyclomatic complexity.p=p*2; iffp<10) sum=0; forint j=0;)<5;i++) sum=sum+p; printf(sum); (©)Compare alpha testing and beta testing, 243424243 (a) Explain the role of ‘Driver’ and ‘Stub’ with respect to top-down and bottom-up integration testing. (b) Design the equivalence class partitioning test cases for a function that reads two integer pairs (m,c1) and (m2,c2) defining two straight lines of the form y= mx +c. The function computes the intersection point of the two straight lines and displays the point of intersection, (c) Compare product metric and process metric. +3343 (a) Explain the following reliability measures- (i) MTBF of 130 units (ii) Availability of 0.991 (iii) ROCOF of 0,03 (iv) POFOD of 0.001 (b) What is TQM? Explain the different maturity levels of SEI CMM. (c) A company develops a software for medical instruments. Which ISO certification among ISO 9001 and ISO 9002 will be beneficial for that company? Justify your answer. 4424343 (a) Compare two different techniques of code review, What is Fog Index? (a) What is Key Process Area in CMM? Explain the KPAs in Level $ CMM. (b) Compare ISO 9001 and CMM. How does Six sigma differs from CMM? (242)4(242)}4(242)Ph.D./CSE/2022 /cs-904 Indian Institute of Information Technology Kalyani End-Semester Examination Autumn 2022 Subject : Algorithm - II Time : 3 hrs. Paper Code : CS ~ 904 Full marks : 40 1. Consider the recurrence equations given below, T(n) = aT (n/b) + cn* Show the following: if T(1) = ¢, © T(n) = O(n*) if a < # and # T(n) = O(nk logn) if a = oF OR State the Knapsack problem and describe stepwise an algorithm of your choice to address the problem. Show the complexity analysis of your algorithm. il 2. Let f.g : N* ++ N* be two functions. Prove or invalidate each of the following claims: i. if F(n) = O(g(n)) then g(r) = O(F(n)), i. f(n) + 9(n) = O(min(f(n). 9(n))) (assuming that it exists). ii. if f(n) = O(g(n)) then log( f(n)) = O(log(g(n)). if f(n) = O(g(n)) then 2%) = O(2)) v. f(n) = O(P'(n)) i z 3. Suppose you have a set of n lectures that need be scheduled in classrooms. Each lecture has fixed (non-modifiable) starting and ending times. You would like to use as few classrooms as possible to schedule all lectures: 1. Describe an naive O(n?) algorithm to determine the scheduling of lectures 2. Try to improve this solution to an O(nlogn) time algorithm, and possibly O(n) under the condition that all lectures start and end on exact hours. and that the algorithm is to be run daily.4. Consider the following optimisation problem, Given an undirected graph @ < (y, p) with non-negative elge weights w : E+ R*. we are looking for an assigument oF vertex weights z : V ++ R such that: (i) for every edge u,v € E, 2(u) +2(v) > w(re,v), (ii) Lucv #(v) is as small as possible. Can this problem be solved exactly in polynomial-time? Either describe the al gorithm (including a justification of its correctness and why it is polynomial time) or prove that the problem is hard via a suitable reduction. Page 2B.Tech/CSE/7"" Sem-F/2022/CS-701 Indian Institute of Information Technology Kalyani End-Semester Examination Autumn 2022 Subject : Algorithm - I Time : 3 hrs. Paper Code : CS ~ 701 Full marks : 40 1. Consider the following optimisation problem, Given an undirected graph G = (V, E) with non-negative edge weights w : ++ R*, we are looking for an assignment of vertex weights x: V ++ R such that: (i) for every edge u,v € £, x(u) + 2(v) > w(u, v), (ii) Sev 2(v) is as small as possible, Can this problem be solved exactly in polynomial-time? Bither describe the algorithm (including a justification of its correctness and why it is polynomial time) or prove that the problem is hard via a suitable reduction. 2. Let f, i. if f(r) = O(g(n)) then g(r) = O(F(n)). ii, f(m) + g(n) = O(min( f(n), 9(n))) (assuming that it exists) iit. if f(n) = O(G(n)) then log(s(n)) = OCog(g(n)). iv. if f(n) = O(g(n)) then 24 = O(2%), ve f(n) = O(f(n)) :N' ++ N* be two functions. Prove or invalidate each of the following claims: 3. Suppose you have a set of n lectures that need be scheduled in classrooms. Each lecture has fixed (non-modifiable) starting and ending times, You would like to use as few classrooms as possible to schedule all lectures, 1. Describe an naive O(n*) algorithm to determine the scheduling of lectures 2. Try to improve this solution to an O(nlogn) time algorithm, and possibly O(n) under the condition that all lectures start and end on exact hours, and that the algorithm is to be run daily. 4. Consider the recurrence equations given below, T(n) = aT (n/b) + en* Show the following: if T(1) = c, © T(n) = O(n*) if a < and fio} (to) {19}# T(n) = O(nk logn) if a = 6 oR State the Knapsack problem and describe stepwise an algorithm of your choice to address the problem. Show the complexity analysis of your algorithm. [19] Page 2