Loyola College M.Sc. Medical Lab Technology April 2007 Methodology Of Medical Laboratory Research Question Paper PDF Download

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

HP 11

M.Sc. DEGREE EXAMINATION – MEDICAL LAB. TECH.

SECOND SEMESTER – APRIL 2007

ML 2951 – METHODOLOGY OF MEDICAL LABORATORY RESEARCH

 

 

 

Date & Time: 21/04/2007 / 1:00 – 4:00     Dept. No.                                                         Max. : 100 Marks

 

 

Part A                                                (Answer all)                                    10 x 2 = 20

  1. Expand the abbreviations: CIOMS. ICMR, IPR, DBT.
  2. Distinguish biased from unbiased data.
  3. What is central measure of tendency?
  4. What is a reference card? Give a model.
  5. How do you quote a journal and a text book in bibliography? Give two examples.
  6. Distinguish research method from research methodology.
  7. Mention the statement given by WHO for ethics in research.
  8. Define Standard deviation and Standard error with the formulae.
  9. What is meant by citation index?
  10. What are various types of objectives in research?

Part B                                                (Answer any four)                                     4 x 20 = 40

    1. Describe ‘Nuremberg code’ in detail.
    2. Explain the criteria for preparation of project proposal.
    3. Write an account on principles of IPR.
  • In an experiment on immunization of cattle against anthrax, following results were obtained.

Type                                   Affected                             Not affected

—————————————————————————————————-

Inoculated                                22                                        45

Not-inoculated                         44                                        18

—————————————————————————————————-

Calculate Chi-square value (Table value is 3.84 at 5% level of significance).

  1. Explain various types of correlation adopted in research.
  2. Classify types of research in paramedical sciences.
  3. Explain the research process with a flow chart.

Part C                                                (Answer any two)                          2 x 20 = 40

  1. Describe in detail the principles involved in research.
  2. Describe kinds of research program in India and abroad.
  3. Write an essay on Data analysis.
  4. Write an essay on preparation of a manuscript for publication.

 

 

Go To Main page

 

Loyola College M.Sc. Medical Lab Technology April 2007 Immunology Question Paper PDF Download

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – MEDICAL LAB. TECH.

HP 12

SECOND SEMESTER – APRIL 2007

ML 2809 – IMMUNOLOGY

 

 

 

Date & Time: 19/04/2007 / 1:00 – 4:00          Dept. No.                                                             Max. : 100 Marks

 

 

SECTION-A

 

Answer all the Questions:                             (10 x 2 = 20 Marks)

 

  1. What is colonel selection theory?
  2. Draw a neat labeled diagram of Class II MHC molecule.
  3. What are Fab and Fc fragment?
  4. Distinguish the attenuated from inactivated vaccines.
  5. Expand the abbreviations: HAT, HGPRT, RIST.
  6. What is drug induced haemolytic anemia?
  7. Mention the glycoprotein present in the cell wall of the influenza virus.
  8. What is antigenic drift and shift?
  9. Write the principle involved in immunoelectrophoresis.
  10. What is Digeorge’s syndrome?

 

SECTION-B

 

Answer any four of the following:             (4 x 10 = 40 Marks)

 

  1. What is pinocytosis? Describe the innate immune mechanism.
  2. Give an account on secondary lymphoid organs with suitable diagram.
  3. Discuss briefly the types of precipitation reactions.
  4. Mention the different types of vaccines? Explain recombinant vector vaccine preparation.
  5. Describe the structure and the functions of MHC molecules.
  6. Write short notes on Interferon and Tumor necrotic factor.

 

 SECTION-C

 

Answer any two of the following:                 ( 2 x 20 = 40 Marks)

 

  1. Write an essay on different types of immunoglobulins with suitable diagrams.
  2. Describe the Type I, II and III hypersensitivity reactions.
  3. Give a detailed account on autoimmune diseases.
  4. Write notes on: a) ELISA      b) RIA

 

Go To Main page

Loyola College M.Sc. Medical Lab Technology April 2007 Human Physiology Question Paper PDF Download

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – MEDICAL LAB. TECH.

HP 07

THIRD SEMESTER – APRIL 2007

ML 3801 – HUMAN PHYSIOLOGY

 

 

 

Date & Time: 30/04/2007 / 9:00 – 12:00 Dept. No.                                                          Max. : 100 Marks

 

 

Section – A

Answer all the questions                                                                                  10 x 2 = 20

 

  1. Draw the structure of a human tooth and mention the dental formula.
  2. Name the two types of sweat glands.
  3. Distinguish residual volume from Expiratory Reserve Volume.
  4. What is hyposalivation?
  5. What is cardiac cycle?
  6. List the important features of cardiac muscles.
  7. Differentiate the role of ADH from Oxytocin.
  8. What is cooper’s glands.
  9. Mention the functions of CSF.
  10. What are the physiological changes caused by progesterone?

 

