Scribd Logo
Upload

Welcome to Scribd!

  • Applied Maths For Electronics Engineers June 2013

    Uploaded by

    Kanaga Varatharajan
    482 views1 page
    1. This document appears to be an exam question paper that contains 10 questions. 2. The first 5 questions ask about applications of fuzzy logic, solving systems of equations using least squares method, the shifter QR algorithm, probability density functions, and finding moments of random variables. 3. The last 5 questions define dynamic programming, state Bellman's principle of optimality, give Little's formula in queueing theory, and ask about Kendal's notation for representing queueing models.

    Original Description:

    Original Title

    Applied Maths for Electronics Engineers June 2013 (1)

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. This document appears to be an exam question paper that contains 10 questions. 2. The first 5 questions ask about applications of fuzzy logic, solving systems of equations using least squares method, the shifter QR algorithm, probability density functions, and finding moments of random variables. 3. The last 5 questions define dynamic programming, state Bellman's principle of optimality, give Little's formula in queueing theory, and ask about Kendal's notation for representing queueing models.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    482 views1 page

    Applied Maths For Electronics Engineers June 2013

    Uploaded by

    Kanaga Varatharajan
    1. This document appears to be an exam question paper that contains 10 questions. 2. The first 5 questions ask about applications of fuzzy logic, solving systems of equations using least squares method, the shifter QR algorithm, probability density functions, and finding moments of random variables. 3. The last 5 questions define dynamic programming, state Bellman's principle of optimality, give Little's formula in queueing theory, and ask about Kendal's notation for representing queueing models.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    I Question Paper Gode : 71436

    lVt.E.DEGREE EXAMINATION, JUNE/JULY 20'13. First Semester Applied Electronics MA 9217/MA 908/UMA 9125 - APPLIED MATHEMATICS FOR ELECTRONICS ENGINEERS (Common to M.E. VLSI Design, M.IP. Medical Electronics, M.E. VLSI Design and Embedded Systems and M.E. Bio Medical Engineering) (Regulation 20'0'9)
    Time : Three hours Statistical tables beermitted. Maximum : 10'0'marks

    Answer ALL questions.


    PART A - (10' x 2 = 20' marks)
    1.

    Find the complement of a fuzzy set F = {OA Ram, 0'.6 Sita, 0'.8 Jyot, 0'.9 Raj} Name some applications of fuzzy logic. State the least square method to solve a system of equations in matrix theory. Give the shifter QR algorithm. If X has the probability density function f{x) and p[O.!) $,X $,1].
    , \ *

    2. 3. 4. 5.

    = Ke -3x , x > 0', find

    the value of K

    6. 7. 8. 9. 10.

    . A continuous random variable X has probability f{x) = 2(1- x) 0' < x < 1. Find the rth moment about origin.
    J

    density

    function

    Define dynamic programming. State Bellman's principle of optimality. Write Little's formulae in queueing theory. Give Kendal's notation for representing queueing models.

    You might also like