orange navy bhrps://wwwakubihar com Code : 105501 B.Tech Sth Semester Exam., 2020 (New Course) ARTIFICIAL INTELLIGENCE. Time : 3 hours sult Marks + 70 Instructions (9 The marks are indicated inthe righthand margin. () There are MINE questions in this paper. i) Atempt FIVE questions in all Fv) Question No, 1 is compulsory 1. Choose the correct option of the following (any severd 27-14 (a) Parts of speech tageing determines ( pacts of speech for each word ‘dynamically as per meaning of the sentence (i) pasts of speech for each word dynamically as per sentence (i) all parts of speech for a specific word given as input (to) AM of the above AK-21/240 (Tum Over ) bitps./www akubihar.com orange navy brps://www.akubihar.com (2) than one Many words have ore OF any ye ave to stect te meaning a ste mos ens 8 coe Sn can be seve by (funy loge (9 sallow somatic anaiis (uy wor eens disambiguation fo) i tthe above (Destin suppor prograsia ar esened to hulp manages ake (budget peetins (ij visual presentations (3 usnee desire fo) vacation sehedlen (woe i he tet way to gr sae vine obi? 0 tinearaproach (i) Heuristic approach (some Imowl- edges are stored) (é@) Random approach (iy) An optimal approach AK-21/240 ( Continued ) bitps./www akubihar.comorange navy bhrps://wwwakubihar com (3) (e) What are not represented by using propositional logic? Objects (i) Relations (ti) Both objects and relations fio) None of the above o aeneral knowledge with current percepts to infer hidden aspects of the ‘current state prior to selecting actions True (i) False (g) Inference algorithin is completed only if @ it can derive any sentence (i) it can derive any sentence that is ‘an entailed version (ii) itis truth preserving (fu) it can derive any sentence that is an entailed version and it is truth preserving (Tum Over) Ak-21/240 bitps./www akubihar.com ormmqgme nays AK-21/240 butps://www.akcubihar com (4) (h) What are the two basic types of inference? Reduction to propositional logic, manipulate rulee directly (i) Reduction to propositional topic, apply modus ponen (ly Apply modus ponen, manipulate rules directly (tw) Convert every rule of horn clause, reduction to propositional logic (What are the main components of the expert systeme? fips: shwiakubiar.com @ tnference engine (i) Knowledge base (ii) Both inference engine and knowledge base (i) None of the above Graph used to represent semantic newwork is (9 undirected graph (i) directed graph (2) directed acyclic graph (DAG) (i) tzected complete graph bitps./www akubihar.com ( Continued )wossmylgnye mays bhrps://wwwakubihar com ts) 2. (a) Explain with diagram the organization ‘hetps://www akubihar.com (6) (0) What is First Order Predicate Logic of @ natural language understanding (FOPL)? Represent the following facts in system, (b) Describe all the levels of understanding in natural proc! ing system. FOPL : ‘Anyone passing his AI paper and getting an opportunity to werk on language live project is Happy. But anyone who language studies sincerely or ie Lucky can pass TT1d all his exams, Ramu did not study but hhe is Lucky. Anyone who is Lucky gets a live project to work.” 47 3. (a) What are agents in Al? How do agents Project to work mr ‘work to import intelligence toa aystem? Classity the diferent types of agents ‘and briefly discuss their properties. () Draw the semantic network of the following sentence Kavita gives a bool to her friend. 6. Write shore notes on the following: 346x4a14 (a) Knowiedge @) intetigence 7 wossmylgnye mays (0) Inheritance knowledge 4. (a) What do you mean by learning? Explain briefly the learning methods. Discuss (@) Knowledge management the advantages and disadvantages. of rule-based eyetem, 7. Describe the following with suitable encoding uncertainty during parsing. () Explain the human preferences in examples + D614 Tes (a) Logistic regression knowledge () Back propagation algorithm 5. (a) Explain the procedure of acquisition with the help of a diagrarn AK-21/240 bitps./www akubihar.com AK-21/240 {Continued ) (Turn Over J bitps./www akubihar.comorange navy brps://wwwakubihar.com (7) 8. (a) Dilterentiate between forward chaining and backward chaining. On what factors does the decision to choose forward or backward chaining depend? ®) Consider the following sentences : + John likes all kinds of food. + Apples are food. + Chicken is foo. ‘Anything anyone eats and isn’t killed by it, is food, + Suc eats everything Bill eats. (@ ‘Translate the sentences into formulae in predicate logic, Prove that John likes peanuts using, ‘backward chaining (i) Convert the formulae of part (i) into clause form, (ii) Prove that John likes peanuts using resolution. (iu) Use resolution to answer the ‘question, “What food does Sue eat?” TTA AK21/240 (Tum Over } bitps./www akubihar.com ormmqgme nays butps://www.akubihar com (8) 9. (a) What is the Turing test? If the machine passes the Turing test, does it mean that the system ie intelligent? What are the associated problems with Turing test? What are required improvement/ advances to overcome these problems? (b) What io the goal of the support vector machine (SVM)? How to compute the margin? TT psy www akubiar.com ‘Whatsapp @ 9300930012 Send your old paper & get 10 wet got te mae 10 wt 8 Paso Google Pas AK-21—1320/240 Code : 108501 bitps:/www akubihar.com‘hetps://www akubihar.com ‘hetps://www akubihar.com Code : 105502 (2) B.Tech 5th Semester Exam., 2020 @ A relational database developer refers (0 rea ora 2 record as, wee @ a criterion DATABASE MANAGEMENT SYSTEM (@) @ relation ‘Time : 3 hours ‘Pull Marks : 70 (o> cope (io) an attribute Instructions Z The marks are indicated in the rghehand margin z fe) ey to represent relationship between z vo z tables is called % —(t) There are MINE questions in this paper. 3 2 aaa 3 (primary Key 2 (ay auemge FIVE questions nal i a : E (i secondary key © fio) Question No.1 is computor z Z reuse F (4) forign ey (iv) None of the above 1. choot the cost answer ofthe allowing tray seven) a te beter o-ute fer than a DBMS (a) The way a prizuar appa views (a) 1 eater to the dnt om the daaeae that the topleation wae a 1 wrngnt rea time seqrements 6 noite &g-rouiiple users wish to access the (2 rlaionat model te scheme (ay complex retationshipe among data (i) sxbechema (of tne above mens (tam Over) AK-21/246 (Continued } bitps./www akubihar.com bitps./www akubihar.comorange navy ‘hetps://www akubihar.com (3) fe) Which of the following are the five builtin functions provided by SQL? \@-Counr, sum, Avo, MAX, MIN bhrps://wwwakubihar com (4) (4) Which of the following is used to get back all the traneactons back afer rolbac> (i) SUM, AVG, Mit, MAX, MULT Commie (ai) SUM, AVG, MULT, DIV, MIN 0, and nis a positive integer constant} What is the minimum number of states needed in a DFA to recognize L? @ ke a ns “iy 21 fio) 28) { Turn Over } bitps./www akubihar.com orange navy bhrps://wwwakubihar com (2) () Which of the following versions of Unix ‘came up with YACC first? “rs w@ vs iy CB UNIX (wy UNDCRT (9 & pushdown automata canbe represented as PDA = e-NFA + [stack}. wih Te (i False (4) A language accepted by deterministic pushdown automata is closed under ‘which of the following? @ Complement Git Union (ii) Both and i (iu) None of the above (e) -& is context free grammar with ‘almost one nonclerminal in the right hhandside of the production. @ linear grammar (i) linear bounded grammar (By regular grammar {fu) None of the above 821/251 {Continued } bitps./www akubihar.comorange navy brps://wwwakubihar.com (3) @ The lexical analysis for a modern language such as Java needs the power of which one of the fellowing machine models in a necessary and sufficient sense? (@ Finite state automata (i) Deterministic pushdown automata (ii) Non-deterministic pushdown automata via) Turing machine (9) Let 1 = (wrin 0+)" Jwhas even number of 1s), Le. Lis the set of all bit strings with even number of 1s. Which one of the regular expression below represents RB @ "10" fj 0° ao" 10" (ity 0° ao" 1°y of (iv) 0° 110" 4" 10" (4) What is the minimum number of states in deterministic finite automata (DFA) for string starting with ba? and ending with a over alphabet (a 6)? Ten (iy Nine (i) Bight Bit 8 AK-21/251 baps:iwwwakeubihar.com (Turn Over } orange navy a % 7) ax-21/252 bhrps://wwwakubihar com (4) The decision problem is the function from string to. @ char (i int (ii) boolean (fe) None of the above A language L may not be accepted by a turing machine if itis recursively enumerable i) it is recursive 3 lid) £ can be enumerated by some $ turing machine 2 {iv} None of the above Write the context-free grammar to create palindrome over (aD, Construct a DFA which accepts the set ‘of all binary strings that interpreted as binary representation of an unsigned decimal integer, is divisible by 5. 747-14 Design a turing machine to compute the sum of two positive integers mand Design ANPDA for accepting the string Le (set of all palindrome over (a, 81) by the empty stack and by inal sat ee eTe a { Continued ) bitps./www akubihar.comorange navy bhrps://wwwakubihar com (5) 4 (al Construct finite automaton corresponding tthe regular (a+ edhe @) Explain the multi-tape version of turing ‘machine and its significance. 7+ 7=14 5. (a) Show given grammar aver alphabet {ab verify whether it i¢ ambiguous or unambiguous Sa/absbfarb ABS /aasb (8) Show that L= palindrome over (a,b) is pot regular W714 6. (a) Prove that if L is generated by a CFG, then Lis accepted by a non deterministic PDA by empty stack. () Design 2 pushdown automaton for the following contextree grammar: 7+7=14 S-+aBiba AnasSibAala B 3 bs|aBB\b 7. (a) Design a turing machine that accepts all palindromes over S)= (a 8) AK-21/251 (Tum Over ) bitps./www akubihar.com orange navy bhrps://wwwakubihar com (6) (b} Explain Myhill-Nerode theorem for ‘minimization of automata with suitable example © (a) Prove that if Lis the language generated by an unrestricted grammar O=(N, T, P, 9, then Lis recognized by a turing machine. (B) Design a pushdown automata for ‘accepting the string for the language La(ww*\we (qa) by the empty stack as well as final state, TeT=14 9. Write short notes on the following : 3¥ox4e14 (2) Minicsization of automata () Type 2 grammar (yey Fe) (6) NP-hard problem (4) Pumping lemma for CFL AK-21—1300/281 Code : 105503 bitps./www akubihar.comCode : 105503 B.Tech Sth Semester Exam., 2021 (New Course } FORMAL LANGUAGES AND. AUTOMATA THEORY ime : 3 hours Rall Marks : 70 1) The marks are indicated inthe nght-hand margin. (iy. There are NINE questions in this paper (00), Attempt FIVE questions in all e°) Question No. 1 is compulsory, A. Choose the correct answer of the following fany seven) Dereld (a) Which of the following statements is/ fare False? A. For every non-deterministic Turing, machine, there exists an_ equivalent deterministic Turing machine. B. Turing recognizable languages are Closed under union and comple mentation. ©. Turing decidable languages are closed under intersection and. complemen: . Turing recognizable languages are Closed under union and intersection iy A and D only {ij A and C only fii) B only fav) C only 22AK/356 (Tum Over } (2) ib) Enumerator ia a Turing machine with (i) an output printer fw 8 ‘put tapes (ii) stack (iv) None of the above (6) The language (a"5"e™" jm, n 2} iw egal (i) context-free but not regular (ii) context-sensitive but not context free (iv) type0 but not context-sensitive (4) The maximum number of states of a DFA converted from an NFA with n states is wn iy ot iy 2" (iv) None of the above 224K /356 1 Continued )fe @ (3) TL and 12 are content Lika a Sot tee, (i) always (i) sometimes (ay never (iv) None of the above Which of the following does not have left recursions? (i) Chomsky normal form {iy Greibach normal form (ii) Backus-Naur form fiv) All of the above Let N be an NFA with n states and tet minimized DPA with m tates a Which recognizing the same languase. Of che following is necessarily true? mst fi nem (ii) M has one accept state ty) me (Tamm Oem 22AK/386 (4) ) isthe acyclic graphical representation of a grammar. () Binary tree fi) Octrce (i) Parse tre (iv) None of the above (A minimum state deterministic FA Acoepting the language Leqwhwe 0.14 where number of 0' and 1's in w are divisible by 3 and 5 respectively, has 15 states (i) 11 states (i) 10 staves (iy 9 states The construction time for DFA from an equivalent NFA (m mumber of node) is 6 O1ne f 03”) 9 O17 (i) O08) ( Conte } 22AK/3862 a) o 3. ta) aa » 5 a 22AK/386 L cs) ‘Tabulate Chomsky hierarchy of grammar with an example for each. Design a finite state machine or abstract model for Parity checker. 7+7=14 Construct an NPA that will accept string of 0, 1's and 2's beginning with {10's followed by odd number of 1's and fending with any number of 2's Construct @ push-down automata that accepts the following language (awh: wand we (a, 0)* and |= |w1) nes Design a Turing machine (TM) to Ccomplate m rod2. tt//wnwatibrcen Design a DFA corresponding to regular expression 1*(10) TeT14 Consider the grammar SAB] BC A> BAla B-+CC|b coaBla Wse the CYK algorithm to determine wheter the eve Sng "babe 18 L(G) or not. (Tum Over) (0) Suppose L is context free and R is regular, justify your answer with the help of example (i) 1s LR necessarily context free? (i 1s RL necessarily context free? 747-14 ©. (a) Show that the language 1 = (a! :n 2 0} is not regular or not context-free language. (0) Let G be @ context-free grammar in Chomsky normal form that contains b variable. Show that if G generates some string using @ derivation with at least 2? steps, then L(G) is infinite. 757214 1 (a) State and prove pumping lemma for regular sets (0) Show given grammar over alphabet {a bj, verify whether itis ambiguous or Uunambiguous S-rasa|dsbjalble 747-14 8. (@) Show that the sum function Sls w=xey is primitive recursive. () Construct a PDA that accepts the language L={a"bejn 20} by final state and empty stack. TeTH14 aoe (Continued )9. Write short notes on the following + 3vix4-14 (a) Post-correspondence problem (0) Chomsky normal form (c) Multistacke Turing machine (d) Pumping lemma for CFL 22AK—1820/356 Code : 105503oor navy ips://www akubihar.com Code : 100508 B.Tech Sth Semester Exam., 2020 (New Course) PROFESSIONAL SKILL DEVELOPMENT Time : 3 hours Pull Marks : 70 Instructions (9 The marks are indicated in the right-hand margin. (i) There are NINE questions in this paper. (it) Attempt FIVE questions in all. (fu) Question No. 4 i compulsory. 1. Answer any seven of the following questions = (a) ® o @ ie} o @ AK-21/284 ‘axT#14 List four skills which are important for ‘group discussion. Define group. What is a schedule? Explain what is a resume. List any four qualities of a leader What is wall-in-interview? ‘What do you understand by ethics? (Turn Over ) bips:/www akubihar.com svsayesd 5 oormmqqnoge navy (h) What are the outcomes of a positive attitude? What, according to you, is the role of independent directors in the board? (Define kinesies, 2. Explain project life cyele using a low chart, 14 3. What is the role of body language in communication? “4 4, What is the significance of group formation? Explain the stage of group formation. “4 S. Define stress. Explain any four methods of stress management. hups//www.akubihar com 14 6. What is the importance of emotional {intelligence in professional life? 14 7. What business etiquettes should be observed by a salesman? Explain, 14 ‘8. What preparations should be done by 2 candidate for a job interview? 4 9. Give the techniques of effective time management. 4 wae AK-21—1980/254 Code : 100508 bips:/www alkubihar.c vss 5“Bitps://www akubihar.com bhrps://wwwakubihar com Code : 105504 (2) 0) Which of the following is a comple- B.Tech Sth Semester Exam., 2020 mentary approach to function oriented (New Course) ‘spproach? ( Object-oriented analysis SOFTWARE ENGINEERING (ti) Object-oriented design (ii) Structured approach Time : 3 houre Fall Marks : 70 Si Both object-oriented analysis and design Instructions (6) Which of the following is not a use of a (i) The marks are indicated in the right-hand margin. CASE tool? (i) There are NINE questions in this paper. (9 te supports structured analysis and design (SA/SD) (9 Atempt FIVE questions in all. (iv) Question No, 2 is compulsory (i) 1 maintains the data dictionary (i te checks whether DEDs are jalanced or not It complies with the available system a a 11. Choose the correct answer (any sever) : 2eTal4 (fa) A characteristic of a software system that can lead to a system error is known, (a) Name of an evaluation technique to assess the quality of test cases is (naman ever or mie ntaon anni pf ys 0 vlan (ity verification (fo) performance analysis (i) system error (i) system failure (Tum over } NK21/260 (Continued } bitps./www akubihar.com bitps./www akubihar.com AK-21/260orange navy brps://wwwakubihar com (3) (e) Which of the following is not a part of bbug repore? (@ Test case (@ Output a paar version ‘Loc Cyclomatic complexity method comes under which testing method? {) Yellow box BY White box fi) Grey box fi) Blac box (om size-oriented metrics, metscs are developed based on the (number of functions (a) umber of wser inputs (Gp mabe Fines of code orange navy @ o bhrps://wwwakubihar com (4) A. software organization has been fasseased at SEI CMM Level 4. Which of the following does the organization need te practice beside Process Change Management and Technology Change Management in order to achieve Level 5? i) Defect detection GH Detect prevention Yai) Detect isolation fa) Detect provagation is a measure of the degree of interdependence between modules. (9, Cohesion af Coupling fi) None of the above (Al of the above (iy) amount of memory usage (a) What is waterfall model for software () Which one of the following is not development? Explain the situation, in desired in a good Software Requirement Which the spiral model for software Specifications (SRS) document? development should be preferred over f) Punctional requirements ‘waterfall model [ij Non-functional requirements (0) A program is to be developed to simulate (ii) Goals of implementation the operations of a sei celular pf Bests for sae implemen inthe aces tbe provided by this etn calculator. Analyze this using a DPD ta Ortevel and I-lewel diagram, na 1AK-21/260 (Tum Over } 8K-21/260 (Continued } bitps./www akubihar.com bitps.iww akubihar.coormmqgme nays 3 fe ye o o AK-21/260 butps://www.akcubihar com (8) ‘What is prototyping model? Explain the problems and advantages of prototyping in detail, Develop a test cate for any testing technique for ‘student admission system’ nT Define cohesion and coupling. Explain various types of each of them, What are CASE tools? With a suitable diagram, explain the categories of CASE. tools. hups:/wwi.akubihar com 1 Explain the roles and responsibilities of the following personnels in the s/w development process : 1 Project Manager (i) Project Leader (ii) System Analyst (iv) Developer Design the following for an ‘E-commerce solution for an electronic products company’ that gives choice co the users to select a/few product(s) from the (Tum Over ) bitps./www akubihar.com orange navy @ ZO Wve shore notes on the flowing ta cy ‘@ AK-21/260 bhrps://wwwakubihar com (6) available range, order them and allow to ‘make the payments online @ Design the DFDs fevel-O, 1 and 2), (i) Prepare SRS document. List sumptions, if any. (6) Design an ER-diagram. List all the cctities, attributes, key constraints ‘and cordialiy (iu) Draw a Gantt chart w) Specify the s/w engineering pre-design which suits this, application development. Discuss the software metric that can be applied to the qualitative assessment of software quality and side effects that occur during maintenance phase How are boundary conditions tested in black box testing? Explain with ‘example, ve S504 Unified modelling language Object-oriented analysis modelling Object-oriented design concepts and methods (Continued } bitps./www akubihar.comormmqgme nays butps://www.akubihar com (7) B. (a) Consider a large scale project for which the manpower requirement is K=600PY and the development time is 3 years 6 months. @ Calculate the peak manning and peak time. (i What is the manpower cost after 1 year and 2 months? (®) What are the risk management activities? Ie it possible to prioritize the sks? Explain with suitable example. 747 “9 fo} What are the diferent architectural styles applied fr software development? Explain with dingrams (6) What is ‘scoeptance’ testing? Explain briefly alpha testing and beta testing with suitable example 7 psy www akubiar.com ‘Whatsapp @ 9300930012 Send your old paper & get 10 wet got te mae 10 wt 8 Paso Google Pas ‘AK-21—1320/260 Code : 10850 bitps./www akubihar.comMLO ARYL MA EAA A MOT ARYAN E A Aa wwwakubiharcom (4) $. (@) UtG be the grammer. given by ‘SAAB /AAA; A+ aBB/e; Bs DBB/A Construct the PDA that accepts the language generated by this grammar G. ) Define deterministic push-down automata. Explain with an example 9. Give « Turing machine— fo) that computes one's complement of a ‘binary number; () that shifts the input sting over the alphabet (0, 1) by one position right by inserting ‘" os the first character. 10. (0) Explain about deterministic context-free language and deterministic PDA. () Show that b= (a"be" :n >=} 19 @ CSL ‘AK13~950/297 Code : 105301 www.akubiharcom Code: 105301 Rose 2013 ay’ FORMAL LANGUAGE AND AUTOMATA THEORY Tine | 3 hows Instructions (@ All questions carry equal marks (@ There are TEN questions in this paper, (i) Attempt any FIVE questions, ull Marks : 70, 1, (aL Explain the disferences between NFA and DFA. () Design a DPA which accepts all strings “which are ending with 101 over an alphabet (0,1): + (@ Obtain the regular expression for the following sets : @ Set of strings over E=(a, b) with exactly two os (Set of all strings over B= (0, 1) which . should not contain the substring 101 (i) L= (www |v, we fa, 8) », 1 =2) . (iu), Set of strings over Z=(a, b, e} with no axis—380/297 (Tum Over) wooueyqnye Man Woo URYIQnye MMAMLO ARYL MA EAA A MOT ARYAN E A Aa wwwakubiharcom www.akubiharcom ua ay foe (®) Constn:ct an NFA (without using Thompson's rule) for the following set Set- of strings over E=(0, 1} with alternate 0's and 1's 3. (a) Give DFA for the following NFA (eis the final sere ‘Current Next State | a - ~ 1. oF a , 2 r 2 ob z z Cos = on x g ) Construct an NPA using © move for VioY T=(le)* albjcys. (@) Give DFA for the NFA constructed in Question No. 8. (b) (&) Find out the regular expression for the 77. (a), Reduce the grammer 6 gven ty S->4Aa; A+8b/bee Dak, Coyabb/DD; Bac; D-van4 Into an equivalent gammar by reisg ‘useless eymbols and useless peducion from it 'S. (a) Design a Moore machine to determine the (2) Convert the folowing gramme it CF residue mode 4 for each binary string GS saAD; A-v4B/ DAB; Bvt Dd treated as integer en Ot} AK13—350/297 {Continued ax13-350/297 ‘ wooueyqnye Man Woo URYIQnye MMACode : 105401 2012 (A) SOFTWARE ENGINEERING Time : 8 hours Aud Marks: 70 Instructions: The marks are indicated in the right-side margin. (@ There are TEN questions in this paper, (ii) Attempt any FIVE questions. 1. (a) Explain the following models with a neat disgram Incremental modet (@ sB1-coM (6) Define S/W risk. List four important S/W risks and their mitigation SMPS. (9 “Top-down and bottom-up estimation approaches are not mumially exclusive.” Explain. S156 2, (a). Give differences foe the following (Program vs. S/W (8) S/W design vs. S/W arcaitecture 12a—200/63 swore alubiharcom! Thm Over } (2) {ii Date abstraction vs, abstraction procedure iv), Debugging ve. testing (o) Explain how S/W project is different from other projects () Explain the importance of UML diagrams, oe 3. faJWhat do you mean by requirements engineering? Explain brielly the steps of requirements engineering (0) Explain the following @ Quality of design and quality conformance @ Coupling and cohesion (a/Coltaboretion diagram: m7 4 (a) /Assaine that a program will experience 300 failures in infinite time, it has now experienced 100, The intial fudure intensity wes 20 faitures/CPU he Determine — (current failure intensity (ij faces experienced and failure intensity alter 20 CPU hrs of execution (0 Deserve the principle of Albrecht's FPA. (©) Brplain tae basic COCOMO model. 54544 12aK—200/63 (Continued ) wow aakubihar.com ‘worw.alubiha.com os gre_* 8. (3) a) Consiter «projet vith ine following functional waits : 10 low external inputs, 12 high extemal outputs, 15 low internal logical files, 20 high external interface files, 12 average external enquiries and a value of complexity adjustment factor 1:2 te unadjusted and adjusted fonction point counts. Explain the following @ S/¥ inspections a and 6 testing (i) Smoke testing Jef Wiatestal model, linenr sequential \-*"" classical life cycle model and traditional 2. 12AK—200/63 software life oyele model of software engineering are not accurate of softwere development activities. Explain. What is the limitation of waterfall model? AF What do you mean by software crisis? Whats its reason? fel Wnat do you mean by SRS? What are / ts characteristes? What are its components? What are the needs of SRS? (Differentiate between requirement and requirement. functional snonfunetional wrmalbihancom (rm Quer) a 10. ja) eo fe 12AK—200/63 Code : ‘worm akubiharcom (4) Write short notes on Raul avoidance and fault tolerance, G8) Deception handling (Gi) Stasistical tating, What do you mean by sofware reliability? How do we measure software reliability? ms Explain the need for software maintenance. Explain the maintenance tools and technique in detail. Also ‘cxplain the maintenance side esfect Why are formal specifications of module desirable? What are the Limitations of ecarrent formal methods and how do they not come into commen tse? 747 "wossegre st What are the factors that influence software quality? Explain them in detail What are different types of CASE cools available in software engineering? What is software reuse? Explain various aspects of software reuse Ste 205401 sww.akubihat.comCode : 105401 2018 (A) SOFTWARE ENGINEERING Time : 3 hours Pal mar + 70 Instucsons {9 The marks are ndeated nthe nohthand margin (6) There are TAN questions in tis paper (it) Attempt any FIVE questions, 2 Wut the principal alm of the sotwace -Giigineering discipline? What does the Aisespline of software enginecring discuss? 14 2. (a) Distinguish between a program and a software product, (o) Draw @ schematic dlagrom to represent the Iterative waterfall model ef software development. T1914 axe’ the objectives of the feasibility ‘study PHase of sofware development? Explain the cSitied cuTauring The oF a woiware de¥elopme AK19~350/280 (2) foet are the relative advantages of using either, the LOC or whe fianetion & o 6 @ e om i co) was—3s0/234 point metric to measure the size of software product? List the major responsibilities of software project manager. Weis How are the’ funetional “and non- functional requirements different? Draw a sequence diagram of ATM withdraw Tees What ase the types of user-interface Sesign? Explain che stages of object-oriented sign proces T7148 According to Boehm, how are verification and validation different? What are various approaches tiken for test-case design? TI-14 What do you mean by algorithenic cost models? Explain. Humphrey's uality plan structure fer cars ( Continued ) swwwakaubihas.com swwwalaubihar.comswow.akubihar.com (3) 9. (a) plain the maintenance cost distibur ton with set istibtion char (0) Beplain the process metios used or sevesing attains. oe AS (a) Beplain the approsches for quality conta, (6) plain Letitan's Yaw for program cretion mmc ro he a 3 sxra-asovaee code + 108401 swow.akebihar.com sos eameswoo aeyigmye-svmaydny Ihetp:/‘www.akubihar.com Code : 051414 B.Tech 4th Semester Exam., 2019 SOFTWARE ENGINEERING Time : 3 hours ull Marks : 70 Instructions: (The marks are indicated inthe righthand margin. (8) There are MINE. questions inthis paper {i Attempt FIVE questions in al {y) Question Mo, 1 18 comguisory. 1,-Choose the correct answer for any seven of "the following eros sof fa) Which of the following activities a generic process framework provides a feedback report? + () Communication \% iy Planning fii) Modeling ana constust fia) Deployment “ (Tum Over} AK9/712 b Intp://www akubihar.com -yggnyeaasyedn woo aeyigmye-svmaydny tnt gitar com fol Which one of the umbrella activity uwine is not an five proceay sat complements the help team manage and control progress, quality, change and riso * @ Reusabitity management (i) Risk management (ii) Measurement (fu) User reviews () Four types of change are encountered during the support phase. Which one of the following is not one that falls into such category? (Translation (i) Correction (iy Adaptation fiw) Prevention one of the following isnot ‘Which , rental activity a fund: eae veto software Validation design and implementation Hy goftwase design and impl i S puase evolution a ip/iwtow akubihar.com wooanyignye-svmaycdnywoo aeyigmye-svmaydny Aeqps/wpsgakepbihar com \_ 6 Which four framework activities are found in the extreme programming ey (Analysis, design, coding, testing (i) Planning, analysis, design, coding + (ii) Planning, design, coding, testing (iv) Planning, analysis, coding, testing of the following statements ‘explains portability in non-functional requirements? —— (Mk is a degree to which software running on one platform can easily bbe converted to run on another platform, (i) 1 cannot be enhanced by using Ianguages, 0S) and tals tat are universally available ané standardized stern to behave © (ii) The ability of the 5Y5 0 Sesoenty ie a uracil ‘manner when operating watnin Te environment for, whie® BF co inumce fiv) None of the apove snaps akbar cont Tum ON" -yggnyeaasyedn woo aeyigmye-svmaydny tmp titan com (g}_ The incorrect sea non-funcuony Rent Wt espe 9 ecuirement (NFR) is f) Product-oriensea approach—focus OF system (or software} quality i) process-oriented approach—focus ~ ~~ on how NFR: can be used in che design process (ii) quantitative approach—find meas rable scales for the functionalis attributes tative approach—study various (iv) quali ros setationship between quality imensions of ry What are te (OME dimension * dependabili? ic reliability, security fy usabilis exit ex y, reliability, maintain fy nosey . bili pseu spins eas 1 oe safety, westabiit eo in Sa Ihttpsiwww akubihar.com y canonued ' wooanyignye-svmaycdnyhttp://www akubihar.com fy What kind of approach was introduced for clicitation and modelling to give a functional view of the system? fH Object-oriented design (oy Booch) * fe) Use cases (by Jacobson) ff] Fusion (by Coleman) 0) Object-modelling technique (by Rumbaugh) ___ and ____ are the two viewpoints \——" Giscussed in controlled requirements expression (CORE) (9 anctional, nonfunctional (i) User, developer (i) Known, wnknown fi) All of the above seware development lifecycle Fey tops 2 Be Eg Diseuss various fb) What are various myths about software? jyes of software fa) What are the main objective ~& Whtcaton and vardasion? Beefy explain different v and ¥ re =60 Maries in Physics >=50 Marks in Chemistry > +40 Marks in all tee courses >=200 If aggregate marks of an eligible candidate fare more than 225, he/she will be eligible for ere tors couree, oterwise he/she will BE Thgible for pass course. The program ready Cale po in ae three cOUrsES and generates the following outro! @@ Not eligible fe) Blgie # #00 EE ji, eligible © (ig PH ges using decision table testing onoure course Design test 14 technique ¢ wxonomy of architectural We, ite a briet description of sy 5. fay write styles each © (Continse? } je AKO/T32—https/seww akubihar com wooanyignye-svmaycdnyJE Write short notes on te following LT) Why AK) T12 naps akubthar.com ) fo) State and explain the generic tasks that are always Pétformed in user interface design. p74 6. Consider a large-scale project for which the ‘manpower requirement is =600 PY and the “development time is 2 years and 6 months. (a) Calculate the peak manning and peak time, () What is the manpower cost after 1 year and 2 months? T7148 SeSed014 (a) Unified modeling angusee (0) Objectoriented analysis modeling (q Ovjectoriented design coments 74 methods a requires? sofware mane ee? Briefly explain soft process models. ———— What are ? (D-What is software qui”, quality? three dimensions of #00" 7714 lain i Explain in brief [nm oer) Intp://www akubihar.com od woo aeyigmye-simaydny 9. (a) ® Ihetp:/‘www.akubihar.com (8) List out various activities that are encompassed by system designed process under objéct-oriented design and explain each one briely Explain the object modularization with example, rse14 hitpy/ we w.akubihar.com ‘Whatsapp @ 9300930012 Your old paper & get 10) yok te a ate 10 eek Papin or Goosle Pay 2 Intp://wrww akubihar com woaanyignye-simaycdnywoo aeyigmye-svmaydny Ihetp:/‘www.akubihar.com Code : 051509 B.Tech 5th Semester Exam., 2019 DATABASE SYSTEM Time: 3 hours Pull Marks : 70 Instructions (9 The marks are indicated in the right-hand margin. (i) There are NINE questions.in this paper. (ii) Atempt FIVE questions in ail (iv) Question No, 1 is compulsory. 1. Answer the following as directed (any seven) : 27-14 (a) play an important role in defining and maintaining a database for an organization. (Fl in the blank } () The strong entity type and weak entity type participate in relationship, (FU in the blame) (o) A level that describes how a record is stored is #9 Bhiysical (i) logical fy user (to) view 20AK/349 (Tum Over } Intp://www akubihar.com -yggnyeaasyedn woo aeyigmye-svmaydny Ihetp:/‘www.akubihar.com (2) (d) Which of the following is true? @ Every relation in 3NF is also in BCNF (i) A relation R is in SNF if very non-prime attribute of & is fully functionally dependent on every key of R fis) Beery season in BCNF is also in NF fie) No relation can be in both BCNF and 3NF (Choose the correct option ) (e) Consider the relation scheme Re(E PG HLSK1 MM and the set of functional dependencies HE, FY 1G), (P91 DB > (K, 1), KL on R, What is the key for R? O17) FAs, FH (i) (EP HK, 2) i (8) (Choose the correct option } 20AK/349 (Continued ) Intp://www akubihar.com wooanyiqnye-smaycdnyIhetp:/‘www.akubihar.com Ihetp:/‘www.akubihar.com (sy (4) (Given the Studenta relation a8 shown 7-H fonctionaly determines 8 and B below : does not functionally determine C Suen] Sereno] Sader | Seeage | OPE (i) B does not functionaly determine C 2345 [shankar Ishentar@eeah |X [94 tv) A doea not functionally determine B a TT iss tnd 2 does net. functionally 7a55_|shantar —[>nankargeae | 19 | 94 determine C 9076 [wai [awatinech [1 [93 ( Choose the correct option} 3765 |Oanesh —|pmeangciel_| 19 87 Oy Date base is generally For (StudentName, StudentAge) to be (9 system centered = the key for this instance, the value X z og ses centered q should not be equal to 3 ‘company centered z 018 z 2 fu) data centered : @is 2 2 (Choose the corset option) z a 15 BOE W The restriction placed on data is said fy 20 BoE tbe piesa ( Choose the correct option ) Bog fy cui {) From the instance ofa relation acheme (a) parameter RAB O io constraint (Choose the correct option} An object in databases is equal to + relationships, () data i) ayeibure wwe can conclude that ity @ A functionally determines B and B fv) constraint functionally determines C (Choose the correct option } | 20aKyaas (Tum Over } 20aK/349 { Continued ) | Intp://www akubihar.com Intp://wrww akubihar com woaanyignye-simaycdny3. @) % 20AK/349 Ihetp:/‘www.akubihar.com (8) Draw and explain the three-level architecture of the database system. 7 Compare the tadilonial file-based systems and relational database ‘management system approaches. 7 ‘What is a view? Can we update a view? Justify your answer. 4 When we try to modify any table in database system, we encounter some side-effects if the tables are insufficiently normalized. Can you explain those side-effects with the respective examples? 8 List out various constraints in relational ‘model and explain in short Discuss the correspondence between. ER model construct and the relation model construct. Show how each ER ‘model construct can be append to the relational model using the following description of an.organization : 10 ‘An organization uses number of items of ‘an equipment.to produce goods. Each item is at one LOCATION, of one TYPE and has a DETAILED DISCRIPTION, Faults on the equipment are identified by a unique FAULT ID and are reported at a TIME_REPORTED, Any number of Intp://wrww akubihar com (Turn Over } woo aeyigmye-svmaydny 20AK/349- ihetp:/‘www. akubihar.com (6) persons may be assigned to a fault and ‘work on the: fault until it is Gxed. ‘The TIMEFIXED is recorded as the ‘TIME_SPENT by each person on a fault. ‘Any number of parts may be used to repair a fault. The QTY.USED of cach part is recorded against the fault. Each part is identified by a PART.ID and has 2 given weight and MAX DIMENSION and can have any number of colors. (©) Write a short note on types of attributes and their representation in ER model with neat figures. 5. Considering the following schema, create the appropriate tables and insert at least 5 records ¢ AUTHOR (author-id, - name, city, country) PUBLISHER (publisher-id, name, City, country) CATALOG (book-id, tile, author-id, publisher-id, category-id, year, price) CATEGORY (eategory:id, description) ORDER-DETAILS (order-no, booicid, quanti) Write each of the following queries in SQL and relational algebra fa) Obtain the names of authors who have 2 or more books in the catalog. Intp://www akubihar.com { Continued } wooanyignye-svmaycdny7 cc] @ co) @ Ihetp:/‘www.akubihar.com (7) Find the author of the book which has maximum sales. ‘Obtain the names of author who have ‘maximum number of publisher. Obtain the name of the city, author, publisher where publisher and author belong to same city. Obtain the title of books which has ‘maximum sales Obtain the book-id, description for the author who have exaetly 3 books in the catalog. . Obtain the author and publisher who have published books in more than or equal to 2 categories. You are given the following set F of fametional dependencies fr a reaton RIA B, CD, B, F):F = (ABCD, "ABD > B, CD-+P, CDP -+B, BF Dy 6) ind al keys of R base on these ina endl cent in Bope-Cs 1 ae amo #aNF? Belin ur anew ee a Pte simplified (oy Pe incinal dependences erates oo onc 4 a ti) She whan sd the iefehand side ae ences) witout chaneit Sertinsare of F Ge. Po? (Tum Over} 200K) 349 Intp://www akubihar.com woo aeyigmye-svmaydny o 7. (@) o 8 ® 9%) & 20AK—1870/349 Ihetp:/‘www.akubihar.com (8) Compute the cloguce of the following set F of functional dependencies for relation schema + (A, B, GD, B).A-+BG, CD98, B3D, B9A List the candidate keys for R 5 What is the need of normalization? How many types of normalization exist? Explain in detail with uitable examples. a What is tigger? When are they used and why? Explain, 6 For the following set of key values constrict a B+ tree with a degree 4: 5, 10, 15, 29, 35, 46, 58, 63, 67, 89 Initially tee is empty. Values must be added in ascending order. Show the step-by-step construction, 10 What is multilevel indexing? Explain in detail, 4 What is two-phase locking protocol? Explain its working in detail, How ean it guarantee serializability? 7 Discuss the various approaches for handling the deadlocks in dbms. 7 Code : 051509 Intp:/wwww akubihar.com wooanyignye-svmaycdnywoo aeyigmye-svmaydny Ihetp:/‘www.akubihar.com Code : 051717 B.Tech 7th Semester Exam., 2019 ARTIFICIAL INTELLIGENCE, Time : 3 hours Pull Marks : 70 Instructions (9 The marks are indicated inthe righthand margin. (i) There are NINE questions in this paper (8) Attempt FIVE questions in alt. {iv) Question No, 1 is compulsory. 1. Answer any seven questions 714 AG What is meant by Taring test? @ or he criteria for the evaluation of ‘search strategy. Jey “Whak are the two types of memory bounded heuriatic algorithms? (a) Define satisfiablity of a sentence, (e) Why doos uncertainty arse? _ Wat in meant by belief network? (@) Define meta-knowiedge in expert system. 208/482 (Tum Over } Intp://www akubihar.com -yggnyeaasyedn woo aeyigmye-simaydny ihetp:/'www.akubihar.com (2) (%)_Write~any two differences between ‘eaditional computer system programs and expert systems. What is an atomic event? @) What is the need for utility theory in uncertainty? 2. (a) Discuss the applications area of Artifical Intelligence. 7 ) Explain AO" algorithm with an ‘example. nip:heww.akubihar.com 7 3. (@) Whatare the steps to convert firs order logic or predicate logic sentence to normal form. Explain each step. 7 (} Describe constraint satisfaction problem in detail 7 4. Consider this knowledge-base (KB) for an Instance of the Blocks World problem ® ao OB Query : Sw above (w, 5 KB for Blocks World problem 1, on &Q) 2. on ©. 20aK/482 (Continued ) Intp://wrww akubihar com woaanyignye-simaycdnyIhetp:/‘www.akubihar.com (3) 3. on & D) 4. on (x, y) = above (x,y) 5. on [x 2) Aabove (2, y= above (x ¥) 20AK/482 Use backward chaining (with Generalized Modus Ponens rule) to answer the query 3w above (us By Draw the complete AND-OR proof tree showing all the answers to the query. Define prior probability and conditional probability. State Bayes's theorem. How J it useful for decision making under uncertainty? Explain for non-monotonic logics Write down the difference between Forward reasoning and Backward reasoning. Discuss the role of Probabilistic reasoning in handling uncertainty What is the meaning of the word ‘Heuristics’ in the context of search strategies? What conditions on A" search is required to guarantee completeness and optimality? Prove admissibility of A search strategy. Intp://www akubihar.com 7 (Turn Over ) woo aeyigmye-simaydny 8 @) o % fa) % 20AK—1880/482 Ihetp:/‘www. akubihar.com (4) ‘Why is MYCIN considered important in the development of expert systems and hhow did ic lead to EMYCIN? 7 Explain Expert system shell 7 Explain Semantic network with suitable example. 7 What are the steps in Natural language processing? List and explain them brief 7 Explain the application of Natural anguage processing in Al. 7 hitpy/ we w.akubihar.com ‘Whatsapp @ 9300930012 Your old paper & get 10) yok te a ate 10 eek Papin or Goosle Pay 2 Code : 051717 Itp://wwww akubihar.com woaanyignye-simaycdnywwwakubiharcom Code : 051414 Breck, 4th Semester Exam., 2015 SOFTWARE ENGINEERING Time : 3 hours Pull Marks: 70 Instructions : (@ The marks are indicated in the right-hand margin. (i) There are NINE questions in this paper. (ii) Atempt FIVE questions in all. (iu) Question No. 1 is compuisory. 1. Answer any seven questions : 2x ()/What are the advantages of using spiral model? (®) Write any one difference between function-oriented design and object- oriented design. (q_- What are the important parts of an SRS document? (d) Write down the characteristics of a good software design. fe) What do you mean by functional independence? Vee Ez rcom www.akubiuredm =” ' ros Hey gE HAs wwwakubiharcom (2) YWnat is the importance of data in data flow diagrams? Differentiate between black box testing ‘and white box testing. (ty What do mean by risk + management? you (@ External entities may appear at all levels of DFDs, Write as true or false ‘with justification, @ What do you mean by statistical testing? 2, Explain in deta Ue cagicalwatertl model Opeth help of nest snd labeled diagram. © Differentiate between cohesion and coupling and state their types in brief. 4. Define UML and the nine types of diagrams 7" associated with it in detail. © what are the different COCOMO models? Explain the phases involved in the detailed COCOMO model. 6. What is capability maturity model? Describe all its levels in detail ‘AK1S—S20/567 Www akubihar.com 4 14 4 14 4 (Continued ) wivw.akubfhar.com ros Hey gE HAswwwakubiharcom (3) _Z> Baplain SRS and its puts. Deseribe some important characteristics of a good SRS document, 4 Explain coding standards, coding guidelines ~Y and code review techniques in deta 14 9. Explain various types of static and dynamic testing tools 4 AKIS—520/867 Code : 051414 aS wlw.altidbiharcom ~ ‘evi akubihatcont ros Hey gE HAsCode : 051509 B.Tech. Sth Semester Exam., 2014 DATABASE SYSTEMS Time: 3 hours Fall Mares : 70 . Instructions: (9 The marks are indicated in the rightchandd margin. There are NINE questions in this paper. (i) Attempt PIM questions in all. (ie) Question No, 1 is compulsory, + Choose the correct answer (any seven) (0) Which of the following is true regarding files? @ Databases and Selds (i) Pictds and records fil) Databases and recone fv) Records and sexts fo) What ie the purpose of project operation? fi) Wt selects certain cotumns (i) 1 selects certain tows (ii) We selects certain strings (iv) WC selects certain integers axTe14 AK1S—1260/133 (Turn Over } (2) (9) + Which of the following normal forms Js considered for normal relational database design? @ ist to BONE Gi) 200 (toy ea (4) The weak entiy set docs not have sufficient attributes to form @ primary key 6) candidate key (ii) Both (@ and (2) ) sapercey fe} Which of the following is false about the DML? (W It refers to data using physical addceases (i) 1 cannot interface with: high-level programming language fii) 1 is uscd to define the physical characteristics of each record {w) AU of the above AK1S--1260/193, (Continued }akubihar.com 15) xplain the meaning of the existential quantifer and universal quantifier with, examples. How are aliases used in SQL queries? ‘What is the purpose of using an alias? . rat o 4. Consider the following relational databese in which CName ia & company mare Lives (Name, Street, Cy] Works (Name, CName, Salary) Located-in {CName, City) Managce (Name, Manaj Formulate the following queries in SQt Si5eo14 name) Find the mame of all people whe work for ABC Bank, Find the Name, Strect and City of ail people vho work for ABC Bank and earn more than ¥ 55,000. 0 % Je) Find all people who live in the same city and on the same street as their aang, What are top-down and bottom-up approaches to database design? 5. (>) explain the reasons for the update, ineortion and deletion anomalies. 7+ AKIS—1260/188 kubihar.com AKIS. fo) ® a) @) 0 fa o 1260/133 16) Describe the characteristics of a table that ig not in normalized form. Describe hhow much such a table is converted toa first normal form refttion, What do you understand by attribute closure? Give an example. TTe14 What is the importance of query optimization? What is its objective? Describe the different steps of query processing. Are these the same steps of a procedural language compiler? Explain, 7+ Explain how query parsing is carried out in a DBMS, Descrite the basic approach used in cost-based query optimization used in system F. DIA List the properties that a transaction ‘must have, Briefly explain them, When do two transactions running concurrently conflic!? Explain RW and WW conflicts. D714 Code | 051509AK15--1260/188 akubiha 15) fa) Explain the meaning of the existential quantifier and universal quantifier with, examples. (8) How ase aliases used in SOL queries? ‘What is the purpose of using en alias? . prea Consider the following relational database in which CName f2 & company name Lives (Name, Street, Ci) ‘Worts (Name, CName, Salary) Located-in {CName, City) Managce (Name, Manager-name) Formutace the following queries in SQL = SISA14 fa) Find the name of all people whe wort foy ABC Ban. (b) Find the Name, Strect and City of all people who work for ABC Bank snd earn more than # 55,000. Je) Find all people who live in the same city and on the same street as their raanagrr, fa) What are top-down and bottom-up approaches to database design? (fo) Explain the reasons for the update, ineertion and deletion anomalies. 74 14 akubihar.com rcom 6. fa) ” 7. fa) a 8. (a) o (a) o AKIS- 1260/133 (6) Describe the characteristics of a table that ig not in normalized form, Describe how much such a table ts converted to a first normal form refttion. What do you understand by attribute closure? Give an example. THTe14 What is the importance of query ‘optimization? What is its objective? Describe the different steps of query processing. Are these the same steps of fa procedural language compiler? Explain. 7 Explain how query parsing is carried ‘out in a DBMS, Describe the basic approach used in cost-based query optimization used in system R. D714 List the properties that a transaction must heve. Briefly explain them. When do two transactions running concurrently confict? Explain RW and WW conflicts Tad Code | 051509akubihar.com Code : 051509 B.Tech Sth Semester Exam., 2015 DATABASE SYSTEMS Time : 3 hours Pull Marks | 70 Instructions (The marks are wdicuted inthe right-hand margin (i) There are NINE questions in ths paper (i) Anempe FIVE questions alt fio) Question No. 1 is compulsory 1. Answer any seven of the following as directed D714 fa) What in data abstraction? (0) Which of the following schemas defines ‘a view of views of the database for particular users? (a External (i Internal (ii) Conceptual ftv) None of the above ( Choose the correct answer } AK16/341 (Tum Over ) a) 2 organized lowing, scher (6) Which of the how and where the data i & physical data storage? Y Inverna fy External (is) Conceptual iv) None of the above (Choose the correct answer | (a) The number of ateributes in a relation is called the ____ of the relation.degoee. (Ful in the Blank ) fe) In E-R diagrams, ___ are underlined. 2 My ' (Fill in the blanc ) (‘The arrow notation (9) in FD is read we abpenelint (Fill in the blank ) (@) 4 NF is violated when @ relation has A ndevirac -rmutive vel 7727 doit (Fill in the blank ) (hy During the query processing, the e7nits fof the query is checked by (Ful in the blank } akubihar.com {Continued } ‘AK16/341akubihar.com ” 0 2 o 3 oh Aki6/a41 Which of the following is validation based concurrency control? fy Validation (a) Write ay Read (00) All of the above (Choose the correct answer } Locking can be done at which level? 1 Page level (ty Row level {tty Database level ftv) All of the above (‘Choose the correct answer } Who is @ DBA? What are the responsibilities of DBA? 7 Describe the main components of 8 DEMS. 7 With example, explain how relationship and weak entities of an E-R diagram are reduced/mapped to tables 7 Draw an E-R diagram for your college. 7 (Tum Over ) 4 o 5 aa) 0) Define the structure of well formed formula (WPF) in beth ‘the tuple Felational calculus and 8 domain relational calculus What do you mean by felational model of database aycieme Explain the significance of dom, ain and keys in the relational model, Fucture of a With example, explai : in superkey, candidate Key, primary key and foreign key, What is the role of cursor in embedded SQL? Explain how it is used. wtn example, © (@/What do you mean by assertion? Explain, ‘What is functional dependency? Explain its types, 7. (/ Compare 3 NF with BCNF OF Explain 4 a a Aki6/941 What are the typical phases of query Processing? With a sketch, discuss these phases in high-level query Processing. akubihar.com 7 (Continued }0 9 «a a Expian how —Rewriae query Sptumisation is performed with an sample akubihar.com What is senalzability? Explain view serializabilty ‘What are ACID properties of a database {ransacton? Discusa each of these properties, How do they relate to the Concurrency control? Give example to iuustrate your answer Ak16—1120/341 Code : 051809moo aPyqUyE As mos Heys nye AAAs Code : 051509 B.Tech S® Semester Examination, 2016 Database System Time : 3 hours Full Marks : 70 Instructions : (The marks ave indicaned in the right-hand margin. (ii) There are Nine questions in this paper: (iii), Attempt five questions ial. (iit) Question No. 1 is Compulsory. Answer any seven of the following as directed :2*7=14 (a) What is data redundancy? (b) List advantages of Database system overa filesystem. (©) Define properties ofa B* tree (4) Define weak entity setin E-R model? fe) Architecture ofthe database can be viewed as PTO. moo aHqNE-AANA moa rey. noyR MAA moo aeygnE As mos Heys nye ANAL. Sg Twolevels i) Fourlevels Gi) Onetevet Ger Threelevels (Inthe architecture ofa database system external level i tte: @ —logicaltevel VS Viewleve i) conceptual evel Gs) Physical level () NULLis: @—Thesameas( for integer (3) ‘The same as blank for character (i) Thesameas( for integer and blank fore! HT Nota value (h) Which ofthe following normal form sbased on muitivalss dependency? Code 2051508 moo urges mo rey noye MAA.@ Fim (by Why do youneed normalization in database ” Explain alg ‘anomalies with suitable examples. How many types y Second ‘nonnalizations exist? State cach oncofthem with standan This examples 7 2 @) Fourth z 2 3. (a) Define DBMS and state the differences between dated e @ Who proposed the relational model? e e information and knowledge. 1% EZ Riven z E _(b) Whetis functional Dependency ? List out its Armstrong! = 5 . z : axioms and waite the procedure to compute F-closure. 2 EB. Codd 3 2 8 2 we z 2 75 (Charles Babbage . 4. (a) Define the concep: of aggregation. Giveswo examples Bil Gates where this concept is usefill. 7 Which ofthe followingié not Un ” ©) Which ofthe followingi#hot Unary operstor {(b) Here is a set of FDS Tora relation R (A.B.C.D,E,F.G}: © Select F = {4-3 BBC DE, AEF 3 GAC DE} 2G Project q Z ‘ i 2 3 2 2 i. What are the candidate keys for R ? Justify Your answers =z = z it IsR in BCNF? Justify your answer. z Ez z Ez z z z Ee ii. Givea 3NF decomposition ofthis elation. g E (@ Discuss thecandidate key, primary key, superkeyand 3 8 8 5 ow eianke 7 8 5 iv. Is youranswer above aloslessjoin decomposition that is dependency preserving? Code : 051509 3 PTO. Code :051509 45. (a) Whacare the various characteristics of SQL ? Discuss fiveagaregation functions witha suitableexample. 7 (0) Lethe following relation schemas be given: 7 ReAB, 4 (ABO) 2 S=(D.E.F) Eo @ av) = 3 Op Z (rx ‘ Ry 6. Inthe ER diagram piven held the relationship Contacts ‘ary that involves waste. asta. and a movie. The intent is that one studio, having acertain star under contract, may i further contract with asecond studio to allow that stato act B hapanichrmoe E (a) Write therelation schema that would describe the relation B - Contracs. 7 5 (oy Modifythe ER diagram givenin order replace the four sway Contracts relation by an entity setand write down the corresponding scherva 7 Code : 051509 3 PTO. moo aPMqUyye AANA mos sRysqMywAAAL moo aeygnE As moa aEysqnyE Ass 7 Consesng thet nsactions as stated in figure. Figure} seme: ine | Figure ream TW Taman | Tanai adem feed-tome7 eae: ween wre om Woh en era nec ie Bente Code : 051509 moa uRyqNTEAAAL(@) Check whether the schedule shown in Figure.2 and Figure are serializable or not 7 (b) Ifyesino state the reasonsand in case of non-seralizable, ‘conver ito serializable 7 . (a) Compare the deferred-and imumediate-modification version of the log-based recovery schemes, in terms of cease of implementation and overhead cost. 7 moo aeMgnyyANs (b) Under what conditions is it less expensive t0 avoid ++, deadlock than to allow deadtocks to occur and thea to detect them. 7 9. (a) What is B+ ree? Whyghty are used forindexing? How toconstruct the Be tee? 7 (b) Wate Short notes on the following: 7 (Lock based protocol (Shadow Paging mos Heys nye AAAs Code : 051509 7 moo aga EAA mos aeyyqnyyR NAACode : 051509 akubihar.com B.Tech Sth Semester Exam., 2017 DATABASE SYSTEM Time : 3 hours Full Marks : 70 akubihar.com Instructons WY The marks are indicated in the right-hand! margin. (i) There are MINE questions in this paper. (i) Anempt FIVE questions in all (i) Question No. 1 is computsery 1. Pill in the blanks (any severd aera (a) & description of data in terms of a data ‘model is called a (0) Information about the conceptual, external, and physical schemas is stored in the fe) The weak entity set must have participation inthe identifying relationship set (a) The ___, also called arity, of relation is the number of felds. (e)_ In relational algebra renaming operation is denoted by ___ operator. DA wigger description contains three partys, and BAK /S9 (Tum Over ) ‘akubihar.com (2) ‘akubihar.com (g) The set of all functional dependencies (FDs) implied by a given set F of FDs is called the F, denoted by __— [hy X1eV is a trivial MVD if__or (SOL queries are optimized by decom. posing them into a collection of smaller units, called allows Us to identify @ point in a ‘transaction and selectively roll back operations carried out after this point o 2. (a) Design a generalization-specialization hierarchy for a motor-vehicle sales company. The company sells motor- cveles, passenger cars, vans, and buses. Justify your placement of attributes at ‘each level of the hierarchy. (®) Explain the difference between condition- defined and user-defined constraints. Which of these constraints can the system check automatically? Explain your answer. akubihar.com 3. (a) List two reasons why we may choose to define a view. (®) List two major problems with processing update operations expressed in terms of views. akubihar.com BAK/59. { Continued } 7BAK/59 (4) (3) akubihar.com block is translated into 7. Describe how # query Consider the relations below sa extended relational algebra, Describe and Passengers (Name, Address, ABe) Sroteate dhe extensions to relational alge Reservations (Name, FlightNum, Seat) Ginn are at expressions the foc! a Mights (FightNum, DepartCiy, DestinationCity, Opts? skybiharscom DepartureTime, ArrivalTime, Mimutestte) com canta ovect Write the following queries in relational 18. when do two actions on the ame data ect tetra mine sMhnice Explain with example the anomal ‘akubihar.com that can be caused by conflicting actions, 14 {a} Get the names of passengers who had a reservation on a flight that was more What transaction characteristics cana than 30 minutes late 9. Whi trot in SQL? Bxplain in brief programmer cont O17 Eat ee () Get the names of passengers who had the. diferent access modes and olan reservations on all flights that were levels in particular. How can the isolation more than 60 minutes late, level and access mode be set ; transaction? Show with example. ¥ (a) What is the dependency closure F* of a ‘akubihar.com set F of FDs? How can you compute the tee closure of a given set F of FDs? 7 (b) What is the attribute closure X° of a set of attributes X with respect to a set of FDe F? Give the algorithm for computing the attribute closure of a set X of attributes, 7 akubihar.com When is the decomposition of a relation schema R into two relation schemas X and Y Said to be a lossless-join decomposition? Why is the property so important? Give a necessary and sufficient condition to test whether a decomposition is logsless-join. 14 BAK—1210/89 Code : 051509 (Tum Over )Lnttp s/w 3 Code : 051509 B.Tech Sth Semester Exam., 2018 DATABASE SYSTEM Time : 3 houre ull Marks : 70 Inserutions (9 The marks are indicated in the righthand margin, (0) There are NINE questions in this paper. (i) Attempt FIVE questions in al, (4) Question No. 1's compulsory. 1. Choose the correct answer (any sever) : 27=14 (a). Data model is collection of conceptual tools for describing dara fi) data schema (ai) cons tency constraints fi) Al of the above () Data models in DBMS are classified into — categories. as wy 4 (i) 5 2 AK /148 (Tum Over wo anaes Ihttp:iwwwakubihar.com_ (2) (o) Object-based logical models are used to describe data at (0 logical level (8) view level i) physical level (iv) None of the abore (a) The erm in weed to refer to arom 0 atsibate i) bepte (9 fea fw) instance (eo) What ie an instance of @ database? (The logical design of the database system (iy The entire set of attributes of the database put together in a single relation fi) The state ofthe database system at any given point of time (fo) The initia) values inserted into the Aatabare immediately iter to AK9/148, {Continued ) wo anaes Ihttp:iwwwakubihar.com_nttp w/w i (3) Wa a foreign ey? Af is a primary key of OY relaton whieh team oes in nother relation (9A tocign key io 8 superiy of 2 felaion which isan atebute in thore than one other relations yA freien fay fn an atrbute of a relation that is a primary key of Shother rlton 1 A forign key i the primary key of 2 Raton that doce not occur toymnere eatin the schema (©) To incade integrity constraint in an ening relation ae (9 reat table An aa (ms tae (5) alter table (i) drop table PR) Which ofthe folowing is not an integrity ‘constraint? (@ Not mu (i) Positive fil) Unique (0) Check ‘predicate’ AK9/148 (2um over) wo anya nay Ihttp:iwwwakubihar.com_ 3 (6) 5. Consider the universal relation Ra{A,B,C,D,B,P,G, Hy} and the set of functional dependencies (A,B) >{C), (A) 910.2), 18) 91), {F) 916. #1), D) 1h) What is the key for R? Decompose R into ‘NF, then 3NF relations. 4 6. (a) Bxplain the diferent integrity constraints i Jn database eystem with the help of 2 example 7 8 (2) Briefly explain the ACID property of F atabase system, 7 | 7. (@) Explain the select, project join and division with the help of example 7 ) Explain the immediate update and deferred update of recovery techniques, 7 8. (a) What are muttivalve and join dependencies in the database system? Explain with the help of example 7 ) What do you mean by concurrent ‘execution and serialzabilty in database soatem? 7 AK9/148 (Continued nuipilwoneakabtbar.comhttp v/www.akubihar.com (7) 9. Write short notes on any tuo of the following, Tas fa) BR models (%) SQL and embedded SQL (0) Referential integrity in database (4) Query optimization ing wo anagaye ny ‘AKo—1990/148 ‘Code : 051509 Ihttp:iwwwakubihar.com_MLO ARYL MA EAA A MOT ARYAN E A Aa wwwakubiharcom 1s) o) Design & PDA to accept the language wou" Jw belongs to (4°) by empty stack, 4 (a) “Prace using pumping lemma that the folléwing language is not CFL 3 : Lefalble t=) 9. (a) Design a TM over {a,b ¢} to accept the language = {uw |w belongs to faa’) 7 () Design 2 Turing machine forthe regular expression O11" 7 Code : 051611 14AK—400/696 www.akubiharcom Code : 051611 B.Tech 6th Semester Bxam., 2014 FORMAL LANGUAGES AND ‘AUTOMATA THEORY ‘mes Pll Marks : 70 structions jp The marks are dented in the righthand mara. fi) There are NINE questions inthis paper. (a) Artempe FITS questions tal (a) Question No.2 is compulsory correct option of the flowing 1. Choose the (any sever) wre fa) The output of the Moore machine depends @ only on present state (@) only on current input sjribol th on present state and current input symbol , {u) None of the sbove (0) The tngic of pumping Yemsna is © ot example of “ nip The pigeonhole principle = ij the divide and conquer teehnlaa= fi) recursion (iu) iteration 14AK—400/696 (Tam Over} wooueyqnye Man Woo URYIQnye MMAMLO ARYL MA EAA A MOT ARYAN E A Aa ¢ a%rwakubiharcom: fe Recurtrey enumerable langutges are sot loo ber i@ union intersection {8 complementation () concatenation (4) The language Lalarsrat, regular language "LAY content-free language (i) non-contexttree language (0) None of the above (1 A language 1 is denoted where n=1.2,3,..) o mneoas by 8 regular en og tte) ich of the folowing ia n string within 22S PO & Vent Ox NE xycyx (i ye G2) None of the above O Context-t Contes languages are st cone (fii) concatenation 1AK—s00/696 (Continued ) wowakubiharcom (o) Recursive languages are (9 & proper superset of CFLs (i) always recognizable (Gi) also called type 0 languages Af) recognizable by Turing machines (4) Choose the incorrect statement ; () Bvery subset of countable set ig countable (i The class of DPDA is not countable (ii) The class of TMs is countable (io) The class of LBA is countable @ Which of the following statements is rue? A The language (a In ta prime} ig regular language §) The union of 2 recursive languages (Gi) Recursive enumerable languages are closed under complementation (Gv) Recursive languages are not closed ‘under complementation @) Incase of TM, by reading input x, TH @ may go to halt-final state (i) may go to halt-non-final state (ii) may go to infinite loop (iv) All of the above 14AK—400/696 (Tum 0 wooueyqnye Man Woo URYIQnye MMAMLO ARYL MA EAA A MOT ARYAN E A Aa wwwakubiharcom (4) 2 (a) bin the separ exreon for the Sowing sea pe10 SW Set of wengs over =a 9) ws leat one nad wt as Set of strings over Bo a.y P Sone pegs FON a L={a™* in>=0} fe) Set strings over = (a 9 where All run of have length oe mulipse of tee (27 22.91 a posible strings of tenets four over £= (0,3) (0) Diierentiate between. Moore and Mealy ‘machines, 2 (¢) Dilferentiate between NFA and DEA. 2 (@) Construct NFA equivalent % the following regular expression 4 10/0}19071 (®) Construct an NEA for the following set: 5 Set of all strings over E=(0.1, containing at least two 0's y (6) Construct NFA for the set of strings over E= (0,1) of alternte 0's and 1's, 14aK—400/696 www.akubiharcom aff dss “4 (ay Construct a DEA for the ‘expression r= (abe “ala i (2) Find out the regular expression er the following FA , TP Simtt Goren Stes | OT l * es Here, ris the final state Moore mach » s (a) Constrict ine equivalentS to the following Mealy machine 8 Ign Spit Ps xs | op a o ° a @ . e @ n # e v of ° @ () Prove the following two properties ‘aes (@ Regular sets are closed over the union operation 14AK—400/696 (Tum Over} wooueyqnye Man Woo URYIQnye MMALOD AML EAA A LOT ACUTE AE AL AAA wwwakubiharcom 16) res cowed over the 0 tcsan operon emma stow with the tp of pring ema pun he following language no o ‘ zs pia pine mney 6 (a) Give “the CFG for the following languages sear @ Bs (a"b"a" In >=0,m>=1) (7 Set of strings over =(a,) with exactly twice as many a's and Bs (@) Find a CFG. for the following regular expression ‘ = (baa abby (9) Let G bea context-free grammar, which is defined a S-rasb|ab Find the CFL generated by 0. 4 7 (0). Find a regular grammar forthe following regular expression 4 = (abbb | ba)*ab 14AK—100/696 {Continued www.akubiharcom @) Determine a CFG without production equivalent to the erg pred the CFG gin > apc a Asa : Bocl cap Doe (©) ind the CNP (Chomsky Norma for the following CFG : Form) S—aAbB 8 An Ablb : Bo Bala : (4) Biminate the nul folowing CFO 4 s+aza | sana] 6 \peny Asaic |e say Boeale en. e productions from the Prove that the CFL's are not dosed under intersection, ©) Design « PDA to accept the lange L={atp - In>=1)) by empty stack. 14AK—400/696 (tum oe WOdUEYIQnyE MAM Woo URYIQnye MMAakubihar.com B.Tech 6th Semester Exam ORMAL LANGUAGES AND AUTOMATA THEO! punt Marks: 70 1. Define any seven of the fallowing = 27°14 _f-Poplcatons of asta ory Zo Finite awomat Sle Transition graph Lf». Boson vaoation (fe) Regular expression Regular language ing acepabe Tov Meaty machine (9 Reduebilty @ Enumerable language AK1S-820/896 akubihar.com akubihar.com (2) singh an FA that aecepts set of strings neni, exatly four 8 an every luabets 2 10.1% 1 1 espn ane NFA for the Fangusge = all sarmps over (0, 1} that have at least rw Pomseruthe O oF 1 9. fa) Design a determinietc finite automat Unhict accepts et of sings such that every string containing "UO" a sub ring but not "000" ae substring 7 (0) Show that 1 regular, so 4(€) wil be also regular. 7 4. fa) Write a regular expression over alphabets {a 4 <} contains atleast one “at and at least one *P () Prove that L={OW"In (9 intereection > (concatenation ( Continued ) www.akubiharcom @ @ AK16/668, Content-free languages arg” @ @ proper superset of languages Feta (8) recognizable by PDA 4 (8) tno called tp 2 . | OA me oes Choose the incorret statements (very seat o cura ay constable, ’ 8) The class of DPDA is not Me (8) The class of TMs is countabi, | 2) The class of LBA is countable, Which of the’ following stat a true? ements ig 7 @ The language (in is prime) | regular language is recursive, (@) Recursive enumerable ‘ere closed under complementatign..¢ (0) Recursive laniguayes'are not elon” ‘under complementation. G The union of 2 recursive tang Tanguagee wooueyqnye Man Woo URYIQnye MMAMLO ARYL MA EAA A MOT ARYAN E A Aa wweakubihergom www.akubiharcom 2 ~ (4 ) { Cs) tn case of 7, in which of the folowing nove “ atrct an Sota sons SS enh wa GrBavise string bas becn consumed atrt an NA in . “ud TM halts in the final state OF Coane NTA wt ot an (@) Batre string has been conrumed apows te Atbenty ios =. and TM halts isthe nom-fnal sine (i) Entire etcing has bees * BF Sonat a DPA eae a the remter erie and Thal i nan “Srpression r=0'102", Mod es he reps extent 7” twig taanton dager” RS FG Obtain the regular expression for the following sets : Dexdet =~ ‘ay yh Fete mean OG AD Set of etrings over™ = (a,b 6 where $ G) Prove the folowing tro properties: 3¥m6 all runs of a’s have lengths that ars " stein of eave lng we (9 Regular sets are cowed ener the vit Set of strings over E=(a, 4.6 ex ig quentenation Sof ies es Pag sh (9 Reparwc ae Go oe te substring eve (abe Somplement operat GL {0 |x Avate ty 3 or ©) Show with the belp of pumping lena Son nae by Sor 5} ‘that following language is not regular: 4 LY (abt wa" L=(ww|we Ry) 7 cot 0h oni © meg em ce following regular expression : 4 number of O's. 4 (ab |b aafab |" * AK16/668 wooueqqnye Man Woo URYIQnye MMAMLO ARYL MA EAA A MOT ARYAN E A Aa wwwakubiharcom — = — — ve So so te te on © angst odd integers 7 fe) Forth grams: 6, whichis defined as Sabian A~ajas|naa Bo 10S\anB Prod wee, Mitheut unit ction equivalent tothe OF gen below: oo S$ ai%|a¥albIa0 kay robix Yow ay AK16/668 wew.akubiharcom C7) (a) Find the CNP 7 (Choo {or the the folowing cnonemaat ony Sans Anatle Bowie 5 xa ‘ Fax lax je se Xala (© Conver he towing Anas 4294s Ib Aa Arle > axial to Grp. Code : osneid i : wooueyqnye Man Woo URYIQnye MMAwoscamyyanyErA a mrosanyiqny ea Code : OStG1L i teeh Gili Semester Examination, 2047 Hora Languages and Automacn Theory rou Pull Nwhs 0 Tine Insiructions (0) there are Nine Questions in this Payer ii) duempr Five questions in alt (ii) Question No. 1 is Compulsory. iv) The marks are indicated in the riglu-hunud uuarsin. Choose the eorreetaltematives foram seven ote fallow ho {i)_ Fhe output ofthe Moore Machine depends (a) only on present state (b) only oncurent input symbol {©} both on present state and current input symbol (none ot the above (i) The logic of Pumping lemmaisa good example ot (40 the pigeon-hole principle PLO,LOD AML EAA A MOT ARYL ANAT A Aan wwwakubiharcom io dhe inate sn womqusrtovtange eb tention (4 Recuasinetvcnamerble a ne not closed unater (a) sion (6) intersection, (6) complementation (@) concatenation (Gv) The language L={a"b"" where n=1.2,3....} isa (2) regulartanguage (6) context-fve language (6) non-contestofive (@) none oftheabove (0) A language L isdenoted by a regular expression Laisy%es{ 3x") ws () yan ©) 9x (@) noneofthe above (4) Context free languages are not closed under (@) wien Code: 051611 2 Code: 051611 6o9 cota (si Revtmsivetngnyesins 4) proper superset OFCHES (6) Awayorsognizable (6) Absocalledtype (languages {€) Rocognizableby Turing Machines (iy Choose the incorrect statements {o) Every subset ofa countable setis eountable (6) The class of DPDA isnot countable (6) the class of TMs iseountable (4) Theclass of LBA is countable (6) Whichofthe following statements is true? (a) Thelanguage fa"|_misprime} is regular language (b) The union of 2 recursive languages is Recursive. (©) Recursive enumerable languages are closed under ‘complernentation. (q) Recursive languages are not closed under complementation PTO. wooueyqnye Man Woo URYIQnye MMALOD AML EAA A LOT ACUTE AE AL AAA wwwakubiharcom (6) Incase of TM, by eading input x, TM. ¢b) may go tohalt-non final sate (0) may 2010 infinite loop () Alloftheabove 2. (8) bun the regular expression forthe fllowing ses 4 © Serofstings over Y= {abc} withexactly one @ Setofsvingsover Y= (0,1} contiing al possible strings ofength fou. GB) Language over Y= {0.1} containing all possible combinations of 0 and 1's but not having «wo consecutive 0s, 0) Language over 51 = (0.1) constingofallsting with * atleast two consecutive 0's. (b) Describe in simple English the language represented by the regular expression r= (1410). 2 3. (@) Construct NFA equivalent to the following Regular expression: 4 10(t No Code : 051611 4 www.akubiharcom oy Construct aNNFA with « moves forthe regular expression ‘ rete bt) 5 (e) Comsiruet NPA forthe Setofall sings over y= {0-11 withltemate sand Ps, 5 «4. (a) Consiuets DPA forthe regularexpression = (alo )° 7 (ab)pa). _(b) Find outthe regular ekpresson forthe following FA: 7 “er ee [CurrentSiates| 1? Symbol) [____ WP Symbol _ p pa r a Tiere, ris the final state. 5, (a) Prove the following two properties: 32-6 . @ Regular setsare closed over the union operation (Regular sets are closed over the intersection operation (b) Show with the help of pumping lemma that following: languages are not regular: 4x28 @ L=(0*}: fisaninteger,>=1) @ L=farbe| n> 0} Code : 051611 5 PTO. wooueyqnye Man Woo URYIQnye MMALOD AML EAA A MOT ARYL GAT AAA 6. (ay Givethe CFG for each of the lan following repular expressions i abe i athe fit (han'sbhy* wwwakubiharcom sdetined by the ya (by Constrecta CFG forthe following anges Le hte, may 7. (a) Forthe grammar G, which is defined S— abba AsalaSbAAa Bo bbSeBB Where § derivation. sighimost derivation. the starting symbol. show the leftmost persone forthe sring Code: OS16T1 6 wwwakubiharcom sie Clever ay ithe CEC oy Sena by 16. sraSiasbarieaa bh hy Limite al prods eth allow > ali pera fe) Convert following ermine to GNF 5 5 > aBalABBAIAAIAIB Anan Bo bBb a, (a) Designa PDA that aceptsall palindrome strings over =z ab} 5 guage, 4 Code: 051611 7 wooueyqnye Man Woo URYIQnye MMA5 wooseqqayy AKUbihar.com AKUbiharscom Code : 051611 B.Tech 6th Semester Exam,, 2018 FORMAL LANGUAGES AND AUTOMATA THEORY z Time : 3 hours, sult Marks : 70 Instructions 3 The marks are indicated in the righthand margin. = (i) There are NaN questions tn thie paper, (i) Attempt FIVE questions in ot (te) Question Ho. is compmlsory 1. Choose the correct answer for any seven of the following eT fo) Regular expressions are closed under union (i intersection z (ii) Kleene star g Ai) oF the above : g (o) Extended transition function is z VeTag fH Fe fi) OEE fy SESE BAK/991 (Tum Over) AKUbiharcom AKUbiharscom AKUbihar.com AKUbiharscom Prom the options given below, the pair fraving different expressive powers is detente groom wana orow ‘and non-deterministic sma BPD to sminiaic finite wutomata (OFA) (i deter (ora) and non-deterministic utomnta (NEA) ii) single-tape turning mochine and mult-tape timing machine fo) deterministic single-tape_ turning machine and _non-deterministic single-tape turning machine (2) For the language (a1? is @ prime), the statement which holds true is _f 4 nt regular but contest fee (a) it is regular but not context-free > a 5 _Biv iti either regular nor contest free, but accepted by a turing machine iv) itis not accepted by turing machine aK /391 (Continued } AKUbiharcom AKUbiharscom wosaeqaayAKUbihar.com AKUbiharscom fe). Whien one of the folowing statements le rue? Nyy The Intersection of two content ree Tenevagen ie context-free fay Aeontext-free languuge can always be scupted by a deterministic jown automaton, pus Ji The union of two contextfree EF languages is context-free. 3 (i) The complement of a context-free language i context-free. W Aclaas of language that is closed under WW union and complementation has to be closed under intersection fi) intersection and complement hax to be closed under union fa) union and intersection has to be closed under complementation > > g fie) Both and iy a Fy crccan meted : £8 iv epee doen aston i fi) @ 2-way linear bounded automaton e (i) Bows (y ane (i) None of the above 8AK/391 (Rum Over } AKUbiharcom AKUbiharscom > a 5 AKUbihar.com 14) AKUbibar:com (ry Acdece graramar in called ambiguous, mare productions have the © Se Shamtermiaen the Ief-hand me ft) @ derivation tree has more than ene associated sentence fi there fm antence with more an fone denwaty jon tree corresponding (fe) brackets are not present in the grammar (0 The output of the Mealy depends @) only on present state machine fir only on eurtent anput symbol (i) both on present state and current input symbol fr) None of the above 0) The logic of pumping lemma is a good example of Lv pigeon-hole principle {) divide-and-conquet technique (en) recursion te) iteration SAK/391, AKUbiharcom {Continued } AKUbiharscom & g g zAKUbihar.com AKUbiharscom AKUbihar.com AKUbiharscom 5) ' en + fa) For ench of the following languazes. wo propertiea o conairuct. a DFA that wccepts Lx fy rove he flora evo properties = 98ng 1) Regular acta nce closed over the the fang in all canes, the alphabet guage. In all canes, the Alp pe itan 205-10 1 tw: the length of 0 i divisible z pete by three 2 z (a) tw: 110 is not @ mabstring of w) z my Represent the language that contain — = lu: w contains at lent fee 2 Ein wer Eei0 and has even rt t Henat five 3's) g number of 0's. 4 fy (we: weomiaine the substring 1001) 3 {09 w: weontaine at leant 0 1 and ed Convert the following DPA to & repuiar = tt moet two Om! expression + 4 0) State and proof pumping lemon for regular languages ‘ 3. fa) Using pumping lemma, show that the language A= (uw: we (0, 1)"} is not . enular s “ > 5. (ay Constrict contesttree Z 0) Let A be @ non-empty regular language, z & gencrate the following lanuoges. tn all > = Prove that there exists an NFA that = & € cases £=(a Hf deseo F accepts A and that ha exactly one | E z . g 3 accept state si z ao : g 3 : : 2 ic) Convert each of the following regular > 5 0 Wath 8 cexpremsions to an NFA: Deed (8) (boas ab" 7 @ GUI 000BV 1)" . oy Construct a CFG for the set of (0) Way" Con A0" rhon-negatve a8 integers. s BAK /391 {2m Over } 8aK/a9t {Continued } AKUbiharcom AKUbiharcom AKUbihar:com AKUbiharcomAKUbihar.com AKUbiharscom AKUbihar.com AKUbiharscom 17) (3) te ard ge uni we aed se oe - fa comet npn at cr © oor raunaweete 2 Geet nae oe BIRO 38 @ L=(atb™:n20) a Prove that the concatenation AB of A and i ia also context-free. (6) Prove that the star A’ of A is alto (@ L={wow® wea Bi") (0) L=twsng hed =2n50) coment ee 3 fy Determine = CFG without us (8) Design a POA that acepts te language predomi ee EO een vara neoy : 5 -+aixDja¥alboa xo 9. (a) Design = Turing machine that Yoox recognizes tings containing, equal umber of Os and 1s ‘ 1 CHF (Chornaky Normal Form) 3.) Po ane EMF (Chora s (0) tet yb renting and fy recusely the folowing fenumerabie. Show that) Ly lyin ‘SABA necessarily recuravey enumerabie, 4 AnaAle > Basie (9 Dene FNP APH and NPC problems ; > z vith example. > ay sminaie mull productions trom the & z i ae g following CFG <8 g a E Saxe F F tee F i x aioe : i F 5 prose Z g fe) Convert the following grammar to ONP: - 3 : Ai Anta Ay AAW Ayo Azle Tun Over } 8aK/991 ' ®aK—ie40/301 51611 AKUbiharcom AKUbihar:com AKUbiharcom AKUbihar:combhttp:/www.akubihar.com Code : 051611 B.Tech 6th Semester Exam., 2019 FORMAL LANGUAGES AND AUTOMATA THEORY Time : 3 hours ull Marks : 70 Instructions i) The marks are indicated in the nght-hand margin. (i) There are NINE questions in this paper (i) Atempt FIVE questions in all. (iv) Question No. 1 is compulsory 1. Choose the correct answer/Fill in the blank of any seven of the following ‘anTes fa) The word ‘ormal” in formal languages {y they are unnecessary, in reality {i the symbols used have well-defined meaning ii) only the form of the string of symbols is significant fy) None of the above AK9/846 (Turn Over } bttp:/www.akubihar.com bhttp:/www.akubihar.com (2) (} Which of the following statements 's rie? Wa language is cont always be accepted by deterministic push-down automaton fi) The union of two context-free languages is context-fre. (ii) The intersection of two context-free languages is context-free \Gv} The complement of a context-free language is context-free (0) Which of the following pairs of regular expressions are equivalent? @ x* and xx @ 10H" and gor (8) x(x" and (rx \guy Alt of the above (a) Which of the following pairs have DIFFERENT expressive powers? (@ Deterministic Finite automata (OFA) and —non-deterministic finite automata (NDFA) {UW Deterministic push-down automata (PDA) and non-deterministic push-down automata (NDPDA) (ti) Deterministic single-tape Turing machine and non-deterministic single-tape Turing machine (iv) Single-tape Turing machine and rmultistape Turing machine ( Continued } textfree, i can AK9/845 bttp:/www.akubihar.combhttp:!www.akubihar.com (3) fo) Definition of a language L with alphabet a) os given as L = (a"}k>0, and risa positive integer constant}. What is the ‘inimum number of states needed in a DFA to recognize 1? woke Ks na fiw) 2n + (iu) kt (Suppose @ polynomial time algoritm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following represents the correct Venn diagram fof the complexity classes P, NP and NP complete (NPC |? . : () wre — "enn" wa ap fia) C fv) D AKO /846 ( Tum Over ) http://www akubihar.com bttp:!www.akubihar.com (4) fa) Let 1 be a recursive language: Let £2 and £3. be languages that are Fecursively enumerable but ot recursive, Which of the following ‘statements is not necessarily true? fy L2-Lt is recursively enumerable (Coy £113 is recursively enumerable (ity L271 is recursively enumerable fio) L2UL1 is recursively enumerable, 2 : ()-APDM behaves like an FSM when the £ ‘number of auxiliary memory it has, is 1 © bpsvwakubibar com fat i 2 fio) None of the above (Define Turing machine in brief WA Sinite automaton with is equivalent to push-down automata AK9/846 ( Continued } http://www akubihar.com 8bhttp:/www.akubihar.com (5) 2. Consider the set of strings on (0,1) defined by the requirements below. For each, construct an accepting dfa “4 > Every 00 is followed immediately by a For example, the strings 101, 0010, 00 1001 1001 are in the language, but (0001 and 00 100 are not Al strings containing 00 but not 009. ae ‘The leftmost symbol differs from the rightmost one (fu) Every substring of four symbols haat ‘most (wo O's. For example, 001110 and (011001 are in the language, but 10010 isnot since one of ite eubstrings, 0010, contains three zeros. Construct the regular grammar accepting the following language L=(weta dj" w is a string over {a b) such that the number of sis 3 mod 4} 7 fo) Let G=W.TSP) be a rightlinear grammar. Prove that the language generated using the grammar G is a regular, 7 AK9/846 (Tum Over } http://www akubihar.com bhttp:/www.akubihar.com (6) A+ (2), Construct a Moore machine equivalent to the Mealy machine M defined by Table 1 7 Present | > a4 ‘Table 1 : Mealy Machine State Transitions |B Prove the following equation 7 (2-+00"2) +1 +00"1}(0+10")" @ +10") =0°1]0+10" 1" 5S. Using the pumping lemma theorem, show that the following sets are not regular 4 (a) Le {abla kensls By b= (wimg =n uh) (b= (uma we (a iB ) 6. (a) Convert the grammar into Chomsky 7 normal form 7 SaB/AB A-saab/) B 4 bbA ‘AK9/846 ( Continued } http://www akubihar.combhttp:/www.akubihar.com (7) fh) Show that the family of unambiguous context-free languages ig not closed under union, 7 Construct an pda corresponding to the grammar “4 S+aABB /aAa AaBB/a Bo DEB/A 8 Construct Turing machines that will accept the following languages on {a bj 4 (9h b= twin guy = mya fo) 1 = fwewiwe fa, 61°) 9. (gr Design a Turing machine with no more than three states that accepts the language Lala+i). Assume that E= (aH. Is it possible to do this with 4 two-state machine? . 7 Let be an undirected graph. An Euler circuit of the graph is a simple c that includes all edges. The Euler Circuit Problem (EULER) is to decide if ¢ hhas an Euler circuit. Show that EULER is not NP-complete. 7 ‘AK9—-2810/846 Code : 051611 hatp:/www.akubihar.comakubihar.com Code : 051614 B.Tech 6th Semester Exam., 2015 SOFTWARE ENGINEERING Tone 9 hours Full Marks 70 Instructions, 1 Alt questions carry equal marks. 0) There are NINE questions in this paper, (1) Attemps RTWB questions in all (0) Question No. 1 4s compulsory. A. Choose the correet option (any seven) (a) Wevery requirement stated in the SRS has only one interpretation, SRS is said to be \@ correct “a unarnbiquous ‘t1) consistent An) veritable (0) A Sault simulation testing technique is “mutation testing ~ (a) stress testing (ii) black-box testing white br etng AK15—880/602 akubihar.com " (2) akubihar.com Mostules X and Y operate on the ame input land output data, then the cohesion 18 Wy sequential =f). communicational (ii) procedural fy) togical {a} IC the objects focus on the problem domain, then we are concerned with 19) object-oriented analysis ay object-oriented design (it) objectoriented analysis & design fio) None of the above (fe) SRS is also known a8 specification of fi) white-box testing (a) oxrecs testing (i) integrated testing efi acon testing The model in which the requirements are implemented by category is, (evolutionary development model (a) waterfall model (ii) prototyping model (iv) iterative waterfall model akubihar.comakubibar. akubihar.com com 13) Sotaeate Requirements Definsion Desminon sted Reguicemen my Software Reeuiremes Diagram ed Requirements Diagrass ACOCOMO model is (common cos: estimation mode! (2) complete cost estimation modet (2) comprehensive cost eximation mosel ‘The worst pe of coupling is Wy dta coupling a) consol coupling stamp coupling st coupling AK15~880/602 o oy fa oe fo a (a) akubihar.com way nminccring, diseipine? What does the Uincipine of software engineering discuss? Desenibe the various eps sa waftware development Ife cycle, What are end product of each step? What is prototype model? Under what circumstances 1st benefiial to construct a prototype? Does the construction of Prototype always increase the overall cost of sofware development? List five desirable characteristics of go0d SRS document. Discuss the relative advantages of formal and informal requirement specifieations. What is structured analysis? Briefly review the tools used. How does it difer from traditional approach? Describe the major software assurance activity and importance. guality indicate their What are drivers and stub modules in. ‘context of integration and unit testing of software product? Why are stubs and driver modules required? akubihar.comakubihar.com akubihar.com 1s) (8) What is diffrence between coding siendara and coding guklelines? Wrie down important coding standard and guidelines that you would recommend © fa) What are diferent types of maintenance that ‘4 software product might need? Why is ‘much maintenance required? () Discuss typical software risk What techniques ean we use to control each risk? 1s it possible to prisitize the risk? Explain. 7 (a) What i sotware projet estimation? Write in brief about COCOMO estimation madels. () Discuss the need of software quality lasnurance, Also give the importance of FTR Be (a) Compare between 180 and SELCMM for software (8) Write « note on CASE toc's Also state the benefits of CASE tools for engineering. software (a) Explain equivalence class partitioning and a ‘oundary-value analysis. (0) What ia software maintenance? Explain software re-engiering ‘AK1S—-880/602 Code : 051614 akubihar.com akubihar.comMLO ARYL MA EAA A MOT ARYAN E A Aa wwwakubiharcom (4) tine beeen cohesion and coupling. an & Diether pee io ik spling, and wii pt ng © Ghoam adoogaaed wit gat ne ypes of © To Se “eee 0 ee Se ae SS. & @). Write & short.note on PERT charts. Ripa ‘when you should use ead tien you should use Gantt chara whe performing the duties ofa project, What wee ditferent mettice for software project size entiation? PSint out the meer // shortcomings of lines of code (LOC) metre Gtder to. use it as a software project sie metre:" manager, ‘maturity model (SEI CMM)? Explain five diferent levels of SEI CMM model. How can SEI CMM ‘model be used to improve the quality of software? kee A6—~1020/674 Code : 51614 www.akubiharcom Code : 051614 B.Tech. 6th Semester Exam., 2016 SOFTWARE ENGINEERING Time : 3:houre Full Marks : 70 Instructions : (9 All questions carry equal marks. (8) There are NINE questions in this paper, (it) Atempt FIVE questions in all. Y) Question No. 1 is compulsory. 1. Anewer any seven of the following as directed + No) What is a software prototype? (©) A structure chart differs from a flowchart in which of the following ways? modules of the software fom its Dowchart representation \ Data among’ different ‘modules is not presented in a flowchart {UH Sequential ordering of tasks inherent in ‘flowchart is suppressed in a structure chart (i) None of the above (Choose the correct option } Ak16/674 (Tam Over ig WOdUEYIQnyE MAM Woo URYIQnye MMA