Anna University–Electromagnetic Theory (EMT)–Nov / Dec 2011 Question Paper

B.E/B.Tech DEGREE EXAMINATION NOVEMBER/DECEMBER 2011
B.E. Electrical and Electronics Engineering
Third Semester
131302 - ELECTROMAGNETIC THEORY
(Regulation 2010)

Time: Three hours
Maximum: 100 marks
Answer ALL QUESTION

PART A -(10X2=20 marks)


1. Given two vectors: P = 3i+5j+2K and Q = 2i-4j+3k Determine the angular separation between them.
2 What is the physical sign1ficaceof curl of a vector field?
3 What is meant by conservative property of an electrostatic field?
4. Give the significant physical differences between Poisson’s and Laplace’s equations.
5. State the conservation of magnetic flux.
6. Define magnetostatic energy density.
7 Find the emf induced in a circuit having an inductance of 700 µH if the current through it varies at the rate of 5000A/sec.
8.Distinguish between conduction and displacement currents.
9.Determine the intrinsic impedance of free space.
10.Define voltage reflection coefficient at the load end of a transmission line.

PART B - (5 x 16= 80 marks)

11. (a) (1) What are the sources and effects of electromagnetic fields ?(4)
 
(ii) Explain the different coordinate systems used to represent field vectors. (12)

Or

(b) State and prove (i). Divergence theorem and (ii) Stroke's theorem (16)

12. (a) (i) State and explain Coulomb’s law of forces. (6)

(ii) Derive the electrostatic boundary conditions at the interface between two dielectrics (10)
 
(b) (i) The relative permittivity ε_r, homogeneous isotropic dielectric material is 3.6 and the material is covering the space between z = O and z = 1. If V= 6000z volts in the material,
Find (1)P  (2) E (3) ρ_s.

(ii) Determine the capacitance of a capacitor consisting of two parallel metal plates 3Ocm x 30 cm surface area, separated by 5 mm in air. What is the total energy stored by the capacitor if the capacitor is charged to a potential difference of 500V? What is the energy density? (8)

13 (a) (ì) Derive an expression for the magnetic field intensity at a point P in a medium of permeability ‘µ’ due to an infinitely long current carrying conductor at a distance r’ meters from the point (10)
.
(ii)If the vector potential is given by A = i5( x²+y²+z²)^-1 Wb/m find the magnetic flux density B. (6)

Or

(b) (i) What is magnetization? Explain the classification of magnetic materials with examples. (10)

(ii) An iron ring with a cross-sectional area of 3cm² and a mean circumference of 15cm is wound with 250 turns of wire carrying a current of 0.3A. The relative permeability of the ring is 1500.
Calculate the flux established in the ring. (6)

14.(a) State and derive the time-harmonic Maxwell’s equations in integral form and point form. Why are Maxwell’s equations not completely symmetrical ? (16)

(b) By means of a simple RLC series circuit, explain the relationship between the field theory and circuit theory. Also explain the limitations of circuit theory. (16)

15. (a) (i) Derive the electromagnetic wave equations in phasor form. (12)

(ii) The current density at the surface of a thick metal plate is 100 A/m². What is the skin depth if the current density at a depth of 0.01 cm is 28A/m²? (4)

Or

(b) (i) How is power flow referred by using Poynting Vector? Explain Poynting’s theorem. Explain its significance. (12)

(ii) What is Standing Wave Ratio? Write the relationship between standing wave ratio characteristic impedance and input impedance of a transmission line. (4)

Anna University– Object Oriented Programming (OOPs)–Nov / Dec 2011 Question Paper

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.

Common to B.E. Computer Science and Engineering I B.Tech. — Information Technology
Third Semester
141303 - OBJECT ORIENTED PROGRAMMING .
(Regulation 2010)

Time : Three hours Maximum: 100 marks

Answer ALL questions.

PART A — (10 x 2 20 marks)

1. What is the difference between a local variable and a data member?

2. Explain the purpose of a function parameter. What is the difference between a parameter and an argument?

3. Explain the multiple meanings of the operators « and » in C++ and their precedence.

4. What is a copy constructor?

5. What is a Function templates? Explain.

6. List five common examples of exceptions.

7. Give the use of protected access specifier.

8. Give the difference between virtual function and pure virtual function.

9. List the file-open modes.

10. What are the three standard template library adapters?

PARTB (5x 16=80 marks)

11. (a) Write brief notes on Friend function and show how Modifying a Class’s private Data With a Friend Function.

Or

(b) Write a C++ program that

(i) calculates and prints the sum of the integers from 1 to 10

(ii) to calculate x raised to the power y.

12. (a) Write a program to overload the stream insertion and stream extraction operators to handle data of a user-defined telephone number class called Phone Number.

Or

(b) (i) Explain ‘+‘ operator overloading with an example. (8)

(ii) Explain type conversion with suitable example (8)

13. (a) Define a DivideBy Zero definition and use it to throw exceptions on attempts to divide by zero.

Or

(b) Write a C++ program to demonstrate function template to print array of different types.

14 (a) Explain different types of inheritances

Or

(b) Demonstrate runtime polymorphism with an example.

15 (a) Write a C++ program that maintains a bank’s account information The program adds new accounts, deletes accounts in a text file. Assume that a file credit.dat has been created and the initial data has been inserted.

Or

(b) Write brief flotes on Standard template Library and Standard Library container classes. (16)

