cse I ROLL NO;, G.PULLA REDDY ENGINEERING COLLEGE(AUTONOMOUS): KURNOOL B.TECH V SEMESTER SECOND SESSIONAL EXAMINATION FEB-2021 DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING WEB TECHNOLOGIES (WT) (SCHEME — 2017) Time : 2:00 PM ~ 4:00 PM Max.Marks: 30 Date : 25-02-2021 (Thursday) ' Note: Answer Question No.1 and One question from each Section. Course QNo Question Outcome Marks Mapping ‘ L 3x2=6 if a, What is HTML DOM, Write its methods? co3 : b, Write the syntax for Checkbox with its attributes. co4 ' ©. Define XML? Write any two rules to write an XML Document. cos Section-I 2. a, Write a Java Script and HTML code for validating the Phone number? CO3(A)_—=«(4M) b. What is the use of HTML inner Property? With example co3(A) (4M) (OR) 3. a, Inhow many ways Java Scripts can be written? What are they Explain? _ CO3(U) 6M * b. Write a Java Script code for converting Uppercase to Lowercase COXA) gnvy characters when submitting a button. Section-IT 4. a, Define Form? Write the attributes and description for Form? What are. CO4(A) (4M) the different controls used in HTML Forms. b. Design a Static webpage with the following: coa(a) (4M) Sign Up It's free and anyone can join fen toa name![ ~~ I (OR), 3. ‘How to create a database connection for an HTML page. Write the co4a) (8M) complete step by step process and sample code for Login form and data base connection using php code. P.T.0.Section-I1 Describe the Difference between HTML and XML with the syntax, cosy) (4M) Explain with the Tree structure of XML document. ‘Write the code for XML Document to load the employee cos(u) (4M) details(empno,name,f_name,|_name,DOB,Salary) in HTML file. (OR) What is valid and Well formed XML Document? Give the different 06 (A) (8M) types of DTD’s. Create a DTD with the data: customer, name,order,items,product,price quantity? Write the use of (#PCDATA) FE ROC OOOO IERIERoll No: G. PULLA REDDY ENGINEERING COLLEGE (AUTONOMOUS): KURNOOL ‘COND SESSIONAL EXAMINATIONS, FEBRGAQERY ~ 2021 B, TECH V SEMESTER DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING INTRODUCTION TO MICROPROCESSORS & MICROCONTROLLERS (IMMC) (SCHEME - 2017) Date: 22-02-2021 Time: 2.00 PM to 4.00 PM Note: i) Question No.1 is compulsory and it must be answered in sequence at one place only MaxMarks:30 it) Answer any one question from each uni Mark QNo Question au s COME | 342-6 1a) | Explain how Programmable Interrupt Controller address 64 interrupts 2M co3 in cascaded mode? b) | Does 8051 is a Van-Neuman Architecture or a Harvard Architecture? Justify your answer? cos | 2M ©) _| Discuss the importance of Program Status Word register of 8051 cos | 2M UNIT- 11) 2] Explain the working of 8259 with neat internal architecture and discuss | ¢o3 | gyy the importance of all the registers used in 8259. _ OR 3a) | Illustrate the difference between Synchronous & Asynchronous mode of Communication? cos. | 3M 6) | Explain in detail about the internal Block diagram of 8251 cos | eu ~—UNIT-IV 4a) | Describe the Internal Architecture of 8051 Micro Controller in Detail? cot | om b)_| Explain Internal Memory Organization of 8051 Micro Controller? co4 | 3M ORDoes 8051 Micro Controller Interrupts are Programmable or Not? 50% Duty cycle at port P1.2, (Use Timer 0 in Mode1 with crystal frequency 12 MHz) 5a) cot | 3M Justify your answer? 5b) | Write an Assembly Language Program of 8051 to transmit the word co4 | SM GPREC over serial port UNIT-V a) | Discuss about the various types of Addressing Modes of 8051 Micro] COS 4M Controller with an example?? 6b) | Explain the Arithmetic and Boolean instructions of 80Siwith an| COS | 4M example? oR _ 7 [Write a program to generate a square wave of frequency 2 KHz with| COS | 8MROLL NO: G.PULLA REDDY ENGINEERING COLLEGE(AUTONOMOUS): KURNOOL B.TECH V SEMESTER SECOND SESSIONAL EXAMINATIONS-FEBRUARY 2021 DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING DATA MINING (DMG) (SCHEME - 2017) Time: 2 PM-4PM Date : 23-02-2021 Max.Marks;30 ‘Note: Answer Question No.1 and One question from each Unit. f ‘Course QNe Question Outcome Marks Mapping 1 3x26 8, Define the term conditional probability with appropriate formula, b, What is support and confidence of an association rule? ©. Differentiate between partitional clustering and hierarchical clustering. Section-T 2. Determine the output class ‘Default? for the customer Andrew by applying KNN C03. (8) classifier where K=5, Write all the calculations in detail. [Customer Age | toan fone 25 | 40000 [smieh 3360000 latex "45 | 89000 ade: 20 | 20000 Kote 3s | 420000, Mack 52 | 18000 [anit 23 | 95000 Pat 40 | 62000 iSeorse ‘60__| 100000 him 48 | 220000 back 33 | 150009 [andrew 43___| 142000 (OR) 3. Explain the step by step process in determining the output class ‘Evade? for the test C03 (8) data X= (No, Divorced, 120K) using Naive Bayes Classifier. Em aa ey Eran ac4, 5. 6 a, b 1a. s Section-II Illustrate the process of generating association rules using Apriori algorithm for the following data with minimum support=2 and minimum confidence=50% TID ITEMSETS T1 AB ; 72 B,D 73 B,C 4 A,8,D 5. AC 16 BC 7 AC 1% ABGE 7) A,B,C (oR) Explain the process of generating frequent patterns using FP Growth algorithm for the following transaction data, Assume minimum support=3. Ti] nw v2], 3314 r3 1415 T4|[ 11a234 5 | na2a3as T6 || 112,131 Section-TIT Write notes on different types of clusters. Illustrate the process of K-Means clustering algorithm with an example. (OR) ‘Write notes on DBSCAN algorithm. Explain the measures of calculating inter cluster distance in agglomerative hierarchical clustering algorithm with suitable examples. cos cos cos cos cos cos ®) ® @ @) @). @ROLL NO; G.PULLA REDDY ENGINEERING COLLEGE Autonomous): KURNOOL Department of Computer Science & Engineering Second Sessional Examinations ~ February 2021 B.Tech V Semester (Scheme - 2017) Formal Languages and Automata Theory (FLAT) Time : 02:00 PM - 04:00 PM Date : 24-02-2021 Max.Marks: 30, Note: Answer Question No.1_and One question from each Section. , Course QNo Question Outcome Marks: 1. 3x2=6 a, | Define ambiguous grammar, Also, give an example. C03 @ State the difference between PDA acceptance by final state and b. co4 Q) acceptance by empty stack, ¢. | Give the formal definition of Turing machine, COs @ SECTION-I Minimize the following CFG: ee S>xY X30 YOZ|1 22W wc co cos o Convert the following CFG into CNF grammar: S>bA| aB 8 088 [bs |b OR Convert the following CFG into GNF: 34 | soxy nx YSib Y>sXJa eg ® b__| Prove that L = {a""c" n> 0 } is not CFL using pumping lemma. 03 @ SECTION-II 4.a__| Design PDA for L = {a™"b": n >0} co4 @ b _| State and Explain the closure properties of CFLs, C04 @ ‘OR 5.a_| Construct an NPDA for the grammar: S > aSbb | aab COs @ ‘Obtain a CFG for the PDA shown below: 3(qo, a, Z) b. | 8(q0,a, A) ‘ co4 @ 5(qu.e, Z)= (qo, €) 7 SECTION 6.4_| Construct a Turing machine for L = {a°b%e" n> 0} ‘COs @ | b Describe about Universal Turing Machine. cos 4 OR - a_| Design a Turing machine to add two unary numbers. ‘OS @ | Explain about Halting Problem of Turing Machine. COs @ROLL NO: G PULLA REDDY ENGINEERING COLLEGE (AUTONOMOUS): KURNOOL B.TECH V SEMESTER SECOND SESSIONAL EXAMINATIONS, FEBRUARY 2021 DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING (CSE) ARTIFICIAL INTELLIGENCE (AD. (SCHEME - 2017) Date : 26-02-2021 + Time: 2.00 P.M. - 4.00 P.M. Note: Answer Question No.1 and One question from each section. 1 QNo Question a. What is meant by bidirectional search? b. Write the advantages of best first search. ¢. What is meant by Locality-sensitive hashing? Section-I a. Explain about the uniform cost search, * b. Differentiate between breadth first and depth first search strategies. (OR) Determine the path from $ to G by using BFS, DFS, DLS(limit=3) and IDS for the following figure: ae IN @ Section-II a. Explain the properties of A* algorithm. , b. Describe about the memory bounded search, (OR) Determine the path from B to G using A* algorithm for the following figure, Section-I1 Explain the block diagram of artificial neural network architecture, b. Explain about the multilayer feed forward neural network (OR) a, Explain about the nearest neighbor model, b. Explain about the K-D tree, Max. Marks: 30 co Mapping Marks 3x246M C03 cos cos cos. (M) co3. 4M) cos. gM) cos 4M) cot 4M) (8M) cos cos (4M) cos 4M) cos 4M) cos 4M)