R10 SET a) Explain the Architecture of 8085 Microprocessor? b) Explain instruction set Architecture Design?

Similar documents
R10 SET a) Construct a DFA that accepts an identifier of a C programming language. b) Differentiate between NFA and DFA?

JNTUWORLD. Code No: R

(a) R=01[((10)*+111)*+0]*1 (b) ((01+10)*00)*. [8+8] 4. (a) Find the left most and right most derivations for the word abba in the grammar

T.E. (Computer Engineering) (Semester I) Examination, 2013 THEORY OF COMPUTATION (2008 Course)

Skyup's Media. PART-B 2) Construct a Mealy machine which is equivalent to the Moore machine given in table.

CT32 COMPUTER NETWORKS DEC 2015

(DMTCS 01) Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) State whether the following is True/False:

ASSIGNMENT - 1 M.Sc. DEGREE EXAMINATION, MAY 2019 First Year COMPUTER SCIENCE Data Structures MAXIMUM : 30 MARKS ANSWER ALL QUESTIONS

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

1. a) Discuss primitive recursive functions with an example? 15M Or b) Statements and applications of Euler s and Fermat s Theorems?


Multiple Choice Questions

(DCS/DIT311) Answer question no.1 compulsory (15 1 = 15) Answer ONE question for each unit (4 15 = 60) 1) Write short notes on :

1. (a) What are the closure properties of Regular sets? Explain. (b) Briefly explain the logical phases of a compiler model. [8+8]

CS402 Theory of Automata Solved Subjective From Midterm Papers. MIDTERM SPRING 2012 CS402 Theory of Automata

UNIT I PART A PART B

Decidable Problems. We examine the problems for which there is an algorithm.

II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION

R13 SET Discuss how producer-consumer problem and Dining philosopher s problem are solved using concurrency in ADA.

QUESTION BANK. Unit 1. Introduction to Finite Automata

Syllabi of the Comprehensive Examination in Computer Science

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES

R13 SET - 1 '' '' '' ''' ' Code No: RT22053

QUESTION BANK. Formal Languages and Automata Theory(10CS56)

SYED AMMAL ENGINEERING COLLEGE (An ISO 9001:2008 Certified Institution) Dr. E.M. Abdullah Campus, Ramanathapuram

QUESTION BANK ADVANCED DATA STRUCTURES Class II B.Tech (CSE-A&B) II Sem Name of the Faculty- K. Nuka Raju

III) EXAMINATION, 2015 CS 331 : SYSTEM PROGRAMMING AND OPERATING SYSTEM I

AUBER (Models of Computation, Languages and Automata) EXERCISES

Languages and Compilers

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2016

QUESTION BANK. Unit I : Finite Automata

DHANALAKSHMI SRINIVASAN INSTITUTE OF RESEARCH AND TECHNOLOGY SIRUVACHUR, PERAMBALUR DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018

Gujarat Technological University Sankalchand Patel College of Engineering, Visnagar B.E. Semester VII (CE) July-Nov Compiler Design (170701)

Midterm Exam II CIS 341: Foundations of Computer Science II Spring 2006, day section Prof. Marvin K. Nakayama

Theory Bridge Exam Example Questions Version of June 6, 2008

Total No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC Second Semester CSE/IT DBMS

Finite Automata. Dr. Nadeem Akhtar. Assistant Professor Department of Computer Science & IT The Islamia University of Bahawalpur

1. [5 points each] True or False. If the question is currently open, write O or Open.

Models of Computation II: Grammars and Pushdown Automata

2068 (I) Attempt all questions.

M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I

Theory of Computation

QUESTION BANK B.TECH II YEAR II SEM (R17) ( ) DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Theory of Computation Dr. Weiss Extra Practice Exam Solutions

CSE 105 THEORY OF COMPUTATION

Parsing. source code. while (k<=n) {sum = sum+k; k=k+1;}

1. Provide two valid strings in the languages described by each of the following regular expressions, with alphabet Σ = {0,1,2}.

Derivations of a CFG. MACM 300 Formal Languages and Automata. Context-free Grammars. Derivations and parse trees

Question Bank. 10CS63:Compiler Design

I have read and understand all of the instructions below, and I will obey the Academic Honor Code.

Context Free Languages and Pushdown Automata

Theory of Programming Languages COMP360

SIR C R REDDY COLLEGE OF ENGINEERING

Interpreter. Scanner. Parser. Tree Walker. read. request token. send token. send AST I/O. Console

CS402 - Theory of Automata FAQs By

Theory of Computations Spring 2016 Practice Final

DADI INSTITUTE OF ENGINEERING & TECHNOLOGY (Approved by A.I.C.T.E., New Delhi & Affiliated to JNTUK, Kakinada)

INSTITUTE OF AERONAUTICAL ENGINEERING

GUJARAT TECHNOLOGICAL UNIVERSITY

Languages and Automata

UNIT -2 LEXICAL ANALYSIS

MIT Specifying Languages with Regular Expressions and Context-Free Grammars. Martin Rinard Massachusetts Institute of Technology

MIT Specifying Languages with Regular Expressions and Context-Free Grammars

Definition 2.8: A CFG is in Chomsky normal form if every rule. only appear on the left-hand side, we allow the rule S ǫ.

Final Course Review. Reading: Chapters 1-9

University of Nevada, Las Vegas Computer Science 456/656 Fall 2016

B.Tech in COMPUTER SCIENCE & ENGINEERING

1. Which of the following regular expressions over {0, 1} denotes the set of all strings not containing 100 as a sub-string?

Formal Grammars and Abstract Machines. Sahar Al Seesi

Software Engineering 4+1* 4 1 Financial Analysis 2. Object Oriented Programming 4+1* 4 3 Computer Science and Engineering

CS/B.Tech/CSE/IT/EVEN/SEM-4/CS-402/ ItIauIafIaAblll~AladUnrtel1ity

CMSC 330: Organization of Programming Languages. Context Free Grammars

CS5371 Theory of Computation. Lecture 8: Automata Theory VI (PDA, PDA = CFG)

Regular Languages (14 points) Solution: Problem 1 (6 points) Minimize the following automaton M. Show that the resulting DFA is minimal.

CSCI312 Principles of Programming Languages!

Definition: A context-free grammar (CFG) is a 4- tuple. variables = nonterminals, terminals, rules = productions,,

CS 314 Principles of Programming Languages. Lecture 3

St. MARTIN S ENGINEERING COLLEGE Dhulapally, Secunderabad

DATABASE MANAGEMENT SYSTEMS

ECS 120 Lesson 16 Turing Machines, Pt. 2

GATE 2018 Online Test Series - Computer science Engineering

DHANALAKSHMI SRINIVASAN COLLEGE OF ENGINEERING AND TECHNOLOGY ACADEMIC YEAR (ODD SEM)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

CS402 - Theory of Automata Glossary By

Compilation 2012 Context-Free Languages Parsers and Scanners. Jan Midtgaard Michael I. Schwartzbach Aarhus University

Madhya Pradesh Bhoj (Open) University, Bhopal

UNIT 1 SNS COLLEGE OF ENGINEERING

PS3 - Comments. Describe precisely the language accepted by this nondeterministic PDA.

QUESTIONS RELATED TO UNIT I, II And III

(3 hours) [80 marks] NOTE: Question No 1 is compulsory Attempt any three questions from remaining. Assume suitable data if necessary.

Books : 4 th SEMESTER MCA F.M -70. Programming With Java(3-1-0)Cr.-4. Module-1

AUTOMATA THEORY AND COMPUTABILITY

CSE 105 THEORY OF COMPUTATION

B.C.A DATA BASE MANAGEMENT SYSTEM MODULE SPECIFICATION SHEET. Course Outline

TECNIA INSTITUTE OF ADVANCED STUDIES

CIS 330: Applied Database Systems. ER to Relational Relational Algebra

2. Lexical Analysis! Prof. O. Nierstrasz!

Answer any Five Questions. All questions carry equal marks.

Computer Sciences Department

Transcription:

Code No: R22054 COMPUTER ORGANIZATION (Com. to CSE, ECC) 1. a) Explain the Architecture of 8085 Microprocessor? b) Explain instruction set Architecture Design? 2. Explain Memory Subsystem Organization and Interfacing? 3. Explain about Micro-operations and Register Transfer language in detail 4. Explain the design and implementation of Basic Micro Sequencer and Micro Sequencer Control Unit? 5. Write briefly about float point numbers? 6. What is cache and virtual Memory? Explain the Memory Management in Pentium/windows? 7. a) Write about Asynchronous data Transfers? b) Differentiate the Asynchronous and Synchronous Data Transfers 8. a) What is the communication process in Multiprocessor Systems? b) Explain the memory Organization in Multiprocessor Systems?

Code No: R22053 DATA BASE MANAGEMENT SYSTEMS (Com. to CSE, IT) ~~~~~~~~~~~~~~~~~~~~~~~~ 1. a) What are the responsibilities of a DBA? If we assume that the DBA is never interested in running his or her queries, does the DBA still need to understand query optimization? Why? b) With a neat diagram, briefly describe the architecture of a DBMS. (8M+7M) 2. What is weak entity? With an example describe in detail Binary Vs Ternary relationships. 3. a) What is Tuple Relational Calculus? With an example, briefly describe syntax and semantics of TRC queries. b) What is join operation and why it is required? With an example, briefly describe condition join, natural join and equijoin. (8M+7M) 4. What is grouping? Is there a counterpart in relational algebra? Explain this feature, and discuss the interaction of the HAVING and WHERE clauses. 5. What is dependency? Briefly describe about multivalued dependencies and Fourth Normal Form. 6. What is recoverability? Describe in detail recoverable schedule and cascadeless schedule. 7. What issues are considered in using clustered indexes? Describe in detail index only evaluation method and what is its primary advantage? 8. What is the drawback of ISAM index structure? How B+ tree index structures provide solution? Briefly describe the characteristics of B+ tree index structure.

Code No: R22055 II B. Tech II Semester Supplementary Examinations, Dec/Jan-2015-16 FORMAL LANGUAGES AND AUTOMATA THEORY (Computer Science and Engineering) 1. a) Construct DFA for the following: L = {w/w is in the form of X01Y for some string X and Y consisting of 0 s and 1 s}. b) Design DFA which accepts set of all string which are divisible by for 5 binary alphabet. 2. a) Determine a DFA from the given NFA M = {{q0, q1} {a, b}, δ, q0, q1} δ a b q0 {q0, q1} {q1} q1 Ø {q0, q1} b) Convert the following mealy machine into equivalent Moore machine. 3. a) Construct a finite Automata for the regular expression ((0 + 1 ) ( 0 + 1) * + (( 0 + 1) ( 0 + 1) ( 0 + 1)) *. b) Prove that for every regular Ɛ an equivalent finite Automata which accepts the same language. 4. a) Construct CFG for ( a/b)* abb from NFA. b) Let G be the grammar s ->ab / ba, A -> a/as/baa, B -> b/bs/abb. For the string aabbabab find i) Derivation tree ii) Rightmost derivation ii) left most derivation. 5. a) Show that L = {a n b n c n /n >= 1 } is not context free but context sensitive. b) Convert the following Context Free Grammar to Chomsky Normal Form S ->AaB aab, A -> Ɛ, B ->bba Ɛ 6. a) Design a deterministic pushdown automata for the following language L = { 0 n 1 2 n / n >=1 } b) Define Push Down Automata (PDA). Discuss about the languages accepted by PDA. 7. a) Construct a Turing machine to recognise Palindromes. b) Construct a Turing machine for f(n) = 4. c) Explain about the Computable functions. 8. a) Explain what is undecidable problem and post correspondence problem? b) Prove that the following is undecidable function: for any context free Grammar G whether L(G) = Σ*.

Code No: R22052 OBJECT ORIENTED PROGRAMMING THROUGH JAVA (Com. to CSE, IT, ECC) 1. a) Compare object oriented programming with structured programming. (7M) b) Explain creating and accessing class members using objects with example. (8M) 2. a) What is meant by type casting? Explain with sample java program. (8M) b) Discuss the usage of final and finalize keywords. (7M) 3. a) Briefly discuss about super keyword. (8M) b) Does java support multiple inheritances? justify your answer (7M) 4. Explain in detail the process of defining, creating and importing a package with suitable example. 5. a) Discuss about thread life cycle. (7M) b) List and explain various types of exceptions. Discuss the benefits of exception (8M) handling. 6. a) How will you pass parameters to an applet? Explain with an example (8M) b) Write short notes in secure applet. (7M) 7. a) Discuss in brief class hierarchy for panel and frame. (7M) b) Explain about various interfaces defined by the java.awt.event to implement event (8M) listener 8. a) Explain about JTree swing component with suitable example. (8M) b) Explain about JApplet with suitable example (7M)

Code No: R22056 II B. Tech II Semester Supplementary Examinations, Dec/Jan-2015-16 PRINCIPLES OF PROGRAMMIG LANGUAGE (Com. to CSE, IT) ~~~~~~~~~~~~~~~~~~~~~~~~ 1. a) What effect will readability have on writability of a program? Discuss a suitable scenario. b) Explain the role of symbol table in a compiler with suitable example. 2. a) Explain the concept of binding? b) Explain the scope rules? 3. a) Describe the approach of using axiomatic semantics to prove the correctness of a program. b) List the differences between an intrinsic attribute and a non-intrinsic synthesized attribute. 4. Explain about control flow in Recursion? 5. a) Explain about type checking? b) Discuss about files in Ada? 6. Explain Exception Handling in C++.? 7. Explain about dynamic method binding? 8. a) Explain about higher order functions? b) Write about applications of logic programming.

Code No: R22051 SOFTWARE ENGINEERING (Computer Science and Engineering) 1. a) Software doesn't "wear out." Give justification for the statement. (8M) b) Explain about the software engineering layers. (7M) 2. a) Discuss about waterfall model (8M) b) What is SRS? Explain about the user and system requirements. (7M) 3. Explain about different system models with neat diagrams. 4. a) What uniform criteria define the technical quality of a software design? Discuss. (8M) b) Discuss about the architectural styles and patterns, (7M) 5. a) Explain about the design principles that enable an interface to reduce the user s (8M) memory load. b) What are the interface design steps? Discuss. (7M) 6. Explain about different black box testing? 7. a) How to rate each risks? Discuss. (8M) b) What is risk migration? Explain. (7M) 8. a) Explain about the ISO 9000 quality standards. (8M) b) Explain about software reliability. (7M)