(DCS/DIT 211) UNIT - II Q3) UNIT - III Q4) N-3039

Similar documents
ADIKAVI NANNAYA UNIVERSITY::RAJAMAHENDRAVARAM II BTech (EIE) I Semester BTEIE301 DIGITAL LOGIC DESIGN MODEL QUESTION PAPER Time:3 hrs. Max.

II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC-2017

B. Tech. DEGREE EXAMINATION, MAY (Examination at the end of Second Year) ELECTRONICS & COMMUNICATIONS. Paper - I : Mathematics - III

Tribhuvan University Institute of Science and Technology 2067

Total No. of Questions : 5] [Total No. of Pages : 02

Sample Test Paper - I

CS/IT OPERATING SYSTEMS

UNIVERSITY OF MASSACHUSETTS LOWELL DEPARTMENT OF ELECTRICAL & COMPUTER ENGINEERING SYLLABUS FOR THE DOCTORAL QUALIFYING EXAM

3. (a) Figure 3(a) shows a Bridge T network used in control systems. The element values are clearly marked in the figure.

Reg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering

Time: 3hrs Max. Marks: 75 SECTION - A. Answer ALL questions. 4 X 15 =60M

INSTRUMENTAL ENGINEERING

ELECTRICAL ENGINEERING

PGVES ENTRANCE EXAM SYLLABUS Pattern: objective type

Test Code : CSB (Short Answer Type) Junior Research Fellowship (JRF) in Computer Science

Industrial Technology: Electronic Technology Crosswalk to AZ Math Standards


EC/EE DIGITAL ELECTRONICS

Numerical Analysis & Computer Programming

BTCE19, BTCSE19, BTEE19, BTETE19,BTME19 III SEMESTER B.TECH EXAMINATION, JANUARY-2013 MATHEMATICS III Time: 3 Hours Max. Marks: 75

M.Sc. DEGREE EXAMINATION, DECEMBER First Year. Physics. Paper I MATHEMATICAL PHYSICS. Answer any FIVE questions.

ELECTRONICS & COMMUNICATION ENGINEERING PROFESSIONAL ETHICS AND HUMAN VALUES

BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES

DE58/DC58 LOGIC DESIGN DEC 2014

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified)

on candidate s understanding. 7) For programming language papers, credit may be given to any other program based on equivalent concept.

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified) State any two Boolean laws. (Any 2 laws 1 mark each)

EE Branch GATE Paper 2010

(DPHY 01) M.Sc. DEGREE EXAMINATION, DECEMBER First Year. Physics. Paper I MATHEMATICAL PHYSICS

DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN

II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION. Answer ONE question from each unit.

Time: 3hrs Max. Marks: 75 SECTION - A. Answer ALL questions. 4 X 15 =60M

( c) Give logic symbol, Truth table and circuit diagram for a clocked SR flip-flop. A combinational circuit is defined by the function

COMPUTER SCIENCE TRIPOS

B.Tech. Theory Examination (Semester IV) Engineering Mathematics III

S. S. Jain Subodh PG (Autonomous) College, Jaipur Department of Mathematics Bachelor of Science (B.Sc. / B.A. Pass Course)

Department of Electrical & Electronics EE-333 DIGITAL SYSTEMS

B.Tech. DEGREE EXAMINATION, MAY (Examination at the end of Second Year) ELECTRICALS AND ELECTRONICS. Paper I MATHEMATICS III

GATE 2010 Electrical Engineering

King Fahd University of Petroleum and Minerals College of Computer Science and Engineering Computer Engineering Department

SEM-2016(02)-I ELECTRICAL ENGINEERING. Paper -1. Please read the following instructions carefully before attempting questions.

EECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs. Cross-coupled NOR gates

(DEE 211) II/IV B.Tech. DEGREE EXAMINATION, JUNE (Examination at the end of First Semester) Electricals and Electronics. Paper I MATHEMATICS III

Digital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.

KINGS COLLEGE OF ENGINEERING Punalkulam

Fundamentals of Computer Systems

Lecture 10: Synchronous Sequential Circuits Design

Units (Different systems of units, SI units, fundamental and derived units)

GATE 2014 A Brief Analysis (Based on student test experiences in the stream of CS on 1 st March, Second Session)

SHIVAJI UNIVERSITY, KOLHAPUR

KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE

Vidyalankar S.E. Sem. III [ETRX] Digital Circuits and Design Prelim Question Paper Solution

