b.tech. degree examination, december 2008.anucde.info/dec2008qps/38-btcs2.pdf(dcs/dit 211) b.tech....

(DCS/DIT 211)

B.Tech. DEGREE EXAMINATION, DECEMBER 2008.

(Examination at the end of Second Year First Semester)

Computer Science and Information Technology

Paper I — MATHEMATICS — III

Time : Three hours Maximum : 75 marks

All questions carry equal marks.

Answer Question No. 1 compulsorily. (1 15 = 15)

Answer ONE question from each Unit. (4 15 = 60)

1. (a) What are the Dirichlet conditions for the expansion of a function as a Fourier series?

(b) Write the value of nb for ||)( xxf , x .

(c) State whether the function

xxxx

xf0,1

0,1)( is odd or even or nether.

(d) Write the half range sine series for 1)( xf in ),0( .

(e) What is the value of the function at the point of discontinuity?

(f) Find the Fourier sine transform of x1 .

(g) State the shifting property for Fourier transforms.

(h) Define finite Fourier cosine transform.

(i) Express

x

xxf

,00,1)( integral.

(j) If 52)( 3 xxxf , then )(3 xf .

(k) In Simpson's 31 rule, what is the condition on the number of sub intervals?

(l) If 22 xuE x and 1h then xu .

(m) Write the formula for the 4th order Runge-Kutta method.

(n) Find the first approximation to the solution of yxdxdy

, 1)0( y using Picard's method.

(o) Write the standard five point formula.

UNIT I

2. (a) Obtain Fourier series for xxf )( in 20 x .

(b) Find the half range sine series for the function 2)( xxf in the interval x0 .

Or

(c) Expand

20,102,0)(

xx

xf as Fourier series.

(d) If

xx

xxxf

2/,2/0,)( . Find the half range cosine series for )(xf hence deduce

that 85

131

11 2

222

.

UNIT II

3. (a) Find the Fourier sine transform of 0, xe x hence show that 21

sin2

0

edxx

xx .

(b) Solve the following equations by Gauss-Siedel method :

.432

32243

zyxzyxzyx

Or (c) Find the real root of the equation 1cos3 xx using Newton-Raphson method.

(d) Find the Fourier transform of 2/2xe , x .

UNIT III

4. (a) Using Newton's Forward difference formula, find the value of )5(y from the following data :

x : 4 6 8 10 y : 1 3 8 16

(b) Find )0(y from the following table :

x : 0 1 2 3 y : 4 8 15 7

Or (c) Apply Bessel's formula to obtain )25(y given 316)24(,285)20( yy ,

398)32(,354)28( yy .

(d) Estimate the missing term in the following table :

x : 1 2 3 4 )(xf : 0 1 4 —

UNIT IV

5. (a) Given that :

x : 4.0 4.2 4.4 4.6 4.8 5.0 5.2 xlog : 1.386 1.435 1.482 1.526 1.569 1.609 1.648

evaluate dxxlog2.5

4 by Trapezoidal rule.

(b) Using Euler's method, find an approximate value of y corresponding to 4.0x given that

yxdxdy

and 1y when 0x .

Or

(c) Solve the partial differential equation 02 u at the nodal points of the square grid given below using the boundary values as indicated :

1 2 2 2 u1 u2

u3 u4 0

0

2

2

0 0 0 1

——————— (DCS/DIT 212)


(Examination at the end of Second Year 1st Semester)


Paper II — BASIC ELECTRONICS Time : Three hours Maximum : 75 marks

All questions carry equal marks. Answer Question No.1 compulsorily. (1 15 = 15)

Answer ONE question from each Unit. (4 15 = 60)

1. (a) Define ‘Zener Break down’.

(b) What is the function of a Clapper circuit?

(c) Define ‘Rectifier’. What are the different types of rectifiers?

(d) What are the different modes of a transistor?

(e) What are the advantages of FET over BJT?

(f) Define ‘Early Effect’.

(g) Draw the h-parameter model for CE amplifier.

(h) Draw the transfer and drain characteristics of MOSFET.

(i) What is the effect of negative feedback on Bandwidth of amplifier?

(j) What are the materials used for the construction of LED?

(k) Compare conversion efficiencies of class A, class B and class C power amplifiers.

(l) Define CMRR.

(m) Draw the integrator ckt using OPAMP.

(n) What are the advantages of ‘Voltage regulator’?

(o) What is the principle of solar cell? UNIT I

2. (a) Sketch the V-I characteristics of a PN junction diode in forward and reverse biased conditions. Explain how these characteristics vary with temperature. (b) Explain the principle and operation of zener diode.

Or

3. (a) Draw the circuit diagram of Half wave rectifier and explain its operation using its i/p and output waveforms. (b) What are the drawbacks in halfwave rectifier? List the advantages of full wave rectifier.

UNIT II

4. (a) Draw the characteristics (both input and output) of a BJT in CB configuration and explain the shape of the curves and derive the expression to collector current. (b) How the transistor works as an amplifier?

Or

5. (a) Define several stabilization factors that can characterise the stability of an operating point in BJT. (b) Design self bias circuit for CE amplifier having = 99 and S = 5. The other values are VCE = 6 V, VRE = 5.5 V, VCC = 15 V, RC = 2.5 k and VBE = 0.3 V.

UNIT III

6. (a) Draw the circuit diagram of FET and explain its operation. Plot the transfer characteristics and calculate dr, and mg . (b) Explain the principle and operation of a UJT. Sketch its V–I characteristics.

Or

7. (a) Explain principle and operation of RC phase shift oscillator. (b) Define ‘feedback’. What are the advantages of negative feedback? Explain briefly.

UNIT IV

8. (a) What are the specifications of OPAMP? (b) Write about voltage controlled oscillator.

Or

9. (a) Explain principle of operation of cathode ray tube with neat diagram. (b) Write about LED. Draw the V–I characteristics.

—————————

(DCS/DIT 213)

B.Tech. DEGREE EXAMINATION, DECEMBER 2008. (Examination at the end of Second Year First Semester)


Paper III — DIGITAL LOGIC DESIGN


Answer ALL questions. 6. (a) Convert the binary 1101 into radix 6.

(b) Find odd parity fit for 10101101.

(c) Draw the circuit diagram of a half-subtractor.

(d) Draw any one universal gate.

(e) What is hamming distance?

(f) Draw circuit diagram of a ‘D’ flip flop.

(g) Write the excitation table for RS flip flop.

(h) How many flip flops are required to build a Mod N counter?

(i) What is meant by PAL?

(j) Solve : (1431)8 to decimal. (k) 1984 of decimal into octal.

(l) Define dynamic memory.

(m) Realise a NOR function using only NAND gates.

(n) Distinguish between a combinational and sequential circuit.

(o) Define RAM.

UNIT I

7. (a) Simplify the following Boolean expressions to a minimum number of literals :

(i) yxxyyx

(ii) zyxzxxyx .

(b) Obtain the simplified expression for

)15,14,11,9,8,7,5,4,3,1(2),,,( mzyxwF .

Or

8. (a) Describe product of sum minimizations.

(b) Obtain the simplified expressions in product of sums

)11,10,4,3,2,1,0(),,,( DCBAF .

UNIT II

9. (a) Implement a full subtractor with two half subtractors and an OR gate.

(b) Design a seven segment display decoder.

Or

10. (a) Briefly explain the operation of a multiplexer.

(b) Realize a 3-bit comparator.

UNIT III

11. (a) Explain the function of a RS flip flop.

(b) What is a race-around condition? How is it overcome in a J-K master slave flip flop.

Or

12. (a) Design a three-fit ripple counter using J-K flip flops.

(b) Write notes on shift registers.

UNIT IV

13. (a) Distinguish between PAL and PLA.

(b) Explain with a neat timing diagram to write data into a RAM.

Or

14. (a) Explain about RAM and ROM.

(b) Design a synchronous BCD counter with JK flip flops.

———————

(DCS/DIT 214) B.Tech. DEGREE EXAMINATION, DECEMBER 2008. (Examination at the end of Second Year First Semester)

Computer Science and Information Technology Paper IV — DATA STRUCTURES


Answer Question No. 1 compulsorily. (1 15 = 15) Answer ONE question from each Unit. (4 15 = 60)

15. (a) Define Abstract Datatypes.

(b) Define time complexity.

(c) Write the time complexity of quick sort.

(d) Transform postfix expression to infix expression ABC .

(e) Difference between queue and circular queue.

(f) What are the applications of stack?

(g) Define Binary Search Tree.

(h) Distinguish between sorting and searching.

(i) Define B trees.

(j) Construct binary search tree for the data elements :

wk 7

20, 5, 30, 4, 45, 36, 21, 11, 16

(k) Representation of an AVL tree.

(l) Define shell sort.

(m) Define splay trees.

(n) Define dequeue.

(o) Distinguish between linked list and an array.

UNIT I

16. (a) Write a routine to merge two single linked lists as one single linked list.

(b) Write a ‘C’ program for add two polynomials.

Or

17. (a) Write a ‘C’ functions for double linked list operations.

(b) Write a ‘C’ function for insertion operations in a single linked list.

UNIT II

18. (a) Write a ‘C’ program for evaluation of post fix expression.

(b) Write a set of routines to implement queue operations using linkedlist.

Or

19. (a) Explain the conditions under which sequential search of a list is preferred over binary search.

(b) Write a ‘C’ function for linear search. What is the time complexity for this?

UNIT III

20. (a) Write a ‘C’ program for quick sort algorithm.

(b) By using merge sort algorithm sort the elements 310, 285, 179, 652, 351, 423, 861, 254, 450, 520.

Or

21. (a) Write a ‘C’ program for Bucket Sort.

(b) Write a ‘C’ program for Heap Sort and estimate its time complexity.

UNIT IV

22. (a) What is Binary tree? Explain Binary tree traversals.

(b) Construct the expression tree for acabbX 25.042 .

Or

23. (a) Explain splaying trees with example.

(b) Write a ‘C’ program for deletion from a B-tree.

—————— (DCS/DIT 215)


(Examination at the end of Second Year First Semester)


Paper V — OBJECT ORIENTED PROGRAMMING

Time : Three hours Maximum : 75 marks Answer ALL questions.

24. (a) List the major parts of a C++ program.

(b) Define Ternary operator.

(c) Define Type conversion.

(d) What is an object?

(e) Define pure virtual function.

(f) What is a destructor?

(g) What is inheritance? Give example.

(h) Define overloading.

(i) Define Abstract Data Types.

(j) Define friend function and give example.

(k) What is the difference between template macro?

(l) What is an exception? List the keywords used in Exception Handling.

(m) What is an abstract base class?

(n) List any four files open mouces.

(o) What is the difference between C and C++?

UNIT I

25. (a) What is the difference between object oriented programming and procedure oriented programming?

(b) Explain C++ operators.

Or

26. (a) What is constructor? Explain various constructors and their advantages.

(b) Explain function overloading and operator overloading with example.

UNIT II

27. (a) What is the difference between overloading and overriding?

(b) Explain the overloading of unary operators with examples.

Or

28. (a) What are the advantages and disadvantages declaring inheritance?

(b) Explain the following with syntactic ruler :

(i) Public Inheritance.

(ii) Protected Inheritance.

(iii) Private Inheritance.

UNIT III

29. (a) What are Input and Output streams? Explain.

(b) Write a program in C++ to merge two files into a one file heading.

Or

30. (a) Explain about various IO manipulators.

(b) Explain how dynamic allocation using new and delete be performed with an example.

UNIT IV

31. (a) What is template? Explain various templates with example.

(b) What are the advantages and disadvantages of templates?

Or

32. (a) What is an exception? Explain exception handling mechanism is C++ with example.

(b) Explain casting operators.

——————— (DCS/DIT 216)

B.Tech. DEGREE EXAMINATION, DECEMBER 2008. (Examination at the end of Second Year First Semester)

Computer Science and Information Technology Paper VI — ENVIRONMENTAL STUDIES


Answer ALL questions. All questions carry equal marks.

33. Explain the following in 1 or 2 sentences :

(a) Define environment.

(b) What are autotrophs?

(c) What is the importance of forests?

(d) What are the advantages and disadvantages of nuclear power?

(e) Mention hot spots of biodiversity in India.

(f) What is the importance of ozone in stratosphere?

(g) What is the difference between primary air pollutants and secondary air pollutants?

(h) What are the sources of indoor air pollution? (i) Mention two water conservation practices.

(j) Define watershed.

(k) What is the significance of Ralegaon Siddhi?

(l) What is EIA?

(m) What are the impacts of modern agriculture?

(n) What is WCED?

(o) What are the uses of biodiversity?

UNIT I

34. Explain the advantages and disadvantages associated with the construction of dams.

Or

35. Distinguish between renewable and non-renewable energy resources.

UNIT II

36. Explain In-situ and Ex-situ conservation of biodiversity.

Or

37. Write in detail about forest ecosystem.

UNIT III

38. Discuss the strategies for sustainable development.

Or

39. What is the need for environmental education? Discuss.

UNIT IV

40. Explain the salient features of environmental Protection Act.

Or

41. Write about :

(a) Florosis in Andhra Pradesh and

(b) Chipko Movement.

——————— (DCS/DIT 224)


(Examination at the end of Second Year Second Semester)

Computer Science/Information Technology

Paper IV — DISCRETE MATHEMATICAL STRUCTURES


All questions carry equal marks.

Answer Question No. 1 compulsorily.

Answer ONE question from each Unit.

1. (a) Prove that the empty set is unique.

(b) Write the following statement in predicate calculus :

There is a shop in every street.

(c) Prove that if R is an antisymmetric relation on A so is 1R .

(d) How many ways are there to distribute 10 different books among 15 people if no person is to receive more than 1 book?

(e) Find the number of non-negative integral solutions to 1054321 xxxxx .

(f) The number of r-permutations of a set of n objects with repetition allowed in is ————————.

(g) What is a fuzzy set?

(h) Define Fibonacci number.

(i) Write the general solutions to 033 321 nnnn aaaa .

(j) Draw Hasse diagram of the poset )1,( 12D , where 12D is the set of all divisors of 12.

(k) Write the adjacent matrix of the following graph :

(l) What is the generating function for the sequence 1, –2, 3, –4 .......?

(m) What are the in degrees of the vertices in the graph G displayed in the given figure?

(n) Consider the graph in the given figure and find all of the simple directed paths from a to d.

(o) Find the greatest and least elements in the poset )1,( 24D where 24D is the set of all divisors of 24.

UNIT I

2. (a) Verify whether the following is a tautology or not?

)()()( RPQPRQP .

(b) Prove that the following argument is valid wherein C is a specified element of the universe.

)()(, xqxpx

)()(, xrxqx

)(

)(cp

cr

.

Or

(c) Prove or disprove the validity of the following argument.

Every living thing is a plant or an animal

¬ ¬

David's day is alive and it is not a plant.

All animals have hearts.

Hence, David's dog has a heart.

(d) Prove by equivalence :

Two integers a and b have the same remainder divided by the positive integer n iff the integer ba is divisible by n.

UNIT II

3. (a) Prove by mathematical induction :

For each integer nnnn 23 1,2 .

(b) Consider nx)21( to prove

nn nnCnCnCnC 3),(2)2,(2)1,(2)0,( 2 .

Or

(c) How many binary sequences are there of length 15?

(d) Find the number of integer solutions to the equation :

2054321 xxxxx where 6,4,2,3 4321 xxxx and 05 x .

UNIT III

4. (a) Find r, given that .2 100101 FFFr

(b) Give the sequence merge (A, B) where 101,100,95,24,1A and 102,101,97,93,24,1B . Show how it is defined in terms of the merges of another sequences.

Or

(c) Solve 08126 321 nnnn aaaa by generating functions for 3n .

(d) Find a general expression for a solution to the recurrence relation nnnn aaa 465 21

for 2n .

UNIT IV

5. (a) On the set of all integers, z, the relation R is defined by Rba ),( if and only if 22 ba is an even integer. Show that R is an equivalence relation.

(b) Draw the Hasse diagram for he poset ),),(( SP where }4,3,2,1{S .

Or

(c) Let ],[ A be poset where A is a finite set. Prove that A contains at least one maximal element and at least one minimal element.

(d) Find the transitive closure of the following relation R by Warshall's algorithm, where ),(),,(),,(),,(),,(),,( edecdccbbaaaR

————————

b.tech. degree examination, december 2008.anucde.info/dec2008qps/38-btcs2.pdf(dcs/dit 211) b.tech....

Documents