Section – B

Answer any four of the following.                                                                   4 x 10 = 40

 

  1. Give an account of the functions of saliva.
  2. What are gastroIntestinal hormones?  Explain gastrin in detail.
  3. Give an account of Lung function test.
  4. Explain Briefly the physiology of transmission of nerve impulse.
  5. Explain briefly about Micturition.
  6. Describe the mechanism of CO2 transport in lungs.

 

Section – C

Answer any Two of the following.                                                                  2 x 20 = 40

 

  1. Give an account of human brain and its functions.
  2. Give an account of the functions of the gonadotropins and their role in reproductive cycle.
  3. Explain in detail the role played by thyroid hormones and their disorders.
  4. Write in detail about the structure and functions of human heart.

 

 

Go To Main page

 

 

Loyola College M.Sc. Medical Lab Technology April 2007 Human Pathogens Question Paper PDF Download

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – MEDICAL LAB. TECH.

HP 13

SECOND SEMESTER – APRIL 2007

ML 2801 – HUMAN PATHOGENS

 

 

 

Date & Time: 17/04/2007 / 1:00 – 4:00         Dept. No.                                                       Max. : 100 Marks

 

 

 

Section A                                (10 x 2 = 20 Marks)

 

Answer all the Questions:

 

  1. Which test can differentiate Salmonella from Shigella?
  2. Enumerate the different pigments produced by Pseudomonas.
  3. Define virus and enumerate their characteristic properties.
  4. Name any four oncogenic viruses.
  5. Differentiate bacteria from fungi.
  6. What are mycotoxins?
  7. Enumerate the lesions produced in amoebiasis.
  8. Name the species of Leishmania pathogenic to man.
  9. What is ascaris pneumonia?
  10. Name any four parasites whose mode of infection is by oral route.

 

Section B                                (4 x 10 = 40 Marks)

 

Answer any four of the following:

 

  1. Discuss briefly the clinical conditions caused by Salmonella.
  2. Discuss the lytic cycle of bacteriophage.
  3. Enumerate the fungi responsible for cutaneous mycosis and explain their pathogenesis.
  4. Enumerate the difference between Plasmodium vivax and Plasmodium falciparum.
  5. Discuss briefly the life cycle of Taenia solium.
  6. Explain the role of various toxins and enzymes produced by Staphylococcus aureus

 

Section C                                ( 2 x 20 = 40 Marks)

 

Answer any two of the following:

 

  1. Discuss in detail about the causative agent, pathogenesis and diagnosis of Diptheria
  2. Write short notes on
  3. a) Mumps b)  Rubella    c)  Small pox   d)  Measles
  4. Explain in detail the role of Candida in causing infection to man.
  5. Write an essay on filariasis.

 

 

Go To Main page

Loyola College M.Sc. Medical Lab Technology April 2007 Histopathology And Essentials Of Lab Question Paper PDF Download

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – MEDICAL LAB. TECH.

HP 01

FOURTH SEMESTER – APRIL 2007

ML 4807 – HISTOPATHOLOGY AND ESSENTIALS OF LAB

 

 

 

Date & Time: 18/04/2007 / 9:00 – 12:00          Dept. No.                                                          Max. : 100 Marks

 

SECTION-A

 

Answer all the Questions:                             (10 x 2 = 20 Marks)

 

  1. What are infiltration and impregnation?
  2. How can mineralized bone be softened for sectioning.
  3. What is PAP smear?
  4. What is meant by vacuum embedding?
  5. Define: a) Honing b) Stropping.
  6. Write the preparation and use of egg albumin.
  7. Mention different types of biopsy.
  8. What is amyloidosis?
  9. Comment on decalcification.
  10. Mention phenyl and Indole group of amino acids.

SECTION-B

 

Answer any four of the following:               (4 x 10 = 40 Marks)

 

  1. Write a short note on mucopolysaccharides and DMAB staining.
  2. Give an account of cryostat sectioning.
  3. Explain the disulfide and sulfhydryl groups of amino acids.
  4. Write the principle, procedure and histological importance of methyl

green-pyronin method.

  1. What is exfoliative cytology? Explain preparation and fixation of cytological

specimen.

  1. Enumerate the problems encountered during section cutting.

 

SECTION-C

 

Answer any two of the following:                             ( 2 x 20 = 40 Marks)

 

  1. Write an essay on different types of fixatives.
  2. What is glycosaminoglycans? Explain the principle, procedure and histological

