You are on page 1of 5

M.Phil/Ph.D in Computer Science October, 2010.

RESEARCH METHODOLOGY Time : 2 Hours Maximum Marks: 75

NOTE: Attempt any FOUR questions. All questions carry equal marks. Out of 75 marks, 15 marks are reserved for Term Paper, to be submitted directly. Q.NO.1: Explain briefly goals of research. Frame some abstract and concrete questions for each of the goals. (15) Q.No.2: In respect of scientific approach to theory and practice of research, discuss (i) rational inference (ii) criteria for growth, (iii) propagating action and (iv) intellectual honesty. Further, discuss limits of each of these in conduct of effective research. (15) Q.No.3: Explain the purpose and various techniques for reviewing literature in respect of a research project. (15) Q.No.4: (a) Discuss hourglass analogy for organization of a research report. (b) Discuss briefly the writing style for writing a research report. (8) (7)

Q.No.5: In respect of complexity theory in theoretical computer science, discuss the following (i) P and NP classes (ii) Reducibility (iii) Completeness (15)

badminton and tennis are given as follows: Mohan’s degrees of skill for hockey. explain each of the following concepts with a suitable example: (i) Support of a fuzzy set (ii) Intersection of two fuzzy sets (iii) Concentration of a fuzzy set A (9) Q.M. football.0 John’s degrees of skill for hockey.D in Computer Science October.2(a). 0.1: (a) Explain briefly for what type of applications fuzzy systems are particularly useful? (6) (b) In respect of fuzzy systems. to be submitted directly.P. 2010.No. football.5. find (i) (ii) Degree of skill of Mohan and Abdul together in Hockey Degree of skill of either Abdul or John in Badminton (8) (1) Contd….2: (a) For three sportspersons Mohan. FUZZY LOGIC AND FUZZY SYSTEMS: THEORY. Abdul and John.0.4 Draw a fuzzy graph for the above relation. football. SIMULATIONS AND APPLICATIONS Time : 2 Hours Maximum Marks: 75 NOTE: Attempt any FOUR questions.8. badminton and tennis are respectively 0.0 and 0. above. Q. 15 marks are reserved for Term Paper.2: (b) From Q.7. All questions carry equal marks. 0. football. 0.5. 0. their skills in hockey.. 0. and 0. Q.6.No.Phil/Ph. 1. badminton and tennis are respectively 0.3 Abdul’s degrees of skill for hockey. Out of 75 marks.No.3 and 0.6. badminton and tennis are respectively 0. 2 (7) .NO.

No. Explain the definition with a suitable example. (7) -2- . 0.3 0.8] 0.5: (a) Discuss the problems and limitations of fuzzy systems. controllability and observability.4: (a) Briefly explain similarities between fuzzy set theory and fuzzy logic (5) (b) Explain with suitable examples how fuzzy implication: If A then B may be defined in various ways (10) Q. (8) Q.9 (7) Q. specially in context of stability.7.No.6 0. 0.3: (a) Find out the composition R o S of two fuzzy relations R and S represented by the matrices.No.No.NO. define the cartesian product R× S.5: (b) Briefly discuss Generic categories of fuzzy systems applications.3: (b) For given two fuzzy sets R and S. (8) Q.Q.4. R: S: [ 0.

15 marks are reserved for Term Paper.3: (a) For a given set U = { a. explaining each with a suitable example Q. c. b } and X3 = { c. d } and for a given set X = { b. (1) (15) Contd…. f. e.D in Computer Science October.2: (a) Explain the concepts of (i) Information Table (ii) Inconsistent Table. explain the following concepts with a suitable example for each Equivalence Relation Partition of a Set (8) (10) (5) (7) (i) (ii) Q. d }. Q. c.No. 2 .2: (b) Illustrate the concepts of “ approximation space” and “indiscernibility relation” each with a suitable example. f. All questions carry equal marks..No. g } and a partition R of U defined as follows: R= {X1. Out of 75 marks. to be submitted directly. R). d. X2 X3}. X2 = { a. Q.M. Where X1 = { e. 2010.No.1: (a) Explain the basic idea of Rough Set Theory in respect of its utility (b) In respect of Rough Set Theory. g } .NO. find the following: (i) lower approximation of X in S (ii) upper approximation of X in S (iii) positive region of X in S (iv) boundary region of X in S (v) negative region of X in S with respect to the approximation apace S = (U. b. ROUGH SET THEORY AND ITS APPLICATIONS Time : 2 Hours Maximum Marks: 75 NOTE: Attempt any FOUR questions.Phil/Ph.P.

C and D denote set of condition attributes and decision attributes respectively. each with a suitable example: (i) rough set (ii) roughly definable (iii) internally definable (iv) externally definable (v) totally non-definable (10) _ _ (b) If S (X) and S (X) denote respectively lower approximation and upper approximation of an approximation space S = (U. (7) -(2)- . R) then prove that _ _ S (U) (i) S (U) = _ (ii)S (X) ∪ S_(Y) is a subset of S_ (X∪Y) (5) Q. explain the following concepts.5: (a) Let U denote the universal set.Q. R) as an approximation space.4: (a) For a given set U and an equivalence relation R with S = (U.No. Then define the following concepts (i) (ii) (iii) (iv) dependent subset of C minimum subset of C reduct of C relative reduct of C (8) (b) Discuss some of the important issues that need to be considered when employing rough sets to develop software.No.