Vidyalankar S.E. Sem. III [EXTC] Digital Electronics Prelim Question Paper Solution ABCD ABCD ABCD ABCD ABCD ABCD ABCD ABCD = B

Show that the dual of the exclusive-or is equal to its compliment. 7

S.Y. Diploma : Sem. III [DE/ED/EI/EJ/EN/ET/EV/EX/IC/IE/IS/IU/MU] Principles of Digital Techniques

India s No. 1 Institute for GATE, ESE & PSU s. Instrumentation Engineering (IN) Chapter/Topic wise Tests 40

Total No. of Questions :09] [Total No. of Pages : 03

CSC9R6 Computer Design. Practical Digital Logic

USHA RAMA COLLEGE OF ENGINEERING & TECHNOLOGY

Virtual University of Pakistan

Final Year M.Sc., Degree Examinations

University of Guelph School of Engineering ENG 2410 Digital Design Fall There are 7 questions, answer all questions.

ELEC Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10)

EECS150 - Digital Design Lecture 11 - Shifters & Counters. Register Summary

ENGG 1203 Tutorial_9 - Review. Boolean Algebra. Simplifying Logic Circuits. Combinational Logic. 1. Combinational & Sequential Logic

Testability. Shaahin Hessabi. Sharif University of Technology. Adapted from the presentation prepared by book authors.

SE]y[-2017(02)-I ELECTRICAL ENGINEERING. Paper. Please read each of the following instructions carefully before attempting questions.

CPE/EE 422/522. Chapter 1 - Review of Logic Design Fundamentals. Dr. Rhonda Kay Gaede UAH. 1.1 Combinational Logic

Chapter 7. Sequential Circuits Registers, Counters, RAM

Q. 1 Q. 25 carry one mark each.

Vidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution

Design of Sequential Circuits

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

I.E.S-(Conv.)-2005 Values of the following constants may be used wherever Necessary:

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

EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

Physics (Theory) There are 30 questions in total. Question Nos. 1 to 8 are very short answer type questions and carry one mark each.

b) Derive the generating function for the Hermite s polynomials. 3) Find the necessary and sufficient condition for F(z) to be analytic.

SIR C.R.REDDY COLLEGE OF ENGINEERING ELURU DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I - SEMESTER

Chapter 7 Logic Circuits

EECS150 - Digital Design Lecture 25 Shifters and Counters. Recap

Outline. policies for the first part. with some potential answers... MCS 260 Lecture 10.0 Introduction to Computer Science Jan Verschelde, 9 July 2014

Unit I (Testing of Hypothesis)

PHYSICS. Downloaded From: Time Allowed : 3 Hrs. Max. Marks 60

B.E. / B.Tech. Degree Examination, April / May 2010 Sixth Semester. Electrical and Electronics Engineering. EE 1352 Power System Analysis

SAU1A FUNDAMENTALS OF DIGITAL COMPUTERS

Mathematics. B.A./B.Sc. III year. Paper-I. Linear Algebra and Linear Programming

per chip (approx) 1 SSI (Small Scale Integration) Up to 99

Advanced. Engineering Mathematics

PRE-BOARD EXAMINATION STD : XII MARKS : 150

Review for Test 1 : Ch1 5

CARIBBEAN EXAMINATIONS COUNCIL

Conventional Paper I-2010

WEST BENGAL STATE UNIVERSITY B.Sc. Honours PART-II Examinations, 2017

Digital Electronics Circuits 2017

ECE Branch GATE Paper The order of the differential equation + + = is (A) 1 (B) 2

BASIC NETWORK ANALYSIS

MATHEMATICAL OBJECTS in

S.Y. Diploma : Sem. III [CO/CM/IF/CD/CW] Digital Techniques

Chapter wise Theoretical Important Questions in Physics for Class-XII

Transcription:

(DCS/DIT 11) Total No. of Questions : 5] [Total No. of Pages : 03 B.Tech. DEGREE EXAMINATION, MAY - 013 (Examination at the end of Second Year) COMPUTER SCIENCE & IT (Paper - I) : Mathematics - III Time : 03 Hours Maximum Marks : 75 Answer Question No.1 Compulsory (15 1 = 15) Answer ONE question from each Unit (4 15 = 60) Q1) a) Define even function and given an example. b) State the Dirichlet conditions. c) Define periodic function. d) If f(x) = x in π<x<π, then find the Fourier coefficient a 0 e) Write any two properties of Fourier transforms. f) State the Fourier sine integral. g) Find the Finite Fourier transform of f(x) = x in (o, l) h) State Newton-Raphson iteration formula. i) Define interpolation. j) 1 Show that 1 = E. k) State Newton s divided difference formula. l) State Bessel s interpolation formula. m) State Trapezoidal rule. n) Write thesimpson s 3 1 rule. o) Define numerical differentiation. UNIT - I Q) a) Expand f(x) = x sin x, 0 < x < π as a Fourier series. b) Obtain the half range sine series for e x in 0 < x < 1. c) Find the Fourier series for the function x f ( x) = 1+, x 0 x = 1, 0 x N-3039 1 1 1 3 1 5 and deduce that + + +.... = 8 P.T.O.

(DCS/DIT 11) d) Find the complex form of the Fourier series of the periodic function f(x) = cosax, π < x < π. Q3) a) Express the function UNIT - II 1 for x 1 ( x) = 0 for x > 1 f as a Fourier integral. 0 sin cos Hence evaluate d. x b) Find a real root of the equation xe x =, by using Regula falsi method correct to three decimal places. coswx 1+ w c) Using the Fourier integral representation, show that dw = e,( x 0). d) Solve the following equations by Gauss elimination method : x + y + z = 9 ;x 3y + 4z = 13;3x + 4y + 5z= 40. UNIT - III 0 x Q4) a) In the table below the values of y are consecutive terms of a series of which the number 1.6 is the 6th term. Find the tenth term of the series. x : 3 4 5 6 7 8 9 y :.7 6.4 1.5 1.6 34.3 51. 7.9 b) Use Stirling s formula to find u 3 from the following values : u 6 = 14.035, u 5 = 13.674, u 30 = 13.57, u 35 = 1.734, u 40 = 1.089, u 45 =11.309. c) Using Lagrange s formula, express the function ( x x + 6x 1 1)( x 4)( x 6) of partial fractions. d) For the following values of x and y, find the first derivative at x = 4. x : 1 4 8 10 y : 0 1 5 1 7 as a sum N-3039

1 dx Q5) a) Evaluate 0 1 + x UNIT - IV taking 7 ordinates by applying Simpson s 8 3 rule. (DCS/DIT 11) b) Evaluate y (0.1) correct to four decimal places using Taylor s series method if dy = x + y, y(0) = 1. dx c) Using Runge-Kutta method of order 4, find y(0.) for the equation dy y x =, y(0) = 1. dx y + x Take h = 0.1. ïïï N-3039 3

(DCS/DIT1) Total No. of Questions : 09] [Total No. of Pages : 0 B.Tech. DEGREE EXAMINATION, MAY - 013 (Examination at the end of Second Year) Computer Science & IT (Paper - II) : BASIC ELECTRONICS Time : 03 Hours Maximum Marks : 75 Answer Question No : 1 Compulsory Answer One question from each unit Q1) a) What is forward resistance of a diode? b) Give the applications of zener diode. c) What is a rectifier? d) Name the three transistor configurations. e) Define α f) List the applications of LED. g) Define an oscillator. h) What is an op-amp? i) Define drift velocity of an electron. j) Define electric field intensity. k) Define electro static deflection sensitivity. l) What is meant by intrinsic semi conductor? m) What is meant by negative feed back? n) What is Virtual ground of an op-amp? UNIT-I Q) a) Explain the function of a zener diode as a regulator. b) Explain the action of a transistor in CE configuration. Q3) a) Explain the function of a transistor in emitter stabilized bias circuit. b) Explain the working of a full wave rectifier. N-3040 P.T.O.

UNIT-II (DCS/DIT1) Q4) a) Draw the characteristic of JFET and explain. b) Explain the working of solar cells. Q5) a) Draw the small signal model of FET and explain. b) Draw the neat figure of LED and explain. UNIT-III Q6) a) Explain the working of a colpitts oscillator. b) Discuss the function of a class A amplifier. Q7) a) Draw a Winbridge oscillator and explain its function. b) Explain the working of a class B amplifier. UNIT-IV Q8) a) Explain how an op-amp functions as a differentiator and integrator. b) Explain how IC voltage regulators are used. Q9) a) List the op-amp specifications. b) Explain VCO. XXXX N-3040 --

