Code: 9A15705 B.

Tech IV Year I Semester (R09) Regular Examinations November 2012

1
SOFT COMPUTING
(Computer Science & Systems Engineering)

Time: 3 hours Answer any FIVE questions All questions carry equal marks *****

Max. Marks: 70

1. (a) State and explain the water jug problem? Give the solution. (b) Discuss the meaning of The first requirement of a good control strategy is that it causes motion. 2. (a) Explain how knowledge can be represented using declarative and procedural representations. Give examples. (b) Compare Forward Vs Backward reasoning. 3. (a) Discuss how Neural Networks can be viewed as directed graphs. (b) Explain in detail the applications of ANNs. 4. (a) Discuss about the self organization network. (b) Describe the architecture of counter Propagation Network. 5. (a) Explain in detail the special features of ART 1 Model. (b) Enumerate the applications of Adaptive Resonance Theory (ART)? 6. Let X = {1,2,3,,10}. Determine the cardinalities and relative cardinalities of the following fuzzy sets. (a) A~ = { (3, 10), (4,0.2), (5, 0.3), (6, 0.4), (7, 0.6), (8, 0.8), (10, 1), (12, 0.8), (14, 0.6)} (b) B~ = { (2, 0.4), (3, 0.6), (4, 0.8), (5, 1.0), (6, 0.8), (7, 0.6), (8, 0.4)} (c) C~ = {(2, 0.4), (4, 0.8), (5, 1.0), (7, 0.6)} Write a short notes on (a) Fuzzy vectors (b) Fuzzy measures (c) Fuzzy integrals

7.

8. (a) Explain knowledge base in fuzzy logic control system. (b) Explain different fuzzification and defuzzification methods of fuzzy logic control system.

*****

Code: 9A15705 B.Tech IV Year I Semester (R09) Regular Examinations November 2012

2
SOFT COMPUTING
(Computer Science & Systems Engineering)

Time: 3 hours Answer any FIVE questions All questions carry equal marks ***** 1.

Max. Marks: 70

Describe with necessary diagrams, a suitable state representation for 8 puzzle problem and explain how the problem can be solved by state space search. Show how heuristics can improve the efficiency of search. Explain constraint satisfaction with the help of the following a crypt arithmetic problem. + S E N D M O R E -------------------------------------------M O N E Y --------------------------------------------

2.

3. (a) Unsupervised learning can be implemented in an off line or on line fashion. Discuss the physical implementations of these two possibilities. (b) Distinguish between supervised and unsupervised learning. 4. (a) What is a stochastic network? Discuss the operation on stochastic network. (b) Explain Boltzmann machine learning algorithm for binary units. 5. (a) Write the differences between Fuzzy verses Crisp sets. (b) Given three sets A, B and C, prove De Morgans laws using Venn Diagrams? 6. (a) Explain the different memberships function used in fuzzy sets. (b) Give possible reasons for triangular membership functions being used, particularly when the height of intersection of each two successive fuzzy sets is equal to one-half. 7. 8. Explain construction and working principle of Fuzzy Inference Systems (FIS). Explain step by step procedure in designing of a fuzzy logic controller. *****

Code: 9A15705 B.Tech IV Year I Semester (R09) Regular Examinations November 2012

3
SOFT COMPUTING
(Computer Science & Systems Engineering)

Time: 3 hours Answer any FIVE questions All questions carry equal marks *****

Max. Marks: 70

1. (a) Give a good state space representation for missionaries and cannibals problem. (b) What are the chief characteristics of production system? 2. Consider the following sentences: i. John likes all kinds of food ii. Apples are food iii. Chicken is food iv. Anything anyone eats and isnt killed by is food v. Bill eats peanuts and is still alive vi. Sue eats everything Bill eats (a) Translate these sentences into formulas in predicate logic. (b) Convert the formulas of part a into clause form (c) Prove that John likes peanuts using resolution.

3. (a) State and prove perceptron convergence theorem. (b) Explain the limitations of perceptron. 4. (a) What are the salient features of the Kohonens self organizing learning algorithm. (b) What is an associative memory? Discuss the requirements of an associative memory. 5. (a) Distinguish between content addressable and address addressable memories. (b) What is meant by stability plasticity dilemma? (c) Sketch the information flow diagram of ART networks. 6. What is fuzzification & defuzzification? Explain the different defuzzification methods in detail.

7. (a) What are the steps involved in decision making process. (b) Differentiate between individual decision maker and multi-person decision maker. 8. Design and develop a pressure process control by FLC model. Formulate necessary membership functions and required fuzzy rules for the application.

*****

Code: 9A15705 B.Tech IV Year I Semester (R09) Regular Examinations November 2012

4
SOFT COMPUTING
(Computer Science & Systems Engineering)

Time: 3 hours Answer any FIVE questions All questions carry equal marks ***** 1.

Max. Marks: 70

Explain AO* algorithm with an example. What is the significance of Hill Climbing?

2. (a) Explain forward and backward chaining in propositional logic. (b) Consider the following axioms. P (P ^ Q) R (SVT) Q T Prove R using resolution in propositional logic. 3. (a) Explain back propagation algorithm and derive expressions for weight update relations? (b) Explain about the performance of the back propagation learning algorithm? 4. (a) Discuss the issues in Boltzmann learning. (b) What is adaptive vector quantization and learning vector quantization? 5. (a) Explain the characteristics of ART. (b) Explain the ART training algorithm. 6. (a) Discuss in detail about different membership functions of fuzzy logic. (b) Discuss about fuzzy sets algebraic operations and fuzzy relations. 7. (a) Discuss fuzzy Bayesian decision making in detail. (b) What are the advantages of fuzzy Bayesian decision making process? 8. (a) What are genetic algorithms? How genetic algorithms are different from traditional algorithms. (b) Write a short note on crossover algorithms.

*****