+a A/B/C/a A aB/é Boa Cccp D-abd (6) Eliminate unit, useless and E-productions from the gramrns bbc, C8 © Shaasabp, A-aadfe, B+ bB/bbC, UNIT-U closure Fe es 3 a)” Explain the do sure properties of conteyforfinguaes. AS) Design PDA to accept al strings generated b OR (@) Differentiate between PDA and NPDA. ©) Convert the given CFG to NPDA A> 0B,B > 0B/18/e UNIRIV machine and other modifications. L={a"b"/n> 0} OR unctions is computable (b)_ Explain the properties of recursively enomerable languages, UNIT-V. Q5 (a) Explain the complexity classes, (©) What is prition problem? In which complexity class it belong? Justify your answer. OR Bit ferentiate between NP hard and NP complete problems, py the language L(G) = [a"b"a/m,n > 1] Time: 1 No. of P Tastruct 1 Ate 2 All Q1 @ ©) 2@ ) B® peoPNROLLMENTNO. | || eae j B.F. VI Sem, [Computer Science & Engg.), Bx 5 THEORY OF COMPUTATION Subject Code: 8-20 (BN6sO1] Maximum Marks: 70 Minimum Marks © Time: Three Hours "No. of Pages: 02 Tstructions: Attempt one question from each unit scarry equal marks. 2 UNIT Q. (a) State and prove pumping lemma for regular sets, (&) Determine the DFA equivalent to the given NFA: 2 (a) Construct DFA that accepts all strings that contain exactly 4 zeros. (b) Find the regular grammar for the given automata: 3 (a) Prove that the grammar is ambiguous: @ S> asp/ssye (i) S> 28/5, AsafAa, B>b (b). State the two normal forms with example. Cont...oR y no unit productions and no ysl stent one wit ae Ti SARA, A+ @AAsalic/bb No Ins Bs asbnsce, ¢-+0C/eb 01 Be crs merges 02 L(G) = [a™b"7m,n 2 OF UNTT-HL Qi QS (@ Construct PDA for the regular expression O°1" ©) Construct NDPA far the given CFG S$ 0AA, A-+os/1s/o or 6 (@) Construct PDA for the language L(G) = (WEW/W € (0,1}"), where W® is reverse of word W (©) Construct PDA for the language . = (a"b?"/n > 0}, 2 UNIT-IV 7 (@) Design TM to accept the language L = (a"b™a"*™ jn > 0; m>1}. (©) Show that there exists a TM for which the halting problem is unsolvable OR Q8 (a) Explain Church's hypothesis Q2 27M forcomputing. /(m,n) = rm ~n proper subtraction. UNITY Q9@) tween tractable and untractable probjems. () Explain Hamiltonian path problem with example Q.10(a) Discuss the implications of conjective P (©). Write brief note on the following b 3 ( (Vertex cover problem (ii) Satisfiability problem.ENROLLMENT NO. 124 c B13) B.Tech, (AICTE) V Sem. (Computer Selence & Fn el Px | THEORY OF COMPUTATION | Subject code: C5502 {BACSS02] | : nination Novensber 2019 8 and NO Uelegg Time: Three Hours Maximum Marks: 70 No. of Pages: 02 Minimum Marks: 22 Tstructions: as per choice given from exch module, 02 All questions carry equal marks, O1 Attempt questio ' Q1@) Mini the given NPA: () Design DFA which accepts Set of al strings containing 1010 as Substring [coy OR (@) Convert the following E-NFA to DEA [coz] se of word W ae ena ie (©) Explain 2 way DFA with diagram. (cor , Module-I1 Q2 (a) Convert the regujar expression r = (11 +0) « (00 +1) «to E-NFA. (C02) (©) ‘State and prove pumping lemma for Regular languages. * (coz \ OR (2) Explain closure phoperties of regular languages, [c03) (b) Find the regular expression for the language accepted by the following automata, ‘Module-121 3 (@) What is Normal forms of Grammar? Explain its types briefly, [coq (©) Fliminete useless symbols trom the grammar: (c03] S > asjAa/c Ava ¢ i Baa, Cath(Design CPG for the given language 17490 UG) =e a! bel dt 4) > 9) (coy, (®) Write CNE forthe given CFO: 5 -» aSa/bSb /a/b/aa/bb Module-1V 4 (4) Constut PDA for he language f(A) = (anbmanem /a.m > 0) (®) Differentiate between deterministic PDA and Non deterministic PDA OR (@) Explain petri net model. (&) Find PDAs that accept the CFG. Saxn X= ax/bx/a Y > ya/yb/a Module-V Q5 (@) Design Turing machine that accept the language 1(6) = (9""/n > 1) ae @®) Explain recursively enumerable languages. cos} “oR @ Design Tuming mechine to compute 1°s complement [c03] (®)_Explaia decidable end undecidable languages. {cos}ie , 1 —+ ENROLLMENTNO. |) | ] eee Ce | | fe Fae j ph, Tech, (AICTE) V Sem, [Computer Science & Engg |. Examination November 2020 THEORY OF COMPUTATION Subject Code: C5028 (RARSSO2} Maximum Marks: 70 Time: Three Hours No. of Pages: 02 Minimum Marks: 22 Now: Attempt one question from exch unit a Qs ii) AN! questions carry equal marks Module-t (2). Explain the steps in conversion of NEA to DFA, Convert following B23. * On i &) (b) Differentiate between DFA and NFA. OR Give discriminate finite automata accepting following language over alphabet: (number of 1's is multipte of 3 (i) number of 1's is not multiple of 3 (b) Explain Mealy Moore machine. Explain conversion of Mealy to Moore. Module-IL Illustrate a regular expression forthe set of all strings of 0’s and 1's not containing 101 as substring. col (©) Develop a pumping lemma for regular set and what are the applications of pumping Lemma. {cos} OR (a) Explain finite automaton for the regular expression O*1*. (coy (©) Explain the following- [con] (9) Closure properties for regular language (i) Arden’s Theorem @) @) ‘Module-t11 ‘When do you say grammec is ambiguous. [fG is the grammer G->SbS| 4. show G is ambiguous. Explain GNF. Conven the following geainmer into GNE : SoXYII0 X200KY Yo IxoR following grammer {Coy 6 (a) Explain aus parse tee. Fort Sabha AcaMSOAA sexs & computets BohESWBB a Copies sintes For the string aabbabbb, Find jation (Hemost derivation beniges (6) ighumost derivation ao Gi) parse tree sn aod. CORE (©) Define Chomsky nonmnal form. Convert CNF to CNF Man -2330499 S—ASA|aB, A+ B1S,B—ble Module-IV Q7 (@) Define Pushdown automata. Design PDA for L.= {0"172"3" | myn = 0} {C04 (b) Explain in detait about equivalence of pushdown automata and CFG. Icoy oR Q8 (a) Design a non-deterministic PDA for accepting the language L = {2° b"c*| m,n>~ 1} {Coa} (b) Explain Pushdown Automata (PDA) and its acceptance by empty stack with a detailed example. {coz Module-V Q9 (@)_ Prove that ifa language is recursive if and only ifit and its complement are both recursively enumerabie. {coy (©) Woite classes and definition of NP problems. {co2} OR 10 (2) Write short nate on (co) (@ Halting Problem Gi) Post Correspondence problem NP complete problem Time: No. of Tastra QaENROLLMENT NO. a EXAMINA’ 1. Peet, (AICTE) V Thi TION NOVEM ‘Sem, (Computer Science & ry of C Subject Code: CSS02B 302 ons: Attempt om (a) Deine the finite automata, Exp finite automata () Construct DFA equivalent to Me C{aoaustsas}): (0st 8: (4) fs t a @ a) Construct a DFA equivatent to NDF. Q2 ¢ (b) Explain the purpose of M Moore machine. Can we answer. Define Regul automata equival Write the elosure property using method of contradiction. 3 4) ® 4 (a). State and explain pumping lemma. ae | ete On fealy machine and Moore machine. Wi ‘determine the type of machine by lar expression and language associa fent to the regular expression (01) of regular expression js not regular using pumping lemma. () Prove that any language accepted by ode: BAHSSO2 Maximum Mar Minimsurn Marks: 22 "question from each module, Module-t difference between deterministic and non-deterministic (06{CO1} (08(CO2} ), where 6 is given by following state table a a [a o oR ‘A, where transition diagram is given below, 2 (o74CO2) b application area of Mealy and Checking output? If yes justify your o7{COr} Module-It construct 2 Finite (on{CO3} ‘n>0} is not regular (07{CO3} ied with regular expression. Ci #(00+11) (01) Prove that language L= (2°b": oR Prove that the following language L~ {a"sn is a perfect square} (ON{CO3] a DFA can be represented by a regular expression. (onjco2! Cont...Moduletit (104C03) es are given below 5G) Let Gea content os rimer Pr whl Sabjba A aaSbAA ee unmar (using Leftmost Derivation, Derive the following sting “auabbubbba’ using the above #7 Rightmos derivation also construct parse ee. (04{C03] (b) Explain in deta he Chomsky classification of language on “8 the follow s 89) Dsine te amet nar an ind ect fe gamer te feloming nee Le fab ncme3} come ass (SIs greta eae sie & Ets ee Fa OO on Pape? i + Ee ge CP {BC og tla s 30drt I 1 Soest ass B> alle € Modute-tV" oR 3906 cae Q7,f2) Describe Push Down Automata (PDA) with its representations. Als yvite?AHES of converting PDA to CFG? (o7ngcoz) Design a Push Down Automata fr language I~ a's moe). Als check the acceptability of string “aanabbab”? conyco2y oR 4 (@) Construct a Push Down Automata that accepts the language generated by the grammar with production rule. (07)[CO2} S2astbie (©) Design the rule for construction of CEG from given PDA. (orcs, Modale-¥ 09 ©) Ga gral espn of Tung aching? Wat do you mean by hating problem of Tang conco2, ©) Design Turing Machine ©) Design Turing Machine of {0 n3-=1). ie or 10(a) Define the Turing machine. Also write the capabilities o 2104) Debs the Teng machin. Ato wie hecpsbies Ting machine and advnages ove te (074C02} Write 3: (©) Write a shor note on eRe © Featues of NP-Complete problem. Recursively Enumerable language BAHSS02/252 es EN Time: 1 No. of I Jnstruc 1. At 2 All ¥ @) eegNROLLMENTNO. | 0 | uk. 1V Sem. (CSAT Engg.) Bxamination Apeit 2016 DATA BASE MANAGEMENT SYSTEM Subject Code: CS-08 {BLAROI} Maximum Marks: 70 prime: Three Hours Yo. of Pages: 02 Minimum Marks: 22 struction Acemni Ail questio jt one question from each unit, ns carry equal marks. UNIT-L 1 @ Write anote on database languages Explain the architecture of a database system, she different between logical and physical data independence explain td you choose a database system instead of simply string data in operating system Biss UNIT ‘vat are diferent types of intégrity constraints? Bxplain by giving suitable example Differentiate between the term Specialization and General attribate defined specifications. b) Why woul ization. Discuss user defined and violated? What is refereatial integrity? What option What does the DBHS do when constraints are ling wise violations of referential integrity? does SQL give application programmers for deal Explain the fundamental operations of Relational Algcbra. UNIT Explain how aggsegate fanctions and grouping are used ia SOP commands. is in BOM, itis in 3NF but the reverse is not tree. ‘What are the thre’ data anonaalies that are likely to cout as a result of data redundancy? Can data aera recy be completely elininated in database approach? Why or why no ural Join and Equi Join UNITY ‘Show that if'a relational schema Explain Join, Differentiate Na dependency preserving decomposition wth example, parison operators in SQL with example Discuss Explain about Nested queries and set co Given R (A,B, C,D, B) with the set of FDs, F(AB ~ CD» (@® Find any two candidate keys of R i) What is the formal form of R? Justify. “Also explain the purpose ara benefits 0 ABC > C, C> AS f Normalization. ‘What do you mean by Normalization? Cont.UNIT-V *) With a neat sketch example the states of transact ©) Briefly discuss about locks and lock management in DBM! 104) Explain erash recovery technique during transaction in detail ») Write short notes of any two of the following ()Serializabitity (i) Distributed database Cit) Data Warehousing & Data BLA OeI ENROLLMENT NO. | 6 ir'san. CBGH Pabieaten Tahun eee RAT AAASE ANA CEE eyeT Sabie CotsiTtase Bentsees ‘rime: Three Hours No. of Page ee Instructions OL Attempt any five questions. 2 All Questions carry equal mai © 1 (a) With the help oF block diagram epain the architecture of « BMS. {¢) Discuss 6ifferont datz models of DBMS snd also write the advantages of DBMS. 2 (a) Write short note on fllowing: (0) Schemas and Instances (i) Data Independence aé DBA iy Accessing approach of tediional fle «by What is E-R Diagram? Explain with the components of E-R Diegram. (4) Write the importance of entity intoprity and referential integrity i the databace. {) Discuss in details of types Of attributes with suitable examples (a) Hlow file system is different ffom the DBMS? Explain with the timitations of filesystem (0) Define’ Extended E-R features of DBMS. 5 (a) What is Query Language” (&) Explain ) DML and DDL.) Domain Constraints with examples. (ji) Weak entity and strong eats the belp ofexamptes. | | 6 (a) What is Normalization? Discuss various noriial forms wits |AB-+CE,E-+AB,C—=D), Whats the highest normal form ofthis (b) Consider the relation #(A,B,C.D.E) and the set ration @.7 (a) Explain data fragmentatio’, replication and allocation techniques fo dluibuted database design. (eyes Rew he concept abject ety nthe objet fn mde its rom the emcatoF HP a2 selationa! model. Cont,Works (ei, ci, salary) Manager (ed, manager-name) (Find eames, street and city of al employees who work for “ABC” and earn more than RS 20,99 Gi) Fin the names of al employees having "a the second letter in their names i) Display the acm salary ofall employees.exrouumentino. (0 Tal oll le Des Buk. (CBGS) IV Sem, [Computer Science & Kagineerlag), Examination April 2018 DATA BASF MANAGEMENT SYSTEM Sulsject Code: C8-4002 inerast] Maximam Marks: 70 rime: Three Hours Mininuas Marts: 22 No. of Pages? 0: Nowe i) Attempt one question from each unit ti) Ail questions carry equal marks off ‘0c euwork Hierarchical and Relational data ode by Discus the three schema architecture of DBMS, Explain how i contibutes to data independence oR 2) 8) Compare traditional file accessing approach with database manage 8) Diftereatiate between following 5 i) Logical data independence and physical data independence <2 ii) Database schema and database insta Unit QS 2) Construct a well labeled ER Model ofa cer insurance eompany customers, each of which owns one er more ears. Each ear has associated with ic 0 to any number of recorded accidents by Explain how the mapping of an ER model toa Relational mode! is done. Give exeriples for mapping the different types of entities, attributes and relationships to relation schemas. OR Q4) , 9) Construct an ER model of a university by determining entities of interest end the relationships between the entities b) Explain the concept of generalization, aggregation and specialization with to ER thodels, giving a suitable example of each Q5) a) Consider following relational database schemas College(CollegelD, Name) Branch(Branch{D, Name) Seats(Coilege(D, BranchID, TotatNoOfSeats, NoOtSeatsFilled) Construet SQL queries to create above tables along with the required primary keys ant foreign keys,\ \ { Dy Form seated inthe QS (8) no sente are oft Hi r sire nile 1 the college nated “IEC ) Find the college names i CSE" banal ih on Q8) 4) Consider the Rllowing dateba ' tmployee (Eid, dod, address, sex, salary, name, Did) Deparment (Did, Drame) Dept Location(Did, Dlocation) Project (Pid, Paame, Plocaion, Did) Works-on (Bid, Pi, hours) Constr SQL queries forthe following 2 Reh Ie 8) Find tho names of employees alone with the name of the projects in which they 10) List the numberof projects tna ave cunning in each department along with the epartment naa il) Find min, max and average salary of each department §) Consteuct Retavonal Algebra queries lur performing the operations listed in Q 6¢«) icv QD 2) Given a relation scheme R(A,13,C,D,E) and the set of functional AMPenrdencics that holds ia R F(A BC, CD> E,B90, £3a) Suppose we decompose the relation schema R into RIG.B.C) and RADE) Is the decomposition losless? ust your answer the decomposition depenseney preserving? Justify your enswer. ¥) Explain following wih help of suitable example ofeach 1) Super key il) Cansidate key, i Primary ke, i) Altemate key, v) Forlgn key oR Q8) Explain following giving suitabte examples of each - un) 4NE ) Explain following with appropriate examples ofeach: ') Lossless decomposition ii) Dependency preserving decompositionUnit V by What are conflict serializable schedules? Consider following schedule $ and an rede S ay A-3500, | write (a) i Readi(C) | c=0#3500 | Weitere Is the sch nflict Setializable? lusty your answer. i) Isthe schedule S View Serializable? Justify your answver OR Q10) _#) Compare conflict serializable schedule and view serializable schedule by) Explain the techniques for recovering the database from system failures BGPAsOy OIE 20Le t jon November 2018, ana & Boga} Pxamni exronumentyo. [|_| ae Maximum Marky» q No, of Pages: ee 4 O1 All questions carry equal marks. 02 Internal choice is given in each question, . @ ¥ ret unit gO nt Q1 (@) Differentiate between physical & logical data independence vo i Ps 04 @) (©) What are the features & objectives of DBMS? He vaTHT ges ON oteE 008 qyDys. NO Gabe oR ING oHNPN 398 si 8, ONG. 9 208409 (e)_ Explain the different types of data models ie B99 @s (&) What is meant by instance of the data base & schema? Nir Q2 (@) Consider a university database for the scheduling of classrooms for final exams. This database could be modelled as the single entity set of exam with attributes course — name, section ~ no, qT room ~ no & time. Alternatively one or more additional entity set could be defined along wit relationship seis to replace some of the attributes of the exam entity set as Course with atributes name, department & course — no, (it) Section with attribute $.No. & enrolment & dependent as a weak entity set on course ii) Room with attributes r—no, capacity & building ) Drawan ER diagram illustrating the use ofall three additional entity sets listed. (©) Explain the following relational algebra operations Q5 f@ D (Natura join Gi) Assignment (ii) Set Intersection su on @ (@) Draw an ER diagram for keeping track of the exploits of your favourite sports team you should @®) Li store the matches play the soresin eash match the players in each match & individual player Statistic foreach match summary statistics should be modelled as derived atriburee (®) Explain DDL & DML. ems ® & UNIT Q3 (@) Consider the following relational database student (name, student #, class, major) course (course name, course #, credit hours, department) section (section, identifier course#, semestes Year, insiucior) grade report ( student, section identifier, grade) prerequisite (course, Presequisite#) specify the following queries in SQL on the above database schema, (@)_ Retrieve the names of all students majoring in CS * i) Retrieve the names ofall course taught by professor Kulkarni in 1989 (Gil) Delete the record for all student whose name is ‘Om’ & whose student no: is 12 (iy) Insert a new course <*DBMS', ‘C81390’, ‘23°, ‘Cs">ENROLLMENT NO. | tion November 2020 BW Peeh, (ALCTR) V Sem, [Computer Seience & Enginee Subject Cade: C8808 SE MANAGEMENT SYSTEM DATAL (RAESSOS] Maximum Marks: 79 Time: Three Howes Min No. of Paes: 2 _—_—_— - re TS Oe ioaid Tnstrwctions: Ra CO oer spiral Bin OL atom) each modute amination Eton Pape! 02 AM questions carry equal marks + £099. opus Hot . kal 1 (a) Discuss the various disadvantages in the file systems and expAAYBW it can overcome by the database system, ie (®)_lsyplain the various components of DEMS. ifgh Qs. on (@) What is data independence? Differentiate between physical and logical data ini (©) Explain various data models, Discus its advantages and disadvantages. {cou} Module-It Q2 (a) What is aggregation in an ER model? Explain the various types of attributes. [co3} aes (©) Explain single valued multivalued and derived attribute briefly (co3} oR (a) What is spocialization and generalization of ER? {co3} (b) Explain the various types of keys with example (cos) Modute-tit Q3 (a) What are the relational algebra operations supported in SQL? Write SQL statement for each operations. [cos (b) Explain the various | and DCL commands with example. [cos] oR (@)_ What is view? Different en table and view. [co4) (®) Construct the following SQI. queries for the given DB: {cos} Person (Driverid, name, address) Can (License, Model, Year) Owns (Driverid, License) Participated (Driverid, License, reportnumber damage & moment) (Find the number ifaccidents in which the cars belonging to “Bob*™ (ii) Delete the Tat-sumo belonging to “Tom” (iii) Add « new accident to the databaseModute 1 Discuss join dependencies and fifth normal form Consider the universal relation R= {ADC DEKE (A. BYSACH. TAP 9(D. H}, (BYHUF}, CFP 11G, Hy 1D) + JY 1} and the set of functional dependencies i What is the key for R? Decompose R in to 2NF, then 3NF relations. on [Explain BCNE with example. State how it differs froin that of INF \co2 Define functional dependency. List and discuss the six inference rules for functional dependencies (co Module-V State the Two-phase commit protocol. Discuss the implications of a failure of the coordinator anc {cor} some participants, [cor Describe the deadlock prevents, schemes, OR Explain the distinctions between the terms serial schedule and serializable schedule. Give relevant [cor] {cox mons example, How recovery done from transaction failures? Explain log based recovery. BAESSOS / Raj Copiers & Computers 4 Lamination Spiral Binding + Engg. Question Papers 4 Syllabus, Notes Main Raod, Gokalpur Jabalpur 0703-2330499, 9424394659* BNROLLMENTNO. | | EXAMINATION NOVEMBER 2077 : itech V Sem. (AICTE) [Computer Seience & : Database Management System ject Code: C8503 yer Corde: BAHSSOS Maximum Marks; 9) Time: Three Hours Minimum Marks: 9 No. of Pages: 04 Tnstructions: ets & Computers (i) Attempt one question from each module. Ra) Copy a spiral Binding Gi) All questions carry equal marks. # Laminatestion Papers Module * Eos as Met oh © 2-12) Compare traditional file accessing approach with database management sy 945 os oe 1 ore s-23% (co (b) Explain following giving the examples of each: (com (Logical data independence Gi). Physical data independence Bc OR Q2 (a) Compare Network, Hierarchical and Relational data models. {col (©) Explain Three-Schema Architecture of DBMS. (cor . Module II ‘ 23 (@) A taining institute has 10 instructors and can handle up to 40 trainees per class. The institute offer five “advanced technology” courses, each of which may generate several classes. If class has fence ‘than 10 trainees in it, it will be canceled. It is, therefore, possible for a course not to generate any () Ci2S5cs during a session. Each clas is taught by one instructor. Each instructor may teach up to twe Classes or may be assigned to do research. Each trainee may take up to two classes per session Q Construct an Entity Relationship model for the training institute. {C03} (©) Explain the concept of generalization, aggregation and specialization with Tespect to ER models, 7 (@) giving a suitable example of each {coy R OR (b) Explain following with examples: [cou G (@ Weak entity set and strong entity set Gi) Partial participation and full participation (Gif) Single valued and multi valued attributesModule U1 9s) Consider the faltvsing database Employee (Eid, dob, address, sex, sary, name, Did) Computers ers & Comput Department (Did, Dname) a soli ay Jue ction Papers Dept_Location(Did, Dlocation) i Project (Pid, Poame, Plocation, Did) 7 Oras, Hotes Works-on (Pid, Pid, hours) + Fv, Goat Construct SQL queries forthe following ()_ List the names of employees along with the name of the department in which they are working (Gi) Retrieve names of employees who are not working on any project. (Gi) Find average salary of female employees (b) Differentiate beween the following (Natural join and Equi join Gi) LeR outer j Right outerjoin 6 (2) Consider the following database ‘Street (name, location, city) House (number, Steet_name) Lives (personname, house_number) Construct SQL queries forthe following (Get the house numbers street wise. (ii) Get the names of person who lives in the street named “Nehru Street” (ii) Get the numbers of house which are not occupied, (0) What is union compatibility? Giving examples explain why do union, interaction and set difference operations require two relations to be union compatible. {coy Module IV. (2) Consider the relation schema and the dependency diagrams: [coz] RCL, C2, C3, C4, C5) faje qe Tes + L225 (®) Identify and discuss each of the indicated dependencies (ii) Deduct the relation schemas from R that are each in 2NF showing dependency diagram for each relation scherna (iii) Deduct the relation schemas from R that are each in 3NF showing dependency diagram for each aoe Cont.() Byplain folowing with suitable example of each: 0 onal dependencies (i) Pull functional depervten (i) Tran on Q8(@) Given a relation schema R(A\B,C,DE) and the set F ink Pe{A% BC, CD £, BOD, BA) Suppose we decompose the ni schema R into RI (A.B.C) and R2(A,D,E) (@)_Is the decomposition lossless? Justify your answer. ileney preserving? Justify your answer. (b) Explain following with suitable example of each () Matti-valued dependencies and 4NF (i) Join dependencies and SNF Module V 9 (@) List ACID properties of transactions, Explain the usefulness of each. ©) Consider following schedules S1 and answer following question Schedule St t n Reada) A=A-S000 Wate (a) Renda) A-A-2000 Write) Read) 18-5000 Write) Read(©) ‘c=c+2000 Wri) Is the schedule $1 Conflict Serializable? Justify your answer. OR (oy of functional dependencies that (coy yurett 5 & Comp Copies cl Biro nation "Ton Papers + 25 a A ai oo of main Fa 99. et orev {coi {cou {co3)ENROLLMENT No, {c Ola lofi EXAMINATION B.Tech, V Sem, (AICTE) B [BAC 02 Ale ae uestion from each module, ry equal marks, Module f 2.1 (a) wats courage? what are salient feat (©) Explain work ethics in detail, Q.2 (a) Mention the diferent types of et (®) Explain the role of Yoga anc med 2.3 (a) expan the types of inquires (8) Exziain in detail about Prof Q-4 (a) Expiain the scope of engi (®) &epizin Kohibere’s theo Q.5 (a) wnat are the ditterJastrwctions: 1. Attempt one question from e: 3. All questions carry equal mai 3 Assume any missing data. Qi @ Deseribe work ethies? (b) Write note on various as Q2 (@) Explain the role of (b) How caring, sl Q3 (a) Describe d (b) Explai Qa (@) ExpModule-V 09 (@)_ Describe environment ethies and computer ethics (b) Explain engineering as expect witnesses and advisors. OR 2:10 (a) Explain code of conduct (©) What is corporate social responsibility? =pNROLLMENT NO. Fpotructions: {1 Adempt one question from ea 2 Internal Choices for each adiloR ic and discuss its role in reducing risks wit (98 Explain the procedure of Assessment of safety and 18 suitable examples oon Module V Q9 Discuss the following in in details Goer Engineers as managers