importance of PAS staining.

  1. Write short notes on : a) Nile blue sulfate stain.
  2. b) Freezing microtome.
  3. Describe in detail any three-lipid identification methods.

 

Go To Main page

Loyola College M.Sc. Medical Lab Technology April 2007 Fluid Analysis Question Paper PDF Download

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

HP 08

M.Sc. DEGREE EXAMINATION – MEDICAL LAB. TECH.

THIRD SEMESTER – APRIL 2007

ML 3800 – FLUID ANALYSIS

 

 

 

Date & Time: 24/04/2007 / 9:00 – 12:00      Dept. No.                                       Max. : 100 Marks

 

 

PART – A

Answer all the questions                                                         (2×10=20 Marks)

 

  1. What is trancellular fluid?
  2. Define osmosis.
  3. What happens when a cell is placed in a hypotonic solution?
  4. What is shake test?
  5. What is the use of Kleinhauer-Boetke stain?
  6. List the functions of CSF.
  7. Define Xanthochromia.
  8. What types of crystals are  seen in synovial fluid  during Gout.
  9. Differentiate transudates from exudates.
  10. List the biomarkers used in sputum analysis for presence of cancer cells.

 

 

PART B

 

Answer any four of the following:                                                            (10×4=40 Marks)

 

  1. Discuss briefly on body fluid compartments .Add a note on the constituents of ICF & ECF.
  2. Enumerate the normal and abnormal findings in amniotic fluid analysis.
  3. What is arthrocentesis ? Explain.
  4. Discuss the complications due to increased intracranial pressure.
  5. Explain the structure of a typical synovial joint.
  6. Describe the structure of ventricles in the brain.

 

PART  C

 

Answer any two of the following:                                                              (20×2=20 Marks)

 

  1. Explain in detail – Polyhydramnios and Oligohydramnios.
  2. What is Osteoarthritis? How is it diagnosed and treated?
  3. Define Clearance. Explain the different clearance tests used to test the function of

kidneys.

  1. Explain Amniocentesis and its analysis and implication of the results.

 

Go To Main page

 

Loyola College M.Sc. Medical Lab Technology Nov 2007 Pharmaceutical Chemistry And Toxicology Question Paper PDF Download

Go To Main page

Loyola College M.Sc. Medical Lab Technology Nov 2007 Molecular Biology Question Paper PDF Download

Go To Main page

Loyola College M.Sc. Medical Lab Technology Nov 2007 Human Psychology Question Paper PDF Download

Go To Main page

Loyola College M.Sc. Medical Lab Technology Nov 2007 Hospital Management Question Paper PDF Download

 

 

Go To Main page

Loyola College M.Sc. Medical Lab Technology Nov 2007 Haematology Question Paper PDF Download

 

Go To Main page

Loyola College M.Sc. Medical Lab Technology Nov 2007 Fluid Analysis Question Paper PDF Download

 

Go To Main Page

Loyola College M.Sc. Medical Lab Technology Nov 2007 Clinical Biochemistry Question Paper PDF Download

 

 

Go To Main Page

Loyola College M.Sc. Mathematics Nov 2006 Algorithmic Graph Theory Question Paper PDF Download

                        LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – MATHEMATICS

AA 26

THIRD SEMESTER – NOV 2006

MT 3806 – ALGORITHMIC GRAPH THEORY

 

 

Date & Time : 01-11-2006/9.00-12.00   Dept. No.                                                       Max. : 100 Marks

 

 

Answer all questions.

 

1(a)(i). Define a graph and reversal of a graph with examples. What do you mean by

symmetric closure?

(OR)

(ii). Define a graphic sequence. Check whether the sequence (8, 8, 6, 5, 5, 4, 3, 3, 2) is

graphic.

(5 marks)

(b)(i). Prove that the complement of an interval graph satisfies the transitive orientation

property.

(ii). State the depth-first search algorithm and simulate it on the following graph by

selecting the vertex a.

 

 

(OR)

 

(iii). Prove that an interval graph satisfies the triangulated graph property.

 

(iv). Obtain a necessary and sufficient condition for a sequence to be

graphic.                                                                                               (3+12 marks)

 

2(a)(i). Define a triangulated graph, a simplicial vertex and a vertex separator with

examples.

(OR)

(ii). What is a perfect vertex elimination scheme? Obtain the same for the following

graph.

 

(5 marks)

 

 

 

(b)(i).Let G be an undirected graph. Then prove that the following statements are

equivalent.

(1). G is triangulated.

(2). Every minimal vertex separator induces a complete subgraph in G.

(ii). Prove that every triangulated graph has a simplicial vertex.