Answer Question No. 1 Compulsory Answer One question from each unit DCS/DIT13 Total No. of Questions : 9] [Total No. of Pages : 0 B.Tech. DEGREE EXAMINATION, MAY - 013 (Examination at the end of Second Year) COMPUTER SCIENCE & IT (Paper - III) : Digital Logic Design Time : 03 Hours Maximum Marks : 75 Q1) a) Define minterms and maxterms. [3] b) List the advantages of TTL. [3] c) Define a state table. [] d) What is a flip flop. [1] e) What do you mean by race around condition. [] f) List the applications of registers. [] g) Draw the figure of a JK flip flop. [] Unit - I Q) a) Reduce AB + ABC + ABC + BC using K-map. b) Reduce XY + XY + XY. Q3) a) Realize EX-N using AND logic. b) State and explain De Morgan s theorem. Unit - II Q4) a) Design a adder and explain its function. b) Explain the working of a magnitude comparator. Q5) a) List the features of a Binary parallel adder. b) Write short notes on positive and negative logics. N-3041 P.T.O.

Unit - III DCS/DIT13 Q6) a) List the differences between synchronous and asynchronous machines. b) Explain the concept of races and hazards and how do you eliminate them. Q7) a) Design a mod-6 synchronous counter using T flip flops. b) Give a note on state diagrams. Unit - IV Q8) a) Explain the working of left to right shift register. b) Describe with a neat figure the function of a PAL. Q9) a) Explain static and dynamic memories. b) Design a synchronous counter, write the steps required. XXXX N-3041 --

Answer Question No : 1 Compulsory Answer One question from each unit (DCS/DIT14) Total No. of Questions : 09] [Total No. of Pages : 0 B.Tech. DEGREE EXAMINATION, MAY - 013 (Examination at the end of Second Year) Computer Science & IT (Paper - IV) : DATA STRUCTURES Time : 03 Hours Maximum Marks : 75 Q1) a) Write briefly about singly linked list ADT. b) Write short note on the concept of binary search. c) Compare any two sorting methods in terms of time complexities. d) Describe briefly about AVL trees. e) What are the advantages of double linked list over single linked list? UNIT-I Q) a) Write a program to delete an integer from sorted circular linked list of integers? b) Explain about Abstract Data Types & explain list ADT. Q3) Describe briefly about data structures & explain about any three basic data structures & their operations. UNIT-II Q4) a) Explain linear search and measure its complexity. b) Write briefly about Queue, Queue ADT and explain operations of Queue ADT. Q5) a) Explain in detail about circular queue ADT, explain operations of circular Queue ADT with example. b) Write briefly about Infix, prefix, postfix notations and explain the following with one example. i) Infix to prefix conversion. ii) Infix to postfix conversion. N-304 P.T.O.

UNIT-III (DCS/DIT14) Q6) a) Write a program to implement merge sort & analyze its time complexity. b) Sort 5, 30, 16, 4, 9, 1, 7, 5 elements using merge sort. Q7) a) Explain about insertion sort with suitable example? b) Explain briefly about. i) Bucket sort. ii) Shell sort. UNIT-IV Q8) a) Describe about AVL trees & explain operations on AVL trees. b) Describe briefly about Binary search trees & explain how binary tree can be represented. Q9) a) What is splay tree & explain advantages & disadvantages of it? b) Explain insertion & deletion operations on B-trees with example. XXXX N-304

(DCS15) Total No. of Questions : 09] [Total No. of Pages : 0 B.Tech. DEGREE EXAMINATION, MAY - 013 (Examination at the end of Second Year) Computer Science (Paper - V) : OBJECTIVE IENTED PROGRAMMING Time : 03 Hours Maximum Marks : 75 Answer Question No : 1 Compulsory Answer one question from each unit Q1) a) Explain the following concepts of oops. Data abstraction and excapsulation. Dynamic binding. Polymorphism. b) Explain clearly about this pointer. c) What is meant by stream & explain C++ stream classes? d) Write about friend function and virtual function. e) What is meant by generic classes and generic function. UNIT-I Q) a) Explain about different types of operators used in C++. b) Explain about the following. Inline functions. Call by reference. Q3) a) Explain about headers and name spaces. b) Explain about parameterized constructor with example. UNIT-II Q4) a) What is function overloading, explain function overloading with example? b) Differentiate early binding and late binding. Q5) a) What is pointer? Explain declaration and initialization of pointers in C++ with example. b) Explain about the pure virtual functions and abstract types. N-3043 P.T.O.

