Registration No : LITT IT Total Number of Pages : 02 B.Tech Res6co0t 6" Semester Regular / Back Examination: 2022-23 ‘SOFTWARE ENGINEERING CST,CSE,CSIT;OSEAIME,ELECTRICAL & C.E.,ELECTRONICS & CET Time : 3 Hour Max Marks : 100 Q.Code : M509 ‘Answer Question No.1 (Part-1) which Is compulsory, any eight from Part-ll and any two a az a) b) <) a) e) 9) i} i a) » °) d) e) 9) from Partull. ‘The figures in the right hand margin indicate marks. Part Answer the following questions: White the characteristics of a good SRS document. ‘What do you mean by a software life cycle? What are the major shortcomings of iterative waterfall model? net are ample of a software product development project for which the iterative ‘waterfall model is not suitable. Define Scrum. What are the main shortcomings, of DFD as a tool for performing structured analysis? ‘What do you mean by software reverse engineering? What is the difference between black box testing and white box testing? ‘What do you mean by software reengineering? Define Saas. Part-ll only Focused-Short Answer Type Questions- (Answer Any Eight out of Twelve) Draw a sctiematic diagram to represent the iterative waterfall model of software development, On your diagram, represent the deliverables that need to be produced at the end of each phase. Byplain how a software development effort is initiated and finally terminated in the spiral model. Suppose you are developing a software product in the organic mode. You have Setimated the size of the product to be about 1,00,000 lines of code. Compute the nominal effort and development time. Explain how a DFD model of software can be created from its source code What do you mean by cohesion and coupling in the context of software design? How are these concepts useful in arriving at a good design of a system? Discuss the major differences between the function oriented and the object oriented approaches to software design. Corroborate your answer through suitable examples. Discuss in brief the different reliability metrics. Draw the diagram for reliability growth model. (2x10) (6x8)Q3 a4 Qs a6 h) i) i) k » Write the IEEE 830 guidelines in brief. With help of suitable example, explain how the inheritance feature of the object oriented paradigm helps in code reuse. Discuss the process models for softwate maintenance and indicate how you would select an appropriate maintenance model for a maintenance project at hand. Explain in brief about RAD model Describe CMM in brief. Part-lll Only Long Answer Type Questions (Answer Any Two out of Four) Design the black box testsuite for a program that accepts two strings and checks if (16) the first string is a substring of the second string and displays the number of times the first string occurs in.the second string. What do you mean by system testing? What are the different kinds of system (16) testing that are usually performed on large software products? Discuss. ‘Assume’ that you are the technical manager of a software development (16) ‘organization. A client approached you for a software solution. The problems stated by the client have uncertainties which lead to loss if it s.not planned and solved Which software development model will you suggest for this project ~ justify? Explain that model with its pros and cons and neat sketch What is the purpose of data flow diagrams? What are the notations used for the (16) same? Explain by constructing a context flow diagram level-0 DFD and level-1 DFD for a library management system.Registration No : Total Number of Pages : 02 Course: B.Tech Sub Code: RCS6C002 6" Semester Regular / Back Examination: 2022-23 SUBJECT: Compiler Design BRANCH(S): CST/ CSE/ CSEAIME/ IT Time : 3 Hour Max Marks : 100 Q.Code : M440 ‘Answer Question No.1 (Part-1) which is compulsory, any eight from Part-I and any two a az b) e) from Part-Iil. The figures in the right hand margin indicate marks. Part-l Answer the following questions: (2x 10) Differentiate DFA and NFA. Mention the job of Lexical Analysis. Explain the specifications of LEX programming, ‘What do you mean by LL(1)? What is handle pruning? ‘What is backpatching? ‘Explain loop invariant with an example. ‘What is S-attributed Grammar? Differentiate static and dynamic storage allocation. Mention the features of symbol table. Part-ll ‘Only Focused-Short Answer Type Questions- (Answer Any Eight out of (6 * 8) Twelve) Illustrate the output of each phase of compilation for the input “a = ( b+c )*( btc) * Be Describe the structure of a LEX programming. Write a LEX specification for removing single line and double line comments from a C file. Define and differentiate token, lexeme and pattern. Find the lexemes, their token group and the pattem for the following piece of code. int main() 4 int a, by print£("Enter two integers to swap\n"); scanf("%dtd", &a, &b); azatb b=a-b a=a-b; print£("a = %d\nb return 0; ad\n",a,b);a3 as Qs as d) i k) ) Prove that following grammar is not SLR(1) but CLR(1). $ > AaAb | BbBa AvE Wie the algorithm for computing FIRST() and FOLLOW() function. Find the FIRST() and FOLLOW() for the following non-terminals whose sets of productions given below $= ACB | CbB | Ba ‘A da|BC Bogle Cohle Describe the issues associated:with grammars in top-down parsing with suitable example. Compare local optimization with global optimization with suitable example. Compare stati¢,'stack and heap allocations. Construct the DAG for the following basic block: d=bte atb bre are-d Explain loop jamming and loop unrolling with suitable example. Describe Peephole optimization How the scope information of variables are stored in symbol table? Explain. Part-lt Only Long Answer Type Questions (Answer Any Two out of Four) (16) Consider the following grammar D— Type Tiist; Type — int | float Tlist + Tlist, id | a) Find the SLR parser for the above grammar. b) Show the parsing of the string “int id, id, id;” using the parsing table constructed above. List the commonly used intermediate representations, Write'7the following (16) expression in all types of iniermediate representations you know (@—b)*(c+d)-(a+b) 2) {) Explain the simple code generator with a suitable example (2) il) Waite detailed notes on basic blocks and flow graphs (16) Obtain the translation scheme for obtaining the three-address code for the following grammar Sid = E E+E, +E,| Ey" Ep|-Es((E)) |idRegistration No: L | Total Number of Pages: 02 Answer Question No.1 (Part-1) which a az a) b) sc) dq) e) 9) hy i d a) b) ) d) e) Course: B.Tech Sub_Code: RCS6D001 6 Semester Regular / Back Examination: 2022-23 Real-Time System BRANCH(S); CSE Time: 3 Hour Max Marks: 100 Q.Code : M323 compulsory, from Partull. The figures in the right-hand margin indicate marks. Part Answer the following questions: ‘What does the term ‘real’ in a real a realtime system. e system signify? Explain what you mean by Explain why safety and reliability are not independent issues in safety-critical hard real-time systems. What do you mean by jitter associated with a periodic task? How are these jitters caused? Can the following set of real-time tasks be schedulable using EDF algorithm? Justify your answer for the realtime tasks such as T1 = (10, 20), T2 = (5, 50) and 73 = (10, 35). What is code sharing? Explain serially reusable and reentrant code. ‘What is chain blocking? How is unbounded priority inversion avoided in PCP? What do you mean by priority inversion? ‘What are the shortcomings of Windows NT? What are the different types of timing constraints that can occur in a system? Give examples of each: What is the difference between synchronous I/O and asynchronous /O? Part-ll Only Focused-Short Answer Type Questions- (Answer Any Eight out of Twelve) Describe mutual exclusion using binary semaphore. Define “Fail-safe” state of a system. Justify your answer “safety-critical real-time systems do not have a fail-safe state.” Briefly explain while scheduling a set of hard real-time periodic tasks, why RMA cannot achieve 100% processor utilization without missing task deadlines? Explain the operation of priority ceiling protocol (PCP) in sharing critical resources among real-time tasks. Explain how PCP can avoid deadiock and chain blockings. List the necessary constraints required to select a suitable frame size for a set of real-time tasks in the cyclic scheduler. ny eight from Part-ll and any two (2* 10) (6x8)a3 a4 as 9) h) d ) a) ») a) ») a) *) a) » ime application such LAN in a hard real-tir and cons of using themet S woul it be aaviable 10 rat answer, Evaluate the pro mation? Just ication. : as facto avonstclin sucha” apBIeaON am for running @ ane rieeooused addressing and bidding "7 i ent, orate tasks in a distributed environ ay ce Byzantine clock, What is the mare ration? pees jt n do Pal examples of sft cial iti ? Give a pl - Wat is a saftciical ster” NE im systems safety-crical? Ifnot, give at har reat systems, Aral hard realtime systems e206) tT least one example of a hard real-time system a eerie What do you mean by QoS routing? Explain the different ty manne: 2 itical real-time Wha do you understand yt eae it of Ppicaton of is? Explmn te fail-safe state. sae Teronceslbetcen the charactrsies of a sot rea-ime task and a non-real- time task. s Define real-time system. With a neat block diagram show the important neccere components of a real-time system and their interactions. Explain the roles of those components. Byzantine clocks that are Partsill Only Long Answer Type Questions (Answer Any Two out of Four) Prove that a set of periodic realtime tasks in RMA schedulable under any task (8) Phasing if all the tasks meet their respective first deadlines under zero phasing. Briefly indicate how Unix dynamically recomputes task Priority values. Why is such (8) 'e computation of task priorities required? What are the implications of such Priority *® computations on real-time application development? When EDF is used for task scheduling in a realtime application, explain a scheme Sr ca ec oe iting aetme and relooeg S2Ud0-code notation to describe the steps to handie resource grant Three hard real-time periodic task: a (70m, 200ms, 200ms) and T3 = (6Oma: anny 4a unpocesor ising FMA Cas intermediate. calculations.) fee (S0ms, 100ms, 100ms), T2= (8) 4 to synchronize the mane ° ISCUSS the fr fe ‘eas SS cer a Oh ed entre en? ree etm aanRegistration No: [ | Total Number of Pages : 02 Course: B.Tech Sub_Code: RNM6A002 6" Semester Regular/Back Examination: 2022-23 SUBJECT: Numerical Methods BRANCH(S): CSE, CSEAIME Time : 3 Hour Max Marks : 100 Q.Code : M137 Answer Question No.1 (Part-1) which is compulsory, any eight from Part-ll and any two from Part-ll. The figures in the right hand margin indicate marks. Part a Answer the following questions: a) What are the order of convergence of Secant and Newton Raphson method? ») Explain the geometrical interpretation of Regula Falsi method. ©) “Determine L and U to compute the LU factorization of the matrix’ ae a-(e 5 2) a d) Write the sum of 0.123 x 10° and 0.456 Xx 10? in 3 digits mantissa form. €) Write the error term in interpolation. f) Write the Newton-Cotes quadrature integration formula? 9) If f(2) =, find the divided difference flxy.~2,%5] hy) (2x10) How many nodes should be there for Simpson's $d rule? i) What do you mean by spectral radius? D Find y(0.2) by Buler’s method, given that Bary, y(0)=1 with h=0.1 Part-il az Only Focused-Short Answer Type Questions- (Answer Any Eight out of (6 * 8) Twelve) ) Find the solution of the below system of equations correct to'three decimal places, using the Gauss-Seidel iteration method: 45x, + 2x, + 3x, = 58 —3x,+ 22x, + 2x, = 47 5x, +x, + 20x, = 67 Find a real root of the equation cosx=3x-1 correct to four decimal places by fixed point iteration method. ©) Find the smallest positive real root of the tan x+ tanh(x)=0 by using Bisection method. Define truncation error. What is the absolute, percentage and relative errors 2 b) dq) involved if y= is represented in normalized decimal form with 6-digits?a3 9) "i a viding the range in to 4 equal parts by Simpson’s > ‘rd rule, u Evaluate [e-* ar di 1 Find the missing term in the table using Lagrange’s interpolation 20 1 200 y 13 9 «hyet Evaluate [4 using Tapezoidl ule with h=0.2. Hence obtain an approximate Ine value of : : io Derive Newton's’ divided difference interpolating formula which interpolates a »n. Mention its error factor. function at x =x, /=0,1, Find the value of (0.04) using Buler’s method, given that »’+ y = 0, »(0)=1, =0.01 Find the approximate value of the integral f° oe using composite trapezoidal rule with 2, 3,5, 9 hodes and Romberg integration. Using improved Euler’s method find yat x=0.l and x=0.2, given yisy Sy(0)=1 with h=0.1. Using fourth order Runge-Kutta method, find (1.4) if y=y-x?+1,y(0) =05,h=02. Partill ‘Only Long Answer ‘Type Questions (Answer. ‘Any Two out of Four) 211 -2 [—10) (16) Solve the system of equations Ax = b, By ee eg stem ofequations Ax = b whetea = [3 2 2 21 ya 7p 13 2 -14 —é. = the LU decomposition method. Take all the diagonal elements of L as I. Also find A~*, Write three properties of Quadratic Spline interpolation. For the data given below (16) <_- ry oe ; np LO) 1 2 33 244 ‘uadratie splines with f”(0) = M(o) = 0, Hence, find an estimate of f(2.5). ai ‘ind <= solution of the ‘system of equations (16) o dx, ae ~ S81 4 Oxy tt, 2 = ae, aes bet, Find the eigenvalue c i rg GT™GUe Corfect to three decimal places which is nearest to $ forthe (16) matrix !1 4g ing ir 2 4] “S88 inverse power method. Obtain the corresponding “leenvector. Take the initial approximate vector as v® = [1,1,1]7,Registration no: | | Total Number of Pages: 02 Answer Question No.1 which is compulsory and any five from the rest. a a) °) d) e) 9) i) ) @2 a) b) Q3 a) b) a4 a) 6" Semester Regular / Back Examination 2016-17 COMPILER DESIGN BRANCH: CSE Time: 3 Hours Max Marks: 70 Q.CODE: 2175 The figures in the right hand margin indicate marks. Answer the following questions: Give examples on a token and lexeme, Differentiate between a compiler and an interpreter. What is a handle used in parsing technique? Differentiate between top-down and bottom up parsing. Write at least four languages which are not regular languages. What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production ((¢., of type A > © and A-> a) to parse a string with n tokens? Briefly discuss about Peephole optimisation. What do you mean by DAG? Give an example of its need in compilation process. = What are the Error-recovery actions in a lexical analyzer? Define LR(k) Parsing. ‘Symbol table is necessary for compiler construction. Justify your statement with example. Explain «» ambiguity in grammars»: Consider the — grammar S-raSbS/bSaS/e Show that the grammar is ambiguous by constructing two different leftmost derivations for the sentence abab. Construct the NFA for the regular expression (0|1)'011 and convert the NFA to DFA after minimizing the number of states. Discuss the working principle of Shift-reduce parsing technique with an example. What is LEX? Explain, in detail, different sections of LEX program with a suitable example, B.Tech PCCS4305 (2x10) (2) @) (5) 6) 6) Page LQs a6 a7 as b) a) b) a) b) a) b) °) } What are the First and Follow sets for the following grammar? The start (5) nonterminal is E. EDA ” ESL A>n Ai L>(S) S>E,S SE Desoribé the relationship between a grammar, How does this relate to th grammar? Give an algorithm for constructing the closure of @ se items LR(0) with respect to a particular grammar. For the following grammar, construct the set of LR(0) states to (6) recognize viable prefixes of this language. Then fill out an SLR parse table for this grammar and indicate whether the grammar is ambiguous. production and an item in an LR(G) (6) fe notion of the stack in an LR(O) t of + SAS + A>-AB/++AB/idB + B>-B]++B| What are the main operations for a symbol table? Discuss the data (5) structures associated with a symbol table maintained as a list of hash tables and how the operations of a symbol table are, implemented in that case. Give an example of what your symbol table would look like for a sample program. Explain briefly, precedence functions. Construct the precedent using the folioning precedence table ‘ Seer eeedueectsi (Ho) eg fog wl Ol 440 9 1 3 5 0 5 0 Below is a grammar for understanding simple arithmetic expressions: (10) E> E*EJEFE|(E)]int ‘assuming that precedence and associativity have been har translation actions would you add to the grammar to get it aaa be the mpulorresin tapos notation (94 @ +8)" 4 would pit spe + 4"). Now add actions to pri : outes 3242, Print out the expression in a prefix Write short answer on any TWO: DAG (5x2) L(t) parser Handle Global Data Flow oh a eym= Registration no: lain et T Total Number of Pages: 03 th 6" Semester Regular / Back Examination 2016-17 OPTIMIZATION IN ENGINEERING BRANCH(S): EEE, ELECTRICAL, MECH, MINERAL, MINING Time: 3 Hours Max Marks: 70 Q.CODE: 2528 B.Tech Hssm3302 Answer Question No.1 which is compulsory and any five from the rest. Qi a) b) The figures in the right hand margin indicate marks. Answer the following questions: Discuss Constraint of LPP problem Find all the basis solutions of the following system of equations, identifying in each case the basic and non basic variables, 2x, + 3x24 4x3 =11 and 3x, 4+ x,+5x,=14 Write one difference between simplex & dual simplex method, What do you mean by degenerate basic feasible solutions of a LPP Write different step to find initial basic feasible solution by Vogel's Approximation Method. State the importance of Branch Bound Method How can one know that a stationary point is a maximum or Minimum A self service store with five counters. Find utilization factor, when 5 customers arrive in a rate of 3 min. & 9 can serve within 4 min Check the function 2x} + x3 - 2x,x) Osx Osx Discuss Hussian Matrix and how it helps for solving Non linear programming Problem. is convex or concave for ‘A company is involved in the production of two items (X and Y), The resources need to produce X and Y are twofold, namely machine time for automatic processing and craftsman timne for hand finishing. The table below gives the number of minutes required for each item: lem Machine time Craftsman time 8 20 Y 19 29 The company has 40 kours of machine time available in the next working week but only 35 hours of craftsman time. Machine time is costed at £10 per hour worked and craftsman time is costed at £2 per hour worked. Both machine and craftsman idle times,incur no costs, ‘The revenue received for each item produced (all production is sold) is £20 for X and £30 for Y. The company has a specific contract to (2x 10) (7) Page 1me b) Q@3 a) b) 04 a) b) roduce 10 items of X per week for a particular customer. Solve this pr near program graphically obtain the duaity ofthe following primal LPP 2x, 4+ 3x2 + % inimize subject to x7 2xet 4x, 28 xy ta %s25 osm 0Sm 80845 Solve the following LPP by simplex Method Maximize 27 3x, + 2% Suberiio om + 2m <4 xy—m $2 Osx, &0Sx Solve the following LPP by Big M Simplex Method Maximize 2= 6x; ~ 3x, +225 Subjectto 2x, + xp + x3 5 16 3x, + 2x2 + x5 518 x ~ 2x 28 & OS x1 Xa Solve the integer programming problem Maximize 2= 3x, - 2x2 Subjectio x, + 2x) <4 Four diferent jobs can be done on four atferent machines. The matrix gives, the cost in Rs of producing ith job on jth machines. Machines M1 M2 M3 M4 How should the Jot (ta coat gg pvOPs, Be assigned tothe various machines so thatthe (6) 6) 6) 6) Page2.Q5 a) ASB ste I company has 3 open heat fumaces and § rolling mills. Find transportati : Hon cost (RS 100 per quintalfor transporting steel from : furnaces to rolling given below M1 M2 M3 M4 M5 : Capacity Fa 7 8 F2 ia core 14 Requirement 4 4 6 8 8 b) A Xerox machine in an office is operated by a person. Average service time (5) for a job is 6 min per customer. On an average, every 12 min, one customer arrives for Xerox work, Find (a) Percentage of time that an arrival has not wail (b) Average queue length. (c) Average time spend by a customer. {d) Probability that 2.no of customer in a system Q6 a) Find optimal value of the linear programming problem Za 2xd4 G4 3xb+ 12m + 10x + 9xs— 110 Subjectlo x, 4+ 22+ xy = 25, xy. Xp. % > 0 (5) b) Maximize [(x) = -5.x2 + 30.5x+4 by Fibonacci search method wih (5) a minimum resolution of 0.5 over 6 functional evaluations, The optimal value of f(x) is assumed be in the range 0 < x = 20 Solve the following nonlinear programming problem Minimize Z= 2x, 43x, xf— 2x2 Subjectto + 3x56 5x, + 2x2 $10 05x, x (10) @8 Write short answer on any TWO: (8x2) a) Genetic Algorithm B) Graphical Method for solving Linear programming Problem ¢) Assignment ProblemTotal number of printed pages - 3 Registration No.:[ eo 6th Semester Regular / Back Examination 2016 - 17 Optimization in Engineering BRANCH : AUT anp CIV QUESTION GODE : 2890 a Pull Marks - 70 ‘Time : 3 Hours Answer Question No. 1 which is compulsory and any five from the rest. The figures in the right-hand margin indicate marks. 1, Answer all the questions very precisely continuously. [2 x 10} (a) Optimal solution obtained by graphical method is non-basic. Justify your answer 7 (b) What is the gencral form of the optimal solution of the linear programming problem maximize F(X) =n +27 subject to the conditions ntmSn, n=1,23) X= (x1, 22)? 20 (©) What is nature of dual variable when the corresponding primal constraint is in "=" form? (a) What is the dual of the given primal linear programming problem maximize F(X)=21 +22 subject to the condition n+ 402 <3 X= (m2)? 20 (6) What one can say about the dual solution when primal near programming problem solution ig infeasible ? (f) Initial transportation solution given below is non-degenerate. Justify your answer ? ot ie rac TT and V, when one writes Kubn Identify the nature of the vectors Il and V, Ce reer given below of some linear programming problem ‘Tucker condition in the AT-1V = -PT AXA IW= Pox 2 x?V=0, ITW=0 ‘ok into while determining optimal solution of some constraints inn variables out of which k constraints (1) How many different eases one has to lo Hoy ma sopamming probien wth" Seen? ne mst do fo dentying =e sain fo knowing the muber of eomptations oe ma do €) White te expression Weg) inte tral (6) whch can devi om the exact optimal ing pollo earch mato ? Gp sean ar vival te and eve ta reece tha intorprt the mining of £72. Answer according 10 the instruction. annnsing problem using graph method without graph paper [5) (9) Solve the linens Prost maximize F(X) = S01 +422 nibject to the conditions 3x, +222 $3 40; - 32 =4 Sry + 322,25 0 Xa (a a2) 20 blem by solving the primal linear programming prob. 9] (b) Find the optimal solution for dual pr Jem using two-phase method ‘maximize P(X) = 20 + Ata 85 subject to the condition ay + 20a +73 <5 Guy +22 + 20324 7 X= (zy 20 43)" 20 ] al ding to requirement. 4, Answer precisely acco lution using penalty method of the (@) Find the optimal sol linear programming problem — [5] sninimize F(X) = 221 + 320 + 42 subject to the conditions ay +322 73 25 a 2, +22 + 30354 X= (#1, 22,25)? 20 (o) Solve the following near programuning problem using revised simplex procedure [5] maximize F(X) = 1 + 202-73 subject to the conditions ay +40, +43 8 2a + 8x2 2as 29 i X= (#1, 22, t)" 20 Give precise answer using simplex table, (8) Solve the followin «linear programming problem using dual simplex procedure (6) imize F(X) = 501 +82 subject to the conditions VS 2 +42y + 2z3 28 2x, + Bry ay <9 these ao set solntion using branch &e bound method maximize . ‘subject to the condition oo : doy +52 18 X= (ey, 22)" 20 Have YoU used bord 1 concept while determining optimal i imal integer solution ? 25. Answer in detail in compact form (a) Find the bound for the source anid the basic cost of the linear programming problem (5) maximize F(X) = 20; + Bq — 49 + 204 subject to the condition 4, + 51 + 2x9 +4 S11 X= (a1 22) 2a, 44)" 20 (b) Students having masculine gender are arriving in front of a ladies hostel according to one server and infinity queue length principle to wish a particular beautiful girl student occupied recently in the hoste) on her birthday through self introduction to have friendship with her im future. If the git] serves 10 students per hour and 5 students are arriving in queve por hour, then determine WV, We, Ls aud Ly 5) 6. Give the detail procedure. (a) Find the optimal solution of the aniuiization assignment problem whose cost ynatrix is [5] (b) Find the-optimal solution of the transportation problem by stepping stone method using initial solution obtained by Vogel’s approximation method (5) SET aTS] 5 Pe T]2]s{7] 9 apse Ts] 5 hatgta 7. Formulate non-linear programming problem in required form, (a) A rectangular box of height @ and width b is placed adjacent to a wall. Formulate a non linear programing problem for find the length of the shortest ladder that can be made to Joan against the wall = 5) (L) Solve the convex programming problem using Lagrange method, [5] optimize S(X) = Ban + 22 — (1 ~ a)? ‘subject to the condition nt+m=4 8 Solve the quadratic programming problem using Woll’s method, 19) rinimize SUX) =} + 2ey22 +a} subject to the condition zr 4202 <2 2 +2 >3 X= (a1, 22)" 20)> Registration no: Total Number of Pages: 01 6" Semester Regular / Back Examination 2015-164 COMPILER DESIGN BRANCH: CSE Time: 3 Hours Max Marks: 70 Q.Code: W193 B.TECH PCCS4305 Answer Question No.1 which is compulsory and any five from the rest. Qi a2 Qs as as a6 ar as a) b) a) b) ») a) ») a) b) 9 The figures in the right hand margin indicate marks. Answer the following questions: Differentiate between compilers and transiators. List different phases of a compiler. What do you mean by Passes? Define Lexical Analysis with an exarnple, Write the characteristics of syntax analysis. What is optimization? List different methods for code optimization. _, What do you mean by cross compiler? What do you mean by semantics of a programming language? What are the data elements of a programming language? What is the responsibility of error handler? Explain the phases of a compiler with a suitable example. Let L = fab, aa, baa}. Which of the following string in L*. Differentiate between NFA and DFA. List the steps to°convert NFA to regular expression with an example. Construct the grammar G, S->SaS |b; show that G is ambiguous for the string ‘bababab’ Consider the grammar S->ce | eSe. Parse the string ‘coc’ and explain the process of backtracking. Construct the FIRST and FOLLOW of the grammar S> ACB |CbB |Ba, Adda] BC, B>g|e,Con| «. Write the non recursive predictive algorithm, For the grammar E> E +E | E*E |(E) | id, show various shift reduce parsing action with respect to input string id1 + id2 *id3, Discuss the advantage and disadvantage of LR parsing Scheme. Construct the LALR parsing table of the following grammar below S3CC, CcC | D. Explain peephole optimization techniques with suitable example, Write Short Notes (Any Two) Synthesized attributes, Yace Compiler. ™ . 7 Error handler. Syntax directed definitions. (2x10) (6) (5) (1) (5) (5) (5) (5) (6) 6) (8) 6) (6x2)otal Number of Pages: 3 tn 6 Soe ATG | Back Examination 2015-16 IZATION IN ENGINEER! BRANCH: CSE, ENV, FASHION, FAT, ME Time: 3 Hours Max Marks: 70 Q.CODE: W427 B.Tech _ HSsM3302 IT, ITE, METTA, MME, PLASTIC, TEXTILE ‘Answer Question No.1 which is compulsory and any five from the rest. ai “The figures in the right hand margin indicate marks. ‘Answer the following questions: a) Explain how you handle a variable unrestricted in sign during the Solution process of simplex method. b) Ina linear programming problem what are shadow prices? How We Jocate these in simplex method? c) What is degeneracy in @ transportation problem? How do you handle ra a) Find the dual of the given LPP Maximize 2 = 3x: + 4¥2—%8 Subject to 2k + ¥2 + Sxs$ 20; 3x2-¥5 12; 4xy + 5x0 $ 18; X12 0,%0 2 0, ¥02 0. @) Define a convex function anda corer function. ) Write the LPP model of an rsignment problem with cost coefficient ci af "aiit queue the arival rate Is 10 per mind and the service rate 1 a er minute, What proportionate ofthe We the system is empty? thy Explain the notations. Le W ane Wa for a queuing model. H) FG) ig. unimodal function ovr ihe interval (2, 7} which is to be Fon Tega. In a process of search the melnur Ve get F(3.5) = 126 Syd F(6.4)= 9.7. Which will be the next interval of your search? J) During the process of Genet ‘Algorithm two strings as given below are ‘eonsidered for a cross over operation "1100100110 (0011101100 perform a eross over operation with mentioning the details. Cy 1) The following table provides infowneiet about two products A and B Ts the resources QR S requied 10 produce Wem oc tied resource per uni.product |__| Resources | Product A Product B Resource Available a z 7 = oR 4 2 1 3 3 3 | rs a a =| (Profit per unit |_3___ (2x10) (8)Q3 a4 0s os b) b) a) b) ») a) the LPP and solve it using graphical method, nulls ide only a rough sketch of the feasible region without us a oak paper, Show all mathematical details of your calculations ing 2 the given LPP by simplex method an ize Z = 3x1 + 5x2 + 6X3 ers xy + x2 + x3 $45 y+ Oke + Xa 54) y+ Xo + 2X9 84; x5 + xy Formulate +x S3)M 20, x220, X20. owe the given LPP using the Big-M method i = Qxy + 5X2 + 3X9 eer - 2k "+ xg2 20; 2X1 + 4Xat Xa = 50; X1 20, X22 0, X52 0» See the given LPP using revised simplex method ® Maximize Z = 5X1 * 4x2 ~ Xa + 3X4 Subject to 3x1 + 2x2 Ska + X4 S24; BX X22 0, X32 0, X42 0. lution to the given transportation problem by Vogel's Find a starting nn eo Method and then . Approximation Method and plies a Ss 7 6] 5 |] 4 50. Se a aT 50. 1 Be] 8 7 { 3_| 5 Demand 201 40 | 30 | 60_[ Sowa the given assignment problem by Hungerian method. “Oo? a) 4 727% 7 4 10 14 12 tsyeys pele wpe] A Solve the given LPP by dual simplex method. Maximize: Z = 4xq + Sxe + 3x0 subject to x + xo # 2X3 2 20, 15x; + 6X2~ 5x S 50, x1 + 3x2 + Bxs $30 Xs, Xa X820 Sake th given iteger programming problem by branch & bound (5) Maximize: Z = 6x, + Bxz Subject to xi + 4x < 8, 7x1 + 2x < 14, Integers " + Bxp + Xs +34 S36; X20, (5) Ll (5) (5) x1, %, are non negative PageZe b) aq a) b) asa) b) mee Consider a barbershop with two barbers and two chairs with no room (8) for waiting. \f both chairs are occupied when a customer arrives, the customer leaves immediately. On the average a customer arrives every'10 minutes ahd each haircut takes an avérage time of 15 4 minutes. Calculate the expected number of busy barbers. Calculate the expected number of customers tuned away per hour. 2 (8) Minimize the function f(x) = 2(x-3) +e A over the interval (0, 100] using the golden section search. Perform 5 iterations to do it. » 2 (5) Mininize f()=3¥+y°+2? subject to t+14+1=1° using Lagrange ( xy multiplier method. Solve the following problem using Kuhn-Tucker conditions. 6) Minimize f(x) =100-1.2x,-1.5x, +0.3x7 +0.05x3 Subject to g (= 44% 235 8:00) =420 BCE R20 Solve the given quadratic programming problem using the simplex (5) ‘method for the quadratic programming. Maximize f(X)=8%-* +478 Subject to x, +4, 52, 720 420 PagesWy Registration no. CCECLEToS Total Number of Pages: 03 ai 9 d a) b) B.Tech . HSSM3302 6"), Semester Regular / Back Examination 2015-16 OPTIMIZATION IN ENGINEERING , BRANCH: AUTO, CIVIL Time: 3 Hours Max Marks: 70 Q.CODE: W595 Answer Question No.1 and any five from the rest. _The figures in the right hand margin indicate marks. Answer the following questions: (2x10) What do you mean by an unbounded solution of a L.P.P ? Define an unsymmetrical dual problem. What is a reduction theorem in assignment problem ? State the necessary and sufficient condition for the existence of a feasible solution OF a transportatidi problem. = ~ What isan L.P.P ? State the importance of Branch and Bound technique. Whatis a Lagrangian Multiplier ? Show that the Hessian matrix of Fagen) = TH 1082 8 +4 Ta ~ 2a isnegative-definite. hat are the limitations of sensitivity analysis? Define Transhipment problem. Write the computational procedure ofthe simplex method for maximizing 2 (5) Lee. Solve the following LPP by dual simplex method : 6) : Maximize = 2x, - 5 Subjectto = +%)-H257 x,—2a +4, 28 and .%,% 20 Page L.Q6 a) Asupermarket has two sales girls at the sales counters, if the service ti each customer is expoential with a ‘mean, of 4 minutes, and if the meee (5) arrive ina poisson fashion at the rate of 10 an hour, then calculate the Peels (i)probability that a customer has to wait for being served? ' (ilexpected percentage of idle time for each sales girl? (iiiif a customer has to wait, what is the expected length of his waiting time? b) Solve the following non-linear Programming problem a » Maximize 2=10x, -x?+10x, -x,? ‘ . ) : subjectto x, +x, $14; ~¥ +x, $6; and XX, 20 by using Kuhn-Tucker conditions. QZ, a) Solve the.non-linear pro Minimize z mming problem, L nn) x)? +a? + 3x,? + 10x, + 8x, +62, -100 subjectto +x, +4, =20; and Hypa 20 by using Lagrangian multipliers. bb) A manufacturer of wooden articles produces tables and chairs which requires two (5) 7 “types of ifiputs namely, theybeing wood and*labour. The manufacturer knows that for a table 3 units of wood and 1 unit of labour are required for a chair they are 2 Units each. The profit from each table is Rs 20 while it is Rs 16 for each chair. The total available resources for the manufacturer are 150 units wood and 75 units of labour. The manufacturer wants to maximize his profit by distributing his resources for tables and chairs. Formulate the problem as linear programming problem 8, Write short notes on any two: = vs ae a) Fibonacci search method, b) Revised simplex method . ©) Hungarian method, 4) Markovian queuing modele ye Registration no. | | | | Total Number of Pages: 02 5 w B.Tech HSSM3302 6" Semester Regular / Back Examination 2015-16 OPTIMIZATION IN ENGINEERING BRANCH: EEE, ELECTRICAL, MECH, MINERAL, MINING Time: 3 Hours Max Marks; 70 ‘ Q.CODE: W473 Answer Question No.1 which is compulsory and any five from the rest. The figures in the right hand margin indicate marks. QA, Answer the following questions: és a) What do you mean by degenerate basic feasibl'Solution of a LLP? b) Write the use of North ~ West comer rule, State an assignment problem, mathematically. 4d) Whats the advantage of dual simplex method? fe) What isa queue? Write the different components of queuing system. 4) Whatis the necessity of sensitivity analysis? 2) State a general form ofa mixed integer programming problem. : . ° hy Whatis an M/M/I model?” = i) What do you mean by a positive semi-definite matrix? j) Does a quadratic programming problem differ from a 1..P? Justify. + Qa). Solvethe following LPP by dual simplex method (2x10) 6) Minimize 2=33,+%, Subjectto x42]; 2x, +3422 ands 3,520 = bb) Defines conver set and show thatthe set of al feasible solutions ofa LP.P isa 6) convex st 03. a) Use Simplex method to solve the following LPP ‘) Maximize 2 =3x, +52, +4x, Subjectto 2m +3m $8; 2x, +5, $10; Bx t2m 4x <15 ey oso b) Define the dul ofa linear progremming problem and show thatthe dual ofthe dual of (§) LPP isthe primal itself 04 Apply Beales method for solving the quadratic programming problem (20) Maximize ix, + 6x4 — 23 — Day? — Dry subjectto +2, $2 and * xy 20 ' Page L08 ene 283 +3 subjectta,, 2m +4 $12 dx, +2x, =10 . ning problem bp Solve the integer programming prob Maximize = 7=2¥,+3% subjectto 6, #5x, $255 x 43x, S10 and %,% 20 and a6. a) Use Kuin-Tucker conditions to slve the fllowing non-linear Programming prblen: : Maximize 2= 23 —) + ubjectio 25, +35, $63 Desh; and ym 20. tb) Amatkting manager has five salesman and five sale districts. Considering the capabilities ofthe salesman and nature of he dstiets the marketing manager ¢stimates that the sles per month( in hundred mapees) foreach salesman in each stir would be as follows pee |r av Vv ae] \ i 25 w $— 8 ea —{o——s 18 assignment of salesman to district eoult in maximum sales. qr Pon-linear (s) 2x! 2d, +20, 8x, +23? 124, +200 e i PY A bank bas two ters working om ee em tipi 4 Senet pt nd thant a eM ha Seen Se ca Ua ape MS 2 3) Trnsporition page? 5 ea a i522)