Anna University - MECHANICS OF FLUIDS (MOF)–April / May 2010 Question Paper

B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2010

Third Semester

Civil Engineering

CE2202 — MECHANICS OF FLUIDS (Regulation 2008)

Time: Three hours

Maximum: 100 Marks

Answer ALL Questions

PART A — (10 * 2 = 20 Marks)

1. Define the term continuum.

2. What is the difference between an ideal and a real fluid?

3. Distinguish between path lines, stream lines and streak lines.

4. To what type of flow is the concept of velocity potential and stream function applicable?

5. What are the assumptions made in the derivation of Euler's equation?

6. Sketch the velocity and shear stress distribution for laminar flow of an incompressible fluid through a circular pipe.

7. Give four examples in every day life where formation of boundary layer is important.

8. What are the characteristics of laminar flow?

9. What are the applications of model testing?

10. Enumerate the applications of dimensional homogeneity.

PART B — (5 * 16 = 80 Marks)

11. (a) (i) An open reservoir contains a liquid having density of 1.23 g/cc. At a certain point the gauge pressure is 0.31 atmosphere. At what height above the given point is the liquid level? (8)

(ii) Define Viscosity. Explain the effect of temperature and pressure on viscosity of liquids and gases. (8)

Or

(b) (i) Explain the characteristics of non- Newtonian fluids in detail. (8) (ii) The velocity distribution for flow over a plate is given by u = 2 y – y² where u is the velocity in m/s at a distance y meters above the plate. Determine the velocity gradient and shear stress at the boundary and 0.15 m from it. (8)

12. (a) Derive an expression for the depth of centre of pressure from free surface of liquid of an inclined plane surface submerged in the liquid. (16)

Or

(b) (i) Derive the differential equation of continuity. (8)

(ii) In a two dimensional incompressible flow, the fluid velocity

components are given by

u = x - 4 y and

v = - y - 4x .

Show that velocity potential exists and determine its form as well as stream function. (8)

13. (a) A drainage pump has tapered suction pipe. The pipe is running full of water. The pipe diameter at the inlet and at the upper end is 1 m and 0.5 m respectively. The free water surface is 2 m above the centre of the inlet and centre of upper end is 3 m above the top of free water surface. The pressure at the top end of the pipe is 25 cm of Hg and it is known that loss of head by friction between top and bottom section is one tenth of the velocity head at the top section. Compute the discharge in litre/sec. Neglect loss of head at the entrance of the tapered pipe. (16)

Or

(b) Show that the momentum correction factor and kinetic energy correction factor for laminar flow through a circular pipe are 4/3 and 2 respectively.

(16)

14. (a) Explain what you understand by boundary layer thickness and displacement thickness. Determine the relationship between the two for a boundary layer which is

(i) laminar throughout and

(ii) turbulent throughout.

Assume :

(1) in the laminar boundary layer, the flow obeys the law, shear

where m is the viscosity, which leads to velocity profile

where U is the free stream

velocity, u is the velocity at a distance y above the plate and k is a constant.

(2) the velocity distribution in the turbulent boundary layer is

(16)

Or

(b) Derive an expression for the calculation of loss of head due to

(i) sudden enlargement

(ii) sudden contraction. (16)

15. (a) Describe Buckingham’s p – theorem to formulate a dimensionally homogeneous equation between the various physical quantities effecting a certain phenomenon. (16)

Or

(b) By dimensional analysis, show that the power P developed by a hydraulic turbine is given by

where p – mass density of  liquid, N – rotational speed, D – diameter of runner, H – working head and g – acceleration due to gravity. (16)

——————––

Anna University - Digital Principles and System Design (DPSD) - November / December 2011 Question Paper

B.E/B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.

Common to B.E./B.Tech. Computer Science and Engineering/Information Technology

Third Semester

141302 - DIGITAL PRINCIPLES AND SYSTEMS DESIGN

(Regulation 2010)

Time : Three hours

Maximum : 100 marks

Answer ALL questions.

PART A — (10 x 2 20 marks)

1. Simplify the expression ((AB’ + ABC)’ + A (B + AB’))’.
2. Find the minimum expression of
Y= π (0,1,3,5,6,7,10,14,15).
3. Draw the full adder circuit as a collection of two half adder.
4. A circuit is to be designed that has one control line and three data lines. When the control line is high, the circuit is to detect when one of the data lines has a 1 on it. No more than one data line will ever have a 1 on it. When the control line is low, the circuit will output a 0, regardless of what is on the data lines.
5. The input frequency of a 7497 binary rate multiplier is 64 K Hz. What will its output be if the multiplier word is 1011?
6. Implement a digital circuit that statistics the following:

7. Given a 8 bit data word 01011011, generate the 13 bit composite word for the Hamming code that corrects single errors and detects double errors.

8. Draw a 4- bit binary synchronous counter with D flip flops.

9. Draw a circuit that has no static hazards and implement the boolean function
F (A, B, C, D) = ∑ (0,2,6, 7, 8, 10, 12)
10. Find a critical race free state assignment for the reduced flow table shown.

PART B - (5 x 16 80 marks)

11 (a) Reduce the expressioi using Quine McCluskey method.
F(x1,x2,x3,x4,x5)=∑m(0, 2,4,5,6,7,8,10,14,17,18,21,29,31) + ∑d (11, 20, 22)

Or

(b) Explain the conversion of regular expression into canonical expression and their simplification in SOP and POS forms.