UNIT-III (DCS15) Q6) a) What is the use of new and delete operator? Explain how to invoke these operators. b) How to create our own inserter and extractor and explain it? Q7) a) Explain about file I/O, Binary I/O. b) Explain about the following. Virtual base classes. Asm key word. UNIT-IV Q8) a) What is generic function? Give the advantages of it. b) Explain about RTTI & Casting operators. Q9) What is an exception? How to handle exceptions in C++? XXXX N-3043 --

DCS16 Total No. of Questions : 09] [Total No. of Pages : 01 B.Tech. DEGREE EXAMINATION, MAY - 013 (Examination at the end of Second Year) Computer Science (Paper - VI) : ENVIRONMENTAL STUDIES Time : 03 Hours Maximum Marks : 75 Q1) Answer the following short notes. a) Deforestation b) Water logging c) Man induced land slides d) Desert ecosystem e) Nuclear hazards Answer Question No. 1 Compulsory Answer One question from each unit All questions carry equal marks Unit-I Q) Explain the environmental effects of extracting and using mineral resources Q3) State the role of individual in the conservation of natural resources Unit-II Q4) Describe the structure and functions of ecosystem Q5) What are the hot-spots of bio-diversity Q6) Elucidate the impact of thermal pollution Unit-III Q7) Elucidate the control measures to manage solid waste Unit-IV Q8) Bring out the energy problems of urban India Q9) What are the important provisions of wildlife protection act? N-3044 XXXX

(DCS 1) Total No. of Questions : 9] [Total No. of Pages : 0 B.Tech. DEGREE EXAMINATION, MAY - 013 (Examination at the end of Second Year) COMPUTER SCIENCE (Paper - I) : Mathematics - IV Time : 03 Hours Maximum Marks : 75 Answer Question No.1 Compulsory (15 1 = 15) Answer ONE question from each Unit (4 15 = 60) Q1) a) Define Continuity of t(z). b) Write the Cauchy-Riemann equations in Cartesian form. c) Define the Analtic function. d) When do we say that a function is Harmonic. e) State Cauchy s integral formula. f) Define isolated singularity of the analytic function. z z) = ( z + 1)( z + ) ( g) Determine the poles of. f h) State Taylor s theorem for the analytic function f(z). i) State Residue theorem. j) Define singular point. k) State Laurent s series. l) Define simple pole. m) Write the orthogonal property of Bessel function. n) State Rodrigue s formula for legendre polynomial. o) Write the expression for P (x). UNIT - I Q) a) Show that an analytic function with constant real part is constant and an analytic function with constant modulus is also constant. b) Show that the function u = log( x + y ) is harmonic and determine its conjugate. 1 Q3) a) Show that the function xy 1/ is not regular at the origin, although Cauchy-Riemann equations are satisfied at the point. b) If f(z) is an analytic function of z, prove that + Rf ( z) = f ( z). x y N-3045 P.T.O.

UNIT - II Q4) a) State and prove Cauchy s integral formula. (DCS 1) b) Find Taylor s expansion of z + 1 f ( z) about the point z = i. z + z = 3 Q5) a) Evaluate c z e ( z + 1) 4 dz, b) Find the Laurent s expansion of where C is the circle z =. UNIT - III Q6) a) State and prove Residue theorem. 7z f ( z) = in the region ( z + 1) z( z ) dθ + cosθ b) Evaluate. 0 Q7) a) Determine the poles of the function z ( z) = ( z 1) ( z + ) f and the residue at each pole. Hence evaluate c f z) dz, ( where c is the circle z =.5. b) Solve in series the equation y + xy + y = 0. UNIT - IV Q8) a) d Show that [ n J ( )] n n = Jn+ 1( x ). dx b) Express J 5 (x) in terms of J 8 (x) and J 1 (x). 1 Q9) Prove that P m 1 0, m n ( x)p n ( x) dx=, m = n. n + 1 ïïï N-3045