(10+5 marks)

(OR)

(iii). Prove that an undirected graph is triangulated if and only if the ordering produced

by the Lexicographic breadth first search is a perfect vertex elimination scheme.

(iv). Apply the above algorithm for the following graph.

 

(5+10 marks)

 

 

3(a)(i). Define a split graph. Give an example of two non isomorphic split graphs with the

same degree sequence.

(OR)

(ii). Let G be a split graph with the vertex set partitioned into a stable set S and a

clique K. If |S| = α(G) and |K| = ω(G) – 1, then prove that there exists an x ε S

such that K +{x} is a clique.

 

(b)(i). Let G be an undirected graph. Prove that the following statements are equivalent.

(1). G is a split graph

(2). G and  are triangulated graphs

(3). G contains no induced subgraph isomorphic to 2K2, C4 or C5.

(OR)

(ii). Let G be an undirected graph with degree sequence d1 d2 ≥ … ≥ dn and let m =

max {i : di i – 1}. Then prove that G is a split graph if and only if

 

.

(15 marks)

4(a)(i). Define a permutation graph. Draw the permutation graph corresponding to the

permutation [5,6,1,2,4,3,7].

(OR)

(ii). What is a permutation labeling? Illustrate with an example.                       (5 marks)

 

(b)(i). Prove that an undirected graph G is permutation graph if and only if G and

are comparability graphs.

(OR)

(ii). Let G be an undirected graph. Prove with usual notations that a bijection L

from V to {1, 2, 3 … n} is a permutation labeling if and only if the mapping

,  is an injection.

(15 marks)

 

 

 

5(a)(i). Define a circular arc graph.

(OR)

(ii). Obtain an interval representation of the interval graph given below.

 

 

 

(5 marks)

(b)(i). Let G be an undirected graph. Then prove that the following statements are

equivalent.

(1). G is an interval graph

(2). G contains no chordless 4-cycle and its complement  comparability graph.

(3). The maximal cliques can be linearly ordered such that, for every vertex x of

G the maximal cliques containing v occurs consecutively.           (15 marks)

 

(OR)

 

(ii). Define circular 1’s property. Prove that a matrix M has circular 1’s property if and

only if M’ has consecutive 1’s property.

(iii). Prove that an m x n (0, 1) with nonzero entries can be tested for the circulars 1’s

property in O(m+ n +f) steps.                                                                (8+7 marks)

 

 

Go To Main Page

 

Loyola College M.Sc. Mathematics April 2007 Real Analysis Question Paper PDF Download

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – MATHEMATICS

CV 28

FIRST SEMESTER – APRIL 2007

MT 1805 – REAL ANALYSIS

 

 

 

Date & Time: 27/04/2007 / 1:00 – 4:00Dept. No.                                              Max. : 100 Marks

 

 

Answer all the questions. Each question carries 20 marks.

 

  1. (a). (i). Prove that refinement of partitions decreases the upper Riemann Stieltjes sum.

 

(OR)

 

(ii). If f is monotonic on [a, b], and if  is continuous on [a, b], then prove                                that  on [a, b].                                                                      (5)

 

(b). (i). Suppose cn ≥ 0, for n = 1, 2, 3 …, converges, and { sn} is a sequence of

distinct points in [a, b]. If  and f is continuous on [a, b], then prove that .

                  (ii). Suppose that  on [a, b], m ≤  f  ≤ M,  is continuous on   [m,M],and  on [a, b]. Then prove that  on [a, b].                                 (7+8)

 

(OR)

 

(iii). Assume that  increases monotonically and  on [a, b]. Let f be a

bounded real function on [a, b]. Then prove that  if and only if  and in

that case.

(iv). State and prove the fundamental theorem of Calculus.                                            (8+7)

 

  1. (a). (i). Prove that a linear operator A on a finite dimensional vector space X is

one-to-one if and only if the range of A is all of X.

 

(OR)

 

(ii). If  then prove that  and .               (5)

 

(b). (i). Let  be the set of all invertible linear operators on Rk. If

, and  then prove that .

(ii). Obtain the chain rule of differentiation for the composition of two

functions.                                                                                                                  (7+8)

 

(OR)

 

                  (iii). Suppose  maps an open set E Rn into Rm. Then prove that

if and only if the partial derivatives  exist and are continuous on E for , .

(iv). If X is a complete metric space and if  is a contraction of X into X,

then prove that there exists one and only one x in X such that .                 (8+7)

 

 

  1. (a). (i).Show by means of an example that a convergent series of continuous functions

may have a discontinuous sum.

(OR)

(ii). State and prove the Cauchy criterion for uniform convergence.                               (5)

 

