BBA 104 Decision Techniques for Business Notes from Unnati Educations run to 90 pages across 4 units, with 64 solved examples, 14 figures, 33 exam-style theory questions and 26 practice numericals with answers. They follow the GGSIPU BBA NEP scheme for the batch admitted in 2024-25 onwards, and the full notes come as a printed book.
Written by Prateek Talwar, Founder, Unnati Educations · Reviewed by Sheetal Kirola, BBA, B.Ed (DU SOL) · Checked against BBA Scheme & Syllabus (NEP based) w.e.f. 2024-2025, ipu.ac.in file BBAwef2024_25_200125.pdf · Updated 13 October 2026 · Editorial policy
Scheme: NEP based BBA scheme w.e.f. 2024-25 | Applies to: batch admitted 2024-25 onwards | Verified against: BBAwef2024_25_200125.pdf (ipu.ac.in)
BBA 104 Decision Techniques for Business at a glance: GGSIPU BBA Sem 2 credits, units and exam pattern
| Code and title | BBA 104 · Decision Techniques for Business |
|---|---|
| Course and semester | BBA, Semester 2 (one of the GGSIPU BBA Semester 2 papers) |
| Category and credits | Discipline Specific Course / Major · 4 credits · 4 lecture hours a week |
| Marks | 100: 40 internal (class test 15 + activities 25) + 60 end-term |
| Applies to | Batch admitted 2024-25 onwards |
| End-term pattern | 60 marks; paper-setter instructions not printed in the official PDF |
| Exam duration | 3 hours |
| Units | 4 units, 15 teaching hours each |
| Paired lab | None |
| Pass marks | Not stated in the BBA scheme PDF; see GGSIPU Ordinance 11 |
The scheme table gives BBA 104 four lecture hours and no tutorial; its syllabus page prints L-3, T-1. Both total 4 credits. Course outcomes CO1 to CO4 match Units 1 to 4.
BBA 104 Decision Techniques for Business Notes unit-wise: 64 solved examples and 14 figures across 4 units
The BBA 104 Decision Techniques IPU notes split in two: Units 1 and 2 are business statistics, Units 3 and 4 are operations research. Each unit ends with formulas, common mistakes, exam questions and a revision table. Notes for the other papers of the course sit on the GGSIPU BBA notes page. Eight pages of this book are in the sample PDF above.
BBA 104 Unit 1: Statistics
Unit 1 takes business data through collect, organise, present and analyse. One marks distribution (0-50, N = 40) is carried through mean, median, mode, quartiles, mean deviation, standard deviation and skewness. It ends with the normal curve and z-scores.
Pages 6-33 (28) · 8 sections · 24 solved examples · 5 figures · 12 theory questions, 7 practice numericals.
| Basis | Mean | Median | Mode |
|---|---|---|---|
| Extreme values | Highly affected | Not affected | Not affected |
| Open-end classes | Cannot be found | Can be found | Can be found |
| Located on a graph | No | Ogive | Histogram |
Quick look: mean vs median vs mode (from page 19)
- Basis
- Extreme values
- Mean
- Highly affected
- Median
- Not affected
- Mode
- Not affected
- Basis
- Open-end classes
- Mean
- Cannot be found
- Median
- Can be found
- Mode
- Can be found
- Basis
- Located on a graph
- Mean
- No
- Median
- Ogive
- Mode
- Histogram
BBA 104 Unit 2: Correlation Analysis
Also covered as "Correlation and Regression Analysis". It goes from the scatter diagram to Karl Pearson's r by four methods and Spearman's rank correlation with tied ranks, then derives both regression lines, fits a least-squares line with residuals and lists pitfalls such as spurious correlation.
Pages 34-52 (19) · 8 sections · 14 solved examples · 3 figures · 7 theory questions, 8 practice numericals.
| r | r² (variation explained) |
|---|---|
| 0.9 | 81% |
| 0.7 | 49% |
| 0.5 | 25% |
Quick look: how much of Y does r explain? (from page 39)
- r
- 0.9
- r² (variation explained)
- 81%
- r
- 0.7
- r² (variation explained)
- 49%
- r
- 0.5
- r² (variation explained)
- 25%
BBA 104 Unit 3: Linear Programming
Unit 3 carries one furniture problem (chairs ₹300, tables ₹500 profit) from formulation to the graphical answer of 10 chairs and 15 tables, then to its dual, where a carpentry hour is worth ₹112.50. It also covers diet and media models, simplex, Big-M and special cases.
Pages 53-71 (19) · 7 sections · 15 solved examples · 4 figures · 7 theory questions, 6 practice numericals.
| Variable | Used for | Coefficient in Z |
|---|---|---|
| Slack (+s) | ≤ constraint | 0 |
| Surplus (−S) | ≥ constraint | 0 |
| Artificial (+A) | ≥ and = constraints | −M (max), +M (min) |
Quick look: slack, surplus and artificial variables (from page 61)
- Variable
- Slack (+s)
- Used for
- ≤ constraint
- Coefficient in Z
- 0
- Variable
- Surplus (−S)
- Used for
- ≥ constraint
- Coefficient in Z
- 0
- Variable
- Artificial (+A)
- Used for
- ≥ and = constraints
- Coefficient in Z
- −M (max), +M (min)
BBA 104 Unit 4: Transportation and Assignment Problems
Unit 4 runs one three-factory, four-market table through every starting method, then improves it by MODI to the optimum. The assignment half solves job and territory problems by the Hungarian method, including unbalanced and prohibited cases, and ends with a four-city travelling salesman tour.
Pages 72-89 (18) · 6 sections · 11 solved examples · 2 figures · 7 theory questions, 5 practice numericals.
Quick look: the Hungarian method (from page 79)
- Make the matrix square with a zero-cost dummy if needed.
- Subtract each row's minimum, then each column's minimum.
- Cover all zeros with the fewest lines; if lines = n, assign.
- Otherwise subtract the smallest uncovered value from uncovered cells, add it at intersections, and test again.
BBA 104 exam corner: 33 theory questions and 26 practice numericals with answers by unit
| Unit | Theory questions | Practice numericals (with answers) | Solved examples |
|---|---|---|---|
| 1 Statistics | 12 | 7 | 24 |
| 2 Correlation and regression | 7 | 8 | 14 |
| 3 Linear programming | 7 | 6 | 15 |
| 4 Transportation and assignment | 7 | 5 | 11 |
Exam-style questions and solved examples in the BBA 104 notes, by unit
- Unit
- 1 Statistics
- Theory questions
- 12
- Practice numericals (with answers)
- 7
- Solved examples
- 24
- Unit
- 2 Correlation and regression
- Theory questions
- 7
- Practice numericals (with answers)
- 8
- Solved examples
- 14
- Unit
- 3 Linear programming
- Theory questions
- 7
- Practice numericals (with answers)
- 6
- Solved examples
- 15
- Unit
- 4 Transportation and assignment
- Theory questions
- 7
- Practice numericals (with answers)
- 5
- Solved examples
- 11
- Unit 1: The mean of 50 items is 40 and of another 50 items is 50. Find the combined mean. Pointer: (50 × 40 + 50 × 50) ÷ 100 = 45.
- Unit 2: byx = 0.9, bxy = 0.4. Find r. Pointer: r = √(0.9 × 0.4) = 0.6.
- Unit 3: Maximise Z = 2x₁ + 3x₂ subject to x₁ + x₂ ≤ 4, x₁ + 3x₂ ≤ 6, x₁, x₂ ≥ 0. Pointer: corner (3, 1) gives the maximum, Z = 9.
- Unit 4: Assign three jobs to three machines with costs (9, 26, 15), (13, 27, 6), (35, 20, 15). Pointer: J1→M1, J2→M3, J3→M2, cost 35.
The BBA 104 notes give 33 exam-style theory questions and 26 practice numericals with answers across 4 units, plus 64 solved examples.
More practice sits in the BBA 104 important questions.
Who writes and checks the BBA 104 Decision Techniques notes?
- Prateek Talwar, author · Founder, Unnati Educations · Associate Company Secretary (ACS), ICSI, since 15 May 2019 · B.Com, University of Delhi (School of Open Learning), 2012 · author bio
- Sheetal Kirola, subject reviewer. She holds a BBA and a B.Ed from the School of Open Learning, University of Delhi (DU SOL), specialises in BBA and B.Ed subjects, and has 6 years of experience.
This 2026-27 edition of the GGSIPU BBA Semester 2 Decision Techniques notes is mapped topic by topic to page 42 of the official NEP scheme PDF (w.e.f. 2024-25). It adds 40 common-mistake rows, 10 per unit. Last updated 13 October 2026; our process is in the editorial policy.
The same team prepares GGSIPU important questions from the same unit maps.
How to write BBA 104 answers: step-by-step numericals, simplex tables and interpreted results
BBA 104 is mostly numericals, and the notes' exam tips repeat the same habits. Write the formula first, then the working table, then the substitution, then a final answer with its unit (₹, marks or hours). For correlation, finish with one sentence in words, such as "a high degree of positive correlation between advertising and sales"; the tip on page 39 says examiners give marks for that interpretation.
In linear programming, always write the non-negativity line x₁, x₂ ≥ 0 and translate the wording carefully: "at least" becomes ≥, while "at most" or "available" becomes ≤. In simplex tables, show the ratio column every time and ignore zero and negative entries. In transportation, state the number of allocations and check it against m + n − 1 before the MODI test. In assignment, always take the final cost from the original matrix, never from the reduced one.
For Spearman's rank correlation, check that ΣD = 0 before squaring, because a non-zero total means a ranking slip. When values repeat, give each the average rank and add (m³ − m)/12 for every tie group, as in the page 42 example where three tied 16s each take rank 8.
Worked example: which regression line is which? (page 46)
Given 8X − 10Y + 66 = 0 and 40X − 18Y = 214, solve the pair together: X̄ = 13 and Ȳ = 17, because the two lines meet at the means. Take the first as Y on X (byx = 0.8) and the second as X on Y (bxy = 0.45). Their product, 0.36, is not more than 1, so the guess holds, and r = +√0.36 = 0.6.
The common-mistakes tables add three traps: r can never be 1.3, the two b's always share a sign, and quartile deviation is half of Q₃ − Q₁. Practise this format on GGSIPU BBA important questions.
BBA 104 and the GGSIPU BBA Sem 2 papers it connects to
No lab is paired with BBA 104; every Semester 2 paper is listed in the GGSIPU BBA syllabus.
BBA 102 Marketing Management meets Unit 2 in the advertising-sales regression (page 46) and Unit 3 in the media selection model (page 56). BBA 106 Human Resource Management meets Unit 4 in assigning jobs to workers (pages 79-83).
The page 84 travelling salesman model is a delivery-route problem, which links to BBA 112 E-Commerce and its lab, BBA 114. BBA 108, BBA 110 or BBA 118, and BBA 116 have no direct overlap.
Vogel's Approximation Method in operations research: excerpt from page 75 of the BBA 104 notes
Excerpt from page 75
Vogel's Approximation Method (VAM) finds a starting solution for a transportation problem by looking at penalties, also called opportunity costs. For every row and every column, the penalty is the difference between the two lowest costs. It tells you how much extra you pay if you do not use the cheapest cell, which is why VAM usually lands very close to the optimum.
Steps of VAM
- Find the penalty for every row and every column: second lowest cost minus lowest cost.
- Pick the row or column with the highest penalty. If two are equal, choose the one with the lowest-cost cell.
- In that row or column, allot as much as possible to the lowest-cost cell.
- Cross out the row or column that is now satisfied, recompute penalties for what is left, and repeat until every allocation is made.
The worked problem
Three factories (S1, S2, S3 with supplies 7, 9 and 18) serve four markets (D1 to D4 with demands 5, 8, 7 and 14). Supply and demand both total 34, so the problem is balanced and needs 3 + 4 − 1 = 6 allocations.
In step 1, row S1 has costs 19, 30, 50 and 10, so its two lowest are 10 and 19 and its penalty is 9. Column D2 has costs 30, 30 and 8, so its penalty is 30 − 8 = 22, the highest in the table. The cheapest cell in D2 is (S3, D2) at ₹8, and it receives all 8 units D2 needs.
| Step | Highest penalty | Allocation |
|---|---|---|
| 1 | D2 (22) | (S3, D2) = 8 |
| 2 | D1 (21) | (S1, D1) = 5 |
| 3 | S3 (50) | (S3, D4) = 10 |
| 4 | D4 (50) | (S1, D4) = 2 |
| 5 | Only S2 left | (S2, D4) = 2, (S2, D3) = 7 |
VAM allocation order for the three-factory problem (page 75)
- Step
- 1
- Highest penalty
- D2 (22)
- Allocation
- (S3, D2) = 8
- Step
- 2
- Highest penalty
- D1 (21)
- Allocation
- (S1, D1) = 5
- Step
- 3
- Highest penalty
- S3 (50)
- Allocation
- (S3, D4) = 10
- Step
- 4
- Highest penalty
- D4 (50)
- Allocation
- (S1, D4) = 2
- Step
- 5
- Highest penalty
- Only S2 left
- Allocation
- (S2, D4) = 2, (S2, D3) = 7
Total cost = 5×19 + 2×10 + 7×40 + 2×60 + 8×8 + 10×20 = 95 + 20 + 280 + 120 + 64 + 200 = ₹779.
How the three starting methods compare on this problem
The North-West Corner Rule ignores cost and gives ₹1,015. The Least Cost Method picks the cheapest cell first and gives ₹814. VAM gives ₹779, and the true optimum, reached later by the MODI method, is ₹743. So VAM is slower to work by hand but starts you only ₹36 away from the best answer.
Do the BBA 104 notes cover the full GGSIPU syllabus?
Yes. Every official BBA 104 topic has its own section; only the stepping stone method is named (page 76) rather than worked, as optimality is solved by MODI.
| Official unit | Official topics | Where in the notes | Status |
|---|---|---|---|
| Unit 1: Statistics | Definition, importance, limitation; data collection, frequency distribution; bars, histogram; mean, median, mode; partition values; range, IQR, mean and standard deviation; normal curves | Sections 1-8, pages 6-29 | Covered |
| Unit 2: Correlation Analysis | Correlation coefficient, assumptions; determination; Karl Pearson; Spearman; regression lines; ordinary least squares; pitfalls | Sections 1-8, pages 34-49 | Covered |
| Unit 3: Linear Programming | Concept, assumptions, business use; formulation; graphical and simplex methods; mixed constraints; duality | Sections 1-7, pages 53-68 | Covered |
| Unit 4: Transportation and Assignment problems | General structure; initial solution; testing for optimality; Hungarian method; unbalanced and restricted assignment; travelling salesman model | Sections 1-6, pages 72-86 | Covered (stepping stone named only) |
Official BBA 104 units mapped to the Unnati notes (official PDF pages 42-43)
- Official unit
- Unit 1: Statistics
- Official topics
- Definition, importance, limitation; data collection, frequency distribution; bars, histogram; mean, median, mode; partition values; range, IQR, mean and standard deviation; normal curves
- Where in the notes
- Sections 1-8, pages 6-29
- Status
- Covered
- Official unit
- Unit 2: Correlation Analysis
- Official topics
- Correlation coefficient, assumptions; determination; Karl Pearson; Spearman; regression lines; ordinary least squares; pitfalls
- Where in the notes
- Sections 1-8, pages 34-49
- Status
- Covered
- Official unit
- Unit 3: Linear Programming
- Official topics
- Concept, assumptions, business use; formulation; graphical and simplex methods; mixed constraints; duality
- Where in the notes
- Sections 1-7, pages 53-68
- Status
- Covered
- Official unit
- Unit 4: Transportation and Assignment problems
- Official topics
- General structure; initial solution; testing for optimality; Hungarian method; unbalanced and restricted assignment; travelling salesman model
- Where in the notes
- Sections 1-6, pages 72-86
- Status
- Covered (stepping stone named only)
Official source: BBA Scheme & Syllabus (NEP based), w.e.f. Academic Session 2024-2025.
Every course in GGSIPU notes is checked against its official PDF in this table format.
BBA 104 Decision Techniques notes FAQs
How do I get the full BBA 104 notes?
Send a WhatsApp message to 9899436384 using the "Get Full Notes" button. The full BBA 104 notes are sold only as a printed book, so our team confirms your address and dispatch details on chat. The book covers all four units in 90 pages, from frequency distributions in Unit 1 to the travelling salesman tour in Unit 4.
Are the BBA 104 notes available as a PDF download?
No. The complete 90-page BBA 104 book is available in printed form only. The only PDF we share is a watermarked 8-page sample with the cover, the three index pages and one page from each unit: graphs, Spearman's rank correlation, LP formulation and Vogel's method. It is meant for checking the writing style before you order.
How many marks is BBA 104 out of, and what is the passing mark?
BBA 104 is marked out of 100: 40 internal and 60 end-term. The internal 40 is a 15-mark class test plus 25 marks from at least two activities such as assignments, presentations or viva. The BBA scheme PDF does not state a pass percentage, so check end-term minimums and re-appear rules in the university's Ordinance 11 on ipu.ac.in.
Which BBA 104 unit has the most solved examples?
Unit 1, Statistics, with 24 of the 64 solved examples across 28 pages. It works one marks distribution through mean, median, mode, quartiles, deciles, percentiles, mean deviation, standard deviation and skewness. Unit 3 follows with 15, including two full simplex solutions and one Big-M solution. Unit 2 has 14 solved examples and Unit 4 has 11.
Do the BBA 104 notes follow the NEP 2024-25 BBA scheme?
Yes. They were checked unit by unit against the IPU BBA Scheme and Syllabus (NEP based) w.e.f. 2024-25, which places BBA 104 in Semester 2 as a 4-credit Discipline Specific Course. That scheme applies to students admitted in 2024-25 or later. If you joined before 2024-25, compare this page's topic table with your own batch's syllabus first.
Is BBA 104 more statistics or more operations research?
It is an even split. BBA 104 Units 1 and 2 are business statistics: averages, dispersion, the normal curve, correlation and regression. Units 3 and 4 are operations research: linear programming by graph, simplex, Big-M and duality, then transportation, assignment and the travelling salesman model. In the notes the statistics half takes 47 pages and the other half 37.
Get the full BBA 104 Decision Techniques for Business Notes on WhatsApp
| Unit | Pages |
|---|---|
| 1 Statistics | 28 |
| 2 Correlation and regression | 19 |
| 3 Linear programming | 19 |
| 4 Transportation and assignment | 18 |
These Decision Techniques for Business notes in English come as a printed book only, with 64 solved examples; they are not available as a PDF. The book adds every worked table, all 14 figures and the revision pages. Message us on WhatsApp to order, and we confirm dispatch and delivery details on chat.
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.