(DCS ) Total No. of Questions : 9] [Total No. of Pages : 0 B.Tech. DEGREE EXAMINATION, MAY - 013 (Examination at the end of Second Year) COMPUTER SCIENCE (Paper - II) : Circuit Theory Time : 03 Hours Maximum Marks : 75 Answer Question No.1 Compulsory (15 1 = 15) Answer ONE question from each Unit (4 15 = 60) Q1) a) Define the conservation of charge. b) What is an independent source. c) Give the examples of bilateral elements. d) Define the term, Farad. e) State KCL. f) State the significance of operator j. g) Define form factor. h) Define admittance. i) Draw and notate the power triangle. j) What is Q-factor of a coil. k) Give the relationship between phase and line values in a 3-phase star network. l) Distinguish between 1-φ and 3-φ systems. m) Give the equation of power in a 3-φ star and delta network. n) What is the importance of source transformation. o) What are the features of a series resonant circuit. UNIT - I Q) a) State and explain the Kirchoff s laws. b) A wheatstone bridge has three arms of 10Ω each and one of 11Ω. Find the current in the various arms of the bridge, taking the applied potential as V, the galvanometer resistance of 100Ω and the battery resistance as negligible. Q3) a) Explain briefly the method of solving an electrical circuit using nodal analysis. b) Using Kirchoff s laws, find the current in each branch of the circuit shown in fig. given V 1 = 5V; V = V; R 1 = 3Ω, R = Ω & R 3 = 4Ω N-3046 P.T.O.

(DCS ) UNIT - II Q4) a) State and explain Superposition theorem. b) Using Superposition principle, compute the value of current in each branch for the fig. Q5) a) Explain the operation of RLC series circuit with respective phasor diagrams and also derive required equations. b) For the given wave form, calculate the average and rms value. UNIT - III Q6) a) For a π-connected resistive network, compute open circuit Z-parameters. b) Consider a R-L-C series network. Derive the resonance condition for such a network also derive the bandwidth and Q-factor. Q7) Calculate the short-circuit Y-parameters for the given circuit. UNIT - IV Q8) a) What are the advantages of three-phase systems. b) For a delta connected network, derive the relationship between line and phase values with the help of phasor diagram. Q9) a) Explain about the generation of 3-phase voltages. b) Calculate the active and reactive components of voltage in each phase of a delta connected, 4400V, 3-phase system supplying 3500kW at a power factor of 0.65. ïïï N-3046

Answer Question No. 1 Compulsory Answer One question from each unit (DCS3) Total No. of Questions : 09] [Total No. of Pages : 0 B.Tech. DEGREE EXAMINATION, MAY - 013 (Examination at the end of Second Year) COMPUTER SCIENCE (Paper - III) : Computer Organization Time : 03 Hours Maximum Marks : 75 Q1) a) Write a short note on 4-bit binary incrementer? b) Write about basic computer instruction formats? c) Write about pipeline register. d) List out data transfer instructions. e) Define cache memory. f) What is page fault write briefly? g) Define priority interrupt. h) What do you mean by micro operation & micro program. Unit-I Q) a) Explain logic microoperations. b) Write about different memory reference instructions. Q3) a) Explain shift microoperations. b) Explain about timing & control. Unit-II Q4) a) Explain about control memory. b) Discuss about stack organisation. Q5) a) Discuss in detail the design of control unit. b) Write about : i) Data transfer instructions ii) Data manipulation instructions N-3047 P.T.O.

Unit-III (DCS3) Q6) a) Explain division algorithm for fixed-point binary number in signed magnitude representation. b) Explain briefly about virtual memory. Q7) a) Write about decimal multiplication & decimal division operations with flowcharts. b) Explain about memory management hardware. Unit-IV Q8) a) Draw the block diagram of DMA controller. Explain how data is transferred. b) Write in detail about asynchronous data transfer. Q9) a) Write briefly about serial communications. b) Write about Input-output interface. XXXX N-3047 --

(DCS 4) Total No. of Questions : 9] [Total No. of Pages : 0 B.Tech. DEGREE EXAMINATION, MAY - 013 (Examination at the end of Second Year) Computer Science (Paper - IV) : DISCRETE MATHEMATICAL STRUCTURES Time : 03 Hours Maximum Marks : 75 Answer Question No.1 Compulsory (15 1 = 15) Answer ONE question from each Unit (4 15 = 60) Q1) a) What is tautology? b) What do you mean by compliment of a relation? c) Define Diagraph. d) A = {a, b, c}, B = {b, c, d,}, then how many binary relations can we define from A to B. e) If A = {x x is a +ve integer and 36 x } and B = {3, 5, 6, 7} find B A. f) What do you mean by Fuzzy set? g) How many strings of length 4 can be formed using ACHIEVE. h) Give the truth table for p q. i) What do you mean by inference? j) What is the significance of permutation? k) Define Lattice. l) What is Euler path? m) What is the significance of recurrence? n) State the converse for if you do things right then you are good person. o) Define Hasse diagram. UNIT - I Q) Construct the truth table for the following : (A B) (B C) (A B) (B C) a) ( ) ( ) b) ((A 7B) 7C) ( (B C) (C A) ) Q3) Convert the following sentences into predicate logic statements and verify the conclusion. a) All science courses are Hard b) Engineering courses are interesting c) All Arts courses are Easy d) John likes Easy Courses e) Data structures is an interesting course. f) AEDI is Arts course. Which courses John and Jasmine will take. N-3048 P.T.O.