(b). (i). Suppose on a set E in a metric space. Let x be a limit point of E

and suppose that . Then prove that converges and that .

(ii). Let  be monotonically increasing on [a, b]. Suppose on [a, b],

for n = 1, 2, …, and suppose that  uniformly on [a, b]. Then prove that      on [a, b] and that.                                                            (8+7)

 

(OR)

(iii). If f is a continuous complex function on  [a, b], then prove that there

exists a sequence of polynomials Pn such that uniformly on [a, b]. (15)

 

  1. (a). (i). Define the exponential function and obtain the addition formula.

(OR)

(ii). If , prove with usual notation that E(it) 1.                     (5)

 

(b). (i). Given a double sequence, i = 1,2,…,  j = 1,2,…, suppose that

and  converges. Then prove that .

(ii). Suppose that the series and converges in the segment

S = (–R, R). Let E be the set of all x in S at which  = . If E has a limit point in S, then prove that for all n.                                                                 (7+8)

(OR)

 

            (iii). State and prove the Parseval’s theorem.                                                                   (15)

 

 

 

 

 

 

 

  1. (a). (i). If f has a derivative of order n at a point x0, then prove that the Taylor

polynomial  is the unique polynomial such that

for any polynomial Q of degree ≤ n.

 

(OR)

 

(ii). Define the Chebychev polynomial Tn and prove that it is of degree n and that

the coefficient of xn is 2n–1.                                                                 (5)

 

(b). (i). State and prove the construction theorem.

(ii). Let where  is a polynomial of degree ≤ n, and let

. Then prove that , with equality if and

only if  where  is the Chebychev polynomial of degree n+1.                                                                                                                                     (8+7)

(OR)

 

(iii). Let x0, x1, …, xn be n+1 distinct points in the domain of a function f and let P

be the interpolating polynomial of degree ≤ n, that agrees with f at these points. Choose a point x in the domain of f and let [a, b] be any closed interval containing the points x0, x1, …, xn and x. If f has derivative of order n+1 in [a, b] then prove that there is a point c in (a, b) such that , where .

 

(iv). If f(x) has m continuous derivatives and no point occurs in the sequence x0,

x1, …, xn more than m+1 times, then prove that there exists one polynomial  Pn(x) of degree ≤ n which agrees with f(x) at x0, x1, …, xn.                                                                                                                                                                                                      (8+7)

 

Go To Main Page

 

 

Loyola College M.Sc. Mathematics April 2007 Probability & Stochastic Processes Question Paper PDF Download

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

AC 36

M.Sc. DEGREE EXAMINATION – MATHEMATICS

SECOND SEMESTER – APRIL 2007

ST 2902 – PROBABILITY & STOCHASTIC PROCESSES

 

 

 

Date & Time: 26/04/2007 / 1:00 – 4:00      Dept. No.                                       Max. : 100 Marks

 

 

PART-A

Answer all the questions.                                                                              10×2=20 marks

 

  1. Define sample space and give an example.
  2. If A is a subset of B, show that P(A)≤P(B).
  3. Define conditional probability.
  4. When three events are said to be mutually independent?
  5. Define normal distribution.
  6. Provide two properties of a distribution function.
  7. Define Markov process.
  8. When a state of a Markov chain is called recurrent and transient?
  9. Define excess life and current life of a renewal process.

10.Write any two applications of stochastic processes.

 

PART-B

Answer any two questions.                                                                             5×8=40 marks

 

11.If 12 fair coins are tossed simultaneously, find the probability of getting

(a) exactly 6 heads  (b) atleast 3 heads  (c) almost 10 heads (d) not more than 5 heads.

 

12.State and prove Boole’s inequality.

 

13.Find the mean and variance of the distribution that has the distribution function

F(x) = 0,          x<0,

= x/8,       0≤x<2,

=x2/16,     2 ≤x<4,

.                                =1,            4 ≤x.

14.Let X and Y have the joint p.d.f.

f(x,y)= 6x2y,    0<x<1,0<y<1,

= 0 ,        elsewhere.

Find (i) the marginals of X and Y.

(ii) P(0<X<3/4, 1/3<Y<2).

 

15.Let the random variables X and Y have the joint pdf

f(x,y) = x+y ,  0<x<1,0<y<1,

= 0,       elsewhere.

Find the correlation coefficient of X and Y.

 

 

  1. Communication is an equivalence relation-Prove.

 

17.Determine the classes and the periodicity of the various states for a Markov chain with

transition probability matrix

 

18.Derive the differential equation for a  pure birth process clearly  stating

the assumptions.

PART-C

Answer any two questions.                                                                          2×20=40 marks.

 

  1. (a) Derive the Poisson process clearly stating the postulates.

