Roll No. BE EXAMINATION OCTOBER-NOVEMBER 2018 Subject Code: CSL-801/8Y51 Subject Title: Advance Operating System(GS & NGS) Time: 3 Hours Maximum Marks: 70 Minimum Passing Marks:22 Note: 1. Answver all five questions. All questions carry equal marks. 2. In each question part a,b,c are compulsory and part d has internal choice. Out of which a & (max 50 words ) carry 2 marks part c (max 100 words ) carry 3 marks and part d (max 400 words) carry 7 marks. Word limit would not be followed for (except) diagram, numerical, derivation ete 3. Allparts of each question are to be attempted at one place, 4._ Assume suitable vatue for missing data, ifany. Question ‘Question Marks | Course Number Outcome mapped Qi (a) Write different type real time operating system shortly 02] COT (b) Why time sharing operating system needed? 2 | Cor i (¢) Differentiate between Loosely couple and tightly couple system. i 'COi,CO2 (A) Using suitable example, discuss the design aspect of single and | 07 | COl™ multiuser operating system. [- ‘OR (©) write short notes on following 07 | Cor 1. Spooling 2. CPU Scheduling 3. Multiprogramming 2 (@) How network operating system is different from distributed operating | 02 | COS system? (b) Define hardware requirement for distributed system, 02 | C06 (©) Compare flexibility and scalability issue for designing distibuted | 03 | COS { | operating system, (d) Discuss the various goals for designing of ideal distributed operating |07 | COS,\CO6 system. | | ‘OR (6) Explain different types of transparencies are required for deigning | 07 | COS,COS distributed operating system.[3 (a) Define blocking vs non blocking primitive in distributed system | 02 «| cO6 | | communication shortly. | t (b) Write short notes on group communication in distributed system COG (c) What are the difference between remote procedure call and local | 03 C03 procedure call? (d) How can we use remote method sum() to add 10 numbers from a | 07 C03 client machine? a OR F at (©) Waite the steps Tor Execute the Remote Procedure Call. oF [oo 1 Q4 (a) Write short notes on wait-die Deadiock prevention approach, 02 C02 (b) Discuss the need of coordinator in election algorithm? [cor | (c) Explain Token Ring Algorithm for Mutual Exclusion. 03 co2 (d) Describes the Various strategies are used to handle deadlocks in} 07 coz Distributed Systems ¢ OR (@)Explain Berkeley algorithm for clock synchronization in distributed | 07 | COD system. Qs (a) What are Trends in Distributed File System? 02 ‘C04 (b) List the name of thread scheduling algorithms in distributed operating | 2 ‘Cod system. (©) What is the difference between replication and file caching? 03 co4 | @ Explain workstation model for building distributed computing 07 CO4,COS system. | ‘OR ‘ (© Explain Write-through and Delayed-Write schemes of file caching in | 07 | CO4,COS | distributed systemRoll No .. VI YEAR B.E. EXAMINATION OCT-NOV 2018 ©@ Iftefprae CSL-804/ITL-801/8Y71 : Cellular & Mobile Communication (GS & NGS) Timo: 3 Hours Maximum Marks: 70 Minimum Passing Marks: 22 Note: [2 Ansara ve quien, Al quations cay equ nari, 2 Ineach question prt ab care compatory spar dine hole, Ou of which part a &b (Max 50 wor) cay 2 mars, prt ¢ (Qa 10 word) cary 3 mars pat (400 wade) cary 7 ak, Word lt woud nee followed fe (excep) dagen, 2 “Airueeek quent utp une ple 4 Assure slab vl for sag dan. 5.__PLEASE MENTION If ANY () 1.5. CODE i) DATA TABLES ETC, ARE PERMITTED IN THE EXAM. Question Marks | CO No. _§ |i 1. | (@)_| Explain the following terms: Unicast, Multicast and Broadcast. oz | 425 (b)_| What method is used for voice transfer? 02 | 125 (©) | Compare feathers of forth generation cellular systems from third-generation | 03. | 1,25 cellular systems? (@ | Explain uniqueness of mobile radio environment. o7 |i25 oR (@)_| Explain elements of mobile communication in brief. 7 2. | (a) | What do you mean by mobile station subsystem? 02 (b) | What are the merits of frequency reuse? 02 (©_| Compare mobile radio systems with conventional telephone systems. 03 (@) | Find the far Held distance for an antenna set with dimension 2 meter. | 07 Assume its operating frequency as 800 MHz. OR ® //Calculate wavelength of signal for PCS and cellular mobile system with | 07 [12456 ranges of 2.6 GHz 845 MHz, 3. | (a) | Define structure mobile operating system. 02 (424.5 (b) | What do you mean by memory allocation? 02 [1.25 (© | Write difference between mobile operating system and windows| 03 | 12 operating system. (@) | Describe constraints and Restrictions of mobile operating system, o7 [a2 OR (©) _| Explain multitasking scheduling in brief, o7 [a2 4, | (@) | Write the name of communication protocol, o2 [42 (b) | What are UI Frameworks? 02 [125 (© | Write comparison between fixed channel allocation and dynamic channel | 03 | 1,2,5 allocation. (@ _| Explain cellular traffic terminology of traffic theory. o7 135 Ll OR (e) | Draw and discuss flow diagram for call setup and control setup? o7 [45 5. | (@) | What do you mean by 802.11b? o2 [1s (b) | Write types of WLAN! z o2 [45 (© [What are home agent and mobile agent? 0345 |__[(@) [Explain working principle of wireless application protocol in detail. o7 [as E | OR (€) | Define GSM? Write working of GSM. What are the difference between | 07 | 1,5 GSM and CDMA? eeIV B.E. EXAMINA’ Time: 3 Hrs. Note: Roll No. CSLIITL-802/8Y52 Data Warehouse and Data Mining (GS & NGS) Maximum Marks: 70 T. Answer all five questions. All questions carry equal marks. be followed for (except) diagram, numerical, derivation etc. 3. All parts of each question are to be attempted at one place. 4, Assume suitable value for missing data, ifany TION, OCTOBER-NOVEMBER 2018 Minimum Passing Marks: 22 2, In each question part a, b, ¢ are compuisory and part d has internal choice. Out of which part a & b (Max. 50 words) carry 2 marks, part ¢ (Max. 100 words) carry 3 marks and part d (Max. 400 words) carry 7 marks, Word limit would not Question Marks | Course No. Outcomes i @ _ | Whatis data mining? Discuss its significance inthe present [2 | 1 scenario. @® _| How does KD differ from data mining? 2 [id (© _| What do you mean by Transactional databases? Discuss with | 3 [1.2 : the help of suitable example. (@ | Describe the differences between the following approaches | 7 [1,2 for the integration of a data mining system with a database ot data warehouse system: no coupling, loose coupling, semi-tight coupling and tight coupling State which approach you think is the most popular and why. OR © _ | Give the architecture ofa data mining system. Whatarethe | 7 | 1,2 essential components of a data mining system? Describe the purpose of each of these components. 2 @ _ | Give the differences between Operational Database Systems | 2 | 1,2 and Data Warehouse, (b) | What do you mean by the term ‘Fact Tables’? Discuss the 2 (24 importance of Fact Tables in the design of d data warehouse. (c) _ | Discuss 3-tier data warehouse architecture and explain 3. 134 ROLAP, MOLAP and HOLAP servers.| (4) | Present an example where Data Warehousing is crucial to 23 the success of a business. What Data Warehousing functions does this business need? OR | (© _ | Discuss about the following schemas in the context of Data| 7 [23 | ‘Warehousing | (i) Siar Schema (ii) Snowflake Schema | | (iii) Fact Constellation | | Also specify which schema is better and why. 3. (@___| Discuss the need and importance of data preprocessing. PamE (0) _| Describe why concept hierarchies are useful in data minin, 216 (© __| What do you mean by noisy data? Discuss with suitable 3 (3 ‘examples. @ __ | What is the purpose of data reduction techniques? Discuss 7 (343 attribute subset selection method with the help of suitable example. OR © _ | Inteal world data, tuples with missing values for some 7.3 attributes are common occurrence. Describe various methods for handling this problem. rm (@) _| Differentiate between Horizontal Data Layout and Vertical 2 (iz Data Layout. (b) | Explain the following oe 2 |4 (i) Aprioti Property (ii Meta Rate i (©)_| What do you understand by market basket analysis? Explain | 3 | 4 | | with the help of suitable example. | |@ _ | Discuss Apriori Algorithm with the help of suitable 7 Tae | example. OR (© _| Discuss Partitioning algorithm for mining frequent itemsets | _7 [4,6 with the help of suitable example. x (@_| What do you understand by the term cluster analysis? 27/5 (6) | What do you mean by prediction? Explain with the help of 2 (46 suitable example, (© | Briefly outline the major steps of decision tree classification. | 3__|3,5, (@__| Discuss the design issues for the efficient and intelligent data [7 | 5.6 _L mining system. iesnsnaiaee =| OR | (©) _ | Discuss and outline the major features of any one 7 (456 commercial data mining system in detail,IV" Year B.E. Examination Oct-Dec 2018 ! S802: Web Engineering(NGS/OLD) ‘Time:, Three Hours Max Marks: 100 ‘Min, Pass Marks: 35, i Note: 4.Total Number of Question: 08. Attempt any five questions. 2. All Question carry equal marks. Q.1 a) Draw the IP header and explain each field of the IP header. b) Explain Client server model in detail Q.2: a) What do you understand by IP address? Write its advantages and disadvantages, b) Explain how the TCP connection can be establish and release. Q.3 a) Explain ICMP packet format? Also discuss various ICMP message type. 'b) Explain ARP in detail? Q.4, a) Draw the TCP header and explain each field of the TCP header. 1°) Explain UOP in detail Q.5) a) Explain SMTP in detail b) Explain the Telnet protocol. Q.6 a) Explain the properties of reliabilities service. +b) Explain Karn’s algorithm of retransmission. 7: a) What do you understand by loopback interface? Explain with the help of suitable example. b) What is Distance vector routing? Explain with suitable example, Q.8' Write short notes on any four of the following FTP ~ Exterior Gateway Protocol TeTP TCP/IP Application RIPBofohy Roll No, Final YEAR B.E. Nov - Dec 2018 CSL 803/ITL 80478553: Neural Network and Fuzzy System Time: 3 Howes oxi Marks 70 Winimum Passing Marks : 22 [ Note: a. Arswerallfvequesions Al guemons cary equal Gos ere aes | Fa uation porta, re cmpuory ad part das heme choke. Out of win | fata so gO Words) cony 2 marks port (Mex. 100 words) cary 9m oho | smeay Matt) cary 7 marks. Wor int woud not be elowed fos oceans ‘numerical, derivation ete 3: _AllParts ofeach question are tobe attempted at one place | 4 Assume suitable value fir isitig data, fony & _PASEMENTION IF ANY () 1. CODE, i) OATA TABLES ETC ARE PERMITTED NTH xa Question | Marks | at No. 2S eee 1. | (a)_[ Differentiate ANN and BNN a Col] {b) | Explain McCulloch Pitts Neural network model 02 | cocoa | (9) [If the net input to neuron is 0.64, calculate ke Sutout when the | 03 | ~coi,co3 | activation function fs Binary Sigmoidal and Bipolar Sigmoidel with Steepness parameter=1 obs |(@ | explain why XOR problem Cannot be solved by a single layer |. o7 | €01,co3 | Perceptron and how itis solved by multilayer perceptron, | | oR } Ee (e) | Draw and Explain Single layer feed forward network, Multilayer feed | 07. | Cou,co2,co4 | forward network and recurrent network, | 2._[a)_[ Explain Hebbian learning. 02 j {b)_| Draw the graph of Log Sigmoid and Signum function 02 1 (¢]_| Clearly distinguish between Supervised, Unsupervised and Reinforce | 03, learning. (d) | Discuss Hopfield networks. Also write its applications, o7 il OR | (e) | Find the new weights when the network (Back Propagation Network) | 07 | CO2,co3_| In fig is Presented the input pattern (0.6 0.8 0 and target output | P. Use learning rate = 0.3 and use binary sigmoid activation function, | | | (4 | | | | | | | 4 | | |3 la) | Biplain ART2 Also write the difference between ART2andaRT. “| 02 | co3,coa ; | (b) | Explain fast and slow learning of ART pat | [ (c)_| What is plasticity in reference of Neural Network 03 4 (a) | Draw architecture of ARTI network ete 5, OR | i Slee eee Se cana Oe| Consider an ARTI network with four ingut unlé and three chaser] units. Determine the updation in weights when vectors (10 1 0}, (10 | 01), (011.4) and (1 10 2) are input. Assume the vigilance parameter 250.3. Explain fuzzy associative memory Explain Demorgan’s law. Write features of Membership function. Write fuzzy entropy theorem. OR T fe) Write the following properties of CRISP set- Commutativity, Associativity, Distributivity, Iden: 5. fa) What are the fuzzy set operations? {b} Define cardinal number. {c) List some application of neuro-fuzzy system, (2) Consider two fuzzy sets, A=(0.33/6 + 0.67/7 +1/8+ 0.67/9 + 0.33/10} (0.2/3 + 0.6/4 + 1/5 +0.6/6+ 0.2/7} | Perform union, intersection, difference and compliment over fuzzy set Aand B. OR | fe) Consider two fuzzy sets: Bx + 0.7/2 + 1/x3) Aly + 0.9/y2} Perform the Cartesian product over these given fuzzy sets, 7 ee RRR Ke4" Year B.E, Examination October-November 2018 SUBJECT CODE BCSL-701/BITL-701/CSL-701NTL-701/TY51 SUBJECT TITLE: Artificial Intelligence & Expert System(GS & NGS) g- $ Time: 3 Hours Maximum marks: 70 Minimum Passing marks: 22 Note: 1. Answer all five questions. All questions carry equal marks, 2. In each question part a,b,c are compulsory and part d has intemal choice. Out of which part a carry 2 marks, part b carry 2 matks, part ¢ earry 3 marks and part d cary 7 marks, 3. All parts of each question are to be attempted at one place. 4, Assume suitable value for missing data, if an; Question [Marks | Course No. Outcome Mapped Unit-T ie (@)_| What is the difference between strong AJ and weak AI? de col @)_| Compare and contrast monotonle and nom-monotonie production 2 Cor system. (©) | What are good programming language for Al? Describe each of them. 13 COT, COF (@ | Discuss water jug problem by taking sultable help of states, operators, | 7 | COLOR, Start states and terminai state? [COs OR (©) | Explain problem characteristics by taking your own example, 7 COI Unit-2 2 (a) _| Explain the simulated annealing search technique. 2 Coz (b) "| Write properties of A in terms of completeness, time exponential space [2 co2 and optimality. (| Discuss some of the potential problems where using hill climbing 3 Coz a ¥ search? @ | Trace the constraint satisfaction procedure solving the following crypt | 7 02,604, arithmetic problem. cos CROSS: +ROADS DANGER | OR (©) | Consider trying to solve the 8-puzzle problem using hill climbing and 7 C02,COS find a heuristic function that makes a work 1/2|3 1[2 13 81516 41516 47 718 LLL J Li | | Start Ht Goal }1 ~ - @)_[ What are major issues in knowledge representation technique? 2 cox (b) | Compare inferential adequacy and inferential efficiency. 2 CO3 | (©) | Explain chain rule and substitution technique in propositional logic by | 3 cot taking suitable example. (@_ [Assume following facts : 7 03 a). Steve only like easy courses. b) Science courses are hard. ¢) All the courses in the basket weaving departments are easy. d) Bk 301 is a basket weaving course. | Use resolution to answer the question.” What course would Steve like"? OR (© _] Witte the different steps for transforming @ sentence into clausal form. | 7 co3 | And convert given sentences into first normal form. 2 a, Leoisalion b, All lions are ferocious c. Leo is ferocious Unit-4 (a) What are the main difference between soript and structure? 2 03,004 (| Compare Forward chaining and backward chaining with example. z COs () | Explain classes and object in frame & give advantage and disadvantage | 3 cot of frame? @® | Explain the following steps as conceptual dependency structure. 7 CO4,CO3 a) Bird flew. b) Joe isa student. ©) Joe pushed the door. 4) Joe gave sue a flower. 5 OR @ _] Represent the given fact in partitioned semantic networks. 7 C03,COF ‘© Andrew believes that the earth is flat Unites € (@)_ [ik the minimax procedure a depth first or breadth first search? Explain. | CO2,C05 (b) | What is cardinality of a fuzzy set? And also explain power set? 2 cos (©) | What is alpha beta pruning? Give example. 3 C05,CO2 TE” | Give the architectine of an expert system? And briefly explain each 7 CO5,CO6 component. OR © _| Explain the following with example: 7 C06,COT | & Application of Natural Language Processing $ '\__b, Planning & UnderstandingB. E. Examination, Nov-Dec 2018 Distributed System (BCSL-702/BITL-702) ‘Time: 3 hours Maximum Marks: 70/60 Minimum Mars: 22/19 Note {Answered all five questions. Carry equal marks. 2, In each unit part a, b, ¢ are compulsory and d part will have an internal Choice, Out of which part a & b (Max. 50 words) carry 2 marks, part ¢ (Max. 100 words) carry 3 marks and part d (Max. 400 words) carry 7 marks. 3. All parts of each question are to be attempted at one place. 4, Assume suitable value for missing data, if any. Que. MM] CO's No. TT @ | Why is Groupware? Why is it considered to be a promising ]2 13 | technology for software development? {| Explain the difference between the terms service and server? In 2 | 2 | The design of a distributed operating system. (| Why is heterogeneity unavoidable in many distributed system, [3] (@) | Differentiate among the following types of operating systems by [7 | 1 defining their essential Properties: 2) Time sharing by Parallel processing | b) Network @) Distributed OR {| Compare the following types of systems in ferms of Cost, 7 Vit Hardware complexity, operating System, Potential Parallelism: 1. A multiprocessor system having a single shared memory? FTW fate DSM systems suitable for both LAN and WAN [2° |14 environments? | What is false sharing? When is it likely t0 occw? 2 (©) | Differentiate between weak consistency and release 3° ]3,5 consistency. @_ | Explain the Architecture of DSM system and its type? 7 [24 OR TE) [Diss the lative advantage and disadvantage of using the [77] 4 NRNMB, NRMB, RMB and RNMB strategies in the design of « DSM system. 3 [| Whats false sharing? 4 (b) | Describe the two-phase, multiserver commit protocol? 2st (c) | Differentiate among the following properties of a distributed 3 file system. i. High degree of availability ii, High degree recoverability iii, High degree of robustness(@) | Why ‘are ‘transaction needed in a fle Service? Give sallable 7 46 examples to illustrate how Transaction help wien Improve the = recoverability of files in the event of failures OR | © | In the design of a distributed file system, high performance [7 a5 and high reliability are conflicting properties, Discuss? 4 (a) "| Deseribe blocking and non blocking types of IPC? 2h | —[(0)_[ Explain ierms: Group Management and Group Addressing? 213 (6) | Why do most RPC systems support call-by-value semanties for [3 23 parameter passing? (@) "| What is meant by absolute ordering, consistent ordering, and 7 {5 causal ordering of messages? Give a mechanism to implement each one. OR © | What is a “stub? How are stubs generated? Explain how the wwe 7] 7 35 | of stubs helps in making an RPC Mechanism transparent. 5__|@) "| Two methods for deadlock prevention in Distributed sysiam? 215 (b) _| Prove that an unsafe state is not a deadlock state? 2_ [2 (©) | What is phantom deadlock? 3_ [2 (a) | A centralized deadlock detection algorithm how prevents the 7/5 detection of false Deadlocks? ~ = OR (¢)__| Explain the issues in designing load balancing algorithms? 715Roll No. 4 YEAR BE. EXAMINATION OCTOBER- NOVEMBER 2018 SUBJECT CODE: CSL/ATL 702/TY52 (GS & NGS) SUBJECT TITLE: COMPILER DESIGN & TRANSLATOR: ‘Time: 3 Hours Maximum Marks: 70 Minimum Passing Marks: 22 Note: | is Answer ail five questions: All queifions carry equal mar 2, Imeach question part a,b, eare compulsory and part d has internal ehoice, Out of whieh part a & b (Max. 80 words) earry 2 marks, parte (Max. 100 words) carry 3 marks and part d (Max, 400 words) carry 7 marks. Word limit would not be followed for except) ‘ingram, numerical, derivation etc, 3. All parts of each question are to be attempted atone place. 4._Assume suitable value for missing data, ifany. ‘Question Marks | Course No. Ontcome Mapped 1._|(@)_| Define Tokens, Alphabets and String. 2 1 (b)_| What do you means by ambiguity of grammar? 2 12 (©) -| Differentiate between compiler and interpreter. 03 I (@) | Explain the six phases of compiler? Ilustrate the translation | 07 | 1.24 of the following statement on all phases of compiler. A=B*C#D/E ‘OR (©_| Consider the Grammar given below 7 | 236 S>aB/bA. A>alaS/bAA | B>b/bS/aBB | | Show that this Grammar is ambiguous or not for the string | aaabbabbba. | (@)_| Define DFA and NFA. a iz (b)_| Explain regular expression. 2 1 ()_| Explain Minimizing of DFA with suitable example. 03 12 (a) | What is LEX? Describe Auxiliary Definitions and|~07 | 13,6 “Translation rules for LEX with suitable example. ‘OR (©) _| Write regular expression for the language 7 | 125 i) L={a'™ J n>=4,m<—3} i) L={a'b™ / (atm) is even 3._|(a)_| What is Context Free Grammar? 2 2 ()_| Write limitation of operator precedence parser. 02 2 (©)_| Differentiate between Top-Down and Bottom-Up parsing. | 03 12 (@) [Construct the predictive LL(1) parsing table for the| 07 | 25,6 following grammar E>E+T/T T>T*F/F F>(B)/id OR ) |For the following grammar calculate FIRST) and) 07 | 12,4 FOLLOW function for each of non terminal.S=> ACB/CbB/Ba i A> da/ BC Bogle C>hle 4. [(a) [Define Syntax directed translation, 02 4 (b)_| Write benefits of Intermediate code generation. 02 4,5 © | Give the difference between heap allocations and stack] 03 | 4,5 allocation of storage. (d) | Write the intermediate Quadruples, Triple and Indirect | 07 45.6 |__| Triples code for the expression. -(a#b)*(c+d)-(atb40) OR (@) | Give three address codes for the following. 07 56 | While(a<5) do = D+ 5._|@)_| Explain incremental Compiler. e i (b)_| What is the need of code optimization? 2 4 (© | What is global data flow analysis? What is iis use in code | 03 | 4,3 optimization? (@) | Describe the necessary and sufficient condition for 07 45,6 performing constant propagation and Dead code a eliminations. OR (e)_ | Construct DAG for the following basic block. OT 45,6Roll No IV YEAR B.E. EXAMINATION OCT- NOY 2018, { BCSL 703: Digital Forensics (GS) 4\ le Time: 3 Hours inne ait Winimum Passing Maris: 2 | Note Ty _Aisweral five quesivons Allquesions cay equal marks fe 2 wea ston pt cae omg ale sinc On which 2 (Mae 30 nl) ey 2a, art (M10 wots) cary 3 ws dp (10) eat Take Wor altb lied (ee dnp eel aoe | See S.__PLEASE MENTION IF ANY (015, CODG i] OATA TABLIS ee, ARI AeAMUTTED IN THE EXAM Question Marks No. = 1. [(@)_| Whatis computer forensics? How is it different from computer security? @ |__| @) | what are typical computer supported crimes that occur in corporates ? @ (©)_| What are the different types of electronic evidences?) 03 (@)_| What is data acquisition? What are its types? List few acquisition tools. 7 OR ie (©)_| Enumerate the gui s for seizing digital evidence at the scene, 07 | co2,c03,c04 2. | @ | What do you understand by print spooling and hibernation? 02, | coscoe (©)_| What is Disk imaging? Discussits importance. a G2 | CoCr (©)_| Explain the process of carving data manually : ms aos) Gj | CoCo (© | What is windows registry? Explain Registry HKEY, Key, Subkey, branch, value, | 07 __| default value and hives in context of windows regist Eee is oa or eae (@)_| What is master boot record? Explain the FAT and NTFS file systems, 07 | cos,co1.cos 3. | @)_| Give an overview of Network Forensics. ee Tes | coxcoz ()_[ What is ONS Poisoning? & ee | cos (©)_| What is Promiscuous mode of Network Interface Card (Ni 3 oS (_| How evidence gathering is carried out in shared and switched Network. 07 [| concos Be OR (©)_| Discuss the features of Wireshark and SNORT pack 07 | coxco 4 | (@)_| Whatis cookie poisoning? How does it work? 02 | coicos (b)_| How “Whois” can be used for footprinting? i 02 €03) (©)_| What is SQL injection and XS5 attack? oa 035 | colieos (@_| What is port scanning? What are different types of port scanning? What are 07 | objectives of port scanning? Ser Sorts (e)_| Discuss various tools and Techniques for locating IP address. 07 | coxcos 5. | (@)_| What do you understand by intellectual property right(IPR) 0 cor (b) | What are the steps to be followed after recording the scene, shutting down the 2 a system and packing the evidence? oy 5 | © _| Enumerate the guidelines for ensuring the integrity of forensic evidence, 03 | concos (d)_| Explain the legal process to conduct computer investigation for potential criminal ae | ce violations of law. epee eer aaa 3 a oe Cee ae (© _| Enumerate the basic steps for computer forensics investigations. O7_|_concos L toticiV Year B.E. EXAMINATION OCTOBER-NOVEMBER 2018 SUBJECT CODE: BITL-703 SUBJECT: IT infrastructure Management (GS). te Time: 3 Hours Maximum marks: 70 Minimum Passing marks: 22 ‘Note: 1. Answer all five questions. All questions carry equal marks. 2, In each question part a,b,c are compulsory and part d has intemal choice. Out of which part ‘acarry 2 marks, part b carry 2 marks, part c carry 3 marks and part d carry 7 marks. 3. All parts of each question are to be attempted at one place. 1 4, Assume suitable value for missing data, if any Question Marks | Course No. Outcome Mapped Unit 1. [@)_| Whatis the meaning of IT infrastructure? 2 1 ( (®)__| Sketch von Neumann architecture of computer system. 2 ws c) | Give the description about fourth generation computers. Zep 24 (®)__| Explain various challenges in IT infrastructure management, 7 3 OR (©_| Explain various common tasks of IT system management. 7 Ss Unit-2 2 (@) | What do you understand by Information Technology Infrastructure ao 1 Library? (b)_| What are the advantages of ITIL? 2 o (c)__| Ilustrate system context diagram. 3 a [(@)_ | What are various IT System Issues? Discuss in detail. 7 we OR (© [Explain various models which are used in system design process? 7 24 Unit-3 3 (a) _| Write the objectives of Operational Level Management. 2 ft (b)_| List the roles and responsibility of Service Level Manager. 2 23 ¢ (c)__| Write the benefits of Service Level Management. 3 ca ‘ (@_| How Capacity Management can be implemented? 7 Le OR (e) | Define availability management. What are various tasks of availability | 7 ss management? Unit-4 4 (@)_| Define incident? 2 1 (b) __| What is the benefit of having change management? 23 (©)_| How can an incident affect the organization? 3 4 (@_| What is the purpose of release management? Explain the types of 7 oa ; release, OR(©) | What are the various steps involved in implementing change 7 Zz management? Units (@)_| List the benefit of storage management. 2 v (b)__[ Sketch the diagram of Storage management process. 2 278 (©)__| Write the types of backup and also give their description. 3 qh (a) ] What do you understand by information security? What is the role of | 7 ed identify management in information security? OR (| What is introsion detection? Explain different types of intrusion 7 Seoe ue IV YEAR B.E. EXAMINATION, OCTOBER — NOVEMBER 2018 CSL/ITL-703/7Y53 : Parallel Processing (GS and NGS) ‘Time : 3 Hours Maximum Marks : 70 Minimum Marks : 22 Note : 1. Answer all five questions. All questions carry equal marks . 2. In each question part a, b, ¢ are ‘compulsory and part d has internal cholee. Out of which part a & b (Max. $0 words) curry 2 marks, Part © (as 100 words) carey 3 marks and part dl (Max. 400 words) cary 7 marks. Word lndt would not be followed yya,y, (COet For (escept)dingram, numeral, dervaton ee. 3. Al parts of each question are tobe atempied atone plac. 4 Mapped Assume suitable value for missing data, any. (@) What do you understand by the time sharing system ? 2 cor (6)’ Distinguish between the parallelism and pipelining. 5 2. col (© Discuss the importance of parallel processing. 03 col (@ _ Discuss the Flynn's classifications of parallel computer structure 07 «col OR z (© Discuss the Handler's Classification of parallel computer structure. 07 coz (a) What do you mean by pipeline Processor ? @ cos (6) What do you understand by data buffering ? @ co3 (© What do you understand by the performance of the pipeline? What are the 03 COL measures used for measuring the same ? (@__ Explain the following terms with reference to pipeline system: 07 cos @ Reservation table i) Lateney Gi) Throughput (iv) Speedup OR (© Discuss the various possible Hazards between read and write operation in an 07 C03 instruction pipeline and state the mechanism to detect and avoid these hazards.(a) ) © @ © @ ) © @ © (@) ) © @ © “What do you mean by vector chaning and vector loops? Describe the characteris of vector processing. Discuss multiple vector task dispatching ? Describe the architecture of CRAY OR Describe pipelined vector processing methods. ‘What do you mean by Shufile- Exchange? Explain the significance of masking in array processor. Desoribe the routing function. Discuss in brief the various topologies of a multiprocessor system, Also find the umber of processors for which the hypercube topology has a lower total ‘bandwidth than the completely connected topology OR Design an algorithm for multiplying two n a matrices on a mesh with fewer than n? processors. ‘What do you understand by parallel memory organization? ‘What do you understand by crossbar switch ? What is the importance of critical section . What are the necessary conditions for the deadlock to occur? Discuss the software requirement for multiprocessor. What do you understand by multiprocessor scheduling? Discuss and compare different scheduling strategies. OR HHH 02 02 03 07 07 02 02 03 07 07 02 03 07 cod | cos cod cos | cos | coz coo | f t | | | |23 )io)e Roll No Il YEAR BE EXAMINATION OCT-NOV 2018 CSL TO4/ITL 704/7Y71; NETWORKING WITH TCP/IP. Time:3 Hour, Maximum Marks: 70 Minimum Passing Mark: 22 Note sega ERE cece ae 2 Ineach ena abc compar an prt antl he Oxf which pa Mt 9 wert cay 2,10 wed) Cary Suis np 40 er] ay Th Werk woebnette fond fr ore) angus anced eae 2. AuPau teat uation a ob bonged on pce 4. Aavane seal arming a ay [ec 5. _PLEASEMENTION F ANY 15. CODE DATA TABLES ETC ARE PERMITTED IN HE EXAM. Z| Question Marks | CO No. 1._| (a) _| Define Basic Service Ser? 02, 4,5 (b)_| What is the purpose of cladding in an optical fiber? ee 5 (c) _| What are the benefits of ATM? 03 1,4,5 (@)_| Explain the ATM reference model along with functions of ATM layers. 07 OR (e)_| Explain the OSI reference model with neat diagram 07 1,4,5,6 2. [(@)_| Whatis a hostid and netid? Os |58 (0) _| What is the purpose of subnetting? 02 3 (©) _| What is the router’s role in controlling the packet lifetime? 03 | 2,3,4.5 (@_| When RARP is required. Explain how it works. What is the limitation of RARP? How 07 45 BOOTP provides solution for it? OR | (©_| Explain various error reporting messages in ICMP protocol. o7 | 45 3. | (@)_| Whats the meaning of ACK frame? @ | 45 (b) [How does ARQ correct an error? 02 4,5 (©)_| List some ways to deal with congestion. 03 45 (d)_| Explain about the structure of UDP header. 07 4,5 OR (e) | Explain the principles behind: 07 4,5 i) the SACK-permitted option, ii) How protection against wrapped sequence numbers can be overcome by using the time-stamp option. 4. | (a)_| What is Generic Domains? 02 4,5 (b) | What are the two types of connections in FTP? 02 45 (©)_| Why is an application such as POP needed for electronic messaging? 03 45 (d)_[ Discuss DNS in detail. 07 45 OR a ()_| Explain how IP can be used over ATM? 07 4,5 5. | (@)_| Whatis IPv6? 5 02 | 345, (b)_| What is the purpose of dialog controller? t 02 45 (©)_| Why is an application such as POP needed for electronic messaging? 3 | 45 (@)_| Explain about remote login in detail. 07 45,6 OR a) (© | What is public key cryptography? What are the necessary conditions for public key 07 | 456 cryptography? = weSUBJECT CODE: BCSL/BITL 704 Time: 3 Hours 29 /jo)ik IV" Year B.E. Examination OCT- NOV 2018 € € SUBJECT TITLE: ADHOC NETWORK Maximum marks: 70 Minimum Passing marks:22 Note: 1. Answer all five questions. All questions carry equal marks. 2. In each question part a,b,c are compulsory and part d has internal choice. Out of which part acarry 2 marks, part b carry 2 marks, part c carry 3 marks and part d carry 7 marks, | 3. All parts of each question are to be attempted at one place. | 4, Assume suitable value for missing data, if any Question Marks | Course No. Outcome Mapped 1 (& _| Differentiate hard and soft handoff 2x01 (b) | Why do we have four address fields in IEEE 802.11 MAC as against only 2; col two in IREE 802.3 MAC frame? a's (c)_| Why is a back-off timer used in the CSMA/CA mechanism? 3 €01,C03 | (d) | Suppose each frame header is 32 bytes, which is the length of RTS, CTS, c. C01,C02, | and ACK frames. The 1,000 bytes data is able to be put into one data CO3 | frame. OR (©) | Discuss in detail the technical and research challenges in ad hoc networks. ht €02,CO03 2 (a) _| What are the effects of exposed terminal problem in wireless networks? 2 €02,CO3 (b) | Calculate the number of handshakes needed to send a data packet from the a €02,C03, source to the destination in the following protocols when Ad hoc route of N co4 hops exits. i }(a) MACA__(b)MACA-BI__ (c) MARCH (c) | What are the disadvantages of the binary exponential back-off mechanism 3 C02,C03, used in MACA? How are they overcome in MACAW? z co4 (d)_| Discuss the various factors that need to be considered while measuring the 7 CO1,CO2 LS performance of the MAC protocol for ad hoc networks. OR (e) | Which protocol is more bandwidth efficient, RTMAC or MACA/PR? 7 C02,C03, Explain. cos Ey | @) | List the classification of routing protocols based on the routing information 2 C02,CO3, update mechanism, C04 (b) | Is hop — length always the best metric for choosing paths in MANETs? 2 C02,CO3, Defend your answer. C04,C06 (@ | Isa table-driven routing protocol suitable for high-mobility environments? 3” |(C02,c03;, = CO4 |Ta) | How the route is established in AODV? Explain with the example (adhoe | 7 | CO2,CO4F | network with 12 nodes) oR * ©) | illustrate the step-by-step Route Discovery process from Node -TtoNode| 7 | CO2.CO3, —7 in the given figure using DSR Routing Protocol? (Assuming the cost of cos each link is 1) i / Q oO ~ K\ “To | Ne om | | 2 : | = eee | | 4__| (a) _| Why does TCP not perform well in Adhoc Wireless networks? 2_[€03,co3 (b)_| Why is energy management needed in ad hoe networks? 2 _[C03,CO4 (©) | What is the typical value of time out period in traditional TCP? In what |” 3 [CO2,C04 ways these become a problem in mobile ad hoc networks? (@__| Explain the typical implementation of a smart battery system with asimple | 7 | C03,CO6 example. € OR (@) | Discuss the Energy-Efficient Routing Protocol used in mobile ad hoc] 7 | CO2,CO3, networks. cos | } [5__[@_| Why secure routing protocols are needed? 2 | C03, COS (b) | Are ad hoc networks or sensor networks more susceptible to waffic| 2 | CO3,COS analysis? Why? (©)_| Give the classification of various security attacks in MANET. 3__| C05, C05 (@)_| Explain DOS Attack and its countermeasures in Ad Hoc Networks? 7__[€03, COs OR © | How key management is achieved in Adhoc Wireless networks? 7 [C03 l L LCOS,CO6 | €atfiolig Roll NO... IV YEAR B.E EXAMINATION OCTOBER - NOVEMBER 2018 (CSL/TL -705/7¥72: INTERNET TECHNOLOGIES & WEB DESIGNING (GS & NGS) Time: 3 Hours ‘Maximum Marks: 70 Minimum Marks: 22 Note: 1. Answer all five questions. All questions carry equal marks, 2. In each question part a, b, ¢ are compulsory and part d has internal choice. Out of which part a & b (Max. 50 words) carry 2 marks, part c (Max. 100 words) carry 3 marks and part d (Max. 400 words) carry 7. Word limit would not be followed for (except) diagram, numerical, derivation ete. 3. All parts of each question are to be attempted at one place, 4. Assume suitable value for missing data, if any. Marks Course Question Outcome No. Mapped 1. (a) What is switch? What is the difference between Switch & bridge? 2 coi (b) What is VSAT? 2 coi (c).- What is internet communication media? 3 cou (4) How an email works? Discuss possible threats through email and 7 c01,co2 guidelines for handling e-mails safely? oR () What is a Web Servers? Discuss different types of web servers? 7 c02,c06 Whaat is the purpose of proxy servers? 2. (a) Why do we need UX? 2 co1,coz (b) What is a named function in java script? How to define a named 2 €01,C03, function? coa (c)_ Write a script that reads an integer and determines whether it is 3 c01,co2, PRIME Number or Not. coa (d) Define frame. Create a HTML page that displays multiple frames ina 7 c02,C03, window. cos oR {e) What is Document object model? Discuss the various DOM methods 7 01, cos used with JavaScript. 3. (a) What are the different types JDBC statements? 2 co4, cos (b) What is a “dirty read”? 2 c02,c03, (c) Whats a stored procedure and how do you call it in JDBC? 3 c01,c04,(a) fa) (b) () (a) {e) (a) (b) (©) (@) (e) What is the scope of the java .io package? Discuss Java IO purposes and features? How to create pipes via java 10? oR What is the difference between POJO and Java beans? What are the benefits of POIO? How to create a POJO? What is a servlet API? ‘What are the life- cycle methods for a JSP? How web container handles the servlet request? List the various action tags used in JSP? What is expression language in JSP? Explain various implicit objects in expression language? OR ‘What is the advantage of JSTL? List the various ISTL core Tags? ‘What are the benefits of WBEM? Why is it important? ‘What does Web-based Enterprise management mean? ‘What do you mean by fault management? Explain Performance Management and security management. OR List, And briefly define the key areas that comprise application and service management. cos 02,03, cos c04,cOS c02,c03, coa c04,cos, coa,cos c01,c02, c03,co6 c04,cos co1,co3 c01,coz 01, Coz co1,coz c01,cOSif 10] 18 Enroll No Final Year B.E. Examination October-November, 2018 BCSL/ BITL-705: E-Commerce (GS) Min Marks: 22 Duration: 3 Hours ‘Max Marks: 70 Note: Attempt all five questions. All questions carry equal marks, Part a, b, c is compulsery and part d ‘has an internal choice in each question. Part a and b are of 2 marks, part c is of 3 marks and part d is of 7 marks. Answers should be relevant, according to the marks & to the point. ae ‘Coie Owisome Q1] @) | Wie the name of five E-commerce opportunities for industries. CO, co2 (0) | What the Advantages & Disadvantages of E-commerce? C02 © | Differentiate Between E-commerce & traditional Commerce. COI (@ | Explain the Business models based on relationship of Transaction Types? | CO3 OR | ©)| Explain the Business models based on relationship of Transaction Parties? | CO3, CO+ Q2| @ | Why do we use beans in Java? COZ | (D) | Differentiate static and dynamic web pages C02, COS (© | Discuss the working of Search Engine. COZ (@) | Draw the Web Application Architecture. Define working and characteristics | CO2 of Components of Web Application Architecture? OR (©)| Discuss the features and need of following Markup languages: VRML, | C02, CO3 SGML, DHTML and XML with example, Q3 | @ | What is Micro Payment System? COI, COZ (©) | What do you understand by Public Private Partnership? Ol, CO2 (© | Write the features and advantages of Smart Card. COI, CO2 (d) | Describe E- Governance System along with objectives and features, Design | CO4, COS | its Architecture, OR’ Discuss the architecture and working of EDI system. COl, CO? leTe02, cos | [Q4]@ | Whats the tmpact of Law and Regulation on Cyber Crime? 1 [7 1) | Waite the difference between HTTP & HTTPS? COB, C06 © | Discuss in brief the working of SSL. 02, C08 | (| Explain IT Act, 2000 on the basis off Salient features, Imporiant concepts | COS and Unresolved issues. T HTOR: [<> | Diseuss the following: SET protocol, SET Business Requirements, parties | CO4, CO6 involved in SET, SET transactions. Q5| @ | What is stateful packet filtering? COF,CO6 (b) | Write the characteristics of static and mobile agents. COI, CO2 © | What is web security and its issues? CO4,CO6 (@ | Draw the architecture of WAP. Discuss lts working and advantages. C03, CO4, cos OR (S97) Discuss the requirement and working of Digital Signature, C02, CO4, [eos |Rol! No, 3RD YEAR B.E EXAMINATION NOV - DEC 2018 CSL 601/6551 ; ANALYSIS AND DESIGN OF ALGORITHM Time: 3 Hours Maximum Marks 70 Minimum Passing Marks : 22 Note: |Z Atawerallfive questions, allauestions carry equal marks 2. Imecch question part o, b, core campulsory and part d has internal choice. Out of which parta & | | ' (Mox. 50 words) carry 2 marks, part c (Max. 100 words) carry 3 marks and pat d (Mex. 400 | words) cary 7 marks. Word limit would not be followed for (except) diagror, numerical, | derivation etc 3. All Parts of each question are tobe attempted at one place. [4 Assume suitable value for missing dat, if any 5. PLEASE MENTION IF ANY (i) 1S. CODE, ll) DATA TABLES ETC. ARE PERIMITTED IN THE EXAM, Question | co No. a See 1. (a) Jfwriain finiteness, definiteness and effectiveness in view of algorithm | 02 | COL characteristics. ee {b) [Clearly differentiate between algorithm, Pseudocode’s and Program. oz | co1 {c)_|Explain the application of following- Stack, Queue, Trees, and Binary Tree. | 03 | CO3__ {d) [Arrange the following function in ascending order of asymptotic 07 | CO1,CO2 InMlogn, n®, 2°, nf, nl . Where k is positive integer k>0. Measure the performance of an algorithm in relation of input size n with making a table lof order of growth for n, logn, nlogn, n?,2* OR (e) | What is RAM modelo find out the time complexity of an algorithm? Write a small code(using loop) and count its primitive operations. {2)_| Explain Divide and Conquer Method. : {b) | Construct 2 max heap using top down approach for following elements {14, 12, 9, 8, 7, 10, 18). {c)_| Explain Strassen’s matrix multiplication. 03 | C03 {d) | Write the procedure MERGE. Execute the Merge sort on the given arrayA| 07 O03 = (310,285,179,652,351,423,861,254,450,520}. Draw the Tree of calls of Merge sort. SEE OR 1 (e)_| Give a recursive and non-recursive algorithm for binary search, = or | e03 3._| (a) _| Define and explain concept of Dynamic programming. 02 | “coa” {b) | Explain Feasible, Locally optimal and Irrevocable Solution in greedy | 02) Coa method. i (c)_| Explain clearly the applications of Greedy Method, 3 cos (d) | Find the optimal solution of greedy Knapsack instances n=7, o7 | €02,C05 (wd,w2,w3...W7)=(2,3,5,7,1,4,1) and (p1,p2,p3...p7)= me=5 (knapsack capacity) 0,5,15,7,6,18,3), ‘OR | (e} | Apply Prims algorithm to find the minimum spanning tree and path cost | 07 | cO2,cO3 for the given graph. i On BO i | ao E ' oa 4. [(@)_[Biplain backtracking concept of algorithm design. o2_| Coa{b) | Write clearly the difference betwean B: jacktracking and Branch and Bound | 02° 1c63,Cos, {20,80,60,15,45,40,90,10,25,30,35,50,55}. i [__| methods. Z |__| {e) | explain Decision tree. Ht Seer Ose (d) | Write the procedure to Solve Traveling salesman problem using branch and o7 bound. ‘OR {e}_| Salve 8 queen problem for a feasible sequence (6.4,7,4), o7_ a)_| What is Binary Search Tree? Ca (5)_[ Explain Hashing. {702° 605,006 (c) | Explain the following search traversal techniques, 03 COG A. Breadth First Search C. Depth First Search shisaes a (a) | Construct a BST from the following set of Strings. C05,CO6 {MAR MAY, NOV, AUG,APR,JAN,DEC,JUL,FEB,JUN, OCT SEP}, Show the steps. See eePHE OR {e}_ | Construct AVL search tree for the following data key values 7 | C05,c06 RE REERoll No. B.E. EXAMINATION OCTOBER-NOVEMBER 2018 Subject Code: BCSL-610 Subject Title: Cloud Computing(GS) Time: 3 Hours Maximum Marks: 70 Minimum Passing Marks: 22 ‘Note: | 1. Answer all five questions. All questions carry equal marks: 2. Ineach question part a,b,c are compulsory and part d has internal choice. Out of which a & b (max 50 words ) carry 2 marks part ¢ (max 100 words } carry 3 marks and part d (max 400 words) carry 7 marks. Word limit would not be followed for (except) diagram, numerical, derivation ete. 3 All parts of each question are to be attempted at one place. 4._Assume suitable vatue for missing data, ffary. Question Question | Marks | Course Number ‘Outcome mapped QI (a) Write a short note on “computing on demand” 02 Cor (b) What is self service provisioning? 02 foi (c) What are the design challenges in cloud architecture? 03 €01,CO2 (@) Enlist and explain three service models and four deployment models | 07 CO1,CO2Z of cloud computing. OR (e) Explain the NIST cloud ‘computing reference architecture. 07 CO1,CO2 Q2 (a) Explain benefits of virtualization? 02 co3 (b) List the available various tools. of virtualization. 02 C04 (©) How to implement data centre virtualization in a cloud? [Cor (d) What is the difference between process virtual machines, host VMMs | 07 C03,CO4 and native VMMs? OR (©) Explain different types of hypervisor with example. | ‘€03,CO4 a (a) List the design challenges of cloud 02 [Cor (b) What is the role of global exchange of cloud resources In ‘cloud COD | | resource management? i [7 Dist erin dnd sage one he ear(@ Define the term of “virtual desktop inivastructure™, How to aohiove 07 scalability in cloud environment? OR (e)Explain layered cloud architecture development using suitable | 07 C02,CO3 example. loa (a) Write short notes on hadoop. 2 [cos (b) Define Google app engine shortly. inl 02 COS Ha (©) Discuss third party cloud services in detail. 03 Coa (d) Describe the Aneka integration of public and private cloud. 07 CO4,COS iH OR (©) Explain twister and iierative map reduce function for distributed [07 | CO4COS programming paradigm. € | 5 (a) Write short notes on software as a service seourity. coe (6) How to manage access control in cloud? 02 coe (c) Write various types of risk and challenges in security implementation | 03 C06 in cloud. (d) Explain cloud computing security architecture. 7 ‘CO2,C06 OR (e) Discuss various cloud ‘computing security services and virtualization | 07 C03,CO6 security management, ¢Roll No. IMl YEAR BE EXAMINATION Nov. — Dec. 2018 SUBJECT CODE: S/AT-SO1USYM1 SUBJECT TITLE: DISCRETE STRUCTURES Maximum Marks: 70 ‘Minimum Passing Marks: 22 7, Answer all five questions, In each question part a, b,c is compulsory and has internal choice. Out of which and part d (Max. 400 words ) carry 7 marks. Word limit would not be followed for (except) diagram, numerical, derivation ete 3. All parts of each question are to be attempted at one place. 4,_Assume suitable value for missing data ifm part a & b (Max. 50 words ) cary 2 marks, part ¢ (Max. 100 words ) carry 3 marks | ‘Question Ma | CO’s No. rks 1_[{@)__| Explain principles of inclusion and exclusfon for two sets. om (b) Distinguish between relation and Binary relation, explain with example. 02 (2 (©) _| Prove that relation R on the set of all integers defined by the relation: 3 [3&4 (,y) € Ree x-y isdivisible bym , is an equivalence relation. (@ _| Forany three sets A, B and C Prove that: 07 [3 Ax(BAC) = (Ax BY (AxC) OR © _ Apply principle of mathematical Induction method to prove that, the sum of the [07 [4 ‘cubes of three successive natural numbers is divisible by 9. 2 | @) | Explain valid and fallacy argument with example. 02 [1&2 (b). ‘Explain predicates and quantifiers with suitable example. 02 | 1&2 (6) _ | Construct conjunctive normal form of the following proposition: 3 {3 (PAGAN) ACP > Cann). @ | Explain WEF with example, Also construct the truth table for the following | 07 2 proposition: p> (gar) v(=paq) OR (© _ | Is following propositions logically equivalence? 7 {2 P>(qvr) and (p> q)v(p>r) 3 | @) _ | Define planner graph and write an example. @ [2 (©) _ | Define Buler path and Hamiltonian path. 02 (2 © _ | Explain Adjacency and Incidence matrix of graph with example. 0 [a2 (| Apply Dijkstra’s algorithm find the shortest path from a to z in the following | 07 | 3&4 weighted graph:% 14 t OR (@) ‘Determine minimal spanning tree of the followii 3&4 Kruskal’s algorithm: A (@) | What do you understand by generating function? 02 [i (@) __| Construct generating finction of following numeric function, if @ |3 B, Osrs4 4, 3%, 25 (©) | Determine numeric function of following generating function: B/S A@)=-— Sere @ | Solve: a, — 7; given ay =2, a, = 07 [5 OR © | Solve: a, -5a,_, +6a, 5 722. With ay =1, a,=1. 07 | 5 @__| Define group and abelian group with example. 02 | 1&2. (b) ‘Write an example which is a ring but nota field. 02 (©) | Prove that the set integers Z is an abelian group for the operation * defined by | 03 [3&4 a*b=atb-l, forall a beZ ‘@_| State and prove Lagrange’s theorem fora finite group. wa OR © _ | Prove that the set of real numbers of the form a+5V2, where a and 6 are | 07 | 384 integers with respect addition and multiplication forms a commutative ring, Is it afield ? fiiRoll No. BE EXAMINATION OCTOBER-NOVEMBER 2018 Subject Code:BCSL/BITL-502 Subject Title: Networking With TCP/IP (GS) Time: 3 Hours Maximum Marks: 70 Minimum Passing Marks:22 Note: 1. Answer all fve questions. All questions carry equal marks. | 2 ih each question part asc are compulsory and part d has internal choice. Out of which a & b | Mr cant) carey 2 marks parte ina 100 words) carey 3 marks and punt dimes 40 | words) carry 7 marks. Word timit would not be followed for (except) diagram, numerical, | derivation ete, ' 3. All parts of each question are to be attempted at one place. | 4. Assume suitable value for missing data, if any: I Question Question ‘Marks [Course | | Number Outcome mapped ai (@)Define cell relay shorily ® | or (b) Classify the services offered by BISDN? Teor (©) Define throughput and latency for a given network Explain the term | 03 COI ‘delay bandwidth product’ (4) Explain the three planes of B-ISDN reference protocol model and also] 07 | CO1,CO2_| | explain the various ATM cell types? | OR ] (©) write short notes on following O71 C01,cO2 1. WLAN 2, SONET and SDH 3. ARPANET Q2 (a) Why ARP and RARP protocol needed? 02 ‘COR (b) Write short notes on CIDR. 02, C03 (©) Find the class, the block and range of address for the network address [03] CO} | | 220.34.76.0. t (4) Explain the architecture of @ TEP /P protocol suite. Draw IP packet | 07 | GOLCOT format and explain its various components. | OR (¢) What are different goals of routing algorithms in a packet switched | 07 C02,C03 network? How will you classify the routing algorithms? { [93 [tay What is Significant of TCP part number? Freee f(b) Draw the state transition diagram for TCP connection termination, 02 @ Explain how TCP is used to add connection-oriented reliable feature to | 03 I the service of IP? | (@) Compare the TCP header and UDP header. List the field in the TCP | 07 cO4, COS header that is missing from UDP header. Give the reason for their absence I ee oe | | | (e) Explain TCP flow and error control using suitable example. [07 C04, COS | L | or (@ Write the difference between FTP and TFTP. a | cos (b) What are the modes of operation in TELNET? a 2 C05 (c) Define recursive and iterative resolution in DNS using suitable example. | 03 cos | (d) List and explain of QOS and traffic parameter used in ATM Network. 0o7 cos OR is | ¢ (Describe the mapping of ATM service classes to QOS classes and AAL [07 | COS protocol. | Qs (a) List the field of response massage of HTTP. 02 | cos (b) Write short notes on network virtual terminal. I 02 cos (6) Write the flow of SMTP commands between client and MTA | 03 cos | “@ Explain various ways for achieving IP Security? Describe authentication | 07 C06 header mode of IP security with suitable diagram. OR : coSCSY © Discuss various type of firewall, Explain commonly used security | 07 mechanisms for email and internet security,: 3" Year BE. Examination October-November 2018 a SUBJECT CODE CSL-502/ITL-S02/SY51 SUBJECT TIT! Database Management System (GS & NGS) Time: 3 Hours Maximum marks: 70 Minimum Passing marks: 22 Note: T. Answer all five questions, All questions carry equal marks, 2. In each question part a,b,c are compulsory and part d has intemal choice. Out of which part a carry 2 marks, part b carry 2 marks, part ¢ carry 3 marks and part d carry 7 marks. 3. All parts of each question are to be attempted at one place. 4. Assume suitable value for missing data, if any Question Marks | Cowse No, Outcome Mapped e Unit-1 1. [@_| Give an example of termary relationship by drawing an E-R diagram. [2 (©)_| Why does DBMS require a concurrency control module? 2 (©)_| Describe the phases of database modeling, 3 @ | Explain the differences between external view, intemal view and 7 conceptual view in three tier database architecture, OR (©)_[ Draw and explain with diagram the DBMS architecture? 7 - Unit-2 2 [(@) | Describe constraints related to primary key and foreign key. 2 (b)__| List the operations of relation algebra and the murpose of each. 2 (© _|Discuss types of outer join with suitable example. 3 (@ | Compare Weak Entity set & Strong Entity set. Also discuss dangling | 7 tuples with suitable example? ¥ OR. © _| Consider the relation Schema RI given ,Find out the relational algebra [7 of the following queries: Employee(employee name, street, city) Work(employee_ name , Company_name, salary) Company(Company name, city), Manages(employee name, manager_name) a, Find the name of employees working for Infosys. b. Find the names and cities of residence of employees working for TCS. c. Find the names, Street and cities of residence of employees working for Infosys and earning more cian 20,000. d. Find the name of employees working in the same city where : they live. go e. Find the name of employees who are not working for WIPRO .Unit-3 aa ies [__b. Multimedia databases (a) | How are aliases used in SQL queries? What is the purpose of usingan | 2 alias? (b)_| What aggregate functions are available in SQL? 2 (c) | How does tuple-oriented relational calculus differ from domain-oriented | 3 relational calculus? (@_| Let the following relation schemas be given: R=(A,B,C) S-D,EF) [7 Let relation 1(R) and s(S) be given, Give an expression in SQL that is equivalent to each of the following queries. , a alr) be Spatrlt) c.rxs OR. (e) | Consider the following two table(R and S) from a DBMS: 7 A|D IE A [B |C 10 fb [6 10 [a_|5 ale 13 is|b [8 tole Ts 25 ja |6 al? R Ss Give the result of join of these two table. a Unit-4 (@)_| What are the ACID properties of transaction? 2 (b)_| What are major causes for database failures? 2 (e) | Discuss the working of wait and die and wound —wait transactions. 3 (@)_ | Cet R be a relation :R=(A, B.C, D, E, F) having the functional 7 dependencies: a ADBC b. BOE c. CD EF d. ECF Find the closure of { A, B} over the given set of FDs. OR (e) | Suppose that we decompose the schema, R= (A, B, C, D, E) into (A, B, | 7 C) and (A, D, E). show that this decomposition is a lose less decomposition, if the following set F of FDs hold- a, ADBC . CDE b. BD d. BOA 1 Unit-5 T@ | List name of some large Indian websites that collect huge amount of — | 2 information. (b) _| Discuss some characteristics of Distributed databases? 2 (c)_| What is object orienicd daia’vase? Explain object behavior. 3 (@_[ Draw the architecture of RDBMS and explain each component briefly. [7 OR © _| Explain the following with example: 7 a, Digital libraryRol No ill YEAR B.E. EXAMINATION OCT-NOV 2018 BCSLIBITL-S04/CSLTL-S03/SY54/5Y41 : Microprocessor & Interfacing Tine: 3 Hours Maxum Marks: 70 icin Passing Mark: 22 Note: | Aisweral ve queda Al genoa any Sp a 2 meashquetion pats, care compulry dpa has nec hoe, Oat of which par a &b (Max. wrk) cay 2 mar, pat © (tax 109 word) coe 3 warts nd pared (Ma. 400 words) cay 7 make, Wont hint woot be flowed for excep dagray, 3, Allan ceach questa are tote seme tone plae 4 Resume subi wae forming at ay. 5,_ PLEASE MENTION IF ANY (015 CODD, i) DATA TABLES ETC. ARE PERMITTED IN THE EXAM Quesign [Maris | co 1. [fa | Befine immediate addressing modes 8086 witli example. 2 [i34 (b) | Write the purpose of maximum mode of 60867 a2 [13.45 (© _| What do you mean by CISC processor? os [a4 (@) | Whatis flag? List its types. What is the structure of flag register? Explain | 07 [12345 each flag with an example. OR (©) | What is segment memory? State the advantages of segmentation with | 07 [13 reference to 8086 microprocessor. Also, explain the default segment assignments. 2. | (@) | What is use of 8155 chip? 02/1235 (b) [Explain BSR mode of operation of 8255. 2 [1235 (Q) [What do you mean by 8212 chip? 03 [1235 (@ [Explain with diagram the interfacing of stepper motor to a| 07 [1,235 4. |:microprocessor 8086. cena = — OR (@)_| Explain the major components of keyboard/display interface chip. oF 3. | (@) [What do you mean by programmable interval timer? 02 (b) | What do you mean by mode 2 of 82537 2 (Q_| What do you mean by terminal count register? 03 (@) | An 8086 is to generate a square wave of frequency 2.5 KHz froma 2MHz| 07 clock connected to counter-1 of an 8254. Assuming suitable port addresses write the assembly language program, OR (@)_| Draw and discuss the architecture of 8259A, 07 [235 4. | (@) | What do you mean by asynchronous data transmission? 02 [235 (b) | Whatis use of modem? 02 [235 (© _| Write the name of various bus standards, 03 [2,35 (@) | Draw the pin diagram of 8251 and explain each pin of 8251. o7 [235 OR (©) | What is the function of status word format of 8251 USART? Also explain | 07 [2,35 the command word format of 8251. 5. | (@)_| Write difference between microprocessor and micro controller. | 02] 25 T{b) | Discuss the advantages of microcontrolled based system over) 02 | 2,5 microprocessor based system. | I (@_| Write operational features of 8051. (os [2s| | ](@) [Show the signals at 6051 pins. Explain meaning of each signal. Aiso,| 07 [2,5 | | { Pindicate when a signal is input and when output, What are the signals | multiplexed at the port PO? | OR (@) _| Write addressing modes of 8051 microcontroller with suitable examples. | 07 | 2.5 € 7Roll No... UfYear B.E. EXAMINATION OCTOBER- NOVEMBER 2018 SUBJECT CODE: BCSL 503/BITL 503 SUBJECT:Software Engineering (GS) ‘Time: 3 Hours Maximum marks: 70 Minimum Passing marks:22 Note: 7. Answer ail five questions. All questions carry equal marks. 2. In each question part a,b,c are compulsory and part d has internal choice. Out of which part acatry 2 marks, part b carry 2 marks, part ¢ earry 3 marks and part d carry 7 marks. 3, All paris of each question are to be attempted at one place. L 4. Assume suitable value for missing data, if any Question Marks | Course No. Outcome ~ Mapped _ Unltd 1 (a) | Ilustrate the concept of Software Process Model. 2 \ (b)_| What is aim of software engineering? 2 r (©) | What is the role of user participation in the selection of a life cycle | 3 model? peel (®" | Discuss the prototyping model. What is the effect of designing -a| 7" i prototype on the overall cost of the project? > Ss | OR, (© | Describe the Rapid Application Development (RAD) Model. Discuss |7 UES each phase in detail. = Uake2 2 (a)_| Define unknown and undreamt Requirements. 2 { (b) | What are the purposes of Data Flow diagrams, Entity-Relationship 2 diagrams? 7 (©)_| What is the difference between SRS document and design document? [3 VS (a) | Describe facilitated application specification technique (FAST) and | 7 4 compare this with brainstorming sessions. OR (| What do you understand with the term “requirements elicitation"? 7 2S Discuss any two techniques in detail. Unit3 3 (a) | What do you understand by common _ ‘coupling? 2 L (b)_| Write name of best type of coupling in modules and define it. 2 Cl (©)_| What is the difference between a flow chart and a structure chart? 3 bs | (a) | Discuss the differences between object oriented and fimetion oriented | 7 4 |_| design. OR @ | lf some existing modules are to be re-used in building a new system, [7 12 which design strategy is used and why?ROH Nous boundary value analysis techniques. Unit (@) | Complete this statements “COCOMO-II estimation model is based on TD 1 (b) "| What is the Objective of the Project Planning Process? 2 Pi (©) _| What is McCall’s quality model? 3 ze (@) | A project size of 200 KLOC is to be developed, Software development | 7 He team has average experience on similar type of projects. The project S schedule is not very tight. Calculate the effort, development time, average staff size and productivity of the project. OR (©) | How function Point Estimation can be done for Software size? Desonbe 7 4 step by step using an example. Units (a) "| What do you undersiand by Acceptance Testing? 2 7 (b)_| List the phases of STLC. 2 C: (©) | Defined the following terms: 3 3: ( fault (i) failure (ii) bug. | Gv) mistake (@_| Explore the concept of V-Model, 7 oe - OR (©) [Describe ‘the equivalence class testing method. Compare this with]7 3Timer 3 Hours Maximum Warks:70 ‘inimum Passing Mark: 22 ROINO esse Hil YEAR B.E. EXAMINATION OCT-NOV 2018 BCSL/BITL-505/CSL-S04/5Y53; Theory of Computation (CBCS) Note: “Ramer fe qostioas A gatas any Spal mal Incach ueion pa, are compulory ae par dls mere choice Ow of wich pata b(Mae 50 wera cry 2 tsp ia 109 weeds) ‘any Sanat (i. 40 or) xy T mash Word int wa ate elon fr excep) aga newteah deere ‘Ass ibe yl fr ising dt ary Tr 3, AltPuns etext questo eto be tempted oe place £ LEASE MENTION IF ANY ) 13. CODE.) DATA TABLES ETC_ ARE PERMMTTED Ih THE EXAM, Question Marks | CO No. 1. [@_| Define automaton, oT (b)_| Why are switching circuits called as finite state systems? 212 (©) _| Design FA which checks whether the urinary number is divisible by 4. 034.2 (@ | Convert the following Mealy machine to an equivalent Moore machine by the | 07] 1.2 tabular format. PO Present State (ert Sute [OP Newt Siate OP —>Q0 [Qo Ql i Or Te co Jeeeaaaad CEEES QjQr in Q et Te 8. fo [Qo i 1 OR (©)_| Construct DFA for the following languay 7 | 12 L(M) = {W £40, 1)* | W has neither ‘00° nor ‘11’ as a substring} 2. T@) | Differentiate C"and L*. 02 3 ©) | Construct a R-E for the language which accepts all strings with atleast two es | 02} 3 over the set 2={0,b} © _| What are the applications of pumping lemma? ers @ | Minimize the Finite automation given below 7 | 12 | = OR ea (© _| Consider the FA and construct regular expressions that are accepted by ik o7 [423(a)__| What is derivation, parse tree and sub tree? @ | 4 (©) | Construct a regular grammar for given FA. 2 | i24 1 1 ©) [Find CFG with no useless symbols equivalent to: ala SAB|[CA BBC |AB Ava C—aB |b @ |S 3adSia a7 [4 ASDAISS/ba Find out LMD, RMD, and parse tree for string aabbaa, ‘OR © | Construct the context free grammar equivalent to a regular expression o7 | 34 (00+1)*(00+11), (a) | Define Instantaneous description (ID) in PDA. [3 (b)_[ State the equivalence of acceptance by final state and empty stack. 02 [5 (©) | Construct PDA for the following grammar. B45 s+ 0s Sis SHE (@) | Construct a two-stack PDA for the language L= {a°b"<", nS0) 7 |S OR (©) | Construct a PDA for L= {0°1""jn>=0} and process the string aaabbbbbb for 7 ls this PDA. (@)_| What are the applications of TM? Gece | 6 (b)_[ What are the special features of TM? 2 [6 (©)_ | What are the possibilities of a TM when processing an input string? | 6 (© | Design a TM for checking whether a given set of parentheses is well formed 7 | 6 OR (©)_| Construct the TM that recognizes the language L={O FY, 7 _|_6Roll No. ......, OT YEAR BE/B.Tech. EXAMINATION Nov. — Dee. 2018 SUBJECT CODE: BCSL/BITL-401/CS/{T-401/4¥M1 SUBJECT TITLE: DISCRETE STRUCTURES ‘Time: 3 Hours Maximum Marks: 70 Minimum Passing Marks: 22 Note: | 1. Ansverall ive quislons (except) diagram, numerical, derivation etc All parts of each question are to be attempted at one place 4. Assume suitable value for missing data, if any. 2. Imeach question part a bc is compulsory and bas intemal choice. Out of which arr a & b (Max. 50 words ) carry 2 marks, part c (Max. 100 words ) cay 3 marks and part d (Max. 400 words ) carry 7 marks. Word limit would not be followed fee ‘Question Ma | CO’s No. rks 1 [(@) | Define Power set and Proper subset @ |i (©) | Whats the difference between function and relation, explain with example? G13 (©) | Let be a binary relation on the set of positive integers such That 03 [3&4 R= { (a,b):a~b ts an odd positive imeger}. Is R an equivalence relation? @ "| For any three sets A, Band C Prove that: 713 Ax(BOC)= (Ax B)A(AxC) OR (©) | Apply principle of mathematical Induction method to prove that, n?—n is | 07 [4 divisible by 3, whenever n is a positive integer. 2 |{(@) | Define tautology, contradiction and contingency with example. 2 | aa (b) | Explain predicates and quantifiers with sutabie example. 02 1az (©) | Transform the following into conjunctive normal form: 03 73 (p> gr (@® | Explain predicates and quantifiers with example, Also iF 72 P(x): x is student; Q(x): x is clever; R(x): x is successfull Express the following using quantifiers- (There exist a student Some students are clever (iii) __Some students are not successful. OR © Is following propositions logically equivalence? 07 fz P>(qvr) and (p> g)v(p>r) J 3 | (@) | Define simpler graph, multi graph and pseudo graph wih an example @)2 ©) [Discuss tree and spanning 2 2 (©) | Explain Adjaceney and Incidence matrix of graph with example @ [Taz[| Apply Dijkstra’s algorithm find the shortest path fom @ to 2 in the following | 07 [3&4 weighted graph: OR (¢) [Determine minimal spanning tee of the following weighted graph To apply] 07 | 3 &a Kruskal’s algorithm: (a) | What do you understand by Discrete numerie function? i (©) | Construct generating fimuction of following numerio function, if 02 73) (2, O eo |r fons |eafee 07| _OR | | (e) [Show how wait ( } and signal ( ) semaphores operation could be| 07 implemented in multiprocessor environment using the Test and Set ( ) instruction, The solution should exhibit minimal busy waiting. Develop pseudo code for implementing the operation, 3. | (a) [Define external fragmentation. What are the causes for external | 02 fragmentation? (b)_[Whatis compaction? —_ 02 (© | Memory partitions of 100ib,500 kb,200 kkb,300kb,600 kb are available how | 03 would best ,worst, first fit algorithm to place processes 212,417,112,426 in order. Which is the best algorithm? | | (@) | With a neat sketch explain how logical address is translated into physical | 07 address using paging mechanism. OR (©) | Why segmentation and paging sometimes are combine into one scheme? | 07 Explain theme in detail with example. 4. | (a) | Explain Trusted system? 02. () | What is the advantage of demand paging? 02 (c)_| Discuss various security threats in file system of OS? 03 (a) | Consider the following reference string 07 7012304230321201701 | For a memory with three (03) frames. How many page Faults occur for LRU and FIFO page replacement algorithms? Which is efficient among both? OR (e) | Whatis the cause of thrashing? How does the system detect thrashing? Ones | 07 | it detect thrashing, what can the system do to eliminate this problem? 5. | (a)_| Explain the indexed and linked file allocation methods, 02 (b)_| How to provide protection to a file system? 02 (©) [What are directories? List different types of directory structures with | 03 examples. = (d) [Let a disk drive has 5000 cylinders from 0 to 4999, Currently drive is at | 07 148rd cylinder, and the previous request was at cylinder 125. Queue of | pending request in FIFO order 186, 1470, 913, 1774, 948, 1509, 1022, 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 ifi)LOOK OR (@) | What is distributed system? How we do parallel processing in distributed | 07 | system explain with the help ofan example.Roll No. B. E, Examination, Nov-Dec 2018 Database Management System (BCSL-403/BITL-403) ‘Time: 3 hours Maximum Marks: 70/60 Minimum Marks: 22/19 Note: | 1. Answered ail five questions. Carry equal marks. 1 | 2.1m each unit part a, b, ¢ are-compulsory and d part will have an internal Choice. Out of which part a & b (Max. 50 words) carry 2 marks, part ¢ (Max. 100 words) carry 3 marks and part d (Max. 400 words) carry 7 marks, 3. All parts of each question are to be attempted at one place. 4, Assume suitable value for missing data, if any. Que. No, MM [CO's 1__|(@)_[ DBMS Vs. traditional file approach? 2 [43 (b)__| Functions of DBA. oT. (c)__| Distinguish between physical and logical data independence? See (@__[ Construct an ER diagram for bank transzetions. T [2a OR (@_| Describe Data Models and its application? 7 [ia 2 [ (a) | How Natural ~Join operation is performed? 2 {15 (b)_| List the operations in relational algebra, 2 [245 (e) [Define Query language. Give the classification of query 3 135 language. @_[R(A,B)andS (A, ©) are two relations. Give relational algebra [7 | 14 expression for the following domain calculus expressions? i) { € rAb=17)} ii) {] €rA, Es} ‘OR (© _ | Write expression for Modification in relational algebra DB using |7 [4 operations. 1. Deletion 2. Insertion 3, Updation 3__|G@) | Explain various aggregate functions in SQL. 2 5 ()__ [DDI and DML command with example? 2 (5 (©) _| Differentiate between tuple oriented & domain oriented 3 i relational calculus. @_| Write down the Advantage of SQL? 7_|3 ‘OR [(©_| Definition of QUEL and QBE Data storage. 7 16 4_{(a) [Explain INF, 2NF, 3NF with suitable example? z 215 ~_[4o) [What is fimesionel dependensy? re reece 2 (5 (©)__[ Problems with dangling tuple and null values? 3 [6 (@) | Give details of data fragmentation, replication, and concurrency in [7 | 6 distributed database. OR © _| Find out the given problem is lossy or loss Tess join Te } | R(A,B.C,D.E) and PD's ate (ABC }, (CD), (BSB) | i j | | |(a) | What is a transaction? 273 (b)__| What is ACID Properties? 2113 (c) | What are all the transaction state? 3_ 2B (@_| Describe about the testing of serializability. 7 [6 OR © __| Compare OODBMS with ORDBMS. 716 oRoll No, i YEAR, IV SEMESTER BE/B.TECH EXAMINATION Oct-NOV2018 CSL /TTL-403/4Y42 , Digital Circuits and Systems (CS/IT) Tima 3 Hows Maximum Mesks: 70 Minimum Poss Marks: 22 pote) [Kamae aif gestions Ai quan cayeqwalmaiks. neach question part a,b care compulsory and port d as Internat choice. Out of which part @ & 1 thtan, 50 words) carty 2 marks, port ¢ (Max. 100 words) corry 3 morks and part d (Mx. 400 | | vaceds) corty, 7 marks, Word timit would not be followed for fexcept) diagrom, numerical, | erivation ete. 3. All Ports of each question are to be attempted at one place. | |i. inte sabe ln forms ot en [austen In | Marks | Course outcome L | mapped, @ | cor oz | cor Jo. | | | | | | | | { 1. [1a)_ Specify the need of look ahead carry generator? PTT (by [Reduce the given function using Boolean algebra: AB+A'C+BC=AB+A’C. ain in brief Half Adder and Full Adder 03 | Cor plify the Boolean function given below using K map and) 07 col ' implement the minimized function using NAND gates. { F(W.XY,Z) = E (13,711,154 (0,2,5) NE eee ane (eee Cree | OR “Tey | Simplify the following Boolean Function by using Tabulation 07 | Col ‘Method ) : F(A.BC.D) = E (0,2,3,6,7.8.9,1013) (3a). [Give the applications of Monostable_ Multivibrator ? | CO2 coz T(e) | What should be the value of the timing capacitor required for an) 03 | CO2 Astable oscillator using 555 timer so that it delivers a clock KOhm and Re=3.SKohm? fimers and draw the| 07 | CO2 [- Toy [What do you understand by Bistable Multivibrator?, 02 | equency of 40 KHz when Ry=I n a Schmitt trigger circuit using OR | 07 | coz m_ | CO3 COs deta r slave J- K flip flop is needed? A ‘operation of D- flip flop. __ |e. (ey (What is the difference between sequential cirewit, and) 03° | CO3 | | Combinational circuit? _ _ | it Up Down Counter, ae Ting counter? Explain with tie help of a logic diagram. Ta 7(ay What do you understand by Demultiplexer? Why they are | | meeded? (hy) Why ECL, HTL and TPL togie? | t«) Differentiate between: i) fam in and fan out of a togie gate ii) __NMOS and PMOS Logie family aiins Design a cireuit to realize the following logical expression using 8:1 MUX for the given funetion:- F(A.B,C.D) = E (2,4,6,7,9,1 0,1 112,15) fe) | Draw a cireui 1 sed in a 16 bit D/A convertor .Also calculate pereent resolution, cy (1a [Write a detailed note on V-F converters? 07 [605 ; OR Explain Successive Approximation A/D converter in detai 07_ | COsRoll No .. HI YEAR BE, EXAMINATION OCT-NOY 2018 BITL 404/BCSL 404: COMPUTER NETWORKS, Time: 3 Hours Maximum Marks: 70 ‘inimum Passing Marks: 22 Note “raer al five quninns All quincy gal al Imcach gastos ae compu sl prt ster coe, ht of why 2b Mi, £0 wor) cany 2 pst M0 wor) any3 mura Mex 400 mods ey T mars Wer han wu tb lane freee Sgrm monroe te 3. -AlPuisoferctqseton we beatnped atone ace ‘sun slate sgt ay EMENFION IF ANY ()15 CODE.) OATA TABLES FIC, ARE PERMITTED IN THE EXAM i | | | | Marks | CO 1. | (@)_| What are the limitations of star topology? i 2 | 123 (6)__| Explain the two types of duplex? # 02 T (©) 7] What are header and trailers and how do they get added and removed? | 12 (@_| What is the purpose of the physical layer? Discuss various physical media for data) O07 1,2 transmission? C OR - 7 . | @_| What is TCPAP Model? Explain the functions and protocols of each layer? o7_| ia 2._[(@)_| Mention the types of errors and define the terms? | 12 (b)_| What is a butter? [12 | (©)__| What are the steps followed in checksum generator? 03 12 | _|@_| Explain CSMA/CD protocol in detail How it detects collision. (_o7_ [12 i OR L (©_| Whatis pure ALOWA and slotted ALOHA? Consider the delay of both at low load, a | ia Which one is less? Explain. @__| How can the routing be classified? = Le |i [| @) | What is multicasting? 02 | 13 (©)_| What are the services offered by network layer? _ 03 12 (@_| What is IP addressing? How itis classified? How is subnet addressing is performed? | 07 [1.3 OR | © | Consider the following network running the distance vector routing protocol. In the | 07} 1.2.3.4 diagram, vertices represent routers and edges (ares) represent links between routers. ‘The numerical annotation on the links represents link costs. Higher costs indicate worse I f Tinks C i. Show the routing table at node A when the distance vector routing algorithm | stabilizes ii, Suppose the link between node A and node E fails, show the routing table at node eo B when the distance vector algorithm stabilizes. Show all importent steps in your analysisof isk : oH @ is the de-multiplexing? ae 02 (©)_| Why TCP services are called Stream delivery services? 8 (@_ | Define UDP. Discuss the operations of UDP. Explain UDP checksum with one 07 example, OR (©)_| Explain the flow conirot and retransmission techniques used in TCP. | i2 5._|(@)_| What do you mean by TELNET? [12,56 | (b)_| State the purpose of SNMP. 02 [1,26 [| What is PGP? re 03 [1256 (@)_| Deseribe how SMTP and POPS transfers message from one host to another with OT 11.256 suitable Mustrasion, OR @_| Give a detailed note on DNS operation. o7_[ 136Roll No. HYEAR B.E, EXAMINATION OCTOBER - DECEMBER 2018 BCSL/BITL-405 : COMPUTER SYSTEM ORGANIZATION Time 3 Hours Maximum Marks : 70 Minimum Passing Marks :22 NOTE: 1. Answer all the five questions. all the questions carry equal marks. 2. Ineach question part a, b, ¢ are compulsory and pert d has internal choice. 3. All parts of each question are to be attempted at one place. 4. Assume suitable values for missing data, if any. ‘Question Marks no. 1. | (a) | differentiate between fixed point and floating paint operation. 02 {b) | Define assembler and its role. 02 (2) | Explain timing control signal of D5T, ; Sc-> 0. Using control tming signal diagram 03 (@ | frotan fowchar foriastdion oe o or (e) | Explain input output interrupt working. Using Suitable flowchart and example 7 2. | (a) | Write byte format and normalized form for both parker 02 0.175 N t94 (b) | what do you mean by EEPROM, Explain. o (c) | Explain about different types of Stack organizations oe (d) | Write @ program to evaluate the arithmetic statement 7 |. Using a general register with three address instruction |. Using a general register computer with two address instruction, Il Using one address instruction, 'V. Using stack organization of computer with zero addresses operation instruction, oF ‘a Interrupt? Differentiate between different interrupt that cause © break In the a: 7 ution of @ program. (@) | What are the different performance measures used to represent a Computer system's performance: 2| Eapa aoaa APS LOS ang oT pa 7 Tr Baan Soci malipion eS a Cr 7 OC 7 4, {a) | Hardwired control unit is faster than microprogrammed control unit. Justify this statement. 02 By | Wa apne ane a GR Ti Sein arte Tor Bois digo s {d) | Draw the general block diagram of a micro sequencer and also explain the inputs and outputs along o7 wh er fonetoning = Ter | Explain how X=(AvB)(A-B) is evaluated in a tack based computer F o7 SP ar ap arma HTT a ooo a a iy ean omen oe a Ta eis sen gna nage Naa agp TF Oa s Ty itera bereen SCRE a x {e) | Design register selection circuit to select one of the four ‘4-bit registers content on to bus. Give fuller o7 ogianaton errrRoll No Hf YEAR B.E. EXAMINATION OCT- NOV 2018 SUBJECT CODE: CSLITL-40S/4Y51 SUBJECT TITLE: Data Structures (GS&NGS) ‘Time 3 Hours Macimum Maris: 70 ‘Minimum Passing Marks: 22 [Note “Answer all ive questions All questions sary equal marks | 2, Incach question part. b. care compsory and pot das itera choice. Ou of which part a (Mas. 50 words) cary 2 ‘parks, prt (Max, 100 words) cary 3 marks and part d (MB. 400 words} cary 7 masks Nord limit would not be follosed for (excep) disram, numeral, derivation ete 3. sed atone pls ___|_4._Assume sable va for mg a Ha. - | Question | Marks | No, 7 Z | 1. | (@) | Whats string and itis represented in memory of computer? [02 |_| (b) | What is abstract data type and what is selfreferential structure? 02 (©) | Let we have a function as defined below: 03 Stringl (char *S) if (*SI=NULL) fete String1(S+1); String1(S+1); print("%c", #5); } } If*="123", find the output of function call and draw the recursion tree, (@) | Write an algorithm to find duplicate characters and number of occurrences | 07 of each character in linear array of char. OR (@) | How we represent a Lower triangular array in a one dimensional array? | 07 Write an algorithm to access rows and columns of Lower triangular array from a one dimensional array. 2. | (a) | What is double ended queue define it with an example. 02 (b) | The following sequence of operations is performed on a stack: 02 PUSH(10), PUSH(20}, POP, PUSH(10), PUSH(20), POP, POP, POP, PUSH(20), POP Show the sequence of values popped out. (c)_| Write an algorithm to reverse the elements of a single linked list. 03 (@) | Write an algorithm to add two polynomials, when the polynomials are | 07 represented using linked list OR (e) | Write an algorithm to evaluate post fix expression using stack. 07 3. | (a) | Whatis Binary search tree, define it with an example, oz (b) | Explain the collision in hashing : 02 (6) | Construct tree from given tree traversals 03 G@ Inorder = (4,8, 2, 5,1, 6,3, 7} Gi) inorder Prevorde {10,5,2.6,14,12,15i) Write an algorithm to delete a done from binary search tree, OR {e) | Create an AVL tree for the given elements: 50, 25, 10, 5, 7, 3, 30, 20,8, 15 Show the AVL trees after the deletion of: 10 and 20 below mentioned graph form node 1 using Dijkstra’s algorithm. (@)_| Explain the Asymptotic Notations. [02 (b) | Discuss the timing analysis of Quick sort algorithm. 02 (©) | If only the root node does not satisfy the heap property, what Is the | 03 complexity of the best algorithm to convert the complete binary tree into a heap? Give the reason. ae {¢) | Write the Radix sort algorithm and explain it with the help of an example, | 07 OR (e) | Write the Merge sort algorithm and explain it with the help ofan example | 07 (a) _| What are the differences between Kruskal's and Prim's algorithm? [02 (b) | What are the different presentations of graph and tell the advantages and | 02 disadvantages of them. a (©) | Write an algorithm for Depth first search where graph is stored using linked | 03 jist. (a) | Consider a complete undirected graph with vertex set (0, 1, 2, 3,4). Entry | 07 ij in the matrix W below is the weight of the edge {i, j}. Calculate the minimum possible weight of a spanning tree T in this graph such that vertex Oisa leaf node in the tree T? B14) 12.49) We Oo 7 3: : 7 02) ! 3 20) OR (@) | Explain the Dijkstra’s algorithms and find the shortest path for each node of [07Total Pages: 03, Roll No. If YEAR B.E. EXAMINATION, OCTOBER — NOVEMBER 2018 150301/BCSL/BITL-302 : Digital Electronics (CBCS/GS) Time : 3 Hours Maximum Marks : 70 Minimum Marks : 22 Notes J. Answer all five questions. All questions carry equell marks . 2. by each question part tare compulsory and part a has iaternal chiaice Out of which part a & b (Mas, 50 carry 2 marks, Parte fmax. 104 words) carry 3 marks and part d (Max. 400 words) carey ? marks. Word lint would not be followed Jor (except) diagram, numerical, derivation ete. 3. All parts of each question are fo be attenpied at one place. 4 Assume suitable value for Q mnissing data, if any. Marks. Course No outcome 1. @)_ What do you understand by ASCII code ? 2 cor (b) What do you understand by signed binary numbers? Discuss with 02 C02 suitable examples. (©) Design a circuit for obtaining 2's complements of a given 4 bit binary 03. cos number. (4) Discuss and design a circuit for converting Hexadecimal code (OtoF) 07 C06 to equivalent BCD code. OR (©) Discuss and design a circuit for converting BCD code (4 bit) to 07 ~~ CO6 equivalent Hexadecimal code. 2. (@) What is commutative law in Boolean algebra? Explain with suitable 02 COI example (&) What do you understand by maxterm and minterm ? 02 cos (©) Obtain the canonical sum of product form of the function 03 cos Y= ABYACD () Using the K-map method, simplify the following Boolean fumetion and obtain 07 C06 minimal SOP expression and also implement the minimal expression. Y= Yn (02,3, 6,7) + Fe(8, 10, 11, 15) OR |O) @) ) © @® @) (b) (©) @® © @ () © |A company has four directors, namely As B, C and D and their conesponding percentage of shares in the comp are 35, 30, 20 and 13 yeopectively. The Directors ate eligible t9 vote according to their percentage of shares (e.g: A cam cast 35 votes, B can cast 30 votes and pron ) in the board of directors meeting ‘and two third majority is required to pass any resolution. Design combinational circuit 0 snelicate whether a resolution is passed oF PO {What do you understand by combinational circuit? Give two examples Design the circuit for full adder. Discuss the applications of multiplexers. ‘What do you understand by Channel Selector ? Design and discuss the working of a channel selector having 8 channels (Assume width of each channel is 4). OR Discuss the following: (i) Parity Generator Gi) Controlled inverter ‘What do you understand by sequential clout? Give some examples. what do you understand by clock signals ?disouss its ignificance. Draw the circuit and truth table of edge triggered J K flip flop. Dravr the cireuit and truth table and timing diagram for 4 bit shift right register and also discuss its working in brief. OR Draw the circuit and truth table and timite diagram for 4 bit ripple ter and also discuss its working in brief “What do you understand by programmable Logie Array ? rite the name of any ovo ICs of TTL family along with their application. List the salient features of CMOS family. 03 07 07 02 3 07 07 02 03 06 cos C06 cos cos cos col co3 cO3 co3 co4 co4 co4© What do you understand by Error detection and Correction? Discuss 07. cos different methods of error detection. OR Discuss how read / write operations (with reference to memory) are 07. C06 performed. Also discuss the memory interconnection for expanding storing capacity. eR KOR OKRolf No. B.E. IL Semester Examination, Dec. 2018 EEL/CSL/YTL-302/3Y42- Electronics (EE/CS/IT) ‘Time : 3 Hours ‘Maximum Marks :70 ‘Minimum Pass Marks : 22 Note: | £ Answerallfive questions. Allquestions carry equal marks 2. In each question part a,b, c are compulsory and part d has intemal choice. Out of which port a & b (Max. 50 words) cargy 2 morks, part ¢ (Mos. 100 words) carry 3 marks and part d (Max. 400 words) comy 7 marks. Word ‘mit would not be followed for (except) diagram, numerical, derivation etc. 3. All Parts of each question are to be attempted at one place. 4 Assume suitable value for missing data, f ony: 55. PLEASE MENTION IF ANY IS CODE, DATA TABLES ETC, ARE PERMITTED IN THE EXAM, Question Marks | Course No. outcome 1. ]@) | Define breakdown voltage. a ® | in a Common Emitter transistor circuit if B = 100 and Is = SOWA,| 02 compute the values of a, Ie and Ic. (©)_| Draw the structure of JFET and discuss its working. 03 (@ | Derive the expressions for voltage gain, current gain, input impedance | 07 and output admittance for a BJT Amplifier in CE configuration using low frequency h-parameter model. OR (©) | Discuss the formation of channel in Enhancement mode of MOSFET | 07, emphasizing the role of inversion layer. 2. |(@ [State Barkhausen Criterion for oscillation. Explain the principle of | 02 operation of oseillator. (b)_| What are the different types of feedback topologies? 02, (©) [A voltage series negative feedback amplifier has a voltage gain] 03 without feedback of A = 500, input resistance Ri = 3k@, output resistance Ro = 20kQ and feedback ratio = 0.01. Calculate the voltage gain Az, input resistance Rig, and output resistance Ror of the amplifier with feedback. @ | Draw the circuit diagram of Wien Bridge Oscillator and determine ts | 07 frequency of oscillation. OR (©) | With the help of neat diagram explain the working ofa push pull class | 07 B amplifier. 3. | (a) | Define common mode rejection ratio (CMRR). Give its significance [| 02 in device performance. @_| Explain the working of positive clamping cireuit oD (© | For a sinusoidal input voltage of 10 volts and ideal diode, find the | 03 output waveform of a simple positive level diode clipper using resistor R in the series arm and shunt arm consisting of reference voltage of 4 volts in series with diode D as shown in fig.1.[© J Draw the diagram of astable multivibrator (ransistorized) and explain | 07 |__| its working. | Be OR (e) | A bipolar differential amplifier with =0.5mA utilizes transistors for} 07 which V=10V and B=100 and Rc=10kQ. (a) the differential gain (b) ‘the common mode gain and the CMRR if the bias current I is generated using a simple current mirror. ot @)_| Explain the characteristics of an Ideal Op-Amp. 02 (b) | Draw op-amp based cireuit for following operation: 02 (Vit VotV3y3 Also state the value of input resistor if Ry ()_| Explain how Op-Amp can be used as Integrator, 03 (d) | With the help of diagram explain the function ‘of each pin of 555} 07 timer IC and also explain its applications. ‘OR (e) | Explain the working of Schmitt trigger in inverting mode. Draw its| 07 hysteresis curve. | (@ | bist out the different tum on methods of a SCR. Explain about | 02 temperature triggering, (b)_| Define chopper. List the different types of choppers. {02 (c) | How the freewheeling diode effects the performance of single phase 03 half wave converters? (@)_| Explain the construction and working of an SCR. 07 } OR (e)_| Explain the dynamic. characteristics of power IGBT. Eee nwTotal page: 02 Roll No. 2°¢ YEAR B.E. EXAMINATION OCTOBER- NOVEMBER 2018 Tima :3 Hours CSL 303/ 3¥44: Network Analysis & Synthesis Wasiomam Marks 70 Winimum Pass Marks 72 Note : LAnswer all five questions. Allquestions carry equal morks 2. Ineach question part o , care compulsory and partd has internal cholce. Out of which part a & b (Max. 50 words) corry 2 marks, part (Max. 100 words) cary 3 marks and part d (Max. 400 words) carry 7 marks. Word limit would not be followed for (except) clagram, numerical, derivation ee. 3. AllPrsof eoch question are tobe cttempted atone place. 44_Assue sultoble oie for ising det, any | ‘Question ae | Coe No. ee 1._| (a) _| Define coefficient of coupling for coupled circuits. 02 | cor} (b)_ | What are independent sources? 02 | cor | (e)_ [What are lumped circuit elements? 03 | cor (d) | in the given circuit the voltage across the capacitor, V. =5— 2e~**. Find the | 07 | CO1 voltage across the inductor. | Vs OR (e) | Drive the relation between Mutual inductance and coefficient of coupling for| 07 | CO1 coupled circuits. 2._| (a)_| Write the properties of a tree in a graph. 02 | coz (b)_| Give the statement of Norton theorem. 02 | coz (d._| Write the statement of Maximum power tansfer theorem for DC network. 03 | C03 (¢) | Find the power loss in the 3 Q resistor by thevenin theorem. 07 | coz ©) e lov ® 32 be OR (e) | Find the current through 6 0 resistor by superposition theorem. 07 | coz S ae Vee ee 5v@ © 6x 22! 3._|(a)_| What is steady state response? 02 [cos | () | Define zero state response. 02 | Con (6)_| Explain the initial condition and final eeeEnt in capacitor. 03 | CO4 (| irswiteh is closed at t=0 and then find #€0 +),2@ a ees) a7 [con | ve “sD iF se ORC (2) | Find 1(0 +) if switch is closed at t=0 and steady state is reached with switch is] 07 | Coa open. Draw circuit at t30+ con | 2m an lov Lean 4._| (a)_| Write the convolution theorem of laplace transform. 02_| cos {b)_| Write the initial value theorem of laplace transform. 02_| cos (0)_| Find the laplace transform of fit) = cos°t. 03} COS (d) | A voltage pulse of 10V magnitude and 5 msec duration is applied to the RC} 07 | COS Network shown in figure. Find the current. vi to af tron ee v oriites OR (e] | Determine the laplace transform of triangular waveform shown in figure. 07 cos itp aed a | + | oO Va Tv 5. | (a)_| Define Driving point impedance. 02 cos (b)_| Define transfer admittance. 02_| coe {c}__| Define poles and zeroes with respect to network function. 03 [cos | {a | Find ABCD parameters fr the cut shownin Figure in a7 | cos | oR {e) | Determine the Y parameters of the network shown in Figure. 07 | COB Lu 2a ae 5a ee KRRall No 2" YEAR B.E. EXAMINATION OCTOBER- NOVEMBER 2018 SUBJECT CODE: 150304/160304/BCSL/BITL 303/CSLATL 303/3Y51 SUBJECT TITLE: OBJECT ORLENTED PROGRAMMING AND METHODOLOGY (CBCS/GSINGS) ‘Time: 3 Hours Maximum Marks: 70 Minimum Passing Marks: 22 Notes | 1 Answer all five questions. All questions carey equal mari. 2. Im each question part a, b,c are compulsory and part d has internal choice, Out of which part a & b (Max. $0 words) carry 2 marks, part ¢ (Max. 100 words) carry 3 marks and part d (Max. 400 words) carry 7 marks. Word limit would not be followed for (except) diagram, numerical, derivation ete. 3. All parts of each question are to be attempted at one place. 4, Assume suitable value for missing data, if any. ‘Question Marks | Course No. Outcome Mapped 1._[(@)_| What do you mean by Data abstraction? a 12 (b)_| What is significance of scope resolution operator? 02 1 (©) [Explain call by value and call by reference parameter | 03 34 passing mechanism with suitable example. @ | Define Object-oriented programming and Explain feature of | 07 | 1.26 Object oriented programming. How it is different than procedure oriented programming OR _ © | Explain the concept of Dynamic Memory Allocation. WAP | 07 34,5 to find Maximum number among entered 10 numbers using | dynamic array. | 2. | (@)_| Define static data member and static member function. 2 12 (b) | “If we have a function having n arguments, then is it) 02 3 possible to call this function using less then n arguments ©. Explain with suitable example. © | What are Constructor and Destructor? Explain Dynamic | 03 | 1,25 Constructor with suitable example, @ | Write a Program to declare friend fimetion in two classes. 07 | 12,5 Calculate the sum of integers of both the classes using friend sum () function, OR © | Create a class DISTANCE. Create D1, D2 and D3 as objects | 07 | 1,2,6 of DISTANCE. Write a C+ program to read the distance | | Di and D2 in the form as kms and mts where kms indicates kilometers and mts indicates meters. Assume both kms and mts to be integer only. Add then and store result in DISTANCE D3. Finally print the value of DISTANCE D3. 3._|(@)_| Define Function overloading. a a 2 (b)_| List of operator which can not be overloaded. a i (©)_| Write the rules for the operator overloading. 03 | 33 ({d) | Write a program to overload ++ (increment) - - (decrement) 07 23,5 operator using member function of'a class.OR inheritance, ive proper suitable example, (e) | What is conversion function? How is # created? Witte al 07 | 230 program to convert user define data type to a built in data type. What do you mean by Base class and Derived class? “02 2 Explain virtual classes. Why it is used? _ | 2 1 Explain public, private and protected access specifiers and | 03 12 show their visibility when they are inherited as public, private and protected, (a) | How to write and call copy consiructor in a single 125 OR Describe the multilevel and multiple inheritances with using writeQ) and read() function in a file. oF | 136 example, d ‘Write name of operations perform on a file. a 3 Explain association and Aggregation. 02 6 Explain pointer to object and this pointer with suitable | 03 13 example. @ | Write a Program to declare @ pointer to the base class and| 07 | 13,6 access the member variable of base and derived class OR (©) | Write a program to read and write operation with objects | 07 245 - rsotal Pages: 03 at Il YEAR B.E. EXAMINATION, OCTOBER - NOVEMBER 2018 CSLIITL-304/3Y52 : Computer System Organization (GS) Time : 3 Hours Maximum Marks : 70 Minimum Marks ; 22 Note: 1. Answer all five questions, All questions cary equal marks 2 In each question part a,b, ‘are compulsory and part das internal chofce. Out of whic part a & b (Max. $0 words) furry 2 marks, Parte (mas. 100 words) enrry 3 marks and par (Max. 400 words) carry 7 ‘marks. Word init would not be followed for (excep) diagram, numerical, derivation el 3 Al parts of each question are fo be atempted at one place. &. Assume suitable value for a. amiss dat, if any. Marks 1. (a) Consider the following statement: the numbers of CPU 02 registers provides some measure of the power of a processor. Comment on the validity of this statement. (b) What do you understand by the term Micro-instructions? 02 Explain with suitable examples. (C) What do you understand by IR, MAR and MBR. Discuss 03 their functions. (qd) There are 4 registers: A, B, C and D each of 4 bits. Construct 07 a common bus system for transferring the information from any one register to another register without affecting the others. Suppose someone is interested to transfer the data from register B to register D. This should be achieved in two steps: during first step data should transfer from register B to BUS and in the second step data should transfer from BUS to register D. Also write the micro instructions for transferring the data from register B to Register D. OR (e) Discuss the following : 07 @ Von Newman model Gi) Register Transfer(a) (b) (c) @ © (@) (b) @ ©) @ (6) © What do you understand by instruction format? What do you understand by signed magnitude number? Explain with some example: Discuss the salient features of RISC. How the addition and subtraction is done for floating point number? Explain it by drawing flowchart and also give some suitable examples OR What do you mean by addressing modes? Discuss and give the suitable examples for the following addressing modes i) Immediate ii) Direct addressing ii) Indirect addressing. List some applications of microprocessor. ‘What do you understand by the term interrupt? Discuss the following instructions of 8085: JP and ADI. For each case give the suitable example, Draw the block diagram of 8085 micro processor. Also discuss the significant of its flags. OR Write an assembly language program that adds 800 and 900, with the final answer stored in the H and L registers. What are the functions performed by an I/O interface? What are the advantages of cache memory over main memory? Calculate the average access time, if the cache access time is 160 nsec, memory access time is 960 nsec and the hit ratio is 90%. 02 02 03 07 07 02 02 03 07 07 02 02 03(d) © (@) ) © @) What do you understand by Priority interrupt? Discuss different interrupt along with their priority. OR Explain Programmed I/O mode of data transfer. What do you understand by Hypercube? What is Cache Coherence? Discuss the characteristics of multi processor system. Compare single stage and multistage switching network. Give some examples of multistage switching network, OR What do you mean by memory management? Discuss memory management hardware. kek eK 07 07 02 03 07 07Roll no. lind B., EXAMINATION Nov ~ Dec 2048 area 150303 /BCSL304/BITL304 Computer Graphics Time : 3 Hours Maximum Marks :70 Minimum Passing Marks -22 Note: | £ Answer all five questions. All questions carry equal mars. 2 Ineach question porta, , care compulsory and part d hes internal chovee. Out of which part o & & (Mox. 50 words) carry 2 marks, part c (Max. 100 words) corry 3 marks and part 6 (Max. 200 wordt) carey 7 marks. Word limit would not be followed for (except) diagram, numerical, derwotion etc 3 AUF Part of each question ore o be attempted atone piece Assume suitable vole for missing dat, if ony | PLEASE MENTION F AMY (71S CODE, (i) DATA TABLES ETC ARE PERMITTED Wy THE Exant ‘Question | Marks “~~ co. No. | 1. | (al_| Explain the basic elements use to display in Computer Graphics. [ee (0)_| What is refresh rate? [02 {c}_| In a 600 x 400 pixel, how many KB does a frame buffer need? 0B (d) | A laser printer is capable of Printing two pages of size 9 x 11 inch/second at | 07 | a resolution of 600 pixels/inch. How many bits per second does such a { device requires. OR (@)_| Consider two raster system with resolution of 640 x 480 and 1280. 1024.07!” Cou How many pixels could be accessed per second in each of these systems by a display controller that refreshes the screen at a rete of 60 frames per second? What is the accesses time per pixel in each systems? (2 T ral | whats scan conversion? [Thy | explain overstrike effect. (| Write the 7 symmetrical points on circle fone point is (2x,4y) using circle diagram, (@) | indicate the raster location that would be chosen by Bresenhams algorithm when scan converting a line fram pixel (1,1) to (8,5). OR Ve} _| Find the equation of the Bezier curve which passes through (0,0) and (-4,2)/ 07 , CO2,CO3" and controlled through (14,10) and{4.0). 3. [(@) | Write clearly 3 x 3 Matrix for reducing an object 9 times, however aspect | 02 ratio should be constant. (b) | Generaté the 2 x 2 matrix of rotation of a point (xy) in anticlockwise | 02 direction. i [@)_[ Write the steps for Viewing transformation Eee [eos (d)_[ Find @ general form of matrix for reflection of an object with respect to a| 07 line yemxtc, OR {e} | Magnify the tangle with vertices A(0,0),8(1.1), and C(S,2) to twice of its size keeping C fixed. 4. {a} _| What is hidden surface elimination? (b)_[ Write the difference between Convex and Concave Polygon. {c)_ | Draw all nine regions 4 bit out code including window in Cohen Sutherland | “03 coz 1 Fine igor —_ a 7 Hf {1@)_| Draw the flow diagram of sutheriand hodgeman polyzon clipping algovitlon | 07 | coz ‘OR (@_| Explain 2 buffer algorithm. [07 | c03,cos | 5. _[(a) | Explain diffuse reflection. o2 | cos (b)_[ Explain clearly the difference between Phong and Gourand Shading. o2 | com |[{)_[ Differentiate RGB and CMY color model. [(@) [Explain Digital image processing. What is the sampling and quantization? on Explain following: 2. Black and White image b. Gray Scale image Image d. Histogram. ace) Coa o7 cos ed |Roll No Ul YEAR B.E. EXAMINATION OCT- NOV 2018 BCSL/BITL-305 : Operating System Tine: $Hours Maximum rks: 70 Minune Passing Marks: 22 Note: TL Answer al five questions All questions cary equal marks 7) 2 Tmeash question pata, cate erpaiory and pat ts intemal coi. Outof which pat afb Max, $0 woud) cay 2 tari, prt (2.100 word) cay 3 masa pr (Max 400 word) cay 7 uke, Werd Hn woud ot be flowed for (creep dagram, numeral, dewaton ee 3. AllParwoteach question ae tobe lenge at one pace | 4 sume sale vale for missing dat any 5._ PLEASE MENTIONIF ANY ()1.5. CODE, i) DATA TABLES ETC. ARE PERMITTED IN THE EXAM Question Maris No. 1. [(@)_| Differentiate Multi-Programming and Multi-Tasking System, 02 (B) | What is Real Time Operating System? Differentiate Hard Real Time and Soft | 02} Real Time System. | (©_| Describe process state diagram in brief. 0B (d) | Consider a variant of the RR scheduling algorithm where the entries inthe | 07 ready queue are pointers to the PCBs. (| What would be the effect of putting two pointers to the same process in the ready queue? (ii)_| What would be the major advantages and disadvantages of this scheme? (iii) | How would you modify the basic RR algorithm to achieve the same effect without the duplicate pointers? oR (©) | Consider The following Processes 7 Process | Arrival Time | CPU Burst Po 0 28 PL 5 10 Pa 10 07 Pa 15 04 Py 20 12 Consider FCFS, SRTF and RR (Quantum = 5) scheduling algorithms for these Processes. Find the minimum Average Turnaround Time and minimum Average Waiting Time, 2. |(@) | What is semaphore? Write two main operation by which semaphore | 02 variables are accessed. (b)_| What is Deadlock Prevention? 02 (Q | What is the sufficient condition to check the Deadlock? Describe by | 03 Example. (@ [in a system, there are three types of resources: E,FandG. Four | 07 processes Po, P, Pr and Ps execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example, Max(Pz F] is the maximum number of instances of F that P2 would require. The number of instances of |__| the resources allocated to the various processes at any given state is given | ' bya matrix named Allocation. | | Consider a state of the system with the Allocation matrix as shown below, | and in which 3 instances of fand 3 instances of Fare the only resources| available. Find whether system is in safe state or not. If yes, find safe | | sequence. |_— maa Max. ft G E [F[G PO 1 po |4 [3 |2 [Pr 2 Pi [2 lila P2 3 p2_ {i [3/3 P3 0 p3_ [5 [4/1 OR (©) | Two concurrent processes P1 and P2 use four shared resources R1, R2, R3 | 07 and R4, as shown below. P1: P2: Compute; Compute; Use R1; Use R1; Use R2s Use R25 Use R3; Use R3; Use R4; Use R4; Both processes are started at the same time, and each resource an be accessed by only one process at a time. The following scheduling constraints « exist between the access of resources by the processes: P2 must complete use of R1 before P1 gets access to R1. P1 must complete use of R2 before P2 | gets access to R2. P2 must complete use of R3 before Pi gets access to R3. P1 must complete use of R4 before P2 gets access to R4. There are no other scheduling constraints between the processes. If only binary semaphores are used to enforce the above scheduling constraints, what is the minimum number of binary semaphores needed? Write the logical code of above processes using semaphores. (a)_| Whatis physical address space and logical address space? 02, (8)_| What is virtual memory? a (©_| What is segmentation? How it Differs from Paging? 03 (@) | ina virtual memory system, size of virtual address is 32 bit, size of physical | 07 address is 30-bit and page size is 4Kbyte. The main memory is byte addressable, Find the following: (__| Number of pages in virtual address space. KC (il) | Number of Frames in physical address space. Gi) | Size of Page table including 1 valid/ invalid bit and 3 sharing and protection bits per entry. OR (©) | Assume that a main memory with only 4 pages, each of 16 bytes, is initially | 07 empty. The CPU generates the following sequence of virtual addresses and uses the Optimal and Least Recently Used (LRU) page replacement policies. 0, 4,8, 20, 24, 36, 44, 12, 68, 72, 80, 84, 28, 32, 88, 92 How many page faults does this sequence cause in both the Optimal and Least Recently Used (LRU) page replacement policies? What are the page numbers of the pages present in the main memory at the end of the sequence?What is file? What are the different attributes of file (write the name of any 02 How free space is managed by File system? Describe the structure of i-node. 5 03 ‘A disk has 200 tracks (numbered 0 through 199). At a given time, it was, servicing the request of reading data from track 120, and at the previous request, service was fro track 90. The pending requests (in order of their arrival) are for track numbers. 30 70 115 130 110 80 20 25. How many times will the head change its direction for the disk scheduling policies SSFT(shortest seek time first} and FCFS. Also find the numbers of track movement in both the policies. 07 OR () Ina particular Unix 0S, each data block is of size 1024 bytes. Each node has 10 direct data block address and three additional addresses: one for single indirect block, one for double indirect block and one triple indirect block. Also, each block can contain address for 128 blocks. What is the maximum. size of the file in the file system? 07 | | | Why is 1/0 interface required? 02 (b) What is memory mapped 1/07 02 © What are the differences between Virus and Worm? 03 (a) What is cryptography? How it helps in security? Describe the different types of Cryptography in brief. 07 OR (e) What is system protection? Write the goal of protections. How Access matrix is implemented? Describe in brief. 07 ‘eich