12. (a) Design a combinational circuit that multiplies by 5 an input decimal digit represented in BCD. The output is also in BCD. Show that the outputs can be obtained from the input lines without using any logic gates.

Or

(b) A circuit receives only valid 5211 or 8421 BCD information and provides two output lines X and Y Design the circuit such that X will provide an output anytime a valid 8421 BCD code appears at the input and Y will provide an output anytime a valid 5211 BCD code appears at the input.

13. (a) Implement the following Boolean function with a 4 X 1 multiplexer and external gates. Connect inputs A and B to the selection lines. The input requirements for the four data lines will be a function of variables C and D these values are obtained by expressing F as a function of C and D for each of the four cases when AB = 00, 01, 10 and 11. These functions may have to be implemented with external gates.
FA,B,C,D)= ∑(1,3,4, 11, 12, 13, 14, 15).

Or

(b) Design a combinational circuit that compares two 4 bit numbers A and B to check if they are equal. The circuit has three output x, y, z so that x =1
if A = B and y= 1 if A < B and z=1 if A > B.

14. (a) (i) Reduce the number of states in the state table and tabulate the
reduced state table.           

(ii) Starting from state a of the state table, find the output sequence generated with an input sequence 01110010011.

Or

(b) Design the following non binary sequence counters as specified in each case. Treat the unused states as don’t care conditions. Analyze the final circuit to ensure that it is self correcting If your design produces a non self correcting counter, modify the circuit to make itself correcting.

(i) Design a counter with the following repeated binary sequence: 0,1,2, 3, 4, 5, 6. Use JK flipflops. 

(ii) Design a counter with the following repeated binary sequence: 0,1,2, 4, 6. Use D ffipflops.
(iii) Design a counter with the following repeated binary sequence: 0 1,3,5,7.  UseT flipflops.

15. (a) A traffic light is installed at a junction of railroad and road. The traffic light is controlled by two switches in the rails placed one mut apart on either side of the junction. A switch is turned on when the train is over it and is turned off otherwise.The train light changes from green (logic -0) to red (logic - 1) when the beginning of the train is one mile from the junction. The light changes back to green when the end of the train is one mile away from the junction. Assume that the length of the train is less than two miles.

(i) Obtain the primitive flow table for the circuit.
(ii) Show that the flow table can be reduced to four rows.      

Or

(b) An asynchronous sequential circuit is described by the following excitation and output functions .
Y = x1x2'+(x1 ± x2')y
Z=y

(i) Draw the logic diagram of the circuit.
(ii) Derive the transition table and output map.
(iii) Obtain 2 state flow table.
(iv) Describe in words the behavior of the circuit.

Anna University - MECHANICS OF SOLIDS - 2011 November / December - Question Paper

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER / DECEMBER 2011.

B.E. - Civil Engineering

Third Semester

101301 - MECHANICS OF SOLIDS

(Regulation 2010)

Time : Three hours

Maximum: 100 marks

PART A

1. State the principle of superposition.
2. Write the expression for direct and tangential stress if θ is the inclination of the plane.

3. What is meant by statically determinate structure?
4. What is a thin shell? Give Examples.
5. Define point of inflexion?
6. Define the term simple bending.
7. What are the methods to find slope and deflection of a beam?
8. Sketch the stress distribution of a hollow circular section.
9. What are the assumptions made in the calculation of stresses and deformations due to torsion?
10.Define stiffness of a spring. 

PART B (5x16=80marks)