(b)Explain different types of stochastic processes.

 

  1. Let f(x1,x2)=21 x12 x23 , 0<x1<x2<1,zero elsewhere,be the joint pdf of X1 and

X2.Find the conditional mean and variance of X1 given X2=x2,  0<x2<1

 

21.A Markov chain on states {0,1,2,3,4,5} has transition probability matrix

 

 

 

(a) Find all classes.

(b) Find periodicity of various states.

(c) Find recurrent states.

(d) Obtain mean recurrence time of states.

 

22.(a) Explain renewal  process in detail.

(b) Derive forward and backward Kolmogorov differential equations for a birth and

death,  process, clearly stating the postulates.

 

 

Go To Main Page

 

Loyola College M.Sc. Mathematics April 2007 Mathematical Statistics – II Question Paper PDF Download

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

AC 56

M.Sc. DEGREE EXAMINATION – MATHEMATICS

FOURTH SEMESTER – APRIL 2007

ST 4900 – MATHEMATICAL STATISTICS – II

 

 

 

Date & Time: 25/04/2007 / 9:00 – 12:00      Dept. No.                                       Max. : 100 Marks

 

 

 

SECTION-A (10 x 2 = 20)

Answer ALL the questions.   Each carries 2 marks.

 

  1. Distinguish between point and interval estimation.
  2. Examine whether the sample variance is a biased estimator of s2 when a random sample of size ‘n’ is drawn from N(m, s2 ).
  3. When do you say that a statistic is a consistent estimator of a parameter?
  4. Distinguish between power function and power of the test.
  5. What is degree of freedom?
  6. Illustrate graphically the meaning of UMPT.
  7. What do you understand by likelihood ratio tests?
  8. Define F statistic.
  1. Define: Markov Chain.
  1. Classify the stochastic processes with respect to time and state space.

SECTION-B  (5 x 8 = 40)

Answer any FIVE questions.  Each carries 8 marks.

 

  1. Let Y1 and Y­2 be two independent unbiased estimators of θ. Let the variance of Y1 be twice the variance of Y2. Find the constants k1 and k2 so that k1 Y1 + k2 Y2 is an unbiased estimator with smallest possible variance for such a linear combination.
  2. State and prove Rao-Cramer Inequality.

 

  1. Let X1, …, Xn be i.i.d., each with distribution having p.d.f.

f(x; θ1, θ2 ) =     (1 / θ2) exp{ – ( x- θ1 ) /θ2},  -θ1 ≤ x< ∞, -∞ <  θ1 <  ∞,  0 <θ2< ∞,

0;  elsewhere.

Find the maximum likelihood estimators of θ1 and θ2.

  1. Let X ≥ 1 be the critical region for testing H0: θ = 1 against H1: θ = 2 on the basis of a single observation from the population with pdf

f(x ,θ) =  θ exp{ – θ x },  0 < x <∞;  0 otherwise.

Obtain  the size and power of the test.

 

  1. Let X1, X2…Xn be iid U(0,q), q>0.  Show that the family of distributions has MLR in X(n).

 

  1. A random sample of size 14 drawn from a normal population provides a sample mean of 3.22mm with an unbiased standard deviation of 0.34mm. Can you conclude at 5% level of significance that it meets the  company’s specification of 2.7mm against more than 2.7mm?  Construct 95% confidence limits for the  population mean.
  2. Let X1, X2,…,Xn be iid N(m,s2). Derive LRT for testing H0: m = m 0 against

H1: m ¹ m0, s2  is unknown.

 

  1. Describe Poisson process.

 

SECTION-C (2 x 20 =40)

Answer any TWO questions.   Each carries 20 marks.

 

  1. a) State and prove factorization criterion for determining sufficient statistics. (12)
  2. b) Show that the first order statistic Y1 of a random sample of size n from the

distribution having p.d.f.

f(x: θ) = e–(x – θ), -¥ < x < ¥, – ¥ < θ < ¥, zero elsewhere,

is a complete sufficient statistic for θ.

Find the unique function of this statistic, which is the unbiased minimum variance

estimator of θ.                                                                                                   (8)

 

  1. State and prove the necessary and sufficient conditions of Neyman-Pearson

Fundamental Lemma.                                                                                    (10+10)

 

  1. a) Let X1,X2 and X3 be a sample of size 3 from Poisson distribution with mean θ.

Consider the problem of testing H0: θ = 2 against H1: θ = 3.  Find the randomized

MPT of level α =0.05.                                                                                      (12)

 

  1. b) Prove or disprove:

“UMPT of level α always exists for all types of testing problems”.

