5th Semester (June-2016) Computer Science and Information Science Engineering Question Papers
2 likes794 views
This document appears to be an exam paper for a Database Management Systems course, containing multiple choice and written response questions. Part A includes questions about defining, manipulating and sharing databases; differentiating entity types; the three-schema database architecture; and designing an entity-relationship diagram for a sports league tracking teams, players, positions and game results. Part B likely contains additional questions related to database concepts, but the document is cut off so the specific questions are not provided. It focuses on topics like translation load aside buffers, page replacement algorithms, file allocation methods and I/O scheduling.
![,:7ei ." -.
-Y---- t-'
ffi)ti
USN 10css6
Max. Marks:100
(04 Marks)
(08 Marks)
Fifth Semester B.E. Degree Examination, June/July 2016
Formal Languages and Automata Theory
(.)
o
o
d!
a
d
ta)
(6
o
EP
-v?
-.o
co ll
CQ,_!
.5 or
53*
Eil,
oi
-O
Q2
o(J
dO
o.obotr
>P
tr:J
-t,()
ce
? (.)
t& o.
oi
?.2
6=
A,i
.!a
,4)
5.v>.'*
oD-
coo
o=
c.U
F>
=D
5:
U<
-:6i
o
Z
L
o
o.
Time: 3 hrs.
2a.
b.
c.
Note: Answer FIVE fuII questions, selecting
at least TlfO questions from each part.
PART _ A
I a. Define the following with examples: i) Alphabet, ii) String.
b. Define DFA. Write the DFA's for the following languages on I: {a, b}.
D The set of all strings containing the substring 'ab'.
i, L: {o I lc,rl moa 3 : 0}
ii) 1: {a"b"' I n>4, m<3}.
Prove that every language defined by a regular expression is also defined
automation.
Write the e -NFA for the regular expression ab(a + b)*.
State and prove pumping lemma for regular languages.
Show that the language I. : {anb" I n > 0} is not regular,
Minimize the following DFA using table filling algorithm.w
6 0 1
+qt
9z
*Q:
9q
*Os
9z
9:
9q
Qs
9z
9:
9s
9:
9s
Qs
Define CFG. Design CFG's for the following languages:
i) ;:1anb2"ln>o)
ii) L: {rr* / oe {a, b}*}
Write the LMD, RMD and parse tree for the string '++-xyxy' using the grammar
E-++EE I *EE I-EE lx ly
What is an ambiguous grammar? Show that the following grammar is ambiguous:
E-+E+ElE*El(E)lid
c. Convert the following NFA to its equivalent DFA.
t lg.Ql(c) (08 Marks)
Define a regular expression. Also write the regular expressions for the following languages.
i) The set ofall strings ending in the substring'00' on I : t0. l]
3a.
b.
c.
(08 Marks)
by a finite
(08 Marks)
(04 Marks)
(07 Marks)
(06 Marks)
(07 Marks)
(08 Marks)
(06 Marks)
(06 Marks)
4a.
b.
c.
Fig.Ql(c)
1 of2](https://image.slidesharecdn.com/5thcsjunejuly16-160809054510/85/5th-Semester-June-2016-Computer-Science-and-Information-Science-Engineering-Question-Papers-10-320.jpg)
5th Semester (June-2016) Computer Science and Information Science Engineering Question Papers
- 1. +fr L) Sut, Cg USN 10ISs1 2a. b. c. (J (.) o L () ox X=':> st9 oo li .g . gil (JS FO @ 9.) gs oc) o0d .g cs - !,,1 ,E 6 .t3 ia- X o .-: 9E5io =! !q if .; ^=oo -- c or) 6: (r< -i 6i 6) z d ! a Fifth Semester B.E. Degree Examination, June7$uly 2016 Software Engineering Note: Answer FIVE full questions, selecting at least TWO questions f*om each part. PABT _ A I a. What are the attributes of good software? Explain the key challenges facing in software (08 Marks) b. What are emergent system properties? Give the example for each. (06 Marks) c. Describe the general model of design process. (t|6 Marks) What are critical systems, with its types? Explain. With the neat diagram, explain water fall model. Explain the requirement engineering process with its four phases. 3 a. Define and differentiate functional and non functional requirements. b. Write IEEE standard format for requirement documentation. c. What is requirement Elicitation and analysis? d. Write short note on Ethnography. Explain data flow model with an example of insuiin pump. (0E Marks) Define object model and explain object aggregation. (04 Marks) Explain different section of project plan and define milestones and deliverables. (08 Marks) PART _ B Time: 3 hrs. 4a. b. c. 5a. b. U. 6a. b. c. ta- b. c. 8a. b. Max. Marks:100 (08 Marks) (06 Marks) (06 Marks) (06 Marks) (06 Marks) (04 Marks) (04 Marks) (06 Marks) (86 Marks) mapping system of the (08 Marks) (06 Marks) (04 Marks) (10 Marks) (10 Marks) (04 Marks) (06 [4arks) Explain the architectural design decision. Explain : i) Repository model ii) Layered model Explain object oriented design process with example of weather layered architecture. What are agile methods? Discuss the principles of agile method. Explain the Lehman's laws. Explain the steps involved in reengineering process with a neat diagram. Explain the factors governing staff selection. Write short notes on group communication. Explain briefly the algorithmic cost modeling and write the difficulties. Define validation and verification and explain two cornplernentary approaches to systen"r checking and analysis. (04 Marks) Explain clean room software development process with neat diagrarn. (08 Marks) Explain interface testing with neat diagram. (08 Marks) CEtTTR&t L!8&4&r
- 2. USN c. t^LA. b. c. 3a. b. c. 4a. 10cs52 Max. Marks:100 (08 Marks) (04 Marks) DC, TIXR : 88, (08 Marks) (05 Marks) (10 Marks) (05 Marks) boot strap loader, (10 Marks) (10 Marks) (04 Marks) (10 Marks) (06 Marks) Fifth Sernester B.E. Degree Examina-tio- System Software Time: 3 hrs. b. d d E () E9 d= CIU ao ll cco .=&dr+ o:! ul -0 *.a 6;i oc) (!o boi -o>e26 't, d ->ts 5v dg ()i ?.? o: A,E fr0 =v >'! oo-c oJ) ()= o: U< iN 6) z ! o Note: Answer any FIVEfull qwestionso selectimg atlesst TWO questions fronn each purt. PART _ A I a. Bring out the differences between system software and application software, with examples. (05 Marks) Write the program in both SIC and SIC/XE to copy a character string 'SYSTEM SOFTWARE' to another character string. (05 Marks) Briefly explain the SIC/XE machine architecture. (trO Marks) Write and explain the algorithm for a pass - 1 of two - pass assembler. Explain the data structures used in assernbler algorithms. Generate the object code for the source program given below : WRREC START 1O5D CLEAR LDT WLOOP TD JEQ WD TIXR .ILT OUTPUT *iY3 BUFFER RESB LENGTH RESB END CLEAR :84, LDT : 74, JLT = 38, RSUB :4C,: x LENGTH OUTPUT WLOOP LDCH BUFFER, X OUTPUT T WLOOP x'05' 400 2 WRREC TD : E0, JEQ : 30, LDCH : 50, WD 1 T:5. Differentiate between literal and immediate operand with example. Discuss different design options of assembler. What are Control sections? How are they processed? What is loader? What are its advantages and disadvantages? Explain the with algorithm. b. Explain the two design options of loaders. . PART-B 5 a. List the task performed by document linking process in an interactive system. b. Explain the structure of a text editor with a neat diagram. c. Expiain the functions and capabilities of an interactive debugging systern. 1 of2
- 3. a. Explain the data structures involved in macro-processer algorithm. b. Briefiy explain the machine - independent macro-processer features. c. Write a note on MASM,macro-processer. a. Explain the structure of a LEX program with example. b. What is shift reduce parsing? Explain with an example. c. Differentiate between LEX and YACC. ,, ' ..'"i " 1.. 10cs52 (05 Marks) (10 Marks) (04 Marks) (06 Marks) What is regular expression? Explain any 8 characteristics that form a regular exprqg,sio:r. (08 Marks) c. List any 3 LEX - YACC variables and functions. -r (06 Marks) 8 a. Write a YACC program to recognize an arithmetic expression involving o$elations *, -. *, /. (08 Marks) (06 Marks) (06 Marks) d!. atr | J 2 af2
- 4. USN Fifth Semester B.E. Degree Examination, JuneiJ Operating Systems Time: 3 hrs. Note: Answer FIYE fall questioms, selecting st least TWO questions from each part 10cs53 uty 2016 IvIax. Marks:10O (07 h{arks) o o a) €{)L ox 6U ,.o . oo ll cco .g&(ot 9iloEdo ??. - 6X O a,) bo< >e !6 or: o-X o ..: lrE,t () i,E !o 5 .:i >,! oo-g ol) o- : =o;L t< _N () o z o. E PART _ A a. List and explain the functions and services of an operating system and OS operations. *-(08 Marks) b. What are virtual machines? Explain VM-WARE architecture with anea,! diagram. (08 Marks) c. Differentiate between multiprogramming, multiprocessing and muXtitasking systems. (04 Marks) a. Explain process states with state transition diagram. .Also explain PCB with a *rlrlrfif;3ff, b. What is IPC? Expiain Direct and Indirect communication with respect to message passing systems. (05 Marks) c. Consider the following set of process with arrival time and Burst time. A LARGER priority number has a hisher prioritnu a Jobs Arrival Time ms Burst Time ms Prioritv Jr 0 6 4 Jz J 5 2 I JJ a J a J 6 Jq 5 5 J Draw the Gantt chart and calculate waiting time and turnaround tirne using i) FCFS ii) Pre emptive priority scheduling algorithm. 3a. b. t. 4a. b. What are semaphores? Explain Binary and counting semaphores with an example. (05 Marks) What do you mean by RACE? Explain Readers * writer's problem with semaphore in detail. What are monitors? Explain with a neat diagram how monitors are used ro ,"rr.(T#ilTi buffer problem. (07 S,[arks) What is a dead lock? What are necessary conditions an OS must satisfy for a deadlock to occur? (05 Marks) What are the different methods to handle deadlocks? Also explain Deadlock prevention and deadlock avoidance. (0f Marks) c. For the foliowing snapshot. Find the safr Banker's algorithm. i) Is the system in safe state? ii) If a request from process P2 arrives for (002), can the request be granted immediately? (09 Marks) Ssale sequence us Ailocation ABC Max AtsC Available ABC Po Pr Pz P: Pa 002 100 i35 632 | .4 3 004 201 137 842 157 102 I of2
- 5. 10cs53 PART _ B- a. What are Translation load aside buffers (TLB)? Explain TLB in detail with a simpie paging system with a neat diagram. (08 Nlarks) b. Given the rnemory partitions of 100K, 500K, 200K, 300K, and 600K apply First fit and Best fit algorithm to place 212K,4L7K,112K, 426K. (04 Marks) c. Consider the following page reference string 70120304230321201101 for a memory with three (03) Frames. F{ow many page Faults occur for LRU and FIFO page replacement algorithms? Which is efficient among both? (08 Marks) a. What is a file? Explain in detail different allocation methods. (08 Marks) b. What are directories? List different types of directory structures with examples. Mention their advantages and disadvantages. (08 Marks) o. Explain how free space is managed. (04 Marks) a. I-et a disk drive has 5000 cylinders from 0 to 4999. Currently drive is at 143'd cylinder, and the previous request was at cylinder 125. Queue of pending request in FIFO order is 86, 1470,913, 1714,948, 1509, 1022, 1J50, 130. What is the total distance the disk arm moves to satisfy all the pending requests for each of the following disk scheduling algorithms from current position i) FCFS ii) SCAN iii) LOOK. (12 Marks) b. What is protection? Distinguish between mechanism and policies. Explain briefly Access rnatrix with domains as objects. 8 a. With a neat dragram explain in detail components of a Linux system. b. Explain the different IPC rneehanisms available in Linux in detail. c. Explain process scheduiing and kernel synchronization in detail. ,rrr*{<16 (08 Marks) (07 Marks) (08 Marks) (05 Marks) 2 of2
- 6. ,..*;i.R. u(;rum-X) '$ --*',/!',; Fifth Semester B.E. Degree NQb**"f,6!/,June/Juty 2016 Data base M a na gem-dnt Syste m s USN 10cs54 (06 Marks)la. b. oo o o. !d) 6) 3P J- 6V =r)-* ll .Q .= ..l :'t ol) Y() otr.c 9.1 i'E *,a a:: C)() dO o0i .g co >!/6 ,6) 6.|J 3: ir. 6- o.e oi a-2 6: AL= L6) 6.Y>'! bo-coo E3tr> =oo U< _N 6) z irl or Tirne: 3 hrs. Max. Marks:100 Note: Answer any FIVE full questions, selecting atleast TWO qaestions fro* eaeh purt. PART _ A What does defining, manipulating and sharing of a database mean? 2 a. Differentiate the following : 0 Entity and Attribute ii) Entity type and Entity set iii) Strong and weak Entity Discuss the main characteristics of the database approach and how it differs from traditional file systems. (08 Marks) c. Describe the three - schema arshitecture. What is the difference between logical and physical data Independence? (05 Marks) iv) Recursive relationship and Identifying relationship. (08 Marks) b. A database is being constructed to keep track of the teams and garnes of, a sports league. A team has a number of players, not a1l of whom participate in each game. It is desired to keep track of the players participating in each game for each team, the positions they played in that game and the result of the game. Design an ER diagram for this application, stating any assumptions you make. Choose your favorite sport (e.g Cricket , Base ball , Football). (12 Marksi 3 a. Explain the entity integrity and referential integrity constraints. Why each is considered important? (06 Marks) b. Briefly discuss the diffoqent types of update operations on a relation. (06 Marks) c. Consider the following relational schema. Emp (eid, ename, age, sal) Works_for.(eid, pid, #hrs) Proj (pid, pname) Write lhe Queries in Relational algebra for the following : i) Rotrieve Employee Id and Name of the employees who work for all the projects. ii) Retrieve Name and Age of employees whose salary > 10000. iii) For each employee, get the number of projects and number of hours worked on projects. iv) Retrieve Names of employees working on 'CSE" project. (08 Marks) 4 a. Give the complete syntax of SELECT statement in SQL and discuss altr the clauses with examples. (05 Marks) b. What are Aggregate functions in SQL? Explain with examples. (05 Marks) c. Consider the following Relational schema : Lives (Name, Street, City) Works (Name, Cname, Salary) Located (Cname, City) Manager (Name, MGR_Name) Write the Queries in SQL for the following : i) Find the people who earn more than every employee of "CanaraBank". I of2
- 7. 10cs54 il) Find the company employing the most people. iii) Find the Name and city of all the people who work for "SBI" and earn more than 55000 rupees. iv) Show 20o/oraise in salary of all managers. v) Find the companies located in every city in which "ICICI" is located. PART _ B a. Explain Insert, Delete and Update statements in SQL with examples. (06 Marks) b. What are views in SQL? Show how views are specified in SQL. I ist the advantages of views. (06 Marks) c. Differentiate : i) Trigger and Assertion ir) Embedded and Dynamic SQL iii) Outer join and Self Join iv) Super key and Candidate key. (08 Marks) (10 Marks) (06 Marks) (06 Marks) (08 Marks) (05 Marks) (05 Marks) 6a. b. c. td. b. c. What are the informal guidelines for relation schemas? Explain. Define lNF, 2NF and 3NF with examples. What is BCNF? How it is different from 3NF? Prove that a relation with two attributes is always in tsCNF. What do you mean by MVD? When does it aflse? Define 4NF. Define Join Dependency and 5NF. Let R: {SSN, Ename, Pnumber, Pname, Plocn, Hrs} and D: tRr, Rz, R:) where R1 : Emp: {SSN, Ename} R2: Proj: {Pnumber, Pname, Plocn} R3 : Work_ON: {SS}i, Pnumber, Hrs} The following functioual dependencies hold on relation R. P: {SSN ---+ Ename";' Pnua'nber ---+{Pname, Plocn} ; {SSN, Pnumber} ---, Hrs}. Prove that a$biie decomposition of relation 'R' has the lossless join property. (10 Marks) a. What &re the problems with concurrency? Explain each with an example. (06 Marks) b. With a neat state transition diagrarn, discuss the different states of a transaction. (06 Marks) c. Wiite and explain the Two - phase locking protocol for concurrency control. 1ot Marks) 2 of2
- 8. USN 10cs5s y 2016 Max. Marks:100 (06 Marks) (06 Marks) Fifth Semester B.E. Degree Examin Gomputer Netw o(.) o.d g () d) ! dJX 6U -.o or.., ll .<r 63$ :r b0 YOJ oEaO En -)i EU -p o0d dd ,E6- r) 9= o. 5- o.J o -.i r' .Y 6: !l() i, tE !o -a .Y >'* tro0'-E 6= o. ti tr> o- ,J< -c'l 0) o z (! L op. Note: Answer uny FIVE full questions, selecting atleast TWO questions from eflch part. PART _ A I a. What is data communication? Explain with neat sketch three types of communications between the devices considering data flow. (06 Marks) b. With sketch, explain two types of wide area network in use. (04 Marks) c. List out the functionalities of physical layer, data link layer and network layer. Explain in brief. (06 Marks) d. Give four levels of addresses used in TCP/P protocol and give its significances. (04 Marks) 2 a. Define the following : i) Frequency shift keying ii) Band width of composite signal iii) Base band transmission iv) Broad band transmission v) SNR vi) Nyquist bit rate. Time: 3 hrs. 5a. b. c. b. What is latency? List out its components. Find the total delay in a line of length 2000 km, to transfer 5 M bytes of data if band width is 1 Gbps. (04 Nfarks) c. What is line coding? Draw line code of the sequence 01001110 in NRZ_L, Manchester, differential Mancheste r, RZ and AMI co ding scheme. (06 Marks) d. Give the block diagram of PCM encoder and state the role of each processes. (04 Marks) 3 a. What is multiplexing? Differentiate sl.nchronous TDM with statistical TDM giving the working of both proeedures in brief, (06 Marks) b. State and explain the data rate management to handle disparity in input data rates in TDM. (04 Marks) Explain in brief FHSS technique. (06 Marks) List out the differences between datagram switching and virtuai circuit switching. (04 Marks) 4 a. What is hamming code? With the structure of the encoder and decoder for hamming code C(7,4), explain how it can find the error and corrects the same. (06 Marks) b- Find codeword, using cyclic redundancy code given generator 1011, data word 1001 and show how it is used to check for error detection in the receiver side. (08 Marks) c. Write note on error detection method using 16 bit check sum used in internet. Caiculate check sum for a text 'Food' given ASCII values of F is 46, o is 6F and d is 64. (06 Marks) t. d. PART - B With neat sketch, explain two approaches used in variable size framing. What should be send window size in Go-Back-N ARQ? Justify your answer. (06 Marks) What are the 3 types of HDLC frames used in HDLC bit oriented protocol? Explain its significance with its structure. Show how that frames can be used for exchange of data using I piggy backing. I of2 (08 Marks)
- 9. 10cs55 6 a. With flow diagram, explain the working of CSMA/CD. (08 Marks) b. Explain working of CDMA with suitable example. (06 Marks) c. Give the details of minimum and maximum length of Ethernet frame. With an example, explain the format of Ethernet address. (06 Marks) la. b. c. 8a. b. With neat sketch, explain BSS and ESS. (06 Marks) Explain with necessary sketch IEEE 802.1 1 addressing mechanism {08 Marks) Show two types of networks used in Bluetooth. Explain in brief the same. "' (06 Marks) Write note on five classes of address used in IPV4 addressing. Gr"y*e,the details of address space. (10 Marks) Give the IPV4 datagram format and brief description of each field. ''.': (10 Marks) '''':."' 2 of2
- 10. ,:7ei ." -. -Y---- t-' ffi)ti USN 10css6 Max. Marks:100 (04 Marks) (08 Marks) Fifth Semester B.E. Degree Examination, June/July 2016 Formal Languages and Automata Theory (.) o o d! a d ta) (6 o EP -v? -.o co ll CQ,_! .5 or 53* Eil, oi -O Q2 o(J dO o.obotr >P tr:J -t,() ce ? (.) t& o. oi ?.2 6= A,i .!a ,4) 5.v>.'* oD- coo o= c.U F> =D 5: U< -:6i o Z L o o. Time: 3 hrs. 2a. b. c. Note: Answer FIVE fuII questions, selecting at least TlfO questions from each part. PART _ A I a. Define the following with examples: i) Alphabet, ii) String. b. Define DFA. Write the DFA's for the following languages on I: {a, b}. D The set of all strings containing the substring 'ab'. i, L: {o I lc,rl moa 3 : 0} ii) 1: {a"b"' I n>4, m<3}. Prove that every language defined by a regular expression is also defined automation. Write the e -NFA for the regular expression ab(a + b)*. State and prove pumping lemma for regular languages. Show that the language I. : {anb" I n > 0} is not regular, Minimize the following DFA using table filling algorithm.w 6 0 1 +qt 9z *Q: 9q *Os 9z 9: 9q Qs 9z 9: 9s 9: 9s Qs Define CFG. Design CFG's for the following languages: i) ;:1anb2"ln>o) ii) L: {rr* / oe {a, b}*} Write the LMD, RMD and parse tree for the string '++-xyxy' using the grammar E-++EE I *EE I-EE lx ly What is an ambiguous grammar? Show that the following grammar is ambiguous: E-+E+ElE*El(E)lid c. Convert the following NFA to its equivalent DFA. t lg.Ql(c) (08 Marks) Define a regular expression. Also write the regular expressions for the following languages. i) The set ofall strings ending in the substring'00' on I : t0. l] 3a. b. c. (08 Marks) by a finite (08 Marks) (04 Marks) (07 Marks) (06 Marks) (07 Marks) (08 Marks) (06 Marks) (06 Marks) 4a. b. c. Fig.Ql(c) 1 of2
- 11. 10cs56 PART _ B Define a PDA and explain the working of it with a neat diagram. (05 Marks) Design a PDA for the language L: {cor,lR I co e{a, b}*}. Draw the transition diagram and also write the sequence od ID's for the string 'abba'. c. Convert the following CFG to an equivalent PDA: S-+aA A -+ aABClbBla B+b C+c 6 a. Eliminate the useless symbols and productions from the following grammar. S -+ ABIAC A -+ aAlbAala B -+ bbAlaBlAB C -+ aCalaD D -+ aDlbC Write short notes on: a. Multitape turing machine b. Post's correspondence problem c. Applications'of context-free languages d. Chomsky hierarchy b. Define CNF and convert the following grammar into CNF. S -+ABa A -+ aab B + Ac (06 Marks) c. Prove that the family of context-free langiiages is closed under union, concatenation and (07 Marks)star-closure 7 a. Define a turing machine and explain the working of a basic turing machine with a neat diagram. (08 Marks) b. Design a turing machine for the language 1: {a'bn ln >1}. Write the transition diagram for the same and also, indicate the moves made by the turing machine for the input 'aabb'. (12 Marlis) (10 Marks) (05 Marks) (07 Marks) (20 Marks) {<*48* 2 of2