181301 TRANSFORMS AND PARTIAL DIFFERENTIAL EQUATIONS Anna University Of Technology Model Question Paper

181301 TRANSFORMS AND PARTIAL DIFFERENTIAL EQUATIONS


.
1 FOURIER SERIES

Dirichlet’s conditions – General Fourier series – Odd and even functions – Half range
sine series – Half range cosine series – Complex form of Fourier Series – Parseval’s
identify – Harmonic Analysis.

2. FOURIER TRANSFORMS

Fourier integral theorem (without proof) – Fourier transform pair – Sine and
Cosine transforms – Properties – Transforms of simple functions – Convolution theorem
– Parseval’s identity.

3. PARTIAL DIFFERENTIAL EQUATIONS

Formation of partial differential equations – Lagrange’s linear equation – Solutions of
standard types of first order partial differential equations - Linear partial differential
equations of second and higher order with constant coefficients.

4. APPLICATIONS OF PARTIAL DIFFERENTIAL EQUATIONS

Solutions of one dimensional wave equation – One dimensional equation of heat
conduction – Steady state solution of two-dimensional equation of heat conduction
(Insulated edges excluded) – Fourier series solutions in cartesian coordinates.

5. Z -TRANSFORMS AND DIFFERENCE EQUATIONS

Z-transforms - Elementary properties – Inverse Z-transform – Convolution theorem -
Formation of difference equations – Solution of difference equations using Z-transform.

TEXT BOOKS

1. Grewal, B.S, ‘Higher Engineering Mathematics’ 40th Edition, Khanna publishers,
Delhi, (2007)
3
REFERENCES
1. Bali.N.P and Manish Goyal ‘A Textbook of Engineering Mathematics’, Seventh
Edition, Laxmi Publications(P) Ltd. (2007)
2. Ramana.B.V. ‘Higher Engineering Mathematics’ Tata Mc-GrawHill Publishing
Company limited, New Delhi (2007).
3. Glyn James, ‘Advanced Modern Engineering Mathematics’, Third edition-Pearson
Education (2007).
4. Erwin Kreyszig ’Advanced Engineering Mathematics’, Eighth edition-Wiley India
(2007).


Question bank collection Click the link below

Model Question Paper 1

Model Question Paper 1 

Model Question Paper 1 

Model Question Paper 1

Model Question Paper 1

Model Question Paper 1

IF365 MOBILE COMMUNICATION Anna University Question Paper APRIL/MAY 2010

DEGREE     :B.E./B.Tech. DEGREE EXAMINATION

SEMESTER : VI 

DEPARTMENT : B.TECH. INFORMATION TECHNOLOGY

SUBJECT CODE : IF365 

SUBJECT    : MOBILE COMMUNICATION

Click Here To Download

EC2252 Communication Theory,Fourth Semester Anna University Question paper Apr/May 2010 regulation 2008

B.E./B.Tech.Degree Examinations,Apr/May 2010

Regulations 2008

Fourth Semester

Electronics and Communication Engineering

EC2252 Communication Theory

Time: Three Hours Maximum: 100 Marks

Answer ALL Questions

Part A - (10 x 2 = 20 Marks)

1. How many AM broadcast stations can be accommodated in a 100 kHz bandwidth
if the highest frequency modulating a carrier i s 5 kHz?
2. What are the causes of linear distortion?
3. Draw the block diagram of a method for generating a narrowband FM signal.
4. A carrier wave of frequency 100 MHz i s frequency modulated by a signal20 sin(200¼ £ 103t):
What i s bandwidth of FM signal if the frequency sensitivity of the modulation is
25kHz=V .
5. When i s a random process called deterministic?
6. A receiver connected to an antenna of resistance of 50­ has an equivalent noise
resistance of 30­. Find the receiver noise ¯gure.
7. What are the characteristics of superheterodyne receivers?
8. What are the methods to improve FM threshold reduction?
9. Define entropy function.
10. Define Rate Bandwidth and Bandwidth e±ciency.

  Part B - (5 x 16 = 80 Marks)

11. (a) (i) Draw an envelope detector circuit used for demodulation of AM and ex-
plain its operation. (10)
(ii) How SSB can be generated using Weaver's method? Illustrate with a neat
block diagram. (6)
OR
11. (b) (i) Discuss in detail about frequency translation and frequency division mul-
tiplexing technique with diagrams. (10)
(ii) Compare Amplitude Modulation and Frequency Modulation.
(6)
12. (a) (i) Using suitable Mathematical analysis show that FM modulation produces
in¯nite sideband. Also deduce an expression for the frequency modulated
output and its frequency spectrum. (10)
(ii) How can you generate an FM from PM and PM from FM?
(6)
OR
12. (b) (i) A 20 MHz is frequency modulated by a sinusoidal signal such that the max-
imum frequency deviation i s 100 kHz. Determine the modulation index
and approximate bandwidth of the FM signal for the following modulating
signal frequencies,
(1) 1 kHz (2) 100 kHz and (3) 500 kHz. (8)
(ii) Derive the time domain expressions of FM and PM signals.
(8)
13. (a) (i) Give a random process, X(t) = A cos(!t+µ), where A and ! are constants
and µ is a uniform random variable. Show that X(t) i s ergodic in both
mean and autocorrelation. (8)
(ii) Write a short note on shot noise and also explain about power spectral
density of shot noise. (8)