11. (a) The following results were obtained in a tensile test of mild steel specimen of original diameter 20mm and a gauge length of 40mm. At the limit of proportionality the load was 80kN and the extension was 0.048mm. The specimen yielded at a load of 85kN and the maximum load withstood was l50kN. When the two broken parts were fitted together the length between the gauge markings was found to be 55.6mm and the minimum diameter at the neck was 15.8mm. Calculate (i) modulus of elasticity (ii) stress at the limit of proportionality (iii yield stress (iv) ultimate stress (v) % elongation in length (vi) % reduction in area.

Or

(b) A concrete cube of 150mm side is subjected to three pairs of axial forces on the three pairs of faces along the three mutually perpendicular axes x, y and z axis. The forces along x and z directions are tensile while the force along the y direction is compressive.If Px =54 kN, Py =72 kN and Pz =36 kN, E=12.5kN/nm2, compute the change in volume of the cube.

12. (a) Find the magnitude and nature of the forces in the given truss carrying loads as shown in Fig. 12(a).

(b).A cylindrical shell 3m long has 1m internal diameter and 1.5cm metal thickness. Calculate the maximum intensity of shear stress induced and the changes in the dimensions of the shell if it is subjected to an
internal pressure of 15kg/cm2.Take E=2.04x105 QN/nm2 and µ=O.3.

Or

13. (a) An overhanging beam is loaded as shown in fig. 13(a). Construct the SFD and BMD for the beam. Also, calculate the maximum bending moment and locate the point of contraflexure.

Or

(b) A cast iron test beam 2cm X 2cm in section and 1 long and supported at the ends fails when a central load of 64kg is applied. What uniformly distributed load will break a cantilever of the same material 5cm wide, 10cm deep and 2m long?

14. (a) A cantilever of length L and constant stan flexural rigidity El carries a uniformly distributed load of intensity w unit length on the middle half of its length. Determine the ratio of slope and the ratio of deflection at the centre and freeend of the cantilever.

Or

(b) An I-section has the following dimension and carries a shear force of 16kN. Calculate the shear stress at critical points and plot the shear stress distribution.
Flange dimension in 80mm x 10mm
Web dimension = 100 mm x 10mm.

15. (a) A solid steel shaft has to transmit 100 H.P at 200 rpm. Taking allowable shear stress as N/mm2, find the suitable diameter of the shaft if the maximum transmitted in each revolution exceeds the mean by 30% . Also find the outer diameter of a hollow shaft to replace the solid shaft if the diameter ratio is 0.7.

Or

(b) A carriage spring is built up of 9 plates each 75mm wide and 6.5mm thick Find the length of the spring so that it may carry a central load of 4kN, the stress being limited to 160N/mm2. Also, find the deflection at the centre of the spring. Take E =2xl05 N/mm2.

Anna University - DIGITAL SIGNAL PROCESSING (DSP) - Version 2 - April / May 2008 Question Paper

B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2008.

Fifth Semester

(Regulation 2004)

Electronics and Communication Engineering

EC 1302 -  DIGITAL SIGNAL PROCESSING
(Common to B.E. (Part-Time)
Fourth Semester Regulation 2005)
Time : Three hours

Maximum: 100 marks

Answer ALL questions.

PART A - (10 x 2 = 20 marks)

1. Define the properties of convolution.
2. Draw the basic butterfly diagram of radix - 2 FFT.
3. What are the merits and demerits of FIR filters?
4. What is the relationship between analog and digital frequency in impulse invariant transformation?
5. What are the three types of quantization error occurred in digital systems?
6. What is meant by limit cycle oscillations?
7. What is a periodogram?
8. Determine the frequency resolution of the Bartlett method of power spectrum
estimates for a quality factor Q = 15. Assume that the length of the sample
sequence is 1500.
9. What is meant by pipelining?
10. What is the principal feature of the Harvard architecture?

PART B - (5x16=80marks)

11. (a) (i) Discuss in detail the important properties of the Discrete Fourier Transform. (8)
(ii) Find the 4 point DFT of the sequence (8)

x(n)=Cosnπ/4.

Or

(b) (i) Using decimation-in-time draw the butterfly line diagram for 8 point FFT calculation and explain. (8)

(ii) Compute an 8 point DFT using DIF FFT radix 2 algorithm. (8)
X (n) = {1, 2, 3, 4, 4, 3, 2, 1}

12. (a) (i) Determine the magnitude response of an FIR filter (M = 11) and
show that the phase and group delays are constant (8)

(ii) If the desired response of a low-pass filter is

Determine H (eiw) for M = 7 using a Hamming window.

Or

(b) (i) For the analog transfer function H(s) = 1 

determine  using impulse invariant technique. Assume T = 1s. (6)

(ii) Design a digital Butterworth filter that satisfies the following constraint using bilinear transformation (T = 1s) (10)

13. (a) (i) Discuss in detail the Truncation error and Round-off error for sign magnitude and two’s complement representation. (8)

(ii) Explain the quantization effects in converting analog signal into digital signal. (8)
Or

(b) (i) A digital system is characterized by the difference equation

y(n)= O.9y (n-1)+x(n)

With x (n) = O and initial condition y (-1) = 12. Determine the dead band of the system. (4)
(ii) What is meant by the co-efficient quantization? Explain. (12)

14. (a) (i) Explain the Barlett method of averaging periodograms. (8)
(ii) What is the relationship between autocorrelation and power spectrum? Prove it. (8)

Or

(b) (i) Derive the mean and variance of the power spectral estimate of the Blackman and Tukey method. (8)
(ii) Obtain the expression for mean and variance of the auto correlation function of random signals. (8)

15. (a) (i) Describe the multiplier and accumulator unit in DSP processors. (6)
(ii) Explain the architecture of TMS 320 C5X DSP processor. (10)

Or

(b) (i) Discuss in detail the four phases of the pipeline techniques. (8)
(ii) Write short notes on:
(1) Parallel logic unit (4)
(2) Circular registers. (4)

Anna University - DIGITAL SIGNAL PROCESSING (DSP) - April / May 2008 - Question Paper

B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2008.

Fifth Semester

Electronics and Communication Engineering

EC 333 - DIGITAL SIGNAL PROCESSING

(Common to Bio-Medical Engineering)

Time: Three hours

Maximum: 100 marks
Answer ALL questions.

PART A - (10x2 = 20 marks)

1. Check for linearity and ausa1ity of the system y(n) = Cos wnT.
2. State two properties of Z-transform.
3. Prove that convolution in the time domain is multiplication in the frequency domain.
4. Draw the basic butterfly of DIT - FFT structure.
5. ‘What is limit cycle oscillation?
6. State the advantages and disadvantages of FIR filters.
7. Write the expression for Hanning window.
8. When do you decimate a signal?
9. What is interpolation?
10. What is quantization noise?

Part B

11. (a) (i) Represent the signal y(n) = x(2n)+x(n —1)where x(n) is the input and y(n) is the output. (8)
(ii) Explain the procedure to perform linear and circular convolution. (8)

Or

(b) Explain in detail the steps in the computation of FFT using DIF algorithm. (16)
12. (a) Design a FIR filter with the following characteristics using rectangular
window with M = 7 and determine h (n) (16)

Or

(b) Discuss the various window functions available for constructing linear phase FIR filters. (16)

13. (a) Design Butterworth filter with the following characteristics using bilinear transformation method using T = 1 s. (16)

Or

(b) Explain briefly how Cascade and parallel realization of filters are done. (16)

14. (a) Explain fixed and floating point representation in detail. (16)

Or

(b) Explain the various errors that occur in a DSP system. (16)

15. (a) With a neat block diagram explain decimation and interpolation. (16)

Or

(b) Discuss mean, variance, co-variance of a Discrete Random signal. (16)

Anna University - DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C ++ - April / May 2010 Question Paper

B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2010

Third Semester

Electronics and Communication Engineering

DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C ++

(Regulation 2008)

Time: Three hours

Maximum: 100 Marks

Answer ALL Questions

PART A - (10 × 2 = 20 Marks)
1. How is a class declared in C++?
2. What is a scope resolution operator and how can it be used for global variable?
3. What is meant by binding?
4. How the pointer is implemented in C++?
5. Write any two data structures used in Operating System?
6. What are the representations of Big and small ‘O’ notations?
7. How many trees are possible with 3 nodes?
8. What is a spanning tree?
9. What is the feature of bucket sort algorithm?
10. Define dynamic programming.


PART B  - (5 × 16 = 80 Marks)

11. (a) (i) Give the syntax and usage of the reserved word inline with two examples. (8)

(ii) Explain the importance of constructors and destructors with example. (8)

Or

(b) What is operator overloading? Overload the numerical operators ‘+’and ‘/’ for complex numbers “addition” and “division” respectively. (16)

12. (a) (i) Define friend class and specify its importance. Explain with suitable example. (8)

(ii) Discuss Virtual function and polymorphism with example. (8) Or

(b) (i) Explain the concept of inheritance by considering an example of “vehicle”. (8)

(ii) Explain the operators used for dynamic memory allocation with examples. (8)

13. (a) (i) Explain Priority Queues and how are binary heaps used in that. (8)

(ii) Explain the properties of heap. (8)

Or

(b) (i) Write a C ++ program to implement Stack and its operations PUSH and POP. (10)

(ii) What is hashing? Classify hashing functions based on the various methods. (6)


14. (a) (i) Traverse the tree given below using Inorder, Preorder and Postorder traversals. (10)

(ii) Convert the expression ((A + B) * C - (D - E) ^ (F + G)) to equivalent Prefix and postfix notations. (6)

 

Or

(b) (i) Convert the given graph with weighted edges to minimal spanning tree. (10)

(ii) Write a short note on AVL trees. (6)

15. (a) Explain the algorithm of Quicksort by sorting the following set of numbers as an example:

42 47 52 57 62 37 32 27 22

Or

(b) Describe divide and conquer technique with the help of mergesort. (16)

Anna University - DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ - Nov / Dec 2010 Question Paper

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2010

Third Semester

Electronics and Communication Engineering

DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++

(Regulation 2008)

Time : Three hours Maximum : 100 Marks

Answer ALL questions

PART A — (10 × 2 = 20 Marks)

1. What effects do the visibility labels private, protected and public have on the
members of a class?
2. What are the advantages of operator overloading?
3. What is inheritance? What are its advantages?
4. Define virtual function.
5. Define stack. Mention the operations on stack.
6. What is binary heap? What are its types?
7. What is meant by an adjacency matrix?
8. State the properties of binary search tree.
9. What is sorting? How is sorting essential for data base applications?
10. What is meant by dynamic programming?

PART B — (5 × 16 = 80 Marks)

11. (a) (i) Compare and contrast Structured Programming and Object
Oriented Programming. (8)
(ii) Distinguish between Data Encapsulation and Data Abstraction. (4)
(iii) Mention the purpose of Constructor and Destructor functions. (4)

Or

(b) (i) Explain the control structures of C++ with suitable examples. (12)
(ii) Define function overloading with a simple example. (4)

12. (a) (i) Differentiate inheritance from polymorphism. (6)
(ii) Write a C++ program to illustrate the concept of hierarchical
inheritance. (10)

Or

(b) (i) What is the use of template? Write an overloaded function template
called max( ), which will find the maximum of any two given
integers. (8)

(ii) Explain the exception handling mechanism of C++ in detail. (8)
13. (a) (i) Explain the operations performed on queue in detail. Write a C++
program to implement these queue operations. (10)
(ii) Explain insertion, deletion and replacement of nodes in a heap. (6)

Or

(b) (i) What are the advantages of linked list over array? (4)
(ii) Define Hashing. (2)
(iii) Write a C++ program to implement stack through linked list. (10)

14. (a) (i) Write an algorithm to traverse binary tree level by level, with each
level of the tree being traversed from left to right. (10)
(ii) Explain spanning tree and minimal spanning tree with examples.(6)

Or

(b) (i) Define AVL tree. Explain the operations on AVL tree with
illustrations. (6)
(ii) Explain breadth first search algorithm for the traversal of any
graph with suitable examples. Define time complexity of the
algorithm. (10)

15. (a) (i) Explain heap sort with an illustration. (8)
(ii) Explain the greedy algorithm to find minimum spanning tree. (8)

Or

(b) (i) Explain the insertion sort with its time complexity. (8)
(ii) Explain as to how divide and conquer technique can be applied for
merge sort. (8)

Anna University - DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ - Nov / Dec 2009 Question Paper

Anna University - DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ - Previous Year Question Paper - Nov / Dec 2009 Question Paper

Download :

DS/OOPs QP 2009.pdf  (371 kb)

Anna University - DIGITAL PRINCIPLES AND SYSTEMS DESIGN (DPSD) - April / May 2008 Question Paper

B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2008.

Third Semester

(Regulation 2004)

Computer Science and Engineering .

CS 1202 - DIGITAL PRINCIPLES AND SYSTEMS DESIGN
(Common to Information Technology)
(Common to B.E. (Part-Time) Second Semester Regulation 2005)

Time : Three hours

Maximum : 100 marks
Answer ALL questions.

PART A - (10x2=20marks) .

1. What are minterms?
2. Convert the following function into sum of product form
(AB + C) (B + C’D)
3. Convert the following number from one base to other

(65.342)8 = ( )7

4. What is a priority encoder?
5. What is a demultiplexer?
6. Draw the logic diagram for T FlipFlop.
7. What is the maximum range of a memory that can be accessed using 10 address lines?
8. What is modulo - N counter?
9. What is a hazard in combinational circuits?
10. What are the assumptions that must be made for fundamental mode circuit?

PART B—(5x16=80 marks)

11. (a) Using Tabulation method simplify the Boolean function
F (V, W, X, Y, Z) =∑(O, 1, 8, 11, 12, 15, 20, 21, 22, 24, 29, 31) which has the don’t care conditions d (9, 18, 30). (16)

Or

(b) (j) Simplify the Boolean function using map method:
F (w, x, y, z) = ∑(O, 2, 4, 6,8, 10, 12, 14) (10)

(ii) Perform subtraction on the following numbers using the 9's complement of the subtrahend
(1) 5763-3145
(2) 59-9876
(3) 5200-561. (6)

12. (a) (i) Design a combinational circuit to convert gray code to BCD. (12)

(ii) What are the designprocedures of combinational circuit? (4)

Or

(b) (i) Design a combinational circuit to convert BCD code to Excess-3 code. (12)

(ii) Design a 3 bit Adder. (4)

13. (a) (i) • Implement the Boolean function using 4 : 1 multiplexer
F (W, X, Y, Z) = ∑ (l, 2, 3, 6, 7, 8, 11, 12,14)                              (8)

(ii) A combinational circuit is defined by the functions
F1=∑(1,3,5)
F2=∑(5,6,7) .
Implement the circuit with a PLA having 3 inputs, 3 product terms
and two outputs. (8)

Or

(b) Construct a BCD adder circuit and write a HDL program module for the same. (16)
14. (a) Explain the different types of shift registers with neat diagram. (16)

Or

(b) Design a sequence detector to detect the sequence 101011.

15. (a) An asynchronous sequential circuit is described by the following excitation and output function
X = (Yi Zi’W2) X + (Yi’Z1W’2)
s=x,
(i) Draw the logic diagram of the circuit
(ii) Derive the transition table and output map
(iii) Describe the behavior of the circuit. (16)

Or

(b) Explain essential, static and dynamic hazards in digital circuit. Give hazard-free realization for the following Boolean function. (16)
F(I,J,K,L)= ∑ m(1,3,4,5,6, 7,9, 11, 15)

Anna University - Environmental Science and Engineering (EVS ) - 2011 November / December Question Paper

B.E/B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.

Common to B.E/B.Tech. (Civil Engineering / Computer Science and Engineering / lnformation Technology )

Third Semester

ENVIRONMENTAL SCIENCE and ENGINEERING

(Regulation 2010)

Time : Three hours
Maximum: 100 marks

Answer ALL questions.

PART A - (10 x 2 = 20 marks)

1. What are the effects of HIV / AIDS on environment?
2. What is Human Development Index (HDI)?
3. Distinguish between renewable and non-renewable resources
4. What are producers, consumers and decomposers?

5. What are hotspots biodiversity? Mention criteria for hot spots.

6. What do mean by environment refugees?

7. What are green house gases and greenhouse effect?

8. Define eietic and species diversity.

9. Whatis environmental ethics?

10.What is “E” waste?

PARTB - (5 x l6 = 80 marks)


11. (a) (i) Discuss the Universal model of energy flow in an ecosystems and explain how the flow of energy follows the I and II law of thermodynamics. (8)


(ii) What are ecological pyramids? Explain why in grass land ecosystems the pyramids of numbers are upright while in parasitic food chain it is inverted? (8)

Or


(b) (i) Explain different methods of In-Situ conservation of Biodiversity (8)


(ii) What are the major causes of man-wildlife conflicts? Discuss the remedial steps that can curb the conflict (8)

12. (a) (i) Discuss various sources of marine pollution. How can you prevent pollution of our oceans? (8)
(ii) How are solid waste classified ? Write the sources of urban and Industrial solid wastes. (8)


Or


(b) (i) Briefly describe the sources, effect and prevention of soil pollution (8)
(ii) Explain.the mitigation measures for land slides. (8)

13 (a) Discuss the modern Agriculture and its impacts and problems under the following heads
(i) High yielding varieties (4)
(ii) Fertilizer related problems (4)
(iii) Effect of Pesticides (4)
(iv) Water logging and salinity. (4)


Or


(i) Explain the basic types of soil erosion and agents responsible for soil erosion. What are the conservation practices employed to prevent soil erosion? (16)


14. (a) (i) What do you mean by sustainable measures to attain sustainability. (8)
(ii) Discuss the salient features of
(1) Wild life (protection) Act (4)
(2) Forest (conservation Act). (4)

Or

(b) Discuss the objectives and various measures of wasteland reclamation and development. (16)

15. (a) (i) How can age - structure pyramids serve as useful tool for predicting population growth trends of a nation? Explain with examples. (12)
(ii) What are the impacts of population explosion over the environment? (4)

(b) Discuss the role of Information Technology in Environment and Human health. (16)

Anna University - Electrical Engineering (EE) - 2011 November / December Question Paper

B.E /B.Tech DEGREE EXAMINATION NOVEMBER / December 2011

B.E. - Electronics and Communication Engineering

Third Semester .

ELECTRICAL ENGINEERING

(Regulation 2010)

Time: Three hours

Maximum: l00 marks

Answer ALL questions

PART A (10 * 2 = 20 marks )

1. Distinguish between shunt and series field coil construction in DC machine?
2. What is the necessity of starter in dc motors?
3 What are the applications of step up and step down transformers ?
4. Define regulation and efficiency of the transformer.
5 Why an induction never runs at its synchronous speed ?
6 What is the function of a capacitor in single phase induction motor?
7. What is hunting ? how can it be prevented?
8 What are the advantages of stepper motor ? Give the applications of stepper motor?

9 What are the major electrical equipments used in the power system?

10.How cables are classified according to the voltage?

PART B - (5 x 16=80 marks)

11. (a) (i) Sketch and explain the speed-current, speed-torque and torque-current characteristics of a DC shunt and series motor (8)

(ii) Derive the expression for emf generated in d.c. machine (8)

Or 

(b) (i) Explain in detail about the ward-leonard sistem of speed control of DC motor. (8)

(ii) Draw a neat sketch and explain a 3 point starter. (8)

12. (a) (i) Draw and explain the no load vector diagram of ideal transformer and practical transformer. (8)

(ii) Enumerate the various losses in a transformer. Derive the condition for maximum efficiency. (8)

(b) (î) Derive the of single phase two winding transformers. (6)

(ii) A 250/500 V , 50 Hz single phase transformer gave the following test result:
SC test : 20V, 12  A , 100 W with low voltage winding shorted.
OC test : 250V, 1A , 80 W with high voltage winding shorted.

Obtain the equivalent circuit parameters and draw the equivalent circuit referred to primary.

13. (a) (i)List the differences between squirrel cage and slip ring induction motors (8)

(ii) Derive the torque equation of a three phase induction motor. Sketch the torque-slip characteristics of a 3-phase IM.

b.(i) Discuss the various methods of speed control in a 3-phase IM. (8)

(ii) Explain the working principle of single phase induction motor. Why single phase induction motor is not self starting. (8)

14. (a) (i) Explain the construction and working principle of motor. (8)

(ii) Define voltage regulation. Explain the two methods used to determine voltage regulation of alternators. (8)

Or

(b) Write short notes on:  (16)
(i) reluctance motor.
(ii) stepper motor.
(iii hysteresis motor.

15 (a) (i) Draw the structure of power system with single line representation. Show its essential constituent sections (8)

(ii) What are the advantages and / disadvantages of HVDC Transmission? (8)

Or

(b) (i) Explain in detail various types of insulators and their applications to power transmission. (8)

(ii) Draw the schematic layout of a substation and explain. (8)

Anna University - Data Structure and Algorithm (DSA) - 2011 Nov / Dec Question Paper

B.E / B.Tech DEGREE EXAMINATION NOVEMBER / December 2011

Common to B.E.(EEE/EIE/ICE)

Third Semester

DATA STRUCTURES AND ALGORITHMS

(Regulation 2010)

Time: Three hours

Maximum: 100 marks

Answer ALL questions

PART A - (10*2=2O marks)

1. Define Abstract Data Type.
2. Mention the advantages of representing stacks using linked lists than arrays.
3 State the properties of a binary tree.
4. Draw a directed tree representation of the formula (a + b * c)+ ((d * e ÷ f) * g).
5. In an AVL tree, at what condition the balancing is to be done?
6. What is collision hashing?
7. What do you mean by depth-first traversal?
8. What is mean by topological sorting?
9 Write lown the best,average and worst case complexity of Quick and Merge sort.
IO.State the various asymptotic relations used for denoting Time complexity.

PART B    (5x16 = 80 marks)

11. (a) Explain operations of Doubly linked List in detail with routine of add, delete node from DLL.

Or

(b) Write an algorithm for covert infix expression to postfix expresion with an example of 

(A + (B * C - (D/E^F)* G)*H).

12. (a) (i) Illustrate the construction of tree of a binary tree given its in order and postorder traversal.
in-order:     H D I  J E K B A L F M C N G O
Post-order: H I D J K E B L M F N O G C A

(ii) To find inorder, preorder and postorder for a given tree (6)

Or

(b) Narrate the operation of Binary search tree on searching a node, Insertion node and deletion of a node from binary tree with example.

13. (a) Discuss about AVL Trees

Or

(b) (i) Briefly explain the hash function in detail (6)

(ii) Narrate B-Tree operations. (10)

14. (a)Explain the followiag with algorithm
(i)DFS (4
(ii)BFS (4)
(iii)Kruskal algorithm with example. (8)

Or

(b) Explain Single source path algorithm with an example. Does the algorithm work for paths of negative values? Explain.

15. (a) Explain the following with algorithm
(i) Finduig Maximum and Minimum. (8)
(ii) Binary Search. (8)

Or

(b) Explain how the traveling salesman problem can be solved using greedy algorithm.

Anna University - Data Structure and Algorithm (DSA) - Nov / Dec 2006 - Question Paper

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2006.

Third Semester

Electrical and Electronics Engineering

DATA STRUCTURES AND ALGORITHMS

(Common to Electronics and Instrumentation / Instrumentation and Control Engineering)

(Regulation 2004)

Time : Three hours

Maximum: 100 marks
Answer ALL questions.

PART A — (10 x 2 = 20 marks)

1. What is the purpose of the do-while statement? How does it differ from the
while statement.

2. What is recursion? What advantages is there in its use?

3. State the different application of stack.

4. What is the significance of priority queue?

5. What are the disadvantages of sequential representation of tree over the linked representation?

6. What is the use of threaded binary tree?

7. When is the need of external sort? Give example.

8. Define address calculation sort.

9. What are strongly connected graph? Give example.

10. State any two application of depth first traversal.

PARTB—(5 x 16=80 marks)

11. (a) (i) Name the four storage class specifications are included in C. Explain them with suitable example. (8)

(ii) Write a for ioop that will read the charter type array called text and write the characters backwards into another charter type array called back_text. Assume that the text contains 80 characters. (8)

Or

(b) (i) Write a C program that reads several different names and addresses into the computer, rearrange the names into alphabetic order, and then write out the alphabetize list. Make use of structure variable within the program. (10)

(ii) State the difference between call-by-value and call-by-reference? Give a suitable example. (6)

12. (a) Compare the following with suitable example. (2 x 8 = 16)
(j) Linked list and array
(ii) Singly linked list and Doubly linked list.

Or

(b) i) What are the advantages of circular linked list? Write down the various primitive operations performed on circular linked list. Write the algorithm for insertion of element in the circular linked list. (8)

(ii) Write a C program to perform the following operation on a queue
(1) Insert
(2) Delete and

(3) Display. (8)

13. (a) (i) Write a note on expression tree with suitable example. (6)

(ii) Write a C program to perform following operations in a binary tree.
(1) To search for particular information
(2) To compute number of nodes in a tree. (10)

Or

(b) (i) Write a C pseudo code to create, insert and delete a node recursively in Binary search tree. (10)

(ii) Draw the complete undirected graphs with five vertices. Prove that the number of edges in an n vertices complete graph is n (n -1)/2. (6)

14. (a) (i) Devise an algorithm for an insertion sort. (6)
(ii) What are different types of sorting techniques? Write an algorithm for shell sort and explain it with example. (10)

Or

(b) (i) Write notes on interpolation search with suitable example. (9)

(ii) Why do we say quick sort is an unstable sorting method? Write an algorithm to prove the same. (7)

15. (a) (i) Devise a round robin algorithm. Explain it in detail with a suitable example. (8)

(ii) State the array and the linked representation of graphs with example. (8)

Or

(b) (i) What are the different graph traversal methods? Explain them with example. (8)

(ii) Give an algorithm to find a shortest path in a graph. Explain it with a suitable example. (8)

Anna University - Data Structure and Algorithm (DSA) - May / June 2007 Question Paper

B.E./B.Tech. DEGREE EXAMINATION, MAY/JUNE 2007.

Third Semester

Electrical and Electronics Engineering

DATA STRUCTURES AND ALGORITHMS

(Common to Electronics and Instrumentation Engineering / Instrumentation and Control Engineering)

(Regulations 2004)

Time: Three hours

Maximum: 100 marks

Answer ALL questions.

PARTA—(10x2 =20 marks)

1. Write code for generating fibonacci sequence recursively.

2. How do you access the  address where the element of a matrix, whose index is given, is stored?

3. Justify queue as ADT.

4. Write simple code to traverse through DLL.

5. Construct a binary tree for the following Infix expression: A + B * C/D.

6. Perform post order traversal for the following binary tree:

7. Give examples of sorting techniques that is not based on Divide and Conquer algorithmic technique.

8. What is the best case and worst case complexity of merge sort?
9. What are spanning forests? Discuss.
10. What is an adjacency matrix used for? Discuss.

PARTB—(5x 16=80 marks)

11. (a) How do you implement union, structures and arrays in C? Explain with suitable examples. (6 + 4 + 6)

Or

(b) (i) Write algorithm for reversing the elements of an array (one dimensional). (6)

(ii) Write a C program to find the product of a matrix A and its transpose. (10)

12. (a) (i) Write algorithms for insertion and deletion of nodes in a
(1) Stack (5)
(2) Circular List (5)

(ii) What is a priority queue? State the advantages with reference to implementation. (6)

Or

(b) Define a header node in Doubly Linked List. How do you merge two Doubly Linked Lists into a sing1e one? Compare with Circular Linked List. Write suitable algorithms.

13. (a) What is threaded binary tree? How do you represent binary tree using list? Write algorithms for finding the Kth element. 

Or

(b) (i) Develop a ‘C’ program to implement a binary tree. Discuss how evaluation of expressions are handled using a binary tree structure.  (10)

(ii) What are the applications of binary tree data structure? Explain. (6)

14. (a) Explain algorithms for bubble sort and selection sort. Which one of these outperforms? Why? Discuss.

Or

(b) Describe with suitable algorithms for indexed sequential search, binary search and interpolation search schemes.

15. (a) Describe BFS and DFS methods for graphs with suitable algorithms. How efficiencies are computed?

Or

(b) Write algorithm for finding minimum spanning tree and explain applications. Illustrate the algorithm with typical data of your own.