EC360: SOFT COMPUTING (S5 ECE, 2017 batch) - APJAKTU

Dt. 14.08.2019
Following are VERY IMPORTANT questions bank referred from University question papers. There are three
sections that constitute ‘Theoretical questions’ and ‘Numerical questions’ bank. Please read and practice to
easily understand the ‘Soft Computing’ question patterns.

1. FUZZY LOGIC

Theory Questions (Very Important)

Module I
1. Write note on soft computing & its application. [Ref: Class Note MI/A1, Sivanandam&Deepa(SD)/ page 8]
2. Distinguish between Soft computing and Hard computing. [Ref: Class Note (CN) MI/A1, (SD)/ page 8]
3. List out the advantages, disadvantages, application of FL, NN & GA. [Ref: Class Note MI/A1]
4. Distinguish between classical set and fuzzy set with example. [Ref: Class Note MI/A1]
5. What are the different types of membership functions? [Ref: Class Note M3/B2]
6. Explain the features of membership functions. [Ref: Class Note MI/B2, (SD)/ page 296]
7. What are the different types of basics of crisp set? [Ref: Class Note MI/A1 and MI/B2]
8. What are the different features of classical sets? [Ref: Class Note MI/B2, (SD)/ page 255]
9. List out different operation of classical sets with examples. [Ref: Class Note MI/B2, (SD)/ page 256]
10. What are the properties of classical sets? [Ref: Class Note MI/B2, (SD)/ page 258]
11. List the functional mapping of classical sets? [Ref: Class Note MI/B2, (SD)/ page 258]
12. What is fuzzy set and list its properties. [Ref: Class Note MI/B2, (SD)/ page 260]
13. List out different operation of fuzzy sets with examples. [Ref: Class Note MI/B2, (SD)/ page 261]
14. What are the properties of fuzzy sets? [Ref: Class Note MI/B2, (SD)/ page 263]
15. What the applications of fuzzy logic. [Ref: Class Note MI/B2,]
16. What is the exclude middle law? [Ref: Univ. Ques. paper solution, (SD)/ page 282]
17. Prove De-Morgan’s law for two fuzzy sets A and B. [Ref: Class Note MI/B2]
18. Distinguish between normal/subnormal and convex/non-convex FS. [Ref: Class Note, (SD)/ page 297]
19. What is alpha-cut/ lambda-cut? [Ref: Class Note MI/B2, M3/B2,]
20. List out the crisp relation properties of lambda-cut? [Ref: Class Note MI/B2, M3/B2, (SD)/ page 312]
21. List out the fuzzy relation properties of lambda-cut? [Ref: Class Note MI/B2, M3/B2, (SD)/ page 313]
22. Whether power set can be formed for a fuzzy set. Compare between fuzzy and probability. [Ref: Class
Note MI/B2, M3/B2, (SD)/ page 261]
23. Review questions. [Ref: (SD)/ page 270-271, 309]

Module II
24. Explain Type-2 fuzzy set with an example.
25. What are extension principle and its application?
26. State the Cartesian product of a relation.
27. Define classical relation and fuzzy relation.
[Ref: Class Note M2/A1]
[Ref: Univ. Ques. paper solution]
[Ref: Class Note M2/B2, (SD)/ page 273]
[Ref: Class Note M2/B2, (SD)/ page 274, 279]

“Very Important Series Test & University exams reference questions”

 2

28. Explain the operation and properties of crisp relation. [Ref: Class Note M2/B2, (SD)/ page 276-277]
29. Explain the operation and properties of fuzzy relation. [Ref: Class Note M2/B2, (SD)/ page 281-282]
30. Write a note on fuzzy composition. [Ref: Class Note M2/B2, (SD)/ page 282]
31. Write about the cardinality of crisp and fuzzy relations. [Ref: Class Note M2/B2, (SD)/ page 276, 281]
32. Explain the concept of Fuzzy composition. [Ref: Class Note M2/B2, (SD)/ page 282]
33. Explain the concept of max-min/ max-product composition. [Ref: Class Note M2/B2, (SD)/ page 282]S
34. Review questions. [Ref: (SD)/ page 292-293]

Module III
35. Describe in detail of classical equivalence relation. [Ref: Class Note M3/A1, (SD)/ page 284]
36. Explain the concept of fuzzy proposition and Reasoning. [Ref: Class Note M3/B1, (SD)/ page 348, 352]
37. What is Fuzzification? [Ref: (SD)/ page 298]
38. What is Defuzzification? [Ref: (SD)/ page 313]
39. List out with example different defuzzification methods. [Ref: Class Note M3/B1, (SD)/ page 314-320]
40. What is fuzzy rule system? Explain ‘If and Then’ conditions. *Ref: Class Note M3/B2, (SD)/ page 349]
41. List out the concept of fuzzy implication/ Inference. [Ref: Class Note M3/A1, (SD)/ page 299]
42. With block diagram explain the ‘Fuzzy Inference System (FIS)’. *Ref: CN M3/B1, (SD)/ page 355-358]
43. Compare between Mamdani & Sugeno model. [Ref: Class Note M3/A1, (SD)/ page 358]
44. Develop an FIS (Mamdani & Sugeno) model for controlling temperature in an air-conditioner. [Ref: Class
Note M3/B2, (SD)/ page 372]
45. Review questions. [Ref: (SD)/ page 309, 327, 360-361]

Numerical Questions (Very Important)

1. Related to Fuzzy set, Fuzzy operation, De-Morgan’s law.

a. Solved problems: 2, 5, 9, [Ref: (SD)/ page 264-270, Univ. Q P]
b. Exercise problem: 2, 3, 10 [Ref: (SD)/ page 271-272, Univ. Q P]
2. Related to alpha-cut/ lambda-cut?
a. Solved problems: 1, 2, 3, 4, 5, 6, 7, 8, [Ref: (SD)/ page 320-270, Univ. Q P]
b. Exercise problem: 1, 4, 6, 9 [Ref: (SD)/ page 27293-294, Univ. Q P]
3. Classical equivalence relation.
a. Exercise problem/ University question: [Ref: Univ. Ques. paper solution, (SD)/ page 291]
4. Cartesian products, Fuzzy relation, Max-min composition, Max-product composition.
a. Solved problem/ University question [Ref: Univ. Ques. paper solution, (SD)/ page 286-291]
b. Exercise problem: 2- 9 [Ref: (SD)/ page 293-294]
5. Fuzzification [Ref: Class Note M3/A1, (SD)/ page 305]
6. Defuzzification [Ref: Class Note M3/A1, (SD)/ page 320]
a. Solved problem/ University question: [Ref: Univ. Ques. paper solution, (SD)/ page 325-326]
b. Exercise problem: 10 [Ref: (SD)/ page 328]
7. Fuzzy Inference System, Exercise problem: [Ref: (SD)/ page 361]
 EC360: SOFT COMPUTING (S5 ECE, 2017 batch) - APJAKTU

2. NEURAL NETWORKS

Theory Questions (Very Important)

1. Write the concept on Artificial Neural Networks (ANN). [Ref: Class Note M4/A1, (SD)/ page 11]
2. Discuss the computing technique in ANN from a biological neuron. [Ref: CN-M4/A1, (SD)/ page 12]
3. Draw and explain the mathematical model of neuron along with its activation function. [Ref: Class
Note M4/A1, (SD)/ page 14]
4. List comparison between biological and artificial neuron. [Ref: Class Note M4/A1, (SD)/ page 14]
5. Write a note on evolution of ANN. [Ref: Class Note M4/A1, (SD)/ page 16]
6. Explain different neuron network architecture. [Ref: Class Note M4/A1, (SD)/ page 17]
7. List out classification of different learning methods in ANN. [Ref: Class Note M4/B2, (SD)/ page 20]
8. Differentiate between supervised and unsupervised learning method. [Ref: Class Note M4/B2]
9. What are the different types of activation function? [Ref: Class Note M4/B2, (SD)/ page 22]
10. Explain the architecture of McCulloch-Pitts Neuron. [Ref: Class Note M4/B1, (SD)/ page 27]
11. What is linear separability? Draw and explain the linear separability response for OR, AND, XOR, [Ref:
Class Note M4/B1, (SD)/ page 11]
12. List out the application of Neural Networks. [Ref: Class Note M5/A1]
13. Review questions. [Ref: (SD)/ page 46]

Module II
14. Explain the concept of Perceptron and its learning rule. [Ref: Class Note M5/A1, (SD)/ page 49-52]
15. Draw the flowchart of training using perceptron. [Ref: Class Note M5/A1, (SD)/ page 52-53]
16. Explain the architecture for pattern classification. [v Class Note M5/A1, (SD)/ page 52-53]
17. Write the perceptron training algorithm. [Ref: Class Note M5/A1, (SD)/ page 54-55]
18. Explain the Back-Propagation neural network architecture. [Ref: CN M5/A2, (SD)/ page 54-55]
19. Explain the Back-Propagation learning rule and its algorithm. [Ref: CN M5/A2, (SD)/ page 66-71]
20. Using linearly separability obtain the response for OR function for bipolar inputs and targets. [Ref: CN
M5/A1, (SD)/ page 34-35]
21. What are the different types of Neuro-fuzzy systems? [Ref: Short Note]
22. Review questions. [Ref: (SD)/ page 94-95]

Numerical Questions (Very Important)

1. Implement ANDNOT, NAND and XOR function using McCulloch-Pitts Neuron. [Ref: Class Note M4/B1,
(SD)/ page 36]
a. Exercise problem: 1-6 [Ref: (SD)/ page 33--294]
2. Implement AND and OR function using Perceptron networks for bipolar inputs and targets. [Ref: Class
Note M5/B1, (SD)/ page 81]
a. Exercise problem: 3-5 [Ref: (SD)/ page 83--87]

“Very Important Series Test & University exams reference questions”

 EC360: SOFT COMPUTING (S5 ECE, 2017 batch) - APJAKTU

3. GENETIC ALGORITHM

Theory Questions (Very Important)

1. What is Genetic Algorithms (GA)? Explain with suitable example. [Ref: CN M6/A1, (SD)/ page 386]
2. With a neat flow-chart, explain the operation of Genetics Algorithms. [Ref: CN M6/A1, (SD)/ page 402]
3. Explain in detail various operator involved in GA. [Ref: CN M6/A2, (SD)/ page 405-416]
4. Explain the concept on Roulette wheel and tournament selection. [Ref: CN M6/A1, (SD)/ page 408-9]
5. Explain the various is encoding techniques used in GA. [Ref: Class Note M6/A1, (SD)/ page 405]
6. Explain the concept on Genetic fitness function. [Ref: Class Note M6/A1, (SD)/ page 399]
7. Explain the different concept on Genetic cross-over. [Ref: Class Note M6/A1, (SD)/ page 410]
8. Explain the concept on Genetic parent’s selection, mutation. [Ref: CN M6/A1, (SD)/ page 400, 415]
9. Explain the concept on Genetic survivor selection, termination. [Ref: Class Note M6/A1]
10. Mention the advantage and disadvantage of GA. [Ref: (SD)/ page 461-462]
11. Discuss the application of GA. [Ref: (SD)/ page 462]
12. Write the characteristics of NN-FL, FL-GA, & GA-NN hybrid systems. [Ref: CN M6/A3, (SD)/ page 466]
13. Review questions. [Ref: (SD)/ page 464, 509]

……………………

University Question Pattern

 Question Paper (End semester exam) - Max. Marks: 100; for Time: 3 hours
 The question paper shall consist of three parts.
o Part A covers modules I and II : 15 marks + 15 marks
o Part B covers modules III and IV : 15 marks + 15 marks
o Part C covers modules V and VI : 20 marks + 20 marks
o Each part has three questions uniformly covering the two modules.
o Each question can have maximum four subdivisions.
o In each part, any two questions are to be answered.
 Mark patterns are as per the syllabus with 50 % for theory, derivation, proof and 50% for
logical/numerical problems.

Note: Refer to “Syllabus reference books”, “Course Reference Study Material”, “Short Notes” and “Principles
of SOFT COMPUTING by S.N.Sivanandam & S N Deepa”.

Dr. S. Swapna Kumar

“Very Important Series Test & University exams reference questions”