(DCS 4) UNIT - II Q4) a) Prove that n 3 n is divisible by 3 using mathematical induction. b) Discuss about Fuzzy sets. Q5) a) In how many ways 48 articles be distributed among 8 people such that each person gets atleast 6 but not more than 16. b) Discuss various applications using combinations and permutations with and without repetitis in real world. UNIT - III Q6) Explain the following with suitable examples. a) Recurrence relations. b) Functions Q7) Solve the recurrence relation. a) a n 3a n 1 + 6a n = 0 for n and a 0 = 1 a 1 = using generating functions. b) Discuss various methods to find roots. UNIT - IV Q8) a) Find the transitive closure of diagraph whose adjancency matrix is 1 1 0 0 0 0 1 1 1 0 0 1 0 1 1 0 b) Find the n-degree and out degree of vertices of follows diagraph. Q9) a) Explain Lattices and Enumerations. b) Discuss Equivalence relations. ïïï N-3048

Answer Question No. 1 Compulsory Answer One question from each unit DCS5 Total No. of Questions : 09] [Total No. of Pages : 0 B.Tech. DEGREE EXAMINATION, MAY - 013 (Examination at the end of Second Year) COMPUTER SCIENCE (Paper - V) : File Structures Time : 03 Hours Maximum Marks : 75 Q1) a) Explain about extendable hashing? b) Explain about Euler s circuits? c) Explain about seaking? d) Explain merging of files on a disk? e) Write a short notes on binding? UNIT-I Q) Explain in detail deletion and insertion process in extendible hashing with example? Q3) Explain briefly about any two graph algorithms. UNIT-II Q4) Explain all pairs shortest path algorithm with an example. Q5) Explain about the following algorithms: a) Prims algorithm b) Krushkals algorithm UNIT-III Q6) Explain briefly about fundamental file processing operations? Q7) Write about the following : a) disks b) Magnetic tape c) CD-ROM N-3049 P.T.O.

UNIT-IV DCS5 Q8) Explain about the following : a) Indexing b) Selective indexes c) Inverted lists Q9) Explain how to processing and the sorting of large files with examples? XXXX N-3049 --

Answer Question No. 1 Compulsory Answer One question from each unit (DCS6) Total No. of Questions : 09] [Total No. of Pages : 0 B.Tech. DEGREE EXAMINATION, MAY - 013 (Examination at the end of Second Year) Computer Science (Paper - VI) : MICROPROCESSS Time : 03 Hours Maximum Marks : 75 Q1) a) What is the difference between an opcode and instruction data [] b) What is a timing diagram [1] c) What are assembler directives [1] d) What is the use of REP prefix [1] e) SHR AX give the output of this instruction [] f) What are the DOS function calls [1] g) What is a linker [1] h) Define a MACRO [1] i) What does G operator perform [] j) What is the function of DAS instruction [] k) What is an Interrupt [1] Unit-I Q) a) Explain the physical address formation in 8086 b) Compare 80186 and 8086 microprocessors (or) Q3) a) Give the significance flags in microprocessor b) With an example explain REPEAT-UNTIL implementation. Unit-II Q4) a) What is the role of stack in calling a subroutine and returning from the routine b) List the differences between a macro and a subroutine. (or) Q5) a) Explain all pseudo-ops and operators of 8086 b) Write a program to move a string of data words from offset 000H to offset 3000H the length of the string is OFH N-3050 P.T.O.

Unit-III (DCS6) Q6) a) Draw a discuss interrupt structure of 8086 b) Write an ALP for delay of 10 sec (or) Q7) a) Explain the address ports in micro computer systems. b) Give the significance of 8085 interrupts Unit-IV Q8) a) Explain the features of dynamic RAM. b) Discuss briefly the architecture of 80188 processor (or) Q9) a) Write short notes on 8087 main coprocessor b) How is data transfer done through DMA XXXX N-3050 --