What do you get
- All the notes of all the subjects in Semester 5, as per the latest syllabus 2026.
- Your own dashboard, where you can track everything you have read, subject by subject.
- Valid for one year, 365 days from the day you pay.
- If the University revises the syllabus while your year is running, the notes are rewritten to match and you read the new version at no extra cost. You are never asked to buy the same semester twice.
-
Ethical Hacking
Official Notes munotes.in
Ethical Hacking
B.SC. (COMPUTER SCIENCE) · SEMESTER 5
Strictly as per the University of Mumbai NEP syllabus in force for B.Sc. (Computer Science)
For B.Sc. (Computer Science) students of the University of Mumbai and all its affiliated colleges
munotes.in Third Year
Ethical Hacking
Copyright © 2026 munotes.in. All rights reserved.
Written and first published by munotes.in, 2026.
This book is free for individual students to read at munotes.in. No part of it may be reproduced, distributed, stored, translated or used for institutional or classroom purposes in any form without a prior written licence from munotes.in.
Licensing and permissions: contact@munotes.in
The text of statutes and of judgments reproduced in this book is in the public domain under section 52(1)(q) of the Copyright Act 1957. The commentary, arrangement, examples and questions are the original work of munotes.in.
munotes.in is an independent study resource for MU students. It is not affiliated with, endorsed by, or officially connected to the University of Mumbai. Course names and university references describe the students and syllabus the material relates to.
Contents
Module I The law and ethics of authorised testing, security vocabulary, the five-phase lifecycle, CVE and CVSS, reconnaissance and scanning, enumeration, system and password security, hashing and salting, and network sniffing
- How This Course Is Examined: the Journal, the 80 Per Cent Rule and the Two-Hour Practical Paper 1
- The Law: What Makes Hacking Lawful 5
- The Rest of the Law: Source Code, Identity, Protected Systems and Confidentiality 10
- Authorisation in Practice: the Letter, the Scope and the Rules of Engagement 16
- The Vocabulary: Asset, Threat, Vulnerability, Exploit and Risk 21
- The CIA Triad, and Which Property Each Attack Breaks 26
- Hacker Classes, Hacktivism and the Types of Hacking 31
- Types of Engagement: Black Box, White Box, Grey Box, Internal and External 36
- The Five Phases of an Engagement: a Lifecycle Model 41
- The Defender's Mirror: a Control for Every Phase 46
- The Life of a Vulnerability 51
- Responsible Disclosure Against Full Disclosure, and the Vendor's Side 55
- CVE and CWE: Naming the Flaw and Naming the Weakness 60
- CVSS: the Eight Base Metrics 64
- CVSS: Working a Score, and the Temporal and Environmental Metrics 68
- Bug Bounty Programmes 73
- A Worked Case Study: Heartbleed 77
Contents continued
Module I continued The law and ethics of authorised testing, security vocabulary, the five-phase lifecycle, CVE and CVSS, reconnaissance and scanning, enumeration, system and password security, hashing and salting, and network sniffing
- A Worked Case Study: Log4Shell 82
- Footprinting: Passive Against Active Reconnaissance 87
- OSINT on People: Names, Roles and the Email Format 92
- OSINT on Technology and Infrastructure 96
- Search-Engine Reconnaissance and Document Metadata 101
- Reducing Your Own Footprint: the Defensive Audit 106
- How the Domain Name System Resolves a Name 111
- The Record Types, and What Each One Reveals 116
- Subdomain Enumeration and Infrastructure Mapping 121
- Zone Transfers and DNS Hardening 126
- WHOIS, the Registries and IP Allocation 131
- The Psychology: the Levers an Attacker Pulls 136
- Phishing, Spear Phishing, Whaling, Smishing and Vishing 141
- Pretexting, Baiting, Impersonation and Tailgating 146
- A Worked Case: Analysing a Real Attack 151
- Defences: Awareness, Verification and Multi-Factor 156
- Email Authentication: SPF, DKIM and DMARC 161
- TCP/IP for the Scanner: Layers, Addresses, Ports and Flags 166
- The Three-Way Handshake, and Why Scanning Works 171
Contents continued
Module I continued The law and ethics of authorised testing, security vocabulary, the five-phase lifecycle, CVE and CVSS, reconnaissance and scanning, enumeration, system and password security, hashing and salting, and network sniffing
- Host Discovery: Finding What Is Alive 176
- The Scan Types: Connect, SYN, FIN, NULL and XMAS 181
- ACK Scanning and UDP Scanning 186
- Port States, Service and Version Detection, and OS Fingerprinting 191
- Firewall and Filter Detection 196
- How the Scan Is Seen: Intrusion Detection and the Defender's View 201
- Enumeration and Banner Grabbing 206
- SNMP Enumeration 211
- NetBIOS and SMB Enumeration 216
- LDAP, SMTP and NTP Enumeration 221
- Enumeration Countermeasures: What to Close 226
- System Hacking and Privilege Escalation 231
- Escalation Routes on Linux and Windows, at Concept Level 236
- Detecting Persistence: the Auto-Start Audit 242
- Covering Tracks, and Why a Defender Protects the Logs 248
- Rootkits: How They Hide and How They Are Found 253
- Spyware and Keyloggers from the Defensive Side 258
- Encoding, Encryption and Hashing: Three Different Things 262
Contents continued
Module I continued The law and ethics of authorised testing, security vocabulary, the five-phase lifecycle, CVE and CVSS, reconnaissance and scanning, enumeration, system and password security, hashing and salting, and network sniffing
- Symmetric and Asymmetric Encryption at Concept Level 266
- Hash Functions and the Properties They Must Have 270
- Why a Password Is Never Encrypted: Storage and Salting 275
- How Passwords Are Attacked, and the Arithmetic of a Keyspace 280
- Password Policy, Managers and Multi-Factor Authentication 284
- Cryptographic Weaknesses to Know 289
- Hubs, Switches, and Passive Sniffing 293
- MAC Flooding 298
- ARP Poisoning and the Man in the Middle 302
- DNS Spoofing 307
- Countermeasures: Switch Controls and Encryption in Transit 312
Module II Denial of service and botnets, session and web-server security, the OWASP Top Ten, SQL injection, buffer overflows, wireless security, malware analysis, exploit frameworks, and penetration testing methodology and reporting
- Denial of Service: Attacking Availability 317
- Volumetric Attacks and Amplification 321
- Protocol Attacks: the SYN Flood in Depth 326
- Application-Layer Denial of Service 330
- Botnets: Architecture and Command and Control 335
- DDoS Mitigation: the Layered Defence 339
- Sessions and Tokens: Why They Exist 344
Contents continued
Module II continued Denial of service and botnets, session and web-server security, the OWASP Top Ten, SQL injection, buffer overflows, wireless security, malware analysis, exploit frameworks, and penetration testing methodology and reporting
- How a Session Is Stolen: Prediction, Sniffing and Script 348
- Session Fixation and Cookie Manipulation 353
- Cookie Security: Secure, HttpOnly and SameSite 358
- Cross-Site Request Forgery 362
- Session Defences in Full 366
- The Web Server Against the Web Application 370
- Common Web Server Misconfigurations 374
- Directory Traversal 378
- Patch Management 382
- Hardening and the Security Response Headers 386
- The OWASP Top 10: What It Is and How It Changed 390
- A01: Broken Access Control 395
- Security Misconfiguration and Cryptographic Failures 399
- Software Supply Chain Failures 403
- Injection: the Category and Its Members 407
- Cross-Site Scripting: Stored, Reflected and DOM-Based 411
- Cross-Site Scripting Defences: Output Encoding and Content Security Policy 415
- Insecure Design and Authentication Failures 420
- Integrity, Logging and Exceptional Conditions 424
Contents continued
Module II continued Denial of service and botnets, session and web-server security, the OWASP Top Ten, SQL injection, buffer overflows, wireless security, malware analysis, exploit frameworks, and penetration testing methodology and reporting
- Server-Side Request Forgery 428
- Input Validation: the Thread Through the Whole List 432
- SQL Injection: How Input Becomes Logic 437
- The Types: In-Band, Union-Based and Error-Based 441
- Blind SQL Injection: Boolean and Time-Based 445
- Prevention: the Parameterised Query 449
- Defence in Depth: Least Privilege, Validation and the Web Application Firewall 454
- Memory Layout: the Stack, the Heap and the Frame 459
- Stack-Based Buffer Overflow and Return-Address Overwriting 463
- Heap Overflows and Format-String Flaws, Briefly 467
- Defences: Bounds Checking, Canaries, DEP, ASLR and Safe Languages 471
- How Wi-Fi Works: Frames, SSIDs and Association 476
- WEP and Why It Broke 480
- WPA and WPA2: AES and the Four-Way Handshake 484
- WPA3 and the SAE Handshake 488
- Wireless Attacks: Deauthentication, Evil Twins and Rogue Access Points 492
- Wireless Best Practice and Enterprise Authentication 497
- The Malware Families 501
Contents continued
Module II continued Denial of service and botnets, session and web-server security, the OWASP Top Ten, SQL injection, buffer overflows, wireless security, malware analysis, exploit frameworks, and penetration testing methodology and reporting
- Viruses and Worms 505
- Trojans, Ransomware and Remote Access Tools 509
- Keyloggers and Spyware: the Architecture 514
- Detection: Signature, Heuristic and Behavioural 518
- Safe Analysis: the Sandbox 523
- Endpoint Protection 527
- What an Exploit Framework Is 531
- The Exploit Lifecycle and the Payload 535
- Post-Exploitation, Bounded by Scope 539
- The Ethical and Legal Limits of Penetration-Testing Tools 544
- Why Methodology Matters More Than Tricks 549
- PTES: the Seven Phases 553
- The OWASP Testing Guide 557
- Risk Assessment and Rating 561
- The Penetration-Test Report 565
- A Worked Specimen Report 569
- Retesting and Closing the Engagement 574
Page 1 onwards
578 pages in this book. The cover and the contents are above. Everything from page one is in the pass.
- Notes
- 2026 Edition, as per the latest syllabus. 578 pages.
Every chapter in the notes: 126 chapters across 2 modules
Module I The law and ethics of authorised testing, security vocabulary, the five-phase lifecycle, CVE and CVSS, reconnaissance and scanning, enumeration, system and password security, hashing and salting, and network sniffing 65 chapters
- 1 How This Course Is Examined: the Journal, the 80 Per Cent Rule and the Two-Hour Practical Paper pages 1–4
- 2 The Law: What Makes Hacking Lawful pages 5–9
- 3 The Rest of the Law: Source Code, Identity, Protected Systems and Confidentiality pages 10–15
- 4 Authorisation in Practice: the Letter, the Scope and the Rules of Engagement pages 16–20
- 5 The Vocabulary: Asset, Threat, Vulnerability, Exploit and Risk pages 21–25
- 6 The CIA Triad, and Which Property Each Attack Breaks pages 26–30
- 7 Hacker Classes, Hacktivism and the Types of Hacking pages 31–35
- 8 Types of Engagement: Black Box, White Box, Grey Box, Internal and External pages 36–40
- 9 The Five Phases of an Engagement: a Lifecycle Model pages 41–45
- 10 The Defender's Mirror: a Control for Every Phase pages 46–50
- 11 The Life of a Vulnerability pages 51–54
- 12 Responsible Disclosure Against Full Disclosure, and the Vendor's Side pages 55–59
- 13 CVE and CWE: Naming the Flaw and Naming the Weakness pages 60–63
- 14 CVSS: the Eight Base Metrics pages 64–67
- 15 CVSS: Working a Score, and the Temporal and Environmental Metrics pages 68–72
- 16 Bug Bounty Programmes pages 73–76
- 17 A Worked Case Study: Heartbleed pages 77–81
- 18 A Worked Case Study: Log4Shell pages 82–86
- 19 Footprinting: Passive Against Active Reconnaissance pages 87–91
- 20 OSINT on People: Names, Roles and the Email Format pages 92–95
- 21 OSINT on Technology and Infrastructure pages 96–100
- 22 Search-Engine Reconnaissance and Document Metadata pages 101–105
- 23 Reducing Your Own Footprint: the Defensive Audit pages 106–110
- 24 How the Domain Name System Resolves a Name pages 111–115
- 25 The Record Types, and What Each One Reveals pages 116–120
- 26 Subdomain Enumeration and Infrastructure Mapping pages 121–125
- 27 Zone Transfers and DNS Hardening pages 126–130
- 28 WHOIS, the Registries and IP Allocation pages 131–135
- 29 The Psychology: the Levers an Attacker Pulls pages 136–140
- 30 Phishing, Spear Phishing, Whaling, Smishing and Vishing pages 141–145
- 31 Pretexting, Baiting, Impersonation and Tailgating pages 146–150
- 32 A Worked Case: Analysing a Real Attack pages 151–155
- 33 Defences: Awareness, Verification and Multi-Factor pages 156–160
- 34 Email Authentication: SPF, DKIM and DMARC pages 161–165
- 35 TCP/IP for the Scanner: Layers, Addresses, Ports and Flags pages 166–170
- 36 The Three-Way Handshake, and Why Scanning Works pages 171–175
- 37 Host Discovery: Finding What Is Alive pages 176–180
- 38 The Scan Types: Connect, SYN, FIN, NULL and XMAS pages 181–185
- 39 ACK Scanning and UDP Scanning pages 186–190
- 40 Port States, Service and Version Detection, and OS Fingerprinting pages 191–195
- 41 Firewall and Filter Detection pages 196–200
- 42 How the Scan Is Seen: Intrusion Detection and the Defender's View pages 201–205
- 43 Enumeration and Banner Grabbing pages 206–210
- 44 SNMP Enumeration pages 211–215
- 45 NetBIOS and SMB Enumeration pages 216–220
- 46 LDAP, SMTP and NTP Enumeration pages 221–225
- 47 Enumeration Countermeasures: What to Close pages 226–230
- 48 System Hacking and Privilege Escalation pages 231–235
- 49 Escalation Routes on Linux and Windows, at Concept Level pages 236–241
- 50 Detecting Persistence: the Auto-Start Audit pages 242–247
- 51 Covering Tracks, and Why a Defender Protects the Logs pages 248–252
- 52 Rootkits: How They Hide and How They Are Found pages 253–257
- 53 Spyware and Keyloggers from the Defensive Side pages 258–261
- 54 Encoding, Encryption and Hashing: Three Different Things pages 262–265
- 55 Symmetric and Asymmetric Encryption at Concept Level pages 266–269
- 56 Hash Functions and the Properties They Must Have pages 270–274
- 57 Why a Password Is Never Encrypted: Storage and Salting pages 275–279
- 58 How Passwords Are Attacked, and the Arithmetic of a Keyspace pages 280–283
- 59 Password Policy, Managers and Multi-Factor Authentication pages 284–288
- 60 Cryptographic Weaknesses to Know pages 289–292
- 61 Hubs, Switches, and Passive Sniffing pages 293–297
- 62 MAC Flooding pages 298–301
- 63 ARP Poisoning and the Man in the Middle pages 302–306
- 64 DNS Spoofing pages 307–311
- 65 Countermeasures: Switch Controls and Encryption in Transit pages 312–316
Module II Denial of service and botnets, session and web-server security, the OWASP Top Ten, SQL injection, buffer overflows, wireless security, malware analysis, exploit frameworks, and penetration testing methodology and reporting 61 chapters
- 66 Denial of Service: Attacking Availability pages 317–320
- 67 Volumetric Attacks and Amplification pages 321–325
- 68 Protocol Attacks: the SYN Flood in Depth pages 326–329
- 69 Application-Layer Denial of Service pages 330–334
- 70 Botnets: Architecture and Command and Control pages 335–338
- 71 DDoS Mitigation: the Layered Defence pages 339–343
- 72 Sessions and Tokens: Why They Exist pages 344–347
- 73 How a Session Is Stolen: Prediction, Sniffing and Script pages 348–352
- 74 Session Fixation and Cookie Manipulation pages 353–357
- 75 Cookie Security: Secure, HttpOnly and SameSite pages 358–361
- 76 Cross-Site Request Forgery pages 362–365
- 77 Session Defences in Full pages 366–369
- 78 The Web Server Against the Web Application pages 370–373
- 79 Common Web Server Misconfigurations pages 374–377
- 80 Directory Traversal pages 378–381
- 81 Patch Management pages 382–385
- 82 Hardening and the Security Response Headers pages 386–389
- 83 The OWASP Top 10: What It Is and How It Changed pages 390–394
- 84 A01: Broken Access Control pages 395–398
- 85 Security Misconfiguration and Cryptographic Failures pages 399–402
- 86 Software Supply Chain Failures pages 403–406
- 87 Injection: the Category and Its Members pages 407–410
- 88 Cross-Site Scripting: Stored, Reflected and DOM-Based pages 411–414
- 89 Cross-Site Scripting Defences: Output Encoding and Content Security Policy pages 415–419
- 90 Insecure Design and Authentication Failures pages 420–423
- 91 Integrity, Logging and Exceptional Conditions pages 424–427
- 92 Server-Side Request Forgery pages 428–431
- 93 Input Validation: the Thread Through the Whole List pages 432–436
- 94 SQL Injection: How Input Becomes Logic pages 437–440
- 95 The Types: In-Band, Union-Based and Error-Based pages 441–444
- 96 Blind SQL Injection: Boolean and Time-Based pages 445–448
- 97 Prevention: the Parameterised Query pages 449–453
- 98 Defence in Depth: Least Privilege, Validation and the Web Application Firewall pages 454–458
- 99 Memory Layout: the Stack, the Heap and the Frame pages 459–462
- 100 Stack-Based Buffer Overflow and Return-Address Overwriting pages 463–466
- 101 Heap Overflows and Format-String Flaws, Briefly pages 467–470
- 102 Defences: Bounds Checking, Canaries, DEP, ASLR and Safe Languages pages 471–475
- 103 How Wi-Fi Works: Frames, SSIDs and Association pages 476–479
- 104 WEP and Why It Broke pages 480–483
- 105 WPA and WPA2: AES and the Four-Way Handshake pages 484–487
- 106 WPA3 and the SAE Handshake pages 488–491
- 107 Wireless Attacks: Deauthentication, Evil Twins and Rogue Access Points pages 492–496
- 108 Wireless Best Practice and Enterprise Authentication pages 497–500
- 109 The Malware Families pages 501–504
- 110 Viruses and Worms pages 505–508
- 111 Trojans, Ransomware and Remote Access Tools pages 509–513
- 112 Keyloggers and Spyware: the Architecture pages 514–517
- 113 Detection: Signature, Heuristic and Behavioural pages 518–522
- 114 Safe Analysis: the Sandbox pages 523–526
- 115 Endpoint Protection pages 527–530
- 116 What an Exploit Framework Is pages 531–534
- 117 The Exploit Lifecycle and the Payload pages 535–538
- 118 Post-Exploitation, Bounded by Scope pages 539–543
- 119 The Ethical and Legal Limits of Penetration-Testing Tools pages 544–548
- 120 Why Methodology Matters More Than Tricks pages 549–552
- 121 PTES: the Seven Phases pages 553–556
- 122 The OWASP Testing Guide pages 557–560
- 123 Risk Assessment and Rating pages 561–564
- 124 The Penetration-Test Report pages 565–568
- 125 A Worked Specimen Report pages 569–573
- 126 Retesting and Closing the Engagement pages 574–578
-
Wireless and Sensor Networks
Official Notes munotes.in
Wireless and Sensor Networks
B.SC. (COMPUTER SCIENCE) · SEMESTER 5
Strictly as per the University of Mumbai NEP syllabus in force for B.Sc. (Computer Science)
For B.Sc. (Computer Science) students of the University of Mumbai and all its affiliated colleges
munotes.in Third Year
Wireless and Sensor Networks
Copyright © 2026 munotes.in. All rights reserved.
Written and first published by munotes.in, 2026.
This book is free for individual students to read at munotes.in. No part of it may be reproduced, distributed, stored, translated or used for institutional or classroom purposes in any form without a prior written licence from munotes.in.
Licensing and permissions: contact@munotes.in
The text of statutes and of judgments reproduced in this book is in the public domain under section 52(1)(q) of the Copyright Act 1957. The commentary, arrangement, examples and questions are the original work of munotes.in.
munotes.in is an independent study resource for MU students. It is not affiliated with, endorsed by, or officially connected to the University of Mumbai. Course names and university references describe the students and syllabus the material relates to.
Contents
Module I Wireless sensor networks: the node and the network, operating systems and ad hoc networks, medium access control, routing, transport and middleware
- What a Wireless Sensor Network Is 1
- The Architectural Elements of a Sensor Network 8
- The Sensor Network Protocol Stack and Its Three Planes 15
- The Advantages of Wireless Sensor Networks 20
- The Challenges of Wireless Sensor Networks 25
- Applications of Wireless Sensor Networks 34
- Inside a Sensor Node: The Five Units 39
- The Radio, the Sensors and the Power Supply of a Node 45
- How Long a Node Lasts: The Energy Budget Worked Out 52
- Sensor Taxonomy 58
- The Operating Environment and the Design Factors 64
- Radio Technology in WSNs: The Sensor Radio and Its Link Budget 70
- The Wireless Technologies a Sensor Network Can Use 76
- Network Architecture: Sources, Sinks, Hops and Mobility 82
- Single Hop or Multiple Hops: The Energy Argument Worked Out 87
- Optimization Goals: Quality of Service, Energy Efficiency and Lifetime 93
- Figures of Merit: Scalability, Robustness and Measuring a Network 98
- Deployment and Coverage: Random Against Grid 102
Contents continued
Module I continued Wireless sensor networks: the node and the network, operating systems and ad hoc networks, medium access control, routing, transport and middleware
- Design Principles: Distributed Organisation and In-network Processing 107
- Design Principles: Data Centricity, Location, Activity and Heterogeneity 112
- Service Interfaces of a WSN 117
- Gateway Concepts 121
- Sensor Networks in the Internet of Things: 6LoWPAN, RPL and CoAP 126
- Why a Sensor Node Needs an Operating System 133
- Event-driven or Multithreaded: The Two Execution Models 137
- TinyOS: Components, Tasks and the Scheduler 142
- Commands, Events and Split-phase Operation 147
- nesC: Modules, Configurations, Interfaces and Wiring 152
- Blink: A TinyOS Application Read Line by Line 157
- TOSSIM: Simulating Motes, Radio Gain and Packet Loss 161
- Contiki, RIOT and the Other Sensor Operating Systems 174
- Ad Hoc Networks: MANETs, and How a Sensor Network Differs 185
- The Characteristics and Challenges of Ad Hoc Networks in a WSN 193
- Time Synchronisation and Localisation 202
- Routing in Ad Hoc Networks: Proactive, Reactive and Hybrid 212
Contents continued
Module I continued Wireless sensor networks: the node and the network, operating systems and ad hoc networks, medium access control, routing, transport and middleware
- AODV: Route Discovery and Route Maintenance 220
- DSR, and What Its Routes Cost Against AODV 229
- Measuring a MANET Protocol: Throughput, Delivery Ratio and Delay 237
- Energy Efficiency in Ad Hoc Networks: Where the Energy Goes 243
- Energy-aware Routing 250
- Security in Ad Hoc and Sensor Networks: Goals, Constraints and Attacks 257
- Routing Attacks: Sinkhole, Sybil, Wormhole and HELLO Flood 265
- Keys and Link Security: Key Predistribution, SPINS and 802.15.4 273
- Privacy in Ad Hoc and Sensor Networks 281
- MAC Protocols for Sensor Networks: The Job and Where the Energy Goes 289
- Contention: ALOHA and CSMA 298
- Hidden and Exposed Terminals, and RTS and CTS 309
- CSMA/CA Worked Step by Step 317
- TDMA and Schedule-based MAC 325
- Duty Cycling: Preamble Sampling, B-MAC and X-MAC 332
- S-MAC: Periodic Listen and Sleep, and Keeping Neighbours in Step 341
Contents continued
Module I continued Wireless sensor networks: the node and the network, operating systems and ad hoc networks, medium access control, routing, transport and middleware
- S-MAC: Collision Avoidance, Overhearing Avoidance and Message Passing 348
- S-MAC: Latency, Adaptive Listening and the Energy Saved 355
- Routing Challenges and Design Issues in WSNs 363
- Routing Strategies in WSNs: A Map 370
- Flooding, Gossiping and the Broadcast Storm 377
- SPIN: Negotiating Before Sending 385
- Directed Diffusion and Rumour Routing 392
- LEACH: Clusters That Take Turns 401
- PEGASIS, TEEN and the Other Hierarchical Protocols 409
- Geographic Routing: Greedy Forwarding and GPSR 417
- Routing Tables and What Happens When the Topology Changes 425
- IEEE 802.15.4: The Standard, Its Devices and Its Topologies 433
- The 802.15.4 Physical Layer 440
- The 802.15.4 Superframe and Guaranteed Time Slots 454
- CSMA-CA, Data Transfer and Frames in 802.15.4 466
- Built on 802.15.4: Zigbee Routing, Security and the Later Amendments 479
- Traditional Transport Control Protocols: TCP and UDP 492
- Why a Sensor Network Cannot Simply Run TCP 502
Contents continued
Module I continued Wireless sensor networks: the node and the network, operating systems and ad hoc networks, medium access control, routing, transport and middleware
- Transport Protocol Design Issues in WSNs 511
- Transport Protocols Built for Sensor Networks: PSFQ, ESRT, CODA and RMST 521
- WSN Middleware: Why It Is Needed, and Its Architecture 531
- Middleware Approaches, and TinyDB 540
Module II Wireless transmission: frequencies, signals, antennas, propagation, multiplexing, modulation and spread spectrum, then cellular systems and GSM, DECT, TETRA and UMTS, and satellite and broadcast systems
- Frequencies for Radio Transmission 550
- Signals: Amplitude, Frequency and Phase 559
- Antennas: Radiators, Dipoles and Radiation Patterns 567
- Directional Antennas, Sectorisation, Diversity and Spatial Reuse 576
- Signal Propagation: Ranges, Path Loss and How a Signal Travels 585
- Multipath, Fading and the Doppler Effect 594
- Multiplexing: Space, Frequency, Time and Code 602
- Modulation: ASK, FSK and PSK 611
- Advanced Modulation: MSK, GMSK, QPSK, QAM and OFDM 619
- Spread Spectrum and Direct Sequence 628
- Frequency Hopping Spread Spectrum 636
- Cellular Systems: Cells, Clusters and Frequency Reuse 644
Contents continued
Module II continued Wireless transmission: frequencies, signals, antennas, propagation, multiplexing, modulation and spread spectrum, then cellular systems and GSM, DECT, TETRA and UMTS, and satellite and broadcast systems
- Channel Allocation, Cell Splitting, Sectorisation and Cell Breathing 653
- GSM and Its Mobile Services 662
- The GSM System Architecture 670
- The GSM Radio Interface: Carriers, the TDMA Frame and Bursts 678
- GSM Logical Channels and the Frame Hierarchy 686
- GSM Protocols 694
- Localization and Calling in GSM 701
- Handover in GSM 709
- GSM Security 716
- New Data Services: HSCSD, GPRS and EDGE 724
- DECT: System Architecture and Protocol Architecture 732
- TETRA 740
- UMTS and IMT-2000 748
- The UMTS System Architecture: UTRAN and the Core Network 755
- The UMTS Radio Interface: W-CDMA, Codes, Power Control and Soft Handover 762
- A Web Request Over a Cellular Network 770
- The History of Satellite Systems 778
- Applications of Satellite Systems 785
Contents continued
Module II continued Wireless transmission: frequencies, signals, antennas, propagation, multiplexing, modulation and spread spectrum, then cellular systems and GSM, DECT, TETRA and UMTS, and satellite and broadcast systems
- Satellite Basics: Orbits, Periods, Elevation and Footprints 793
- GEO: The Geostationary Orbit 803
- LEO and MEO 813
- Routing in Satellite Systems 822
- Localization and Handover in Satellite Systems 832
- Broadcast Systems: Cyclic Repetition, DAB and DVB 840
- Across the Two Modules: The Comparisons Question 3 Draws On 851
Page 1 onwards
862 pages in this book. The cover and the contents are above. Everything from page one is in the pass.
- Notes
- 2026 Edition, as per the latest syllabus. 862 pages.
Every chapter in the notes: 110 chapters across 2 modules
Module I Wireless sensor networks: the node and the network, operating systems and ad hoc networks, medium access control, routing, transport and middleware 73 chapters
- 1 What a Wireless Sensor Network Is pages 1–7
- 2 The Architectural Elements of a Sensor Network pages 8–14
- 3 The Sensor Network Protocol Stack and Its Three Planes pages 15–19
- 4 The Advantages of Wireless Sensor Networks pages 20–24
- 5 The Challenges of Wireless Sensor Networks pages 25–33
- 6 Applications of Wireless Sensor Networks pages 34–38
- 7 Inside a Sensor Node: The Five Units pages 39–44
- 8 The Radio, the Sensors and the Power Supply of a Node pages 45–51
- 9 How Long a Node Lasts: The Energy Budget Worked Out pages 52–57
- 10 Sensor Taxonomy pages 58–63
- 11 The Operating Environment and the Design Factors pages 64–69
- 12 Radio Technology in WSNs: The Sensor Radio and Its Link Budget pages 70–75
- 13 The Wireless Technologies a Sensor Network Can Use pages 76–81
- 14 Network Architecture: Sources, Sinks, Hops and Mobility pages 82–86
- 15 Single Hop or Multiple Hops: The Energy Argument Worked Out pages 87–92
- 16 Optimization Goals: Quality of Service, Energy Efficiency and Lifetime pages 93–97
- 17 Figures of Merit: Scalability, Robustness and Measuring a Network pages 98–101
- 18 Deployment and Coverage: Random Against Grid pages 102–106
- 19 Design Principles: Distributed Organisation and In-network Processing pages 107–111
- 20 Design Principles: Data Centricity, Location, Activity and Heterogeneity pages 112–116
- 21 Service Interfaces of a WSN pages 117–120
- 22 Gateway Concepts pages 121–125
- 23 Sensor Networks in the Internet of Things: 6LoWPAN, RPL and CoAP pages 126–132
- 24 Why a Sensor Node Needs an Operating System pages 133–136
- 25 Event-driven or Multithreaded: The Two Execution Models pages 137–141
- 26 TinyOS: Components, Tasks and the Scheduler pages 142–146
- 27 Commands, Events and Split-phase Operation pages 147–151
- 28 nesC: Modules, Configurations, Interfaces and Wiring pages 152–156
- 29 Blink: A TinyOS Application Read Line by Line pages 157–160
- 30 TOSSIM: Simulating Motes, Radio Gain and Packet Loss pages 161–173
- 31 Contiki, RIOT and the Other Sensor Operating Systems pages 174–184
- 32 Ad Hoc Networks: MANETs, and How a Sensor Network Differs pages 185–192
- 33 The Characteristics and Challenges of Ad Hoc Networks in a WSN pages 193–201
- 34 Time Synchronisation and Localisation pages 202–211
- 35 Routing in Ad Hoc Networks: Proactive, Reactive and Hybrid pages 212–219
- 36 AODV: Route Discovery and Route Maintenance pages 220–228
- 37 DSR, and What Its Routes Cost Against AODV pages 229–236
- 38 Measuring a MANET Protocol: Throughput, Delivery Ratio and Delay pages 237–242
- 39 Energy Efficiency in Ad Hoc Networks: Where the Energy Goes pages 243–249
- 40 Energy-aware Routing pages 250–256
- 41 Security in Ad Hoc and Sensor Networks: Goals, Constraints and Attacks pages 257–264
- 42 Routing Attacks: Sinkhole, Sybil, Wormhole and HELLO Flood pages 265–272
- 43 Keys and Link Security: Key Predistribution, SPINS and 802.15.4 pages 273–280
- 44 Privacy in Ad Hoc and Sensor Networks pages 281–288
- 45 MAC Protocols for Sensor Networks: The Job and Where the Energy Goes pages 289–297
- 46 Contention: ALOHA and CSMA pages 298–308
- 47 Hidden and Exposed Terminals, and RTS and CTS pages 309–316
- 48 CSMA/CA Worked Step by Step pages 317–324
- 49 TDMA and Schedule-based MAC pages 325–331
- 50 Duty Cycling: Preamble Sampling, B-MAC and X-MAC pages 332–340
- 51 S-MAC: Periodic Listen and Sleep, and Keeping Neighbours in Step pages 341–347
- 52 S-MAC: Collision Avoidance, Overhearing Avoidance and Message Passing pages 348–354
- 53 S-MAC: Latency, Adaptive Listening and the Energy Saved pages 355–362
- 54 Routing Challenges and Design Issues in WSNs pages 363–369
- 55 Routing Strategies in WSNs: A Map pages 370–376
- 56 Flooding, Gossiping and the Broadcast Storm pages 377–384
- 57 SPIN: Negotiating Before Sending pages 385–391
- 58 Directed Diffusion and Rumour Routing pages 392–400
- 59 LEACH: Clusters That Take Turns pages 401–408
- 60 PEGASIS, TEEN and the Other Hierarchical Protocols pages 409–416
- 61 Geographic Routing: Greedy Forwarding and GPSR pages 417–424
- 62 Routing Tables and What Happens When the Topology Changes pages 425–432
- 63 IEEE 802.15.4: The Standard, Its Devices and Its Topologies pages 433–439
- 64 The 802.15.4 Physical Layer pages 440–453
- 65 The 802.15.4 Superframe and Guaranteed Time Slots pages 454–465
- 66 CSMA-CA, Data Transfer and Frames in 802.15.4 pages 466–478
- 67 Built on 802.15.4: Zigbee Routing, Security and the Later Amendments pages 479–491
- 68 Traditional Transport Control Protocols: TCP and UDP pages 492–501
- 69 Why a Sensor Network Cannot Simply Run TCP pages 502–510
- 70 Transport Protocol Design Issues in WSNs pages 511–520
- 71 Transport Protocols Built for Sensor Networks: PSFQ, ESRT, CODA and RMST pages 521–530
- 72 WSN Middleware: Why It Is Needed, and Its Architecture pages 531–539
- 73 Middleware Approaches, and TinyDB pages 540–549
Module II Wireless transmission: frequencies, signals, antennas, propagation, multiplexing, modulation and spread spectrum, then cellular systems and GSM, DECT, TETRA and UMTS, and satellite and broadcast systems 37 chapters
- 74 Frequencies for Radio Transmission pages 550–558
- 75 Signals: Amplitude, Frequency and Phase pages 559–566
- 76 Antennas: Radiators, Dipoles and Radiation Patterns pages 567–575
- 77 Directional Antennas, Sectorisation, Diversity and Spatial Reuse pages 576–584
- 78 Signal Propagation: Ranges, Path Loss and How a Signal Travels pages 585–593
- 79 Multipath, Fading and the Doppler Effect pages 594–601
- 80 Multiplexing: Space, Frequency, Time and Code pages 602–610
- 81 Modulation: ASK, FSK and PSK pages 611–618
- 82 Advanced Modulation: MSK, GMSK, QPSK, QAM and OFDM pages 619–627
- 83 Spread Spectrum and Direct Sequence pages 628–635
- 84 Frequency Hopping Spread Spectrum pages 636–643
- 85 Cellular Systems: Cells, Clusters and Frequency Reuse pages 644–652
- 86 Channel Allocation, Cell Splitting, Sectorisation and Cell Breathing pages 653–661
- 87 GSM and Its Mobile Services pages 662–669
- 88 The GSM System Architecture pages 670–677
- 89 The GSM Radio Interface: Carriers, the TDMA Frame and Bursts pages 678–685
- 90 GSM Logical Channels and the Frame Hierarchy pages 686–693
- 91 GSM Protocols pages 694–700
- 92 Localization and Calling in GSM pages 701–708
- 93 Handover in GSM pages 709–715
- 94 GSM Security pages 716–723
- 95 New Data Services: HSCSD, GPRS and EDGE pages 724–731
- 96 DECT: System Architecture and Protocol Architecture pages 732–739
- 97 TETRA pages 740–747
- 98 UMTS and IMT-2000 pages 748–754
- 99 The UMTS System Architecture: UTRAN and the Core Network pages 755–761
- 100 The UMTS Radio Interface: W-CDMA, Codes, Power Control and Soft Handover pages 762–769
- 101 A Web Request Over a Cellular Network pages 770–777
- 102 The History of Satellite Systems pages 778–784
- 103 Applications of Satellite Systems pages 785–792
- 104 Satellite Basics: Orbits, Periods, Elevation and Footprints pages 793–802
- 105 GEO: The Geostationary Orbit pages 803–812
- 106 LEO and MEO pages 813–821
- 107 Routing in Satellite Systems pages 822–831
- 108 Localization and Handover in Satellite Systems pages 832–839
- 109 Broadcast Systems: Cyclic Repetition, DAB and DVB pages 840–850
- 110 Across the Two Modules: The Comparisons Question 3 Draws On pages 851–862
-
Software Testing and Quality Assurance
Official Notes munotes.in
Software Testing and Quality Assurance
B.SC. (COMPUTER SCIENCE) · SEMESTER 5
Strictly as per the University of Mumbai NEP syllabus in force for B.Sc. (Computer Science)
For B.Sc. (Computer Science) students of the University of Mumbai and all its affiliated colleges
munotes.in Third Year
Software Testing and Quality Assurance
Copyright © 2026 munotes.in. All rights reserved.
Written and first published by munotes.in, 2026.
This book is free for individual students to read at munotes.in. No part of it may be reproduced, distributed, stored, translated or used for institutional or classroom purposes in any form without a prior written licence from munotes.in.
Licensing and permissions: contact@munotes.in
The text of statutes and of judgments reproduced in this book is in the public domain under section 52(1)(q) of the Copyright Act 1957. The commentary, arrangement, examples and questions are the original work of munotes.in.
munotes.in is an independent study resource for MU students. It is not affiliated with, endorsed by, or officially connected to the University of Mumbai. Course names and university references describe the students and syllabus the material relates to.
Contents
Module I Testing fundamentals and the test process, the SDLC and quality factors, quality, QA, QC, QM and SQA, verification and validation with reviews, inspection and walkthroughs, and the testing strategies from unit to system testing, debugging and test automation
- What Software Testing Is 1
- Errors, Faults and Failures 8
- Why Software Must Be Tested 15
- The Seven Principles of Testing 23
- The Basic Test Process 29
- The Software Testing Life Cycle, Phase by Phase 35
- What a Test Case Is, and What Makes a Good One 40
- Test Design Techniques: The Three Families 46
- Test Execution 51
- Test Reporting 57
- Writing a Test Plan 62
- The Test Documents, From Design to Completion 68
- What a Software Development Life Cycle Is 73
- The Waterfall Model, and What Royce Actually Said 77
- The V-Model: A Test Level for Every Phase 82
- Iterative, Incremental and Spiral Models 86
- Agile, Scrum and DevOps: Testing in Short Cycles 91
- The Role of Testing in Each Phase 97
- Software Quality Factors: McCall's Model 102
- From McCall to ISO/IEC 25010: The Quality Model Today 106
Contents continued
Module I continued Testing fundamentals and the test process, the SDLC and quality factors, quality, QA, QC, QM and SQA, verification and validation with reviews, inspection and walkthroughs, and the testing strategies from unit to system testing, debugging and test automation
- How Quality Factors Shape Testing 111
- What Quality Means 116
- Quality in Software Development 120
- Quality Control and Quality Assurance 129
- Quality Management and Software Quality Assurance 135
- Verification and Validation, and Why Both Matter 140
- The Kinds of V&V: Static and Dynamic Mechanisms 146
- Software Reviews: The Process, the Roles and the Types 152
- Inspection 158
- Walkthrough, and How It Differs From an Inspection 165
- A Strategic Approach to Software Testing 171
- Test Levels and Test Types 177
- Unit Testing: What It Is For 183
- Unit Testing Techniques: Drivers, Stubs and Test Doubles 188
- Writing Unit Tests With a Framework 193
- Unit Testing Best Practices 198
- Integration Testing: Why Units That Work Can Fail Together 204
- Top-Down, Bottom-Up and Sandwich Integration 209
- Regression Testing, Smoke Testing and Continuous Integration 215
Contents continued
Module I continued Testing fundamentals and the test process, the SDLC and quality factors, quality, QA, QC, QM and SQA, verification and validation with reviews, inspection and walkthroughs, and the testing strategies from unit to system testing, debugging and test automation
- The Challenges of Integration Testing 221
- Validation Testing 226
- Acceptance Testing: Alpha, Beta and User Acceptance 231
- System Testing: The Whole System, End to End 236
- Recovery, Security, Stress, Performance and Deployment Testing 241
- Load Testing: Users, Ramp-Up, Throughput and Error Rate 247
- Cross-Browser and Compatibility Testing 252
- Debugging: From a Failure Back to Its Fault 257
- Test Automation: What to Automate and What Not To 262
- Driving a Browser: WebDriver, Locators and Waits 267
- Data-Driven Testing 273
- The Page Object Model 278
Module II Black-box, white-box and experience-based test design, software metrics and complexity, defect management, the quality movement, SQA and reliability, ISO 9000, formal technical reviews, quality costs and the seven basic quality tools
- Black-Box and White-Box Testing 283
- Specification-Based Testing 292
- Equivalence Partitioning 300
- Boundary Value Analysis 308
- Decision Table Testing 315
Contents continued
Module II continued Black-box, white-box and experience-based test design, software metrics and complexity, defect management, the quality movement, SQA and reliability, ISO 9000, formal technical reviews, quality costs and the seven basic quality tools
- State Transition Testing 323
- Structural Testing: Seeing Inside the Code 330
- Statement Testing and Statement Coverage 337
- Branch Testing and Branch Coverage 343
- Experience-Based Testing 350
- Error Guessing 355
- Exploratory Testing 360
- Checklist-Based Testing 366
- What a Software Metric Is, and Why Measure 372
- Developing Metrics: Goal, Question, Metric 378
- Size Metrics: Lines of Code and Function Points 384
- Quality, Process and Test Metrics 391
- Object-Oriented Metrics: The CK Suite 396
- Cyclomatic Complexity 402
- Halstead's Measures and Other Complexity Metrics 408
- Why Complexity Matters to Testing: Basis Path Testing 415
- What a Defect Is 421
- The Defect Life Cycle 426
- The Defect Management Process 431
Contents continued
Module II continued Black-box, white-box and experience-based test design, software metrics and complexity, defect management, the quality movement, SQA and reliability, ISO 9000, formal technical reviews, quality costs and the seven basic quality tools
- Writing a Defect Report: Severity and Priority 436
- Tracking Defects to Closure 441
- A Defect Tracker at Work: Bugzilla 446
- Defect Metrics 452
- Using Defect Data to Improve the Process 458
- Quality Concepts: Variation, Design and Conformance 463
- The Quality Movement: Shewhart, Deming and Juran 472
- The Quality Movement: Feigenbaum, Ishikawa, Crosby and TQM 480
- Background Issues in Software Quality Assurance 488
- The Challenges in Software Quality Assurance 494
- SQA Activities: What the SQA Group Does 500
- The Software Quality Assurance Plan 506
- Approaches to SQA: Formal Methods, Cleanroom and Process Models 512
- Statistical Software Quality Assurance and Six Sigma 520
- Software Reliability 526
- Statistical Process Control: Control Charts for Software 531
- Measuring Software Reliability 538
- Improving Software Reliability 543
- The ISO 9000 Family and the Seven Principles 548
Contents continued
Module II continued Black-box, white-box and experience-based test design, software metrics and complexity, defect management, the quality movement, SQA and reliability, ISO 9000, formal technical reviews, quality costs and the seven basic quality tools
- ISO 9001: The Requirements, Certification and Software 552
- Why Reviews Pay: The Cost of a Late Defect 557
- Formal Technical Reviews 562
- The Benefits of Formal Technical Reviews 568
- Quality Improvement Methodologies: PDCA and Kaizen 572
- Lean, CMMI and Choosing a Methodology 577
- The Cost of Quality 583
- Using Quality Costs for Decision Making 587
- The Seven Basic Quality Tools 592
- Pareto Diagrams 597
- Cause-Effect Diagrams 602
- Scatter Diagrams 608
- Run Charts 612
- What the Examination Asks, and How to Answer It 618
Page 1 onwards
622 pages in this book. The cover and the contents are above. Everything from page one is in the pass.
- Notes
- 2026 Edition, as per the latest syllabus. 622 pages.
Every chapter in the notes: 108 chapters across 2 modules
Module I Testing fundamentals and the test process, the SDLC and quality factors, quality, QA, QC, QM and SQA, verification and validation with reviews, inspection and walkthroughs, and the testing strategies from unit to system testing, debugging and test automation 51 chapters
- 1 What Software Testing Is pages 1–7
- 2 Errors, Faults and Failures pages 8–14
- 3 Why Software Must Be Tested pages 15–22
- 4 The Seven Principles of Testing pages 23–28
- 5 The Basic Test Process pages 29–34
- 6 The Software Testing Life Cycle, Phase by Phase pages 35–39
- 7 What a Test Case Is, and What Makes a Good One pages 40–45
- 8 Test Design Techniques: The Three Families pages 46–50
- 9 Test Execution pages 51–56
- 10 Test Reporting pages 57–61
- 11 Writing a Test Plan pages 62–67
- 12 The Test Documents, From Design to Completion pages 68–72
- 13 What a Software Development Life Cycle Is pages 73–76
- 14 The Waterfall Model, and What Royce Actually Said pages 77–81
- 15 The V-Model: A Test Level for Every Phase pages 82–85
- 16 Iterative, Incremental and Spiral Models pages 86–90
- 17 Agile, Scrum and DevOps: Testing in Short Cycles pages 91–96
- 18 The Role of Testing in Each Phase pages 97–101
- 19 Software Quality Factors: McCall's Model pages 102–105
- 20 From McCall to ISO/IEC 25010: The Quality Model Today pages 106–110
- 21 How Quality Factors Shape Testing pages 111–115
- 22 What Quality Means pages 116–119
- 23 Quality in Software Development pages 120–128
- 24 Quality Control and Quality Assurance pages 129–134
- 25 Quality Management and Software Quality Assurance pages 135–139
- 26 Verification and Validation, and Why Both Matter pages 140–145
- 27 The Kinds of V&V: Static and Dynamic Mechanisms pages 146–151
- 28 Software Reviews: The Process, the Roles and the Types pages 152–157
- 29 Inspection pages 158–164
- 30 Walkthrough, and How It Differs From an Inspection pages 165–170
- 31 A Strategic Approach to Software Testing pages 171–176
- 32 Test Levels and Test Types pages 177–182
- 33 Unit Testing: What It Is For pages 183–187
- 34 Unit Testing Techniques: Drivers, Stubs and Test Doubles pages 188–192
- 35 Writing Unit Tests With a Framework pages 193–197
- 36 Unit Testing Best Practices pages 198–203
- 37 Integration Testing: Why Units That Work Can Fail Together pages 204–208
- 38 Top-Down, Bottom-Up and Sandwich Integration pages 209–214
- 39 Regression Testing, Smoke Testing and Continuous Integration pages 215–220
- 40 The Challenges of Integration Testing pages 221–225
- 41 Validation Testing pages 226–230
- 42 Acceptance Testing: Alpha, Beta and User Acceptance pages 231–235
- 43 System Testing: The Whole System, End to End pages 236–240
- 44 Recovery, Security, Stress, Performance and Deployment Testing pages 241–246
- 45 Load Testing: Users, Ramp-Up, Throughput and Error Rate pages 247–251
- 46 Cross-Browser and Compatibility Testing pages 252–256
- 47 Debugging: From a Failure Back to Its Fault pages 257–261
- 48 Test Automation: What to Automate and What Not To pages 262–266
- 49 Driving a Browser: WebDriver, Locators and Waits pages 267–272
- 50 Data-Driven Testing pages 273–277
- 51 The Page Object Model pages 278–282
Module II Black-box, white-box and experience-based test design, software metrics and complexity, defect management, the quality movement, SQA and reliability, ISO 9000, formal technical reviews, quality costs and the seven basic quality tools 57 chapters
- 52 Black-Box and White-Box Testing pages 283–291
- 53 Specification-Based Testing pages 292–299
- 54 Equivalence Partitioning pages 300–307
- 55 Boundary Value Analysis pages 308–314
- 56 Decision Table Testing pages 315–322
- 57 State Transition Testing pages 323–329
- 58 Structural Testing: Seeing Inside the Code pages 330–336
- 59 Statement Testing and Statement Coverage pages 337–342
- 60 Branch Testing and Branch Coverage pages 343–349
- 61 Experience-Based Testing pages 350–354
- 62 Error Guessing pages 355–359
- 63 Exploratory Testing pages 360–365
- 64 Checklist-Based Testing pages 366–371
- 65 What a Software Metric Is, and Why Measure pages 372–377
- 66 Developing Metrics: Goal, Question, Metric pages 378–383
- 67 Size Metrics: Lines of Code and Function Points pages 384–390
- 68 Quality, Process and Test Metrics pages 391–395
- 69 Object-Oriented Metrics: The CK Suite pages 396–401
- 70 Cyclomatic Complexity pages 402–407
- 71 Halstead's Measures and Other Complexity Metrics pages 408–414
- 72 Why Complexity Matters to Testing: Basis Path Testing pages 415–420
- 73 What a Defect Is pages 421–425
- 74 The Defect Life Cycle pages 426–430
- 75 The Defect Management Process pages 431–435
- 76 Writing a Defect Report: Severity and Priority pages 436–440
- 77 Tracking Defects to Closure pages 441–445
- 78 A Defect Tracker at Work: Bugzilla pages 446–451
- 79 Defect Metrics pages 452–457
- 80 Using Defect Data to Improve the Process pages 458–462
- 81 Quality Concepts: Variation, Design and Conformance pages 463–471
- 82 The Quality Movement: Shewhart, Deming and Juran pages 472–479
- 83 The Quality Movement: Feigenbaum, Ishikawa, Crosby and TQM pages 480–487
- 84 Background Issues in Software Quality Assurance pages 488–493
- 85 The Challenges in Software Quality Assurance pages 494–499
- 86 SQA Activities: What the SQA Group Does pages 500–505
- 87 The Software Quality Assurance Plan pages 506–511
- 88 Approaches to SQA: Formal Methods, Cleanroom and Process Models pages 512–519
- 89 Statistical Software Quality Assurance and Six Sigma pages 520–525
- 90 Software Reliability pages 526–530
- 91 Statistical Process Control: Control Charts for Software pages 531–537
- 92 Measuring Software Reliability pages 538–542
- 93 Improving Software Reliability pages 543–547
- 94 The ISO 9000 Family and the Seven Principles pages 548–551
- 95 ISO 9001: The Requirements, Certification and Software pages 552–556
- 96 Why Reviews Pay: The Cost of a Late Defect pages 557–561
- 97 Formal Technical Reviews pages 562–567
- 98 The Benefits of Formal Technical Reviews pages 568–571
- 99 Quality Improvement Methodologies: PDCA and Kaizen pages 572–576
- 100 Lean, CMMI and Choosing a Methodology pages 577–582
- 101 The Cost of Quality pages 583–586
- 102 Using Quality Costs for Decision Making pages 587–591
- 103 The Seven Basic Quality Tools pages 592–596
- 104 Pareto Diagrams pages 597–601
- 105 Cause-Effect Diagrams pages 602–607
- 106 Scatter Diagrams pages 608–611
- 107 Run Charts pages 612–617
- 108 What the Examination Asks, and How to Answer It pages 618–622
-
IKS in Computational Systems
Official Notes munotes.in
IKS in Computational Systems
B.SC. (COMPUTER SCIENCE) · SEMESTER 5
Strictly as per the University of Mumbai NEP syllabus in force for B.Sc. (Computer Science)
For B.Sc. (Computer Science) students of the University of Mumbai and all its affiliated colleges
munotes.in Third Year
IKS in Computational Systems
Copyright © 2026 munotes.in. All rights reserved.
Written and first published by munotes.in, 2026.
This book is free for individual students to read at munotes.in. No part of it may be reproduced, distributed, stored, translated or used for institutional or classroom purposes in any form without a prior written licence from munotes.in.
Licensing and permissions: contact@munotes.in
The text of statutes and of judgments reproduced in this book is in the public domain under section 52(1)(q) of the Copyright Act 1957. The commentary, arrangement, examples and questions are the original work of munotes.in.
munotes.in is an independent study resource for MU students. It is not affiliated with, endorsed by, or officially connected to the University of Mumbai. Course names and university references describe the students and syllabus the material relates to.
Contents
Module I Sastra methodology and knowledge formalization, Pingala's Chandahsastra as binary encoding and combinatorial generation, and Panini's Astadhyayi as a generative formal grammar
- Why a Computer Science Student Reads a Śāstra 1
- How This Paper Is Examined, and What That Means for How You Read 4
- Śāstra: What Makes a Body of Knowledge Formal 7
- The Sūtra Method as Compressed Symbolic Encoding 10
- Pramāṇa: Where Knowledge Is Allowed To Come From 13
- Pratyakṣa: Perception, and Why It Is Defined So Narrowly 16
- Anumāna: Inference in Outline 19
- Āgama: Testimony, and the Trusted Source as a Design Decision 22
- Knowledge Validation and Structured Reasoning 26
- Knowledge Representation: The Modern Name For It 29
- Formal Specification: Saying Exactly What a System Must Do 32
- Computational Thinking, and the Four Habits It Names 35
- Piṅgala's Chandaḥśāstra, and the Text We Are Reading 38
- Syllables, Laghu and Guru: Sanskrit Metre Without Sanskrit 41
- Laghu and Guru as One Bit 44
- Prastāra: The Table of Every Pattern 47
- The Prastāra Rule Read as an Algorithm 51
- Prastāra in Code 55
- Binary Number Systems, and Exactly Where Piṅgala's Order Agrees 59
Contents continued
Module I continued Sastra methodology and knowledge formalization, Pingala's Chandahsastra as binary encoding and combinatorial generation, and Panini's Astadhyayi as a generative formal grammar
- Saṅkhyā: Counting the Rows Without Writing Them 63
- Binary Exponentiation: The Same Algorithm in a Modern Textbook 67
- Uddiṣṭa: From a Pattern to Its Row Number 70
- Naṣṭa: From a Row Number Back to the Pattern 73
- Index Retrieval, and Proving Two Rules Are Inverses 77
- Recursive Enumeration 80
- Tree Structures, and the Prastāra as a Binary Tree 83
- Meru-Prastāra: Halāyudha's Staircase 87
- Pascal Triangle and Combinatorics 91
- Meru-Prastāra as a Dynamic Programming Model 95
- Lagakriyā and Adhvayoga: The Rest of the Pratyayas 99
- Algorithmic Generation: What Piṅgala Actually Achieved 102
- Pāṇini's Aṣṭādhyāyī, and the Text We Are Reading 105
- The Six Kinds of Sūtra, in Vasu's Own Words 108
- The Fourteen Śivasūtras and the Pratyāhāra 112
- Anubandha: The Marker Letter as a Type Tag 116
- Rule-Based Generative Structure 119
- Meta-Rules: Paribhāṣā, and Rules About Rules 122
- Rule Precedence: The Four Principles 125
Contents continued
Module I continued Sastra methodology and knowledge formalization, Pingala's Chandahsastra as binary encoding and combinatorial generation, and Panini's Astadhyayi as a generative formal grammar
- Vipratiṣedha: When Two Rules Collide, the Later Wins 128
- Context-Sensitive Operations 131
- Asiddhatva and the Tripādī: Ordering by Blocking 134
- Conflict Resolution Mechanisms, Collected 137
- Formal Grammars: Alphabet, Rule, Derivation, Language 140
- Context-Free Grammar, and Whether Pāṇini Wrote One 143
- The Chomsky Hierarchy, and Where the Aṣṭādhyāyī Sits 147
- Rewrite Systems 150
- Automata Theory Foundations: The Finite Automaton 154
- Śāstra Rule Precedence as a Deterministic Finite Rewrite System 158
- Parsing Algorithms 164
- Foundations of NLP, and What Pāṇinian Grammar Contributed 168
- Pāṇini's Aṣṭādhyāyī as a Rule-Based Grammar Engine 172
- Practice for Module I 176
Module II Nyaya logic as structured inference, Ayurvedic classification as a rule-based expert system, and Arthasastra cryptography as a secure communication model
- Nyāya: The School, the Sūtra and the Sixteen Categories 181
- The Four Pramāṇas of Nyāya, and Why Charaka Has Three 184
- Anumāna: Vyāpti, and the Three Kinds of Inference 187
Contents continued
Module II continued Nyaya logic as structured inference, Ayurvedic classification as a rule-based expert system, and Arthasastra cryptography as a secure communication model
- The Five-Member Syllogism 191
- The Five Members Worked, Three Times 195
- Five Members Against Aristotle's Three 198
- Hetvābhāsa: The Five Fallacies of the Reason 201
- Chala, Jāti and Nigrahasthāna: How a Debate Is Lost 205
- Vāda, Jalpa and Vitaṇḍā: Three Kinds of Dispute 209
- Debate Methodology as a Validation Protocol 213
- Padārtha: The Categories of What Exists 217
- Padārtha Ontology as a Knowledge Representation Model 221
- Propositional Logic: The Minimum You Need 226
- Predicate Logic, and Why Anumāna Needs It 231
- The Five Members Written in Logical Notation 234
- Inference Engines: Forward and Backward Chaining 237
- Nyāya Logic as an Inference Engine 241
- Explainable AI, and Why a Five-Member Answer Is an Explanation 246
- Āyurveda as a Śāstra, and What This Chapter Does Not Claim 250
- The Tridoṣa Framework 254
- Doṣa as a Feature Vector 258
- Prakṛti: Constitution as a Class Label 262
Contents continued
Module II continued Nyaya logic as structured inference, Ayurvedic classification as a rule-based expert system, and Arthasastra cryptography as a secure communication model
- Parīkṣā: How an Examination Is Structured 265
- Symptom to Feature Mapping 269
- Multi-Attribute Classification 273
- Decision Principles in Diagnosis 276
- Decision Trees 280
- A Decision Tree Built From the Tridoṣa Attributes 285
- Rule-Based Systems 289
- Expert Systems, and MYCIN as the Comparison 293
- Feature Engineering 297
- Multi-Class Classification, and How It Is Scored 300
- Ayurvedic Classification as a Rule-Based Expert System 303
- The Arthaśāstra, and Its Intelligence Apparatus 310
- Secret Communication: What the Text Actually Says 313
- The Royal Writs as a Message Format 316
- Substitution Systems 319
- Transposition Systems 323
- Substitution and Transposition in Code 328
- Concealment and Coded Messaging 335
- Basic Steganography 338
Contents continued
Module II continued Nyaya logic as structured inference, Ayurvedic classification as a rule-based expert system, and Arthasastra cryptography as a secure communication model
- Information Protection Mechanisms 342
- Symmetric Encryption 345
- Cipher Algorithms, Classical to Modern 348
- Breaking a Classical Cipher 351
- Arthaśāstra-Inspired Cryptography as a Symmetric Cipher System 356
- Secure Protocol Abstraction 360
- Foundations of Cybersecurity 363
- The Internal Assessment: Building and Presenting the Implementation 366
- Practice for Module II 370
- The Whole Paper on One Page 374
Page 1 onwards
378 pages in this book. The cover and the contents are above. Everything from page one is in the pass.
- Notes
- 2026 Edition, as per the latest syllabus. 378 pages.
Every chapter in the notes: 103 chapters across 2 modules
Module I Sastra methodology and knowledge formalization, Pingala's Chandahsastra as binary encoding and combinatorial generation, and Panini's Astadhyayi as a generative formal grammar 52 chapters
- 1 Why a Computer Science Student Reads a Śāstra pages 1–3
- 2 How This Paper Is Examined, and What That Means for How You Read pages 4–6
- 3 Śāstra: What Makes a Body of Knowledge Formal pages 7–9
- 4 The Sūtra Method as Compressed Symbolic Encoding pages 10–12
- 5 Pramāṇa: Where Knowledge Is Allowed To Come From pages 13–15
- 6 Pratyakṣa: Perception, and Why It Is Defined So Narrowly pages 16–18
- 7 Anumāna: Inference in Outline pages 19–21
- 8 Āgama: Testimony, and the Trusted Source as a Design Decision pages 22–25
- 9 Knowledge Validation and Structured Reasoning pages 26–28
- 10 Knowledge Representation: The Modern Name For It pages 29–31
- 11 Formal Specification: Saying Exactly What a System Must Do pages 32–34
- 12 Computational Thinking, and the Four Habits It Names pages 35–37
- 13 Piṅgala's Chandaḥśāstra, and the Text We Are Reading pages 38–40
- 14 Syllables, Laghu and Guru: Sanskrit Metre Without Sanskrit pages 41–43
- 15 Laghu and Guru as One Bit pages 44–46
- 16 Prastāra: The Table of Every Pattern pages 47–50
- 17 The Prastāra Rule Read as an Algorithm pages 51–54
- 18 Prastāra in Code pages 55–58
- 19 Binary Number Systems, and Exactly Where Piṅgala's Order Agrees pages 59–62
- 20 Saṅkhyā: Counting the Rows Without Writing Them pages 63–66
- 21 Binary Exponentiation: The Same Algorithm in a Modern Textbook pages 67–69
- 22 Uddiṣṭa: From a Pattern to Its Row Number pages 70–72
- 23 Naṣṭa: From a Row Number Back to the Pattern pages 73–76
- 24 Index Retrieval, and Proving Two Rules Are Inverses pages 77–79
- 25 Recursive Enumeration pages 80–82
- 26 Tree Structures, and the Prastāra as a Binary Tree pages 83–86
- 27 Meru-Prastāra: Halāyudha's Staircase pages 87–90
- 28 Pascal Triangle and Combinatorics pages 91–94
- 29 Meru-Prastāra as a Dynamic Programming Model pages 95–98
- 30 Lagakriyā and Adhvayoga: The Rest of the Pratyayas pages 99–101
- 31 Algorithmic Generation: What Piṅgala Actually Achieved pages 102–104
- 32 Pāṇini's Aṣṭādhyāyī, and the Text We Are Reading pages 105–107
- 33 The Six Kinds of Sūtra, in Vasu's Own Words pages 108–111
- 34 The Fourteen Śivasūtras and the Pratyāhāra pages 112–115
- 35 Anubandha: The Marker Letter as a Type Tag pages 116–118
- 36 Rule-Based Generative Structure pages 119–121
- 37 Meta-Rules: Paribhāṣā, and Rules About Rules pages 122–124
- 38 Rule Precedence: The Four Principles pages 125–127
- 39 Vipratiṣedha: When Two Rules Collide, the Later Wins pages 128–130
- 40 Context-Sensitive Operations pages 131–133
- 41 Asiddhatva and the Tripādī: Ordering by Blocking pages 134–136
- 42 Conflict Resolution Mechanisms, Collected pages 137–139
- 43 Formal Grammars: Alphabet, Rule, Derivation, Language pages 140–142
- 44 Context-Free Grammar, and Whether Pāṇini Wrote One pages 143–146
- 45 The Chomsky Hierarchy, and Where the Aṣṭādhyāyī Sits pages 147–149
- 46 Rewrite Systems pages 150–153
- 47 Automata Theory Foundations: The Finite Automaton pages 154–157
- 48 Śāstra Rule Precedence as a Deterministic Finite Rewrite System pages 158–163
- 49 Parsing Algorithms pages 164–167
- 50 Foundations of NLP, and What Pāṇinian Grammar Contributed pages 168–171
- 51 Pāṇini's Aṣṭādhyāyī as a Rule-Based Grammar Engine pages 172–175
- 52 Practice for Module I pages 176–180
Module II Nyaya logic as structured inference, Ayurvedic classification as a rule-based expert system, and Arthasastra cryptography as a secure communication model 51 chapters
- 53 Nyāya: The School, the Sūtra and the Sixteen Categories pages 181–183
- 54 The Four Pramāṇas of Nyāya, and Why Charaka Has Three pages 184–186
- 55 Anumāna: Vyāpti, and the Three Kinds of Inference pages 187–190
- 56 The Five-Member Syllogism pages 191–194
- 57 The Five Members Worked, Three Times pages 195–197
- 58 Five Members Against Aristotle's Three pages 198–200
- 59 Hetvābhāsa: The Five Fallacies of the Reason pages 201–204
- 60 Chala, Jāti and Nigrahasthāna: How a Debate Is Lost pages 205–208
- 61 Vāda, Jalpa and Vitaṇḍā: Three Kinds of Dispute pages 209–212
- 62 Debate Methodology as a Validation Protocol pages 213–216
- 63 Padārtha: The Categories of What Exists pages 217–220
- 64 Padārtha Ontology as a Knowledge Representation Model pages 221–225
- 65 Propositional Logic: The Minimum You Need pages 226–230
- 66 Predicate Logic, and Why Anumāna Needs It pages 231–233
- 67 The Five Members Written in Logical Notation pages 234–236
- 68 Inference Engines: Forward and Backward Chaining pages 237–240
- 69 Nyāya Logic as an Inference Engine pages 241–245
- 70 Explainable AI, and Why a Five-Member Answer Is an Explanation pages 246–249
- 71 Āyurveda as a Śāstra, and What This Chapter Does Not Claim pages 250–253
- 72 The Tridoṣa Framework pages 254–257
- 73 Doṣa as a Feature Vector pages 258–261
- 74 Prakṛti: Constitution as a Class Label pages 262–264
- 75 Parīkṣā: How an Examination Is Structured pages 265–268
- 76 Symptom to Feature Mapping pages 269–272
- 77 Multi-Attribute Classification pages 273–275
- 78 Decision Principles in Diagnosis pages 276–279
- 79 Decision Trees pages 280–284
- 80 A Decision Tree Built From the Tridoṣa Attributes pages 285–288
- 81 Rule-Based Systems pages 289–292
- 82 Expert Systems, and MYCIN as the Comparison pages 293–296
- 83 Feature Engineering pages 297–299
- 84 Multi-Class Classification, and How It Is Scored pages 300–302
- 85 Ayurvedic Classification as a Rule-Based Expert System pages 303–309
- 86 The Arthaśāstra, and Its Intelligence Apparatus pages 310–312
- 87 Secret Communication: What the Text Actually Says pages 313–315
- 88 The Royal Writs as a Message Format pages 316–318
- 89 Substitution Systems pages 319–322
- 90 Transposition Systems pages 323–327
- 91 Substitution and Transposition in Code pages 328–334
- 92 Concealment and Coded Messaging pages 335–337
- 93 Basic Steganography pages 338–341
- 94 Information Protection Mechanisms pages 342–344
- 95 Symmetric Encryption pages 345–347
- 96 Cipher Algorithms, Classical to Modern pages 348–350
- 97 Breaking a Classical Cipher pages 351–355
- 98 Arthaśāstra-Inspired Cryptography as a Symmetric Cipher System pages 356–359
- 99 Secure Protocol Abstraction pages 360–362
- 100 Foundations of Cybersecurity pages 363–365
- 101 The Internal Assessment: Building and Presenting the Implementation pages 366–369
- 102 Practice for Module II pages 370–373
- 103 The Whole Paper on One Page pages 374–378
-
Cyber and Information Security
Official Notes munotes.in
Cyber and Information Security
B.SC. (COMPUTER SCIENCE) · SEMESTER 5
Strictly as per the University of Mumbai NEP syllabus in force for B.Sc. (Computer Science)
For B.Sc. (Computer Science) students of the University of Mumbai and all its affiliated colleges
munotes.in Third Year
Cyber and Information Security
Copyright © 2026 munotes.in. All rights reserved.
Written and first published by munotes.in, 2026.
This book is free for individual students to read at munotes.in. No part of it may be reproduced, distributed, stored, translated or used for institutional or classroom purposes in any form without a prior written licence from munotes.in.
Licensing and permissions: contact@munotes.in
The text of statutes and of judgments reproduced in this book is in the public domain under section 52(1)(q) of the Copyright Act 1957. The commentary, arrangement, examples and questions are the original work of munotes.in.
munotes.in is an independent study resource for MU students. It is not affiliated with, endorsed by, or officially connected to the University of Mumbai. Course names and university references describe the students and syllabus the material relates to.
Contents
Module I Introduction, classical encryption, public-key cryptography and RSA, key management, message authentication and hash functions
- What Security Means: Confidentiality, Integrity and Availability 1
- The Security Trend: Why Attacks Got Easier as Attackers Got Less Skilled 5
- The OSI Security Architecture: The Words This Subject Is Spoken In 10
- Security Attacks: Passive and Active 15
- Security Services: The Five Things Security Promises 20
- Security Mechanisms, and Which Service Each One Serves 25
- The Symmetric Cipher Model 30
- Cryptanalysis and the Attack Models 35
- The Caesar Cipher, and Breaking It in Twenty-five Tries 41
- Monoalphabetic Substitution, and Breaking It by Frequency 46
- The Playfair Cipher 51
- The Hill Cipher 57
- Polyalphabetic Ciphers: Vigenere and the Autokey 64
- The One-Time Pad, and What Perfect Secrecy Means 70
- Transposition Techniques: Rail Fence and Row Transposition 75
- Steganography: Hiding That There Is a Message at All 81
- Block Ciphers and Stream Ciphers: The Difference That Decides Everything 86
- The Feistel Cipher Structure, Confusion and Diffusion 91
Contents continued
Module I continued Introduction, classical encryption, public-key cryptography and RSA, key management, message authentication and hash functions
- The Data Encryption Standard: The Shape of It 97
- Inside a DES Round: Expansion, the S-boxes and the Permutation 102
- The DES Key Schedule 110
- DES Run End to End: Decryption, and the Avalanche Effect 116
- The Strength of DES: Fifty-six Bits, and the Machines That Broke It 125
- The Advanced Encryption Standard 131
- Multiple Encryption, Double DES and the Meet-in-the-Middle Attack 138
- Triple DES, and Where It Stands Now 145
- Electronic Codebook Mode, and Why It Leaks 154
- Cipher Block Chaining 160
- Cipher Feedback, Output Feedback and Counter Mode 166
- Stream Ciphers and RC4 173
- The Arithmetic of Public Keys: Modular Arithmetic and the gcd 179
- Fermat, Euler and the Totient Function 187
- Fast Modular Exponentiation, and Testing a Number for Primality 194
- Principles of Public-Key Cryptosystems 202
- The RSA Algorithm 208
Contents continued
Module I continued Introduction, classical encryption, public-key cryptography and RSA, key management, message authentication and hash functions
- Why RSA Works, and How It Is Attacked 215
- Textbook RSA Is Not RSA: Why Padding Exists 223
- Distributing a Public Key: Announcement, Directory, Authority, Certificate 230
- Key Management for Secret Keys: Session Keys and the Key Hierarchy 235
- Diffie-Hellman Key Exchange 241
- The Man in the Middle, and Why Diffie-Hellman Needs Authentication 250
- Authentication Requirements: The Attacks on a Message 256
- Authentication Functions: Encryption, MAC and Hash 260
- Message Authentication Codes 265
- Hash Functions: What One Must Do 271
- How a Hash Function Is Built, and Breaking a Small One 276
- Security of Hash Functions and MACs: The Birthday Attack 282
- The Secure Hash Algorithm: SHA-1, SHA-256 and SHA-512 289
- HMAC 298
- Practical: Writing a Substitution and a Transposition Cipher 306
- Practical: Generating and Verifying a Message Authentication Code 311
- Practical: A Diffie-Hellman Exchange in Code 316
Contents continued
Module II Digital signatures and authentication, authentication applications, electronic mail security, IP security, web security, intrusion, malicious software and firewalls
- Digital Signatures: What One Is and What It Must Do 322
- The RSA Digital Signature 327
- The ElGamal and Schnorr Signature Schemes 333
- Direct and Arbitrated Digital Signatures 340
- Authentication Protocols: Mutual Authentication and the Replay Problem 345
- One-Way Authentication, and Authentication with a Public Key 352
- The Digital Signature Standard, and the DSA Algorithm 357
- What the Signature Standard Says Today, and Why DSA Left It 364
- Kerberos: The Problem It Solves 371
- The Kerberos Dialogue, Step by Step 381
- Kerberos Version 5, Realms and What Changed 392
- X.509: The Certificate and Its Fields 402
- Certificate Chains, Revocation and the CRL 413
- Public-Key Infrastructure 425
- Pretty Good Privacy: The Five Services 434
- How a PGP Message Is Built, and Radix-64 443
- PGP Key Management and the Web of Trust 452
- S/MIME 460
- IP Security: What It Is For 468
Contents continued
Module II continued Digital signatures and authentication, authentication applications, electronic mail security, IP security, web security, intrusion, malicious software and firewalls
- The IPsec Architecture: SA, SPD, Transport and Tunnel Mode 475
- The Authentication Header 483
- Encapsulating Security Payload 490
- Combining Security Associations 496
- IPsec Key Management: Oakley, ISAKMP and IKE 503
- Web Security Considerations 512
- SSL: The Architecture and the Record Protocol 518
- The SSL and TLS Handshake 525
- TLS, and What Each Version Fixed 533
- Secure Electronic Transaction, and the Dual Signature 544
- Intruders: Who They Are and What They Do 552
- Intrusion Techniques: Attacking the Password File 558
- Password Selection and Management 564
- Intrusion Detection: Statistical Anomaly and Rule-Based 571
- Audit Records, Distributed Intrusion Detection and Honeypots 577
- Malicious Software: The Taxonomy 584
- Viruses: The Four Phases, the Structure and the Types 589
- Worms, and the Ones That Made History 596
- Virus Countermeasures 603
Contents continued
Module II continued Digital signatures and authentication, authentication applications, electronic mail security, IP security, web security, intrusion, malicious software and firewalls
- Denial of Service and Distributed Denial of Service 609
- DDoS Countermeasures 615
- Firewall Design Principles 621
- Types of Firewalls 627
- Firewall Configurations, and a Rule Base Read Line by Line 634
- Practical: Signing and Verifying a Message in Code 640
- Practical: Configuring IPsec, and Reading the Policy Back 645
- Practical: Certificates and a Secure Session, End to End 651
- Practical: Setting Up an Intrusion Detection System 657
- Practical: Analysing a Malware Sample, Safely 662
- How the Paper Is Set, and How to Answer It 668
- The Comparisons That Cross Both Modules 673
Page 1 onwards
678 pages in this book. The cover and the contents are above. Everything from page one is in the pass.
- Notes
- 2026 Edition, as per the latest syllabus. 678 pages.
Every chapter in the notes: 102 chapters across 2 modules
Module I Introduction, classical encryption, public-key cryptography and RSA, key management, message authentication and hash functions 52 chapters
- 1 What Security Means: Confidentiality, Integrity and Availability pages 1–4
- 2 The Security Trend: Why Attacks Got Easier as Attackers Got Less Skilled pages 5–9
- 3 The OSI Security Architecture: The Words This Subject Is Spoken In pages 10–14
- 4 Security Attacks: Passive and Active pages 15–19
- 5 Security Services: The Five Things Security Promises pages 20–24
- 6 Security Mechanisms, and Which Service Each One Serves pages 25–29
- 7 The Symmetric Cipher Model pages 30–34
- 8 Cryptanalysis and the Attack Models pages 35–40
- 9 The Caesar Cipher, and Breaking It in Twenty-five Tries pages 41–45
- 10 Monoalphabetic Substitution, and Breaking It by Frequency pages 46–50
- 11 The Playfair Cipher pages 51–56
- 12 The Hill Cipher pages 57–63
- 13 Polyalphabetic Ciphers: Vigenere and the Autokey pages 64–69
- 14 The One-Time Pad, and What Perfect Secrecy Means pages 70–74
- 15 Transposition Techniques: Rail Fence and Row Transposition pages 75–80
- 16 Steganography: Hiding That There Is a Message at All pages 81–85
- 17 Block Ciphers and Stream Ciphers: The Difference That Decides Everything pages 86–90
- 18 The Feistel Cipher Structure, Confusion and Diffusion pages 91–96
- 19 The Data Encryption Standard: The Shape of It pages 97–101
- 20 Inside a DES Round: Expansion, the S-boxes and the Permutation pages 102–109
- 21 The DES Key Schedule pages 110–115
- 22 DES Run End to End: Decryption, and the Avalanche Effect pages 116–124
- 23 The Strength of DES: Fifty-six Bits, and the Machines That Broke It pages 125–130
- 24 The Advanced Encryption Standard pages 131–137
- 25 Multiple Encryption, Double DES and the Meet-in-the-Middle Attack pages 138–144
- 26 Triple DES, and Where It Stands Now pages 145–153
- 27 Electronic Codebook Mode, and Why It Leaks pages 154–159
- 28 Cipher Block Chaining pages 160–165
- 29 Cipher Feedback, Output Feedback and Counter Mode pages 166–172
- 30 Stream Ciphers and RC4 pages 173–178
- 31 The Arithmetic of Public Keys: Modular Arithmetic and the gcd pages 179–186
- 32 Fermat, Euler and the Totient Function pages 187–193
- 33 Fast Modular Exponentiation, and Testing a Number for Primality pages 194–201
- 34 Principles of Public-Key Cryptosystems pages 202–207
- 35 The RSA Algorithm pages 208–214
- 36 Why RSA Works, and How It Is Attacked pages 215–222
- 37 Textbook RSA Is Not RSA: Why Padding Exists pages 223–229
- 38 Distributing a Public Key: Announcement, Directory, Authority, Certificate pages 230–234
- 39 Key Management for Secret Keys: Session Keys and the Key Hierarchy pages 235–240
- 40 Diffie-Hellman Key Exchange pages 241–249
- 41 The Man in the Middle, and Why Diffie-Hellman Needs Authentication pages 250–255
- 42 Authentication Requirements: The Attacks on a Message pages 256–259
- 43 Authentication Functions: Encryption, MAC and Hash pages 260–264
- 44 Message Authentication Codes pages 265–270
- 45 Hash Functions: What One Must Do pages 271–275
- 46 How a Hash Function Is Built, and Breaking a Small One pages 276–281
- 47 Security of Hash Functions and MACs: The Birthday Attack pages 282–288
- 48 The Secure Hash Algorithm: SHA-1, SHA-256 and SHA-512 pages 289–297
- 49 HMAC pages 298–305
- 50 Practical: Writing a Substitution and a Transposition Cipher pages 306–310
- 51 Practical: Generating and Verifying a Message Authentication Code pages 311–315
- 52 Practical: A Diffie-Hellman Exchange in Code pages 316–321
Module II Digital signatures and authentication, authentication applications, electronic mail security, IP security, web security, intrusion, malicious software and firewalls 50 chapters
- 53 Digital Signatures: What One Is and What It Must Do pages 322–326
- 54 The RSA Digital Signature pages 327–332
- 55 The ElGamal and Schnorr Signature Schemes pages 333–339
- 56 Direct and Arbitrated Digital Signatures pages 340–344
- 57 Authentication Protocols: Mutual Authentication and the Replay Problem pages 345–351
- 58 One-Way Authentication, and Authentication with a Public Key pages 352–356
- 59 The Digital Signature Standard, and the DSA Algorithm pages 357–363
- 60 What the Signature Standard Says Today, and Why DSA Left It pages 364–370
- 61 Kerberos: The Problem It Solves pages 371–380
- 62 The Kerberos Dialogue, Step by Step pages 381–391
- 63 Kerberos Version 5, Realms and What Changed pages 392–401
- 64 X.509: The Certificate and Its Fields pages 402–412
- 65 Certificate Chains, Revocation and the CRL pages 413–424
- 66 Public-Key Infrastructure pages 425–433
- 67 Pretty Good Privacy: The Five Services pages 434–442
- 68 How a PGP Message Is Built, and Radix-64 pages 443–451
- 69 PGP Key Management and the Web of Trust pages 452–459
- 70 S/MIME pages 460–467
- 71 IP Security: What It Is For pages 468–474
- 72 The IPsec Architecture: SA, SPD, Transport and Tunnel Mode pages 475–482
- 73 The Authentication Header pages 483–489
- 74 Encapsulating Security Payload pages 490–495
- 75 Combining Security Associations pages 496–502
- 76 IPsec Key Management: Oakley, ISAKMP and IKE pages 503–511
- 77 Web Security Considerations pages 512–517
- 78 SSL: The Architecture and the Record Protocol pages 518–524
- 79 The SSL and TLS Handshake pages 525–532
- 80 TLS, and What Each Version Fixed pages 533–543
- 81 Secure Electronic Transaction, and the Dual Signature pages 544–551
- 82 Intruders: Who They Are and What They Do pages 552–557
- 83 Intrusion Techniques: Attacking the Password File pages 558–563
- 84 Password Selection and Management pages 564–570
- 85 Intrusion Detection: Statistical Anomaly and Rule-Based pages 571–576
- 86 Audit Records, Distributed Intrusion Detection and Honeypots pages 577–583
- 87 Malicious Software: The Taxonomy pages 584–588
- 88 Viruses: The Four Phases, the Structure and the Types pages 589–595
- 89 Worms, and the Ones That Made History pages 596–602
- 90 Virus Countermeasures pages 603–608
- 91 Denial of Service and Distributed Denial of Service pages 609–614
- 92 DDoS Countermeasures pages 615–620
- 93 Firewall Design Principles pages 621–626
- 94 Types of Firewalls pages 627–633
- 95 Firewall Configurations, and a Rule Base Read Line by Line pages 634–639
- 96 Practical: Signing and Verifying a Message in Code pages 640–644
- 97 Practical: Configuring IPsec, and Reading the Policy Back pages 645–650
- 98 Practical: Certificates and a Secure Session, End to End pages 651–656
- 99 Practical: Setting Up an Intrusion Detection System pages 657–661
- 100 Practical: Analysing a Malware Sample, Safely pages 662–667
- 101 How the Paper Is Set, and How to Answer It pages 668–672
- 102 The Comparisons That Cross Both Modules pages 673–678
-
Artificial Intelligence
Official Notes munotes.in
Artificial Intelligence
B.SC. (COMPUTER SCIENCE) · SEMESTER 5
Strictly as per the University of Mumbai NEP syllabus in force for B.Sc. (Computer Science)
For B.Sc. (Computer Science) students of the University of Mumbai and all its affiliated colleges
munotes.in Third Year
Artificial Intelligence
Copyright © 2026 munotes.in. All rights reserved.
Written and first published by munotes.in, 2026.
This book is free for individual students to read at munotes.in. No part of it may be reproduced, distributed, stored, translated or used for institutional or classroom purposes in any form without a prior written licence from munotes.in.
Licensing and permissions: contact@munotes.in
The text of statutes and of judgments reproduced in this book is in the public domain under section 52(1)(q) of the Copyright Act 1957. The commentary, arrangement, examples and questions are the original work of munotes.in.
munotes.in is an independent study resource for MU students. It is not affiliated with, endorsed by, or officially connected to the University of Mumbai. Course names and university references describe the students and syllabus the material relates to.
Contents
Module I Intelligent agents, problem solving and search, knowledge representation and logical reasoning, and reasoning under uncertainty
- What Artificial Intelligence Is 1
- Acting Rationally, or Thinking Like a Human 6
- The Agent and Its Environment 10
- Types of Environment 15
- The Simple Reflex Agent 20
- The Model-Based Reflex Agent 24
- The Goal-Based Agent 29
- The Utility-Based Agent 34
- The Learning Agent 39
- Formulating a Problem for Search 45
- The Search Tree, and How an Algorithm Is Judged 51
- Breadth First Search 57
- Depth First Search 62
- Uniform Cost Search 67
- Iterative Deepening Search 73
- Heuristics: Estimating What Is Left To Do 78
- Greedy Best First Search 85
- A* Search 90
- Admissibility, and Why A* Is Optimal 96
- Consistency, and A* on a Graph 102
Contents continued
Module I continued Intelligent agents, problem solving and search, knowledge representation and logical reasoning, and reasoning under uncertainty
- Recursive Best First Search 108
- Comparing Two Search Algorithms on One Problem 113
- Games as Search 119
- Minimax 124
- Alpha-Beta Pruning 129
- The Knowledge-Based Agent 136
- Propositional Logic: Syntax and Meaning 142
- Entailment, Models and Validity 147
- Inference in Propositional Logic 152
- Conjunctive Normal Form and Resolution 157
- First-Order Logic 163
- Inference in First-Order Logic: Unification and Chaining 168
- Rule-Based Systems and Expert Systems 175
- Planning and STRIPS 181
- Fuzzy Logic and the Membership Function 187
- Fuzzification, the Rule Base and Defuzzification 193
- Why an Agent Needs Probability 199
- The Joint Distribution and Inference by Enumeration 204
- Bayes Theorem 209
Contents continued
Module I continued Intelligent agents, problem solving and search, knowledge representation and logical reasoning, and reasoning under uncertainty
- Conditional Independence 215
- Bayesian Networks 221
- Inference in a Bayesian Network 227
Module II Machine learning, supervised models, probabilistic and latent variable models, unsupervised and reinforcement learning, and responsible AI
- What Machine Learning Is 234
- Supervised Learning 240
- Unsupervised Learning 246
- Reinforcement Learning: The Third Form 250
- Parametric and Nonparametric Models 254
- Bias and Variance 259
- Overfitting and Underfitting 265
- Regularization 271
- Gradient Descent 277
- Classification and Regression 284
- k-Nearest Neighbours 290
- k-NN for Regression, and What Limits the Method 296
- Entropy and Information Gain 302
- Decision Tree Learning 308
- Reading, Drawing and Pruning a Decision Tree 314
Contents continued
Module II continued Machine learning, supervised models, probabilistic and latent variable models, unsupervised and reinforcement learning, and responsible AI
- The Naive Bayes Classifier 321
- Support Vector Machines: The Margin 328
- The Soft Margin and the Kernel 334
- The Artificial Neuron and the Perceptron 342
- The Multilayer Network and Backpropagation 349
- What Deep Learning Is 357
- Ensemble Methods, Bagging and the Random Forest 362
- Boosting and AdaBoost 370
- Evaluating a Model 378
- The Statistical Learning Framework 387
- Maximum Likelihood Estimation 395
- Learning with Complete Data 404
- Hidden Variables 412
- The EM Algorithm 420
- Hidden Markov Models 430
- The Forward Algorithm and Viterbi 439
- Clustering and k-Means 451
- Hierarchical Clustering, and Judging a Clustering 462
- Support, Confidence and Lift 475
Contents continued
Module II continued Machine learning, supervised models, probabilistic and latent variable models, unsupervised and reinforcement learning, and responsible AI
- The Apriori Algorithm 485
- The Reinforcement Learning Framework 495
- Markov Decision Processes 505
- The Bellman Equations, Value Iteration and Policy Iteration 514
- Q-Learning 525
- Ethical Issues in AI Systems 537
- Bias and Fairness in AI Models 543
- Transparency and Explainability 553
- Accountability and Human Oversight 559
- Hallucination in Generative AI 564
- Deepfakes and Misuse 575
- Using an AI Library Responsibly 581
- What the Examination Asks, and How to Answer It 587
Page 1 onwards
591 pages in this book. The cover and the contents are above. Everything from page one is in the pass.
- Notes
- 2026 Edition, as per the latest syllabus. 591 pages.
Every chapter in the notes: 89 chapters across 2 modules
Module I Intelligent agents, problem solving and search, knowledge representation and logical reasoning, and reasoning under uncertainty 42 chapters
- 1 What Artificial Intelligence Is pages 1–5
- 2 Acting Rationally, or Thinking Like a Human pages 6–9
- 3 The Agent and Its Environment pages 10–14
- 4 Types of Environment pages 15–19
- 5 The Simple Reflex Agent pages 20–23
- 6 The Model-Based Reflex Agent pages 24–28
- 7 The Goal-Based Agent pages 29–33
- 8 The Utility-Based Agent pages 34–38
- 9 The Learning Agent pages 39–44
- 10 Formulating a Problem for Search pages 45–50
- 11 The Search Tree, and How an Algorithm Is Judged pages 51–56
- 12 Breadth First Search pages 57–61
- 13 Depth First Search pages 62–66
- 14 Uniform Cost Search pages 67–72
- 15 Iterative Deepening Search pages 73–77
- 16 Heuristics: Estimating What Is Left To Do pages 78–84
- 17 Greedy Best First Search pages 85–89
- 18 A* Search pages 90–95
- 19 Admissibility, and Why A* Is Optimal pages 96–101
- 20 Consistency, and A* on a Graph pages 102–107
- 21 Recursive Best First Search pages 108–112
- 22 Comparing Two Search Algorithms on One Problem pages 113–118
- 23 Games as Search pages 119–123
- 24 Minimax pages 124–128
- 25 Alpha-Beta Pruning pages 129–135
- 26 The Knowledge-Based Agent pages 136–141
- 27 Propositional Logic: Syntax and Meaning pages 142–146
- 28 Entailment, Models and Validity pages 147–151
- 29 Inference in Propositional Logic pages 152–156
- 30 Conjunctive Normal Form and Resolution pages 157–162
- 31 First-Order Logic pages 163–167
- 32 Inference in First-Order Logic: Unification and Chaining pages 168–174
- 33 Rule-Based Systems and Expert Systems pages 175–180
- 34 Planning and STRIPS pages 181–186
- 35 Fuzzy Logic and the Membership Function pages 187–192
- 36 Fuzzification, the Rule Base and Defuzzification pages 193–198
- 37 Why an Agent Needs Probability pages 199–203
- 38 The Joint Distribution and Inference by Enumeration pages 204–208
- 39 Bayes Theorem pages 209–214
- 40 Conditional Independence pages 215–220
- 41 Bayesian Networks pages 221–226
- 42 Inference in a Bayesian Network pages 227–233
Module II Machine learning, supervised models, probabilistic and latent variable models, unsupervised and reinforcement learning, and responsible AI 47 chapters
- 43 What Machine Learning Is pages 234–239
- 44 Supervised Learning pages 240–245
- 45 Unsupervised Learning pages 246–249
- 46 Reinforcement Learning: The Third Form pages 250–253
- 47 Parametric and Nonparametric Models pages 254–258
- 48 Bias and Variance pages 259–264
- 49 Overfitting and Underfitting pages 265–270
- 50 Regularization pages 271–276
- 51 Gradient Descent pages 277–283
- 52 Classification and Regression pages 284–289
- 53 k-Nearest Neighbours pages 290–295
- 54 k-NN for Regression, and What Limits the Method pages 296–301
- 55 Entropy and Information Gain pages 302–307
- 56 Decision Tree Learning pages 308–313
- 57 Reading, Drawing and Pruning a Decision Tree pages 314–320
- 58 The Naive Bayes Classifier pages 321–327
- 59 Support Vector Machines: The Margin pages 328–333
- 60 The Soft Margin and the Kernel pages 334–341
- 61 The Artificial Neuron and the Perceptron pages 342–348
- 62 The Multilayer Network and Backpropagation pages 349–356
- 63 What Deep Learning Is pages 357–361
- 64 Ensemble Methods, Bagging and the Random Forest pages 362–369
- 65 Boosting and AdaBoost pages 370–377
- 66 Evaluating a Model pages 378–386
- 67 The Statistical Learning Framework pages 387–394
- 68 Maximum Likelihood Estimation pages 395–403
- 69 Learning with Complete Data pages 404–411
- 70 Hidden Variables pages 412–419
- 71 The EM Algorithm pages 420–429
- 72 Hidden Markov Models pages 430–438
- 73 The Forward Algorithm and Viterbi pages 439–450
- 74 Clustering and k-Means pages 451–461
- 75 Hierarchical Clustering, and Judging a Clustering pages 462–474
- 76 Support, Confidence and Lift pages 475–484
- 77 The Apriori Algorithm pages 485–494
- 78 The Reinforcement Learning Framework pages 495–504
- 79 Markov Decision Processes pages 505–513
- 80 The Bellman Equations, Value Iteration and Policy Iteration pages 514–524
- 81 Q-Learning pages 525–536
- 82 Ethical Issues in AI Systems pages 537–542
- 83 Bias and Fairness in AI Models pages 543–552
- 84 Transparency and Explainability pages 553–558
- 85 Accountability and Human Oversight pages 559–563
- 86 Hallucination in Generative AI pages 564–574
- 87 Deepfakes and Misuse pages 575–580
- 88 Using an AI Library Responsibly pages 581–586
- 89 What the Examination Asks, and How to Answer It pages 587–591
-
Mini Project - I Real-World Application Development
Official Notes munotes.in
Mini Project - I Real-World Application Development
B.SC. (COMPUTER SCIENCE) · SEMESTER 5
Strictly as per the University of Mumbai NEP syllabus in force for B.Sc. (Computer Science)
For B.Sc. (Computer Science) students of the University of Mumbai and all its affiliated colleges
munotes.in Third Year
Mini Project - I Real-World Application Development
Copyright © 2026 munotes.in. All rights reserved.
Written and first published by munotes.in, 2026.
This book is free for individual students to read at munotes.in. No part of it may be reproduced, distributed, stored, translated or used for institutional or classroom purposes in any form without a prior written licence from munotes.in.
Licensing and permissions: contact@munotes.in
The text of statutes and of judgments reproduced in this book is in the public domain under section 52(1)(q) of the Copyright Act 1957. The commentary, arrangement, examples and questions are the original work of munotes.in.
munotes.in is an independent study resource for MU students. It is not affiliated with, endorsed by, or officially connected to the University of Mumbai. Course names and university references describe the students and syllabus the material relates to.
Contents
Module I Problem Identification, Requirement Engineering & System Design Phase
- How Mini Project I Is Marked: the Guide's Twenty, the Examiner's Thirty and Passing Each 1
- The Design Phase at a Glance, and the Worked Project in This Book 8
- Finding a Real-World Problem: Industry, Social and Institutional 13
- Problem Justification and Scope Definition 20
- Stakeholder Identification 26
- Technical Feasibility 32
- Economic Feasibility 38
- Operational Feasibility and the Feasibility Report 43
- Requirement Engineering: Eliciting, Recording and Checking Requirements 50
- Functional Requirements Specification 57
- Non-Functional Requirements 63
- Use-Case Analysis 68
- Requirement Prioritization 74
- Constraints and Assumptions 79
- Selecting an SDLC Model for a Mini Project 84
- The Work Breakdown Structure 89
- The Project Timeline: Estimates, Dependencies and the Gantt Chart 95
- Resource Planning 104
Contents continued
Module I continued Problem Identification, Requirement Engineering & System Design Phase
- System Modeling with UML: the Six Diagrams and How They Fit Together 112
- The Use Case Diagram 119
- The Class Diagram 125
- The Sequence Diagram 132
- The Activity Diagram 138
- The ER Diagram 144
- The Deployment Diagram 150
- System Architecture Design: Styles, Layers and Choosing the Stack 154
- Frontend Architecture 160
- Backend Architecture 167
- Database Schema Design 174
- API Structure 181
- Security Considerations 187
- The Module 1 Documents: What Is Due and How They Connect 195
- The Project Proposal 200
- The SRS Document 207
- The Complete UML Set 217
- The Architecture Design Document 222
Contents continued
Module I continued Problem Identification, Requirement Engineering & System Design Phase
- The Design Review: Presenting Module 1 to Your Guide 239
Module II Implementation, Testing, Deployment & Evaluation Phase
- The Build Phase at a Glance 246
- Setting Up the Development Machine: Node.js, MySQL, an Editor and Git 251
- Frontend Implementation, Part 1: the Pages, the Stylesheet and Talking to the Server 259
- Frontend Implementation, Part 2: the Menu, the Cart, the Orders and the Counter 270
- Backend Implementation, Part 1: the Express Application and Its Routes 281
- Backend Implementation, Part 2: the Services and the Business Rules 291
- Database Integration, Part 1: the Connection Pool and Safe Queries 299
- Database Integration, Part 2: Transactions and the Order That Must Not Oversell 308
- Authentication: Passwords, Sessions and Roles 315
- Validation: Checking Every Input on the Server 323
- Error Handling 331
- Development Progress and Code Review 337
- Testing the Project: the Levels, the Test Plan and the Tools 344
Contents continued
Module II continued Implementation, Testing, Deployment & Evaluation Phase
- Unit Testing 350
- Black-Box Testing: Equivalence Partitions, Boundary Values and Decision Tables 357
- Integration Testing 363
- System Testing and Acceptance 373
- Test Case Preparation 378
- Bug Tracking 384
- Local Hosting: Running the Application for the Whole Lab 388
- Cloud Deployment 393
- APK Build: Putting the Application on an Android Phone 398
- Server Configuration: Linux, Nginx, systemd and HTTPS 404
- Version Control Using GitHub, Part 1: the Repository, Commits and the Remote 410
- Version Control Using GitHub, Part 2: Branches, Pull Requests and Releases 415
- Basic Load Testing 420
- Input Validation Checks 426
- Security Validation 432
- The Technical Report 437
- The User Manual 444
- Screenshots 451
Contents continued
Module II continued Implementation, Testing, Deployment & Evaluation Phase
- Source Code Documentation 456
- The Final Deliverables: What Is Due at the End of Module 2 463
- The Working Application 467
- The GitHub Repository 472
- The Final Report 477
- Presentation and Demonstration 482
- The External Evaluation: How the Thirty Marks Are Earned 487
- The Viva Voce: Questions You Must Be Able to Answer 492
Page 1 onwards
499 pages in this book. The cover and the contents are above. Everything from page one is in the pass.
- Notes
- 2026 Edition, as per the latest syllabus. 499 pages.
Every chapter in the notes: 76 chapters across 2 modules
Module I Problem Identification, Requirement Engineering & System Design Phase 37 chapters
- 1 How Mini Project I Is Marked: the Guide's Twenty, the Examiner's Thirty and Passing Each pages 1–7
- 2 The Design Phase at a Glance, and the Worked Project in This Book pages 8–12
- 3 Finding a Real-World Problem: Industry, Social and Institutional pages 13–19
- 4 Problem Justification and Scope Definition pages 20–25
- 5 Stakeholder Identification pages 26–31
- 6 Technical Feasibility pages 32–37
- 7 Economic Feasibility pages 38–42
- 8 Operational Feasibility and the Feasibility Report pages 43–49
- 9 Requirement Engineering: Eliciting, Recording and Checking Requirements pages 50–56
- 10 Functional Requirements Specification pages 57–62
- 11 Non-Functional Requirements pages 63–67
- 12 Use-Case Analysis pages 68–73
- 13 Requirement Prioritization pages 74–78
- 14 Constraints and Assumptions pages 79–83
- 15 Selecting an SDLC Model for a Mini Project pages 84–88
- 16 The Work Breakdown Structure pages 89–94
- 17 The Project Timeline: Estimates, Dependencies and the Gantt Chart pages 95–103
- 18 Resource Planning pages 104–111
- 19 System Modeling with UML: the Six Diagrams and How They Fit Together pages 112–118
- 20 The Use Case Diagram pages 119–124
- 21 The Class Diagram pages 125–131
- 22 The Sequence Diagram pages 132–137
- 23 The Activity Diagram pages 138–143
- 24 The ER Diagram pages 144–149
- 25 The Deployment Diagram pages 150–153
- 26 System Architecture Design: Styles, Layers and Choosing the Stack pages 154–159
- 27 Frontend Architecture pages 160–166
- 28 Backend Architecture pages 167–173
- 29 Database Schema Design pages 174–180
- 30 API Structure pages 181–186
- 31 Security Considerations pages 187–194
- 32 The Module 1 Documents: What Is Due and How They Connect pages 195–199
- 33 The Project Proposal pages 200–206
- 34 The SRS Document pages 207–216
- 35 The Complete UML Set pages 217–221
- 36 The Architecture Design Document pages 222–238
- 37 The Design Review: Presenting Module 1 to Your Guide pages 239–245
Module II Implementation, Testing, Deployment & Evaluation Phase 39 chapters
- 38 The Build Phase at a Glance pages 246–250
- 39 Setting Up the Development Machine: Node.js, MySQL, an Editor and Git pages 251–258
- 40 Frontend Implementation, Part 1: the Pages, the Stylesheet and Talking to the Server pages 259–269
- 41 Frontend Implementation, Part 2: the Menu, the Cart, the Orders and the Counter pages 270–280
- 42 Backend Implementation, Part 1: the Express Application and Its Routes pages 281–290
- 43 Backend Implementation, Part 2: the Services and the Business Rules pages 291–298
- 44 Database Integration, Part 1: the Connection Pool and Safe Queries pages 299–307
- 45 Database Integration, Part 2: Transactions and the Order That Must Not Oversell pages 308–314
- 46 Authentication: Passwords, Sessions and Roles pages 315–322
- 47 Validation: Checking Every Input on the Server pages 323–330
- 48 Error Handling pages 331–336
- 49 Development Progress and Code Review pages 337–343
- 50 Testing the Project: the Levels, the Test Plan and the Tools pages 344–349
- 51 Unit Testing pages 350–356
- 52 Black-Box Testing: Equivalence Partitions, Boundary Values and Decision Tables pages 357–362
- 53 Integration Testing pages 363–372
- 54 System Testing and Acceptance pages 373–377
- 55 Test Case Preparation pages 378–383
- 56 Bug Tracking pages 384–387
- 57 Local Hosting: Running the Application for the Whole Lab pages 388–392
- 58 Cloud Deployment pages 393–397
- 59 APK Build: Putting the Application on an Android Phone pages 398–403
- 60 Server Configuration: Linux, Nginx, systemd and HTTPS pages 404–409
- 61 Version Control Using GitHub, Part 1: the Repository, Commits and the Remote pages 410–414
- 62 Version Control Using GitHub, Part 2: Branches, Pull Requests and Releases pages 415–419
- 63 Basic Load Testing pages 420–425
- 64 Input Validation Checks pages 426–431
- 65 Security Validation pages 432–436
- 66 The Technical Report pages 437–443
- 67 The User Manual pages 444–450
- 68 Screenshots pages 451–455
- 69 Source Code Documentation pages 456–462
- 70 The Final Deliverables: What Is Due at the End of Module 2 pages 463–466
- 71 The Working Application pages 467–471
- 72 The GitHub Repository pages 472–476
- 73 The Final Report pages 477–481
- 74 Presentation and Demonstration pages 482–486
- 75 The External Evaluation: How the Thirty Marks Are Earned pages 487–491
- 76 The Viva Voce: Questions You Must Be Able to Answer pages 492–499
-
Computer Science Practical 5
Official Notes munotes.in
Computer Science Practical 5
B.SC. (COMPUTER SCIENCE) · SEMESTER 5
Strictly as per the University of Mumbai NEP syllabus in force for B.Sc. (Computer Science)
For B.Sc. (Computer Science) students of the University of Mumbai and all its affiliated colleges
munotes.in Third Year
Computer Science Practical 5
Copyright © 2026 munotes.in. All rights reserved.
Written and first published by munotes.in, 2026.
This book is free for individual students to read at munotes.in. No part of it may be reproduced, distributed, stored, translated or used for institutional or classroom purposes in any form without a prior written licence from munotes.in.
Licensing and permissions: contact@munotes.in
The text of statutes and of judgments reproduced in this book is in the public domain under section 52(1)(q) of the Copyright Act 1957. The commentary, arrangement, examples and questions are the original work of munotes.in.
munotes.in is an independent study resource for MU students. It is not affiliated with, endorsed by, or officially connected to the University of Mumbai. Course names and university references describe the students and syllabus the material relates to.
Contents
Module I Artificial Intelligence: ten exercises in Python, from breadth first search to a TensorFlow demonstration
- How This Practical Is Examined: the Journal, the 80 Per Cent Rule and the Two-Hour Paper 1
- The Python Laboratory from Zero: Running Your First Program and Saving It for the Journal 5
- The Dataset, the Split and the Score: How Every Model in This Module Is Measured 11
- Practical 1: Breadth First Search and Iterative Deepening Depth First Search 20
- Practical 2: A* Search and Recursive Best-First Search 30
- Practical 3: Decision Tree Learning 40
- Practical 4: The Feed Forward Backpropagation Neural Network 51
- Practical 5: Support Vector Machines 62
- Practical 6: Adaboost Ensemble Learning 69
- Practical 7: The Naive Bayes Classifier 76
- Practical 8: K-Nearest Neighbours for Classification and for Regression 84
- Practical 9: Association Rule Mining with Apriori 92
- Practical 10: A Demonstration with TensorFlow and with an OpenAI-Style Tool 99
Module II Cyber and Information Security: ten exercises, from the classical ciphers to firewall rules on a real Linux
- The Security Laboratory from Zero: OpenSSL, the Byte, and What Is Safe to Run 107
- Practical 11, Part 1: The Substitution Ciphers 112
Contents continued
Module II continued Cyber and Information Security: ten exercises, from the classical ciphers to firewall rules on a real Linux
- Practical 11, Part 2: The Transposition Ciphers 124
- Practical 12: RSA Encryption and Decryption 130
- Practical 13: Message Authentication Codes 139
- Practical 14: Digital Signatures 146
- Practical 15: Key Exchange Using Diffie-Hellman 154
- Practical 16: IP Security (IPsec) Configuration 162
- Practical 17: Web Security with SSL/TLS 169
- Practical 18: Intrusion Detection System 177
- Practical 19: Malware Analysis and Detection 184
- Practical 20: Firewall Configuration and Rule-Based Filtering 191
- The Two-Hour Paper: Sitting the Examination 199
Page 1 onwards
206 pages in this book. The cover and the contents are above. Everything from page one is in the pass.
- Notes
- 2026 Edition, as per the latest syllabus. 206 pages.
Every chapter in the notes: 26 chapters across 2 modules
Module I Artificial Intelligence: ten exercises in Python, from breadth first search to a TensorFlow demonstration 13 chapters
- 1 How This Practical Is Examined: the Journal, the 80 Per Cent Rule and the Two-Hour Paper pages 1–4
- 2 The Python Laboratory from Zero: Running Your First Program and Saving It for the Journal pages 5–10
- 3 The Dataset, the Split and the Score: How Every Model in This Module Is Measured pages 11–19
- 4 Practical 1: Breadth First Search and Iterative Deepening Depth First Search pages 20–29
- 5 Practical 2: A* Search and Recursive Best-First Search pages 30–39
- 6 Practical 3: Decision Tree Learning pages 40–50
- 7 Practical 4: The Feed Forward Backpropagation Neural Network pages 51–61
- 8 Practical 5: Support Vector Machines pages 62–68
- 9 Practical 6: Adaboost Ensemble Learning pages 69–75
- 10 Practical 7: The Naive Bayes Classifier pages 76–83
- 11 Practical 8: K-Nearest Neighbours for Classification and for Regression pages 84–91
- 12 Practical 9: Association Rule Mining with Apriori pages 92–98
- 13 Practical 10: A Demonstration with TensorFlow and with an OpenAI-Style Tool pages 99–106
Module II Cyber and Information Security: ten exercises, from the classical ciphers to firewall rules on a real Linux 13 chapters
- 14 The Security Laboratory from Zero: OpenSSL, the Byte, and What Is Safe to Run pages 107–111
- 15 Practical 11, Part 1: The Substitution Ciphers pages 112–123
- 16 Practical 11, Part 2: The Transposition Ciphers pages 124–129
- 17 Practical 12: RSA Encryption and Decryption pages 130–138
- 18 Practical 13: Message Authentication Codes pages 139–145
- 19 Practical 14: Digital Signatures pages 146–153
- 20 Practical 15: Key Exchange Using Diffie-Hellman pages 154–161
- 21 Practical 16: IP Security (IPsec) Configuration pages 162–168
- 22 Practical 17: Web Security with SSL/TLS pages 169–176
- 23 Practical 18: Intrusion Detection System pages 177–183
- 24 Practical 19: Malware Analysis and Detection pages 184–190
- 25 Practical 20: Firewall Configuration and Rule-Based Filtering pages 191–198
- 26 The Two-Hour Paper: Sitting the Examination pages 199–206
-
Software Testing and Quality Assurance Practical
Official Notes munotes.in
Software Testing and Quality Assurance Practical
B.SC. (COMPUTER SCIENCE) · SEMESTER 5
Strictly as per the University of Mumbai NEP syllabus in force for B.Sc. (Computer Science)
For B.Sc. (Computer Science) students of the University of Mumbai and all its affiliated colleges
munotes.in Third Year
Software Testing and Quality Assurance Practical
Copyright © 2026 munotes.in. All rights reserved.
Written and first published by munotes.in, 2026.
This book is free for individual students to read at munotes.in. No part of it may be reproduced, distributed, stored, translated or used for institutional or classroom purposes in any form without a prior written licence from munotes.in.
Licensing and permissions: contact@munotes.in
The text of statutes and of judgments reproduced in this book is in the public domain under section 52(1)(q) of the Copyright Act 1957. The commentary, arrangement, examples and questions are the original work of munotes.in.
munotes.in is an independent study resource for MU students. It is not affiliated with, endorsed by, or officially connected to the University of Mumbai. Course names and university references describe the students and syllabus the material relates to.
Contents
Module I Selenium IDE, manual test cases, Selenium Grid and Selenium WebDriver: suites, logins, web elements and waits, data-driven testing with Apache POI, dynamic tables, counting objects, and lists
- How This Practical Is Examined: the Journal, the 80 Per Cent Rule and the Two-Hour Paper 1
- The Testing Laboratory from Zero: the Practice Portal, the Browsers and the Tools 7
- Practical 1: Creating a Test Suite with Selenium IDE 14
- Practical 2: Cross-Website Functional Testing with Selenium IDE 26
- Practical 3: Manual Test Case Design and Execution 35
- Selenium WebDriver from Zero: Java, Maven, the Drivers, Locators and the First Script 44
- Practical 4: Selenium Grid, Hub and Nodes, and Remote Execution 53
- Practical 5: Login Automation and Validation 59
- Practical 6: Web Elements, Alerts, Frames and Waits 65
- Practical 7: Data-Driven Testing with Apache POI 71
- Practical 8: Extracting Marks from a Dynamic Web Table 77
- Practical 9: Identifying and Counting the Objects on a Page 82
- Practical 10: List and Combo Box Verification 86
Module II Checkboxes, sorting and filtering, uploads and downloads with the Robot class, Log4j and screenshots, the Page Object Model, TestNG, Jenkins, cross-browser Grid runs, JMeter load tests and Bugzilla
- Practical 11: Checkbox Identification and Validation 90
- Practical 12: Dynamic Web Table, Sorting and Filtering 93
- Practical 13: File Upload and Download with the Robot Class 98
Contents continued
Module II continued Checkboxes, sorting and filtering, uploads and downloads with the Robot class, Log4j and screenshots, the Page Object Model, TestNG, Jenkins, cross-browser Grid runs, JMeter load tests and Bugzilla
- Practical 14: Screenshot on Failure and Logging with Log4j 106
- Practical 15: The Page Object Model Framework 113
- Practical 16: TestNG Annotations, Groups, Priorities and Reports 121
- Practical 17: Continuous Integration with Jenkins 128
- Practical 18: Cross-Browser Testing with Selenium Grid 135
- Practical 19: Load Testing with Apache JMeter 142
- Practical 20: Bug Tracking and the Defect Life Cycle in Bugzilla 149
- The Two-Hour Paper: Sitting the Examination 157
Page 1 onwards
162 pages in this book. The cover and the contents are above. Everything from page one is in the pass.
- Notes
- 2026 Edition, as per the latest syllabus. 162 pages.
Every chapter in the notes: 24 chapters across 2 modules
Module I Selenium IDE, manual test cases, Selenium Grid and Selenium WebDriver: suites, logins, web elements and waits, data-driven testing with Apache POI, dynamic tables, counting objects, and lists 13 chapters
- 1 How This Practical Is Examined: the Journal, the 80 Per Cent Rule and the Two-Hour Paper pages 1–6
- 2 The Testing Laboratory from Zero: the Practice Portal, the Browsers and the Tools pages 7–13
- 3 Practical 1: Creating a Test Suite with Selenium IDE pages 14–25
- 4 Practical 2: Cross-Website Functional Testing with Selenium IDE pages 26–34
- 5 Practical 3: Manual Test Case Design and Execution pages 35–43
- 6 Selenium WebDriver from Zero: Java, Maven, the Drivers, Locators and the First Script pages 44–52
- 7 Practical 4: Selenium Grid, Hub and Nodes, and Remote Execution pages 53–58
- 8 Practical 5: Login Automation and Validation pages 59–64
- 9 Practical 6: Web Elements, Alerts, Frames and Waits pages 65–70
- 10 Practical 7: Data-Driven Testing with Apache POI pages 71–76
- 11 Practical 8: Extracting Marks from a Dynamic Web Table pages 77–81
- 12 Practical 9: Identifying and Counting the Objects on a Page pages 82–85
- 13 Practical 10: List and Combo Box Verification pages 86–89
Module II Checkboxes, sorting and filtering, uploads and downloads with the Robot class, Log4j and screenshots, the Page Object Model, TestNG, Jenkins, cross-browser Grid runs, JMeter load tests and Bugzilla 11 chapters
- 14 Practical 11: Checkbox Identification and Validation pages 90–92
- 15 Practical 12: Dynamic Web Table, Sorting and Filtering pages 93–97
- 16 Practical 13: File Upload and Download with the Robot Class pages 98–105
- 17 Practical 14: Screenshot on Failure and Logging with Log4j pages 106–112
- 18 Practical 15: The Page Object Model Framework pages 113–120
- 19 Practical 16: TestNG Annotations, Groups, Priorities and Reports pages 121–127
- 20 Practical 17: Continuous Integration with Jenkins pages 128–134
- 21 Practical 18: Cross-Browser Testing with Selenium Grid pages 135–141
- 22 Practical 19: Load Testing with Apache JMeter pages 142–148
- 23 Practical 20: Bug Tracking and the Defect Life Cycle in Bugzilla pages 149–156
- 24 The Two-Hour Paper: Sitting the Examination pages 157–162
-
Wireless and Sensor Networks Practical
Official Notes munotes.in
Wireless and Sensor Networks Practical
B.SC. (COMPUTER SCIENCE) · SEMESTER 5
Strictly as per the University of Mumbai NEP syllabus in force for B.Sc. (Computer Science)
For B.Sc. (Computer Science) students of the University of Mumbai and all its affiliated colleges
munotes.in Third Year
Wireless and Sensor Networks Practical
Copyright © 2026 munotes.in. All rights reserved.
Written and first published by munotes.in, 2026.
This book is free for individual students to read at munotes.in. No part of it may be reproduced, distributed, stored, translated or used for institutional or classroom purposes in any form without a prior written licence from munotes.in.
Licensing and permissions: contact@munotes.in
The text of statutes and of judgments reproduced in this book is in the public domain under section 52(1)(q) of the Copyright Act 1957. The commentary, arrangement, examples and questions are the original work of munotes.in.
munotes.in is an independent study resource for MU students. It is not affiliated with, endorsed by, or officially connected to the University of Mumbai. Course names and university references describe the students and syllabus the material relates to.
Contents
Module I TinyOS, nesC and TOSSIM: the sensor node, the execution model, radio and serial communication, flooding and routing tables
- How This Practical Is Examined: the Journal, the 80 Per Cent Rule and the Two-Hour Paper 1
- The TinyOS Laboratory from Zero: nesC, TinyOS 2.1.2 and TOSSIM on Ubuntu 6
- Practical 1: The Sensor Node Hardware Architecture 17
- Practical 2: Sensor Motes, a Base Station and Data Aggregation 27
- Practical 3: The TinyOS Architecture and Its Non-Preemptive Scheduler 38
- Practical 4: The nesC Programming Model: Modules, Configurations and Wiring 47
- Practical 5: Events, Commands, Tasks and Split-Phase Execution 55
- Practical 6: Simulating a Single Mote in TOSSIM 61
- Practical 7: Mote-to-Mote Radio Communication: Signal Strength and Packet Loss 69
- Practical 8: Mote-to-PC Serial Communication Through the SerialForwarder 78
- Practical 9: A Simple Ad Hoc Network in TOSSIM and Its Broadcast 86
- Practical 10: Routing Table Generation and Analysis 96
Module II NS-2 and the network: MANET routing with AODV and DSR, CSMA/CA, TDMA and duty-cycling MACs, directional antennas, coverage, and a cellular request
- The Network Simulator Laboratory from Zero: NS-2, Tcl, the Trace File and NAM 106
- Practical 11: A Basic MANET with Packet Animation 122
Contents continued
Module II continued NS-2 and the network: MANET routing with AODV and DSR, CSMA/CA, TDMA and duty-cycling MACs, directional antennas, coverage, and a cellular request
- Practical 12: The AODV Routing Protocol 134
- Practical 13: The DSR Routing Protocol and Its Overhead against AODV 148
- Practical 14: Performance Evaluation of MANET Routing Protocols 158
- Practical 15: The CSMA/CA MAC Protocol 168
- Practical 16: TDMA Slot Allocation and Its Energy against CSMA 178
- Practical 17: An Energy-Aware Duty-Cycling MAC for Sensor Networks 186
- Practical 18: A MANET with Directional Antennas 196
- Practical 19: Sensor Network Deployment and Coverage Analysis 202
- Practical 20: A Cellular Network and One Web Request through It 208
- The Two-Hour Paper: Sitting the Examination 221
Page 1 onwards
232 pages in this book. The cover and the contents are above. Everything from page one is in the pass.
- Notes
- 2026 Edition, as per the latest syllabus. 232 pages.
Every chapter in the notes: 24 chapters across 2 modules
Module I TinyOS, nesC and TOSSIM: the sensor node, the execution model, radio and serial communication, flooding and routing tables 12 chapters
- 1 How This Practical Is Examined: the Journal, the 80 Per Cent Rule and the Two-Hour Paper pages 1–5
- 2 The TinyOS Laboratory from Zero: nesC, TinyOS 2.1.2 and TOSSIM on Ubuntu pages 6–16
- 3 Practical 1: The Sensor Node Hardware Architecture pages 17–26
- 4 Practical 2: Sensor Motes, a Base Station and Data Aggregation pages 27–37
- 5 Practical 3: The TinyOS Architecture and Its Non-Preemptive Scheduler pages 38–46
- 6 Practical 4: The nesC Programming Model: Modules, Configurations and Wiring pages 47–54
- 7 Practical 5: Events, Commands, Tasks and Split-Phase Execution pages 55–60
- 8 Practical 6: Simulating a Single Mote in TOSSIM pages 61–68
- 9 Practical 7: Mote-to-Mote Radio Communication: Signal Strength and Packet Loss pages 69–77
- 10 Practical 8: Mote-to-PC Serial Communication Through the SerialForwarder pages 78–85
- 11 Practical 9: A Simple Ad Hoc Network in TOSSIM and Its Broadcast pages 86–95
- 12 Practical 10: Routing Table Generation and Analysis pages 96–105
Module II NS-2 and the network: MANET routing with AODV and DSR, CSMA/CA, TDMA and duty-cycling MACs, directional antennas, coverage, and a cellular request 12 chapters
- 13 The Network Simulator Laboratory from Zero: NS-2, Tcl, the Trace File and NAM pages 106–121
- 14 Practical 11: A Basic MANET with Packet Animation pages 122–133
- 15 Practical 12: The AODV Routing Protocol pages 134–147
- 16 Practical 13: The DSR Routing Protocol and Its Overhead against AODV pages 148–157
- 17 Practical 14: Performance Evaluation of MANET Routing Protocols pages 158–167
- 18 Practical 15: The CSMA/CA MAC Protocol pages 168–177
- 19 Practical 16: TDMA Slot Allocation and Its Energy against CSMA pages 178–185
- 20 Practical 17: An Energy-Aware Duty-Cycling MAC for Sensor Networks pages 186–195
- 21 Practical 18: A MANET with Directional Antennas pages 196–201
- 22 Practical 19: Sensor Network Deployment and Coverage Analysis pages 202–207
- 23 Practical 20: A Cellular Network and One Web Request through It pages 208–220
- 24 The Two-Hour Paper: Sitting the Examination pages 221–232
Questions
Can I download it?
No, and that is deliberate. Everything is read on the site, on any device you sign in on. There is nothing to lose, and nothing to forward.
How long do I keep it?
365 days from the day you pay.
What if the syllabus changes?
Revisions are written into the same subject, and you keep reading the current version for as long as your access runs.
Can I buy one subject instead of the whole semester?
Not yet. It is sold per semester, one price for the notes of all 10 subjects.
Is this enough to pass?
It covers the prescribed syllabus. It is not a substitute for your lectures or your textbooks, and we would not claim otherwise.
Can I get a refund?
Once a semester is unlocked it stays unlocked, and there is no way to hand back reading you have already done. That is why this page shows you so much before you pay: the cover of every subject, every chapter in it by name, and the page each one starts on. Read that first and buy only if it is the book you want. If something genuinely went wrong, being charged twice or paying and having nothing unlock, write to us and we refund it: the cancellation and refund policy sets out which cases those are.
Does it renew automatically?
No. It is one payment for one semester. Nothing is charged again unless you choose to buy another semester yourself.
Where our readers study
Students from 169 colleges affiliated to the University of Mumbai read munotes. Here are some of them.