MCA 237 Soft Computing Notes from Unnati Educations cover all 4 units of this GGSIPU MCA Semester 3 Core Elective III paper in 71 pages: fuzzy sets, fuzzy logic controllers, genetic algorithms and neural networks, with 31 solved examples, 94 short answers and 50 long-answer questions, mapped to the syllabus for A.S. 2025-26 onwards.
Written by Prateek Talwar, Founder, Unnati Educations · Reviewed by Ritik Rawat, B.Tech, Senior Full Stack Developer · Checked against MCA Scheme of Examination and Detailed Syllabus (A.S. 2025-26), 13 October 2026 · Updated 14 October 2026 · Editorial policy
Scheme: MCA, A.S. 2025-26 | Applies to: session 2025-26 onwards | Verified against: MCA Scheme and Detailed Syllabus, 01 Aug 2025
MCA 237 Soft Computing at a glance: GGSIPU MCA Sem 3 credits, units and exam pattern
MCA 237 is one of eleven Core Elective III options, taken alongside the other GGSIPU MCA Semester 3 papers.
| Code and title | MCA-237 Soft Computing |
|---|---|
| Course and semester | Master of Computer Applications (MCA), Semester 3 |
| Category and credits | Core Elective III · 3 credits · L 3, T/P nil · 10 hours per unit |
| Marks | Out of 100, pass mark 40; internal and end-term split not printed in the official PDF |
| End-term pattern | Compulsory Q1 (objective or short answers, whole syllabus) 12 marks, then one of two questions per unit at 12 marks each (12 + 48 = 60 marks) |
| Units | 4 (untitled in the official PDF) |
| Applies to | Academic session 2025-26 onwards |
| Verify on ipu.ac.in | Official MCA syllabus PDF (MCA-237 on pages 145 to 147) |
| Paired lab | MCA-267 Lab based on Core Elective III (Soft Computing Lab), 1 credit |
Unit titles below are the notes' own. The programme is governed by Ordinance 11 of the university, which holds the re-appear rules.
MCA 237 Soft Computing Notes unit-wise: 31 solved examples and 94 short answers across 4 units
Unit 2 is the longest (18 pages, 14 solved examples). Notes for every other paper sit under GGSIPU MCA notes.
Each unit of the MCA 237 Soft Computing IPU notes ends with long-answer questions, answered short questions and a revision table; one page per unit is in the sample PDF above.
MCA 237 Unit 1: Introduction to Soft Computing, Classical and Fuzzy Sets, Membership Functions
Unit 1 (pages 4 to 20, 7 sections) moves from Zadeh's four constituents, tolerance for imprecision and a 12-row hard versus soft computing table to crisp sets, fuzzy notation, α-cuts, cardinality, six membership function shapes and seven ways to assign membership values. It has 6 solved examples, 22 short answers and 11 long-answer questions.
| Property | Result |
|---|---|
| Support (μ > 0) | {x1, x2, x3, x4, x5} |
| Core, height | {x4}, 1.0 (normal set) |
| α-cut at 0.5 (μ ≥ 0.5) | {x2, x3, x4, x5} |
| Strong α-cut at 0.5 (μ > 0.5) | {x3, x4, x5} |
Quick look: properties of à = 0.2/x1 + 0.5/x2 + 0.8/x3 + 1.0/x4 + 0.6/x5 + 0/x6 (from page 13)
- Property
- Support (μ > 0)
- Result
- {x1, x2, x3, x4, x5}
- Property
- Core, height
- Result
- {x4}, 1.0 (normal set)
- Property
- α-cut at 0.5 (μ ≥ 0.5)
- Result
- {x2, x3, x4, x5}
- Property
- Strong α-cut at 0.5 (μ > 0.5)
- Result
- {x3, x4, x5}
MCA 237 Unit 2: Operations on Fuzzy Sets, Fuzzy Rules and Inference, Fuzzy Arithmetic, Defuzzification and Fuzzy Logic Controller
Unit 2 (pages 21 to 38, 10 sections) starts with Sugeno and Yager complements, t-norms, OWA aggregation, six implications and generalised modus ponens, then fuzzy numbers, interval arithmetic, the extension principle, fuzzy equations, eight defuzzifiers and FLC design. It has 14 solved examples, 24 short answers and 14 long-answer questions.
| Method | z* |
|---|---|
| Centroid (15.5 / 3.5) | 4.43 |
| Mean of maximum | 5.5 |
| First of maxima | 5 |
| Last of maxima | 6 |
Quick look: four defuzzifiers on one output, z = 1 to 7 with μ = 0.2, 0.4, 0.4, 0.6, 0.8, 0.8, 0.3 (from page 33)
- Method
- Centroid (15.5 / 3.5)
- z*
- 4.43
- Method
- Mean of maximum
- z*
- 5.5
- Method
- First of maxima
- z*
- 5
- Method
- Last of maxima
- z*
- 6
MCA 237 Unit 3: Evolutionary Computation: Genetic Algorithms and Genetic Programming
Unit 3 (pages 39 to 55, 9 sections) moves from the 8-step simple GA with pseudocode and Goldberg's f(x) = x² generation into steady-state, island and messy GAs, selection pressure and takeover time, the schema theorem, premature convergence and GP trees. It has 4 solved examples, 22 short answers and 11 long-answer questions.
| Schema | o(H), δ(H) | Survival factor | m(H, t+1) at least |
|---|---|---|---|
| 1∗0∗1 | 3, 4 | 0.17 | 0.85 (likely lost) |
| ∗10∗∗ | 2, 1 | 0.78 | 3.9 (grows) |
Quick look: which schema survives, l = 5, pc = 0.8, pm = 0.01, m = 4, f(H)/f̄ = 1.25 (from page 50)
- Schema
- 1∗0∗1
- o(H), δ(H)
- 3, 4
- Survival factor
- 0.17
- m(H, t+1) at least
- 0.85 (likely lost)
- Schema
- ∗10∗∗
- o(H), δ(H)
- 2, 1
- Survival factor
- 0.78
- m(H, t+1) at least
- 3.9 (grows)
MCA 237 Unit 4: Neurons, Artificial Neural Networks and Hybrid Soft Computing Systems
Unit 4 (pages 56 to 71, 11 sections) maps neuron parts to ANN terms, then covers McCulloch-Pitts gates, Hebb, perceptron and delta rules, a full 2-2-1 back-propagation iteration and Hopfield recall, before ANFIS, GA-trained networks and genetic-fuzzy optimisation. It has 7 solved examples, 26 short answers and 14 long-answer questions.
| x1, x2 | h1 | h2 | y |
|---|---|---|---|
| 0, 0 | 0 | 1 | 0 |
| 0, 1 | 1 | 1 | 1 |
| 1, 0 | 1 | 1 | 1 |
| 1, 1 | 1 | 0 | 0 |
Quick look: XOR from OR, NAND and AND neurons; h1 = OR and h2 = NAND feed y = AND(h1, h2) (from page 63)
- x1, x2
- 0, 0
- h1
- 0
- h2
- 1
- y
- 0
- x1, x2
- 0, 1
- h1
- 1
- h2
- 1
- y
- 1
- x1, x2
- 1, 0
- h1
- 1
- h2
- 1
- y
- 1
- x1, x2
- 1, 1
- h1
- 1
- h2
- 0
- y
- 0
MCA 237 exam corner: 94 short answers and 50 long-answer questions by unit
The notes label answers "2.5 Marks" and "12.5 Marks"; the current paper sets each question at 12 marks, so read the labels as length guides.
| Unit | Short answers | Long-answer questions | Solved examples |
|---|---|---|---|
| Unit 1 | 22 | 11 | 6 |
| Unit 2 | 24 | 14 | 14 |
| Unit 3 | 22 | 11 | 4 |
| Unit 4 | 26 | 14 | 7 |
| Total | 94 | 50 | 31 |
MCA 237 notes: questions and solved examples per unit
- Unit
- Unit 1
- Short answers
- 22
- Long-answer questions
- 11
- Solved examples
- 6
- Unit
- Unit 2
- Short answers
- 24
- Long-answer questions
- 14
- Solved examples
- 14
- Unit
- Unit 3
- Short answers
- 22
- Long-answer questions
- 11
- Solved examples
- 4
- Unit
- Unit 4
- Short answers
- 26
- Long-answer questions
- 14
- Solved examples
- 7
- Unit
- Total
- Short answers
- 94
- Long-answer questions
- 50
- Solved examples
- 31
The MCA 237 notes answer 94 short questions and list 50 long-answer questions across 4 units, plus 31 solved examples.
One question per unit, with answer pointers:
- Unit 1: Which classical set laws fail for fuzzy sets? Pointer (page 20): excluded middle and contradiction.
- Unit 2: Mamdani versus Sugeno inference? Pointer (page 38): fuzzy-set consequent plus defuzzification versus crisp function plus weighted average.
- Unit 3: What is takeover time? Pointer (page 54): generations for the best individual to fill the population under selection alone.
- Unit 4: Name the five layers of ANFIS. Pointer (page 71): fuzzification, rule, normalisation, consequent and output.
More practice sits in the MCA 237 important questions.
Crossover operators and Order Crossover in genetic algorithms: excerpt from page 46 of the MCA 237 notes
Excerpt from page 46
5.2 Crossover (recombination) operators
Crossover combines the genetic material of two parents to produce offspring. It is the main search operator of a GA, because it exploits good building blocks that already exist in the population. It is applied with probability pc.
Types of crossover
- Single-point: one cut point, tails swapped. P1 = 1010 | 1100 and P2 = 0110 | 0011 give C1 = 1010 0011 and C2 = 0110 1100.
- Two-point: the middle segment is swapped. P1 = 110 | 110 | 10 and P2 = 011 | 011 | 00 give C1 = 110 011 10 and C2 = 011 110 00.
- Multi-point (n-point): n cut points, with segments alternating between the parents; a generalisation of two-point crossover.
- Uniform: a random binary mask decides, bit by bit, which parent each gene comes from. With P1 = 10110011, P2 = 00011010 and mask 11010110 (1 means copy from P1 for C1), the children are C1 = 10011010 and C2 = 00110011.
- Three-parent: a bit is copied when P1 and P2 agree, otherwise it is taken from P3; one child comes from each triple.
- Arithmetic (real-coded): C1 = λP1 + (1 − λ)P2 and C2 = λP2 + (1 − λ)P1. With P1 = 5, P2 = 10 and λ = 0.3, C1 = 8.5 and C2 = 6.5.
Crossover for permutation encoding
In travelling-salesman-type problems, ordinary crossover creates invalid tours in which a city repeats. Special operators are used instead: PMX (partially mapped), OX (order) and CX (cycle).
Solved example: Order Crossover (OX)
P1 = 1 2 3 | 4 5 6 | 7 8 9 and P2 = 9 3 7 | 8 2 6 | 5 1 4.
- Copy the middle segment of P1 into the child: _ _ _ 4 5 6 _ _ _.
- Read P2 from just after the second cut: 5 1 4 9 3 7 8 2 6. Remove 4, 5 and 6 to leave 1 9 3 7 8 2.
- Fill these into the child starting after the second cut (positions 7, 8, 9, then 1, 2, 3).
Child = 7 8 2 4 5 6 1 9 3, a valid permutation in which every city appears exactly once.
PMX in brief: swap the middle segments, build a mapping between the swapped genes (for example 4 and 8, 5 and 2), and use it to repair duplicates outside the segment. In CX, each gene comes from the same position of one parent, following the cycles between the two parents.
Do the MCA 237 notes cover the full GGSIPU syllabus?
Yes. Every Unit I to IV topic of MCA-237 in the 2025-26 MCA syllabus has its own section, plus fuzzy relations (page 26), which inference needs.
| Official unit | Official topics | Where in the notes | Status |
|---|---|---|---|
| Unit I | Soft Computing Concepts, tolerance in imprecision and uncertainty, "Soft" versus "Hard" computing, Characteristics, applications · Classical and Fuzzy Sets, Membership Function | Sections 1 to 7, pages 5 to 18 | Covered |
| Unit II | Compliment, Intersections, Unions, Aggregation; rule generation, Propositions, implications, inferences · Fuzzy Numbers, Linguistic Variables, Intervals, Lattice, Fuzzy Equations, Defuzzyfication, Fuzzy logic controller design | Sections 1 to 10, pages 22 to 35 | Covered |
| Unit III | Genetic Algorithms and Genetic Programming, Basic GA framework, GA architectures · operators, Analysis of Selection Operations, Convergence | Sections 1 to 9, pages 40 to 52 | Covered |
| Unit IV | Biological neurons, ANN architectures, perceptions, training rules, Back Propagation, Multilayer Perceptron, Hopfield · Neuro-Fuzzy, GA for NN Design, Fuzzy Logic and GA for Optimization | Sections 1 to 11, pages 57 to 68 | Covered |
MCA 237: official topics mapped to the notes
- Official unit
- Unit I
- Official topics
- Soft Computing Concepts, tolerance in imprecision and uncertainty, "Soft" versus "Hard" computing, Characteristics, applications · Classical and Fuzzy Sets, Membership Function
- Where in the notes
- Sections 1 to 7, pages 5 to 18
- Status
- Covered
- Official unit
- Unit II
- Official topics
- Compliment, Intersections, Unions, Aggregation; rule generation, Propositions, implications, inferences · Fuzzy Numbers, Linguistic Variables, Intervals, Lattice, Fuzzy Equations, Defuzzyfication, Fuzzy logic controller design
- Where in the notes
- Sections 1 to 10, pages 22 to 35
- Status
- Covered
- Official unit
- Unit III
- Official topics
- Genetic Algorithms and Genetic Programming, Basic GA framework, GA architectures · operators, Analysis of Selection Operations, Convergence
- Where in the notes
- Sections 1 to 9, pages 40 to 52
- Status
- Covered
- Official unit
- Unit IV
- Official topics
- Biological neurons, ANN architectures, perceptions, training rules, Back Propagation, Multilayer Perceptron, Hopfield · Neuro-Fuzzy, GA for NN Design, Fuzzy Logic and GA for Optimization
- Where in the notes
- Sections 1 to 11, pages 57 to 68
- Status
- Covered
Official source: MCA Scheme of Examination and Detailed Syllabus, A.S. 2025-26 onwards ("Compliment", "Defuzzyfication" and "perceptions" are spelt as printed there).
Every course in GGSIPU notes is checked topic by topic against its official PDF in the same way.
Who writes and checks the MCA 237 notes?
- Prateek Talwar, author: Founder, Unnati Educations; Associate Company Secretary (ACS), ICSI, membership no. 58704, since 15 May 2019; B.Com, University of Delhi (School of Open Learning), 2012. Author profile
- Ritik Rawat, subject reviewer: Senior Full Stack Developer, Unnati Educations; B.Tech.
This 2026-27 edition of the GGSIPU MCA Sem 3 Soft Computing notes follows the MCA scheme for A.S. 2025-26 onwards, includes the x² GA generation, the 2-2-1 back-propagation iteration and a Hopfield recall, and was last checked on 13 October 2026. See the editorial policy.
The same team prepares GGSIPU important questions for every course.
MCA 237 and the GGSIPU MCA Sem 3 papers it connects to
Paired lab: in the GGSIPU MCA syllabus, this elective's lab is MCA-267, run as the Soft Computing Lab (1 credit). Its course outcomes follow the theory units:
- Fuzzy set operations (Units 1, 2) feed CO1: De Morgan, union, intersection.
- FLC design (Unit 2) feeds CO2: FIS Editor for anti-lock brakes.
- McCulloch-Pitts nets (Unit 4) feed CO3 and CO4.
- Genetic algorithms (Unit 3) feed CO5.
Unit 4's perceptron and back-propagation overlap with core paper MCA-203 Artificial Intelligence and Machine Learning, and Unit 3's GA search sits beside MCA-201 Design and Analysis of Algorithms. The semester also has one Core Elective II and one Open Elective II paper, MCA-269 Minor Project III and NUES papers MCA-271 and MCA-273.
How to write MCA 237 answers: membership-grade numericals, max-min inference steps and twelve-mark theory answers
In this paper, marks come from visible working rather than the final number. Question 1 rewards crisp two-line definitions, such as support, core or elitism, while each 12-mark unit question usually mixes theory with a numerical. The notes build the right habit in four places.
α-cut questions
Check the sign first. A plain "α-cut" means μ ≥ α; a "strong α-cut" means μ > α. Add that α-cuts shrink as α rises (the nesting property); it is worth one line.
Membership function long answers
Follow the order the notes give: definition, the core-support-boundary diagram, at least five methods of assigning membership values, then one triangular MF numerical.
Inference numericals
Write the relation matrix first, then compose element by element with min inside and max outside. The notes warn that writing only the final answer loses most marks.
Worked example: generalised modus ponens (page 28)
A = 0.2/x1 + 0.6/x2 + 0.5/x3 and B = 1/y1 + 1/y2, with Mamdani implication R = min(μA, μB): rows x1 = [0.2, 0.2], x2 = [0.6, 0.6], x3 = [0.5, 0.5]. Given A′ = 0.3/x1 + 0.9/x2 + 0.6/x3:
- μB′(y1) = max[min(0.3, 0.2), min(0.9, 0.6), min(0.6, 0.5)] = max[0.2, 0.6, 0.5] = 0.6
- μB′(y2) = max[min(0.3, 0.2), min(0.9, 0.6), min(0.6, 0.5)] = max[0.2, 0.6, 0.5] = 0.6
So B′ = 0.6/y1 + 0.6/y2: three lines of working, each one checkable by the examiner.
GA numericals
Lay out the x² problem as two tables: string, x, f(x), pᵢ, expected and actual count for selection, then mating pool, crossover site, offspring and new fitness. A theory answer on GA versus traditional search should still name Goldberg's four points: coding, population, payoff and probabilistic rules. Draw the GA cycle flowchart from page 42 beside it; a labelled diagram makes a long answer easy to mark.
Practise this format on GGSIPU MCA important questions.
MCA 237 notes FAQs
How do I get the full MCA 237 notes?
Tap "Get Full Notes" at the top of this page to message us on WhatsApp at 9899436384 and place the order. The full MCA 237 notes come only as a printed book of 71 pages, not as a PDF. The book reaches you within 5 to 7 days at most, and the exact delivery time depends on your location.
Are the MCA 237 notes available as a PDF download?
No. The complete MCA 237 notes are sold only as a printed book, and no full PDF is sent. Before ordering you can open a watermarked 7-page sample (cover, index and one page per unit) from the button at the top, and read the unit summaries, quick looks and the page 46 excerpt on this page.
Which MCA 237 unit has the most solved examples?
Unit 2 has the most, with 14 solved examples in 18 pages, because complements, t-norms, implications, interval arithmetic, fuzzy equations and defuzzification are all numerical. Unit 4 has 7, including a 2-2-1 back-propagation iteration and a Hopfield recall. Unit 1 has 6, and Unit 3 has 4, among them Goldberg's x² generation worked through one full cycle.
Do the MCA 237 notes follow the 2025-26 GGSIPU MCA syllabus?
Yes. They follow the MCA scheme for affiliated institutes that applies from academic session 2025-26, approved by the BoS on 28 July 2025. Every Unit I to IV topic has a matching section, shown with page numbers in the coverage table above, and the book also adds fuzzy relations and composition, which Unit II inference depends on.
What is the passing mark for MCA 237?
MCA 237 is marked out of 100, with the end-term paper set for 60 marks: a 12-mark compulsory Question 1 plus one 12-mark question from each unit. The MCA scheme of examination states pass marks as 40%, which is 40 out of 100. End-term minimums and re-appear rules are in GGSIPU's Ordinance 11 on ipu.ac.in.
Do I need MATLAB or coding for the MCA 237 theory notes?
No. The MCA 237 theory notes work through formulas, tables and hand-solved numericals, with one GA pseudocode procedure on page 42 and no MATLAB programs. Programming in C, C++, Java or MATLAB is listed as a prerequisite and matters most in the MCA-267 lab, where the fuzzy and neural network toolboxes are used in practice.
Get the full MCA 237 Soft Computing Notes on WhatsApp
The full notes come as a printed book only, not as a PDF: 71 pages of Soft Computing notes in English with 13 figures. Delivery: within 5 to 7 days at most; the exact time may vary with your location.
Order the printed MCA 237 Soft Computing notes book on WhatsApp (4 units, 71 pages)
Unnati Educations is an independent education provider based in Vikaspuri, Delhi. We are not affiliated with, authorised by, or endorsed by Guru Gobind Singh Indraprastha University (GGSIPU). 'GGSIPU' and 'IPU' are used only to describe the syllabus our notes follow. For official information, visit ipu.ac.in.
Ready for the full notes?
Discuss coverage and delivery with our team.