Justify your answer.                                                                                         (8)

 

  1. a) A number is to be selected from the interval (x : 0 < x < 2) by a random process.

Let Ai = {(x : (i-1)/2 < x < i/2}, i = 1,2,3, and let A4 = {x : 3/2 < x < 2}.  A certain

hypothesis assigns probabilities pio to these sets in accordance with

pio = òAi (1/2) (2-x) dx, i = 1,2,3,4.  If the observed frequencies of the

sets Ai, i = 1,2,3,4, are respectively, 30, 30, 10, 10, would Ho be accepted at the

(approximate) 5 percent level of significance ?                                                 (10)

 

  1. b) Consider a Markov chain having state space S = {0,1,2} and transition probability

matrix

 

1/3      1/3       1/3

 

¼        ½          ¼

 

1/6       1/3        ½

 

 

Show that this chain has a unique stationary distribution p and find p.          (10)

 

 

Go To Main page

Loyola College M.Sc. Mathematics April 2007 Functional Analysis Question Paper PDF Download

    LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – MATHEMATICS

CV 58

FOURTH SEMESTER – APRIL 2007

MT 4804 – FUNCTIONAL ANALYSIS

 

 

 

Date & Time: 16/04/2007 / 9:00 – 12:00       Dept. No.                                                       Max. : 100 Marks

 

 

 

Answer all questions.

 

01.(a)   Show that every vector space has a Hamel basis.

(OR)

Prove that a subset S of a vector space X is linearly independent Û for every
subset {x1, x2, …, xn­} of S,  åaixi = 0 Þ ai = 0, for all  i.                  (5)

(b)(i)  Show that every element of X/Y contains exactly one element of z, where Y
and z are complementary subspaces of X.

(ii)  If Z is a subspace of a vector space X of deficiency 0 or 1, show that there is
an f Î X* such Z = Z(f).                                                                 (7 + 8)

(OR)

(iii) Let X be a real vector space.  Let Y be a subspace of X and p be a real
valued function on X such that p(x) ³ 0, p(x + y) = p(x) + p(y) and
p(ax) = a(Px) for a ³ 0.  If f is a linear functional on Y such that
£ p(x) for every  x Î Y, show that there is a linear functional F on X
such that F(x) = f(x) on Y and  £ p(x) on X.                         (15)

 

 

  1. (a) State and prove F-Riesz Lemma.

(OR)

Let X and Y be normed linear spaces and let T be a linear transformation
of X into Y.  Prove that T is bounded if and only if T is continuous.  (5)

(b)  State and prove the Hahn Banach Theorem for a complex normed linear
space.

(OR)

Let X and Y be normed linear spaces and let B(X,Y) denote the set of all
bounded linear transformations from X into Y.  Show that B(X, Y) is a
normed linear space and B(X, Y) is a Banach space, if Y is a Banach space.

(15)

 

 

 

 

 

  1. (a) State and prove Riesz Representation Theorem.

(OR)

Prove that a real Banach space is a Hilbert space iff the parallelogram law
holds in it.                                                                                             (5)

(b) State and prove the Projection Theorem.

(OR)

If X and Y are Banach spaces and if T is a continuous linear transformation
of  X onto Y, then prove that T is an open mapping.                            (15)

 

  1. (a) State and prove Bessel’s inequality.

(OR)

If T is an operator on a Hilbert space X, show that T is a normal Û its real
and imaginary parts commute.                                                          (5)

(b)(i) If T is an operator in a Hilbert space X, then show that

(Tx, x) = 0  Þ T = 0.

(ii)  If N1 and N2 are normal operators on a Hilbert space X with the property
that either commute with adjoint of the other, prove that N1 + N2 and N1N2
are normal.                                                                                     (7 + 8)

(OR)

(iii) State and prove Riesz-Fischer Theorem.                                        (15)

  1. (a) Prove that the spectrum of x, , is non-empty.

(OR)

Define a Banach algebra A, set of regular elements G, set of singular
elements S, and prove that G is open and S is closed.                     (5)

(b)   State and prove the Spectral theorem.

(OR)

Let G be a set of regular elements in a Banach algebra A.               (5)

Prove that f : G ® G given by f(x) = x-1 is a homeomorphism.

 

 

 

Go To Main page

 

 

Loyola College M.Sc. Mathematics April 2007 Functional Analysis Question Paper PDF Download

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

M.Sc. DEGREE EXAMINATION – MATHEMATICS

CV 54

FOURTH SEMESTER – APRIL 2007

MT 4800 – FUNCTIONAL ANALYSIS

 

 

 

Date & Time: 16/04/2007 / 9:00 – 12:00       Dept. No.                                                       Max. : 100 Marks

 

 

