DBATU · Third Year B.Tech Information Technology · NEP 2020
Soft Computing
26AF1246PC605 · Semester VI · 3 credits · Continuous assessment 20 + mid-semester 20 + end-semester 60
Unit 1: Artificial Neural Networks I
9 hoursBiological and artificial neurons; bias and threshold; the McCulloch–Pitts model for AND, OR and XOR; supervised, unsupervised and reinforcement learning; gradient descent; activation functions; Hebbian learning, the delta rule and the perceptron's limits.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Artificial neuron model
- McCulloch–Pitts neuron and logic functions
- Learning rules: Hebbian and delta
- Perceptron, Adaline and Madaline
Unit 2: Artificial Neural Networks II
7 hoursThe multilayer perceptron and backpropagation; self-organising feature maps; learning vector quantisation; RBF and Hopfield networks; associative memory; an introduction to deep, convolutional and recurrent networks.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Backpropagation networks
- Kohonen self-organising maps
- Radial basis function networks
- Hopfield networks
- Associative memory
Unit 3: Fuzzy Logic I
7 hoursFuzzy and crisp sets; fuzzy set operations and properties; fuzzy and crisp relations; fuzzy-to-crisp conversion.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Fuzzy sets and relations
- Fuzzy set operations and properties
Unit 4: Fuzzy Logic II
8 hoursMembership functions; inference; fuzzy if–then rules, implications and algorithms; fuzzification and defuzzification; fuzzy controllers and industrial applications.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Membership functions and fuzzification
- Defuzzification methods
- Mamdani and Sugeno inference
- Fuzzy logic controllers
Unit 5: Evolutionary Computation
6 hoursGenetic algorithms: fitness, crossover, mutation and reproduction; rank and rank-space methods; simulated annealing; ant colony and particle swarm optimisation.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Genetic algorithm operators
- Crossover and mutation
- Simulated annealing and tabu search
- Ant colony and particle swarm optimisation
Unit contents are summarised from the official DBATU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Technological University (DBATU).