OR

13. (b) Write the details about narrow band noise and the properties of quadrature
components of narrowband noise. (16)
14. (a) Derive an expression for SNR at input (SNRc) and output of (SNRo) of a
coherent detector. (16)
2 E3077

  OR

14. (b) (i) Explain pre-emphasis and De-emphasis in detail. (10)
(ii) Compare the performances of AM and FM systems. (6)
15. (a) (i) Find the code words for ¯ve symbols of the alphabet of a discrete memory-
less source with probability f0.4, 0.2, 0.2, 0.1, 0.1g, using Hu®man coding
and determine the source entropy and average code word length. (10)
(ii) Discuss the source coding theorem. (6)

OR

15. (b) (i) Derive the channel capacity of a continuous band limited white Gaussian
noise channel. (10)
(ii) Discuss about rate distortion theory. (6)

CS2354 Advanced Computer Architecture Anna university Question paper for ME(Master of engineering)

M.E/M.Tech DEGREE EXAMINATION, JUNE 2010

First Semester

Computer Science and Engineering

CS9211 – COMPUTER ARCHITECTURE

(Common to M.Tech - Information Technology)

        (Regulation 2009)

Time: Three hours                                                                               Maximum: 100 Marks

                                                     Answer all the questions

                                                    Part A – (10*2=20 Marks)

1.      State the principle of locality and its types.

2.      What are the choices for encoding instruction set.

3.      What is speculation? Give an example.

4.      Mention the effects of imperfect alias analysis.

5.      What is loop unrolling?

6.      Give the uses of sentinel.

7.      Define multiprocessor cache coherence.

8.      What are the approaches used for multithreading?

9.      Which block should be replaced on a cache Miss?

10.  How is cache performance improved?

    Part B – (5*16=80 Marks)

11.  (a)(i)Explain the operations designed for media and signal processing. (10)

    (ii)Explain the ways in which a computer architect can help the compiler writer. (6)

                                                            (Or)

(b)(i)Discuss the addressing modes used for signal processing instructions. (7)

     (ii)Describe the addressing modes and instructions designed for control flow. (9)

12.  (a)Explain the techniques to overcome data hazards with dynamic scheduling. (16)

(Or)

(b)Describe the limitations of Instruction level Parallelism. (16)

13.  (a)(i)Explain the basic VLIW approach used for static multiple issues. (8)

    (ii)Enumerate the crosscutting issues in hardware and s/w speculation mechanisms. (8)

                                                            (Or)

(b)(i)Explain the hardware support for exposing more parallelism at compile time. (8)

    (ii)Describe the basic compiler techniques for exposing ILP. (8)

14.  (a)(i)Describe the design challenges in SMT processors. (8)

    (ii)Discuss the performance of shared memory multiprocessors. (8)

                                                            (Or)

(b)(i)Explain synchronization mechanisms designed for large scale multiprocessors. (9)

    (ii)Discuss the details of memory consistency models. (7)

15.  (a)(i)Explain the concept of miss penalty and out of order execution in processors. (6)

    (ii)Discuss the methods of interface between CPU and memory. (10)

                                                            (Or)

(b)Discuss in detail the different levels of RAID. (16)

CS2354 Advanced Computer Architecture Anna university Model Question Paper

M.E/M.Tech DEGREE EXAMINATION, JANUARY 2010

First Semester

Computer Science and Engineering

CS9211 – COMPUTER ARCHITECTURE

(Common to M.Tech - Information Technology)

        (Regulation 2009)

Time: Three hours                                                                               Maximum: 100 Marks

                                                     Answer all the questions

                                                    Part A – (10*2=20 Marks)

1.      What is hazard? State its types.

2.      Mention the techniques available to measure the performance.

3.      What is dynamic scheduling?

4.      Give the limitation of ILP.

5.      Distinguish between hardware and software speculation mechanisms.

6.      What is static branch prediction?

7.      What are the synchronization issues?

8.      What is multithreading?

9.      Define cache miss penalty?

10.  What is RAID?

                                        Part B – (5*16 = 80 Marks)

11.  (a)How does one classify ISA? Discuss their design issues. (16)

(Or)

(b)What is pipelining? Explain various hazards involved in implementing pipelining. (16)

12.  (a)Explain the instruction level parallelism with dynamic approaches. (16)

(Or)

(b)What is dynamic hardware prediction? Explain it in detail. (16)

13.  (a)Explain the different hardware support for exposing ILP. (16)

(Or)

(b)Explain the different hardware support for more parallelism. (16)

14.  (a)Explain distributed shared memory architecture with necessary life cycle diagram. (16)

(Or)

(b)(i)Differentiate software and hardware multithreading approaches. (8)

   (ii)Explain the models of memory consistency. (8)

15.  (a)How does one reduce cache miss penalty and miss rate? Explain. (16)

(Or)

(b)What are the ways available to measure the I/O performance? Explain each of them in detail. (16)