Answer ALL questions.

 

01.(a)(i)    Show that every element of  X/Y contains exactly one element of Z,
where Y and Z are complementary subspaces of  a vector space X.

(OR)

(ii)     Prove that a subset S of a vector space X is linearly independent  Û for
every subset  {x1, x2, …, xn} of S,  i.       (8)

 

(b)(i)    Let X and Y be normed linear spaces and let B(X,Y) denote the set of all
bounded linear transformations from X into Y.  Show that B(X, Y) is a
normed linear space and B(X, Y) is a Banach space, if Y is a Banach space.

(OR)

(ii)    Let X be a real vector space.  Let Y be a subspace of X and p be a real
valued function on X such that p(x) ³ 0, p(x + y) = p(x) + p(y) and
p(ax) = a(Px) for a ³ 0.  If f is a linear functional on Y such that

£ p(x) for every  x Î Y, show that there is a linear functional F on X
such that F(x) = f(x) on Y and  £ p(x) on X.                       (17)

 

02.(a)(i)    Show that  a normed vector space is finite dimensional iff the closed and
bounded sets are compact.

(OR)

(ii)  Let X and Y be Banach spaces and let T be a linear transformation of X
into Y.  Prove that if the graph of T is closed, then T is bounded.           (8)

 

(b)(i)  State and prove the Uniform Boundeness Theorem.  Give an example to
show that the uniform boundedness principle is not true for every normed
vector space.                                                                                   (9 + 8)

(OR)

(ii)  If X and Y are Banach spaces and if T is a continuous linear transformation
of X onto Y, then prove that T is an open mapping.                       (17)

 

03.(a)(i)  Let X be a Hilbert space and S = {xa} a Î A  be an orthonormal set in X.

Prove that S is a basis iff it is complete in X.

(OR)

(ii)  If T is an operator on a  Hilbert space  X, then show that

(Tx, x) = 0 Þ T = 0.                                                             (8)

 

 

(b)(i)  State and prove Riesz Representation Theorem

(ii)  If M and N are closed linear subspaces of a Hilbert space H and if P and Q
are projections on M and N, then show that M ^ N Û PQ = O Û QP = 0.

(OR)                                                    (9 + 8)

(iii)  State and prove Riesz – Fischer Theorem.                                      (17)

 

04.(a) (i)  Prove that the spectrum of x, s(x), is non-empty.

(OR)

(ii) Define a Banach Algebra A, set of regular elements G, set of singular
elements S, and prove that G is open and S is closed.                   (8)

 

(b)(i)   Define spectral radius and derive a formula for the same.

(OR)

(ii)   State and prove the Spectral theorem.                                           (17)

 

 

Go To Main page

 

 

 

Loyola College M.Sc. Computer Science April 2007 Visual Basic-Oracle Programming Question Paper PDF Download

LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034

HC 23

M.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE

FIRST SEMESTER – APRIL 2007

CS 1808 – VISUAL BASIC – ORACLE PROGRAMMING

 

 

 

Date & Time: 27/04/2007 / 9:00 – 12:00      Dept. No.                                       Max. : 100 Marks

 

 

Part-A

Answer all Questions                                                                          10 x 2 = 20

 

  1. What is an array?
  2. What is Drag-Drop operation?
  3. Explain OCX and DLL
  4. List out the styles in a toolbar.
  5. What is an Activex component?
  6. How to add a HTML controls to DHTML pages
  7. What is an index?
  8. What is a recursion?
  9. What is a data environment?
  1. Write any two numeric functions in SQL.

 

Part-B

Answer all Questions                                                                          5 x 8 = 40

 

  1. (a) Explain any four project types (or)

(b) Explain any four components in a tool box.

 

  1. (a) Discuss Progress bar (or)
  • Write a program to add a sub nodes using tree views

 

  1. (a) Write a program using VB to create an Activex control (or)

(b) How to send an Email from VB.

 

  1. (a) Write a short note about DML commands                                   (or)

(b) Write a short note about DDL commands

 

  1. (a) Explain the various cursor types                                                   (or)

(b) Generate a report for payroll processing

 

Part-C

Answer any Two Questions                                                                2X20=40

 

  1. Write a short note on
  2. a) Sub procedures
  3. b) Functions
  4. c) Data types
  5. d) Arrays in VB.

 

  1. a) Explain web browser
  2. b) Explain ADO, DAO and RDO.

 

  1. a) How to access a oracle table from VB
  2. b) Explain data reports.

 

Go To Main page

© Copyright Entrance India - Engineering and Medical Entrance Exams in India | Website Maintained by Firewall Firm - IT Monteur