BAMU · Final Year B.E. Computer Science and Engineering · CBCS (2019)
Soft Computing
CSE452 · Semester VIII · 4 credits · CT 20 + theory 80
Unit 1: Soft Computing and Neural Networks
7 hoursSoft versus hard computing and its techniques and applications; biological and artificial neural networks; MP, perceptron and Adaline neuron models; topology and basic learning laws; supervised and unsupervised learning; functional units for pattern recognition.
Examined in the 80-mark end-semester paper
- Soft computing vs hard computing
- Soft computing techniques and applications
- Artificial neuron models
- McCulloch-Pitts, perceptron and Adaline models
- Basic learning laws
Unit 2: Perceptron Learning
7 hoursSingle- and multilayer perceptrons, linear and non-linear separability, error-correction and gradient-descent rules, feed-forward networks and backpropagation, pattern classification and association.
Examined in the 80-mark end-semester paper
- Perceptron learning rule
- Linear separability and multilayer perceptrons
- Backpropagation training
Unit 3: Pattern Association
6 hoursAuto- and hetero-association, feedback networks and the energy function, associative and bidirectional associative memory, the Hopfield network.
Examined in the 80-mark end-semester paper
- Pattern association, classification and mapping
- Associative memory
- Bidirectional associative memory and Hopfield networks
Unit 4: Deep Learning
7 hoursWhy deep learning, the building blocks of a deep network, and an introduction to RNNs and CNNs with an example.
Examined in the 80-mark end-semester paper
- Deep learning: building blocks, CNNs and RNNs
Unit 5: Fuzzy Logic
6 hoursClassical and fuzzy sets, crisp and fuzzy relations, membership functions, fuzzification and defuzzification, fuzzy control.
Examined in the 80-mark end-semester paper
- Fuzzy sets and operations
- Fuzzy relations
- Membership functions and fuzzification
- Fuzzy inference and defuzzification
- Fuzzy logic controllers
Unit 6: Genetic Algorithms and Applications
7 hoursFundamentals and working principle; inheritance, crossover, inversion, deletion, mutation and bit-wise operators; convergence and applications.
Examined in the 80-mark end-semester paper
- Genetic algorithm basics
- Genetic operators: encoding, selection, crossover and mutation
- Convergence of genetic algorithms
- Solving problems with genetic algorithms
Unit contents are summarised from the official BAMU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Marathwada University (BAMU).