Design and Analysis of Algorithm
Analyse running time and space; design solutions using divide-and-conquer, greedy and dynamic-programming strategies.
AsymptoticsRecurrencesGreedyDynamic programmingGraphsNP-completeness
01 / COMPOSITION
Semester
composition.
Both Major courses follow the university curriculum. The Minor menus contain only the department-confirmed options; the combination preview does not constitute allotment.
BCOSMAJ06C · 6 credits · 4-2-0
BCOSMAJ07C · 6 credits · 4-2-0
02 / COURSE MAP
Learning
scope.
The two Major courses form a natural pair: efficient solutions are developed and then translated into dependable software.
Software Engineering
Study lifecycle models, requirements, estimation, quality, design, testing and documentation for real software projects.
Lifecycle modelsSRSCOCOMOUMLTestingQuality
Physics or Chemistry
The available options are Waves and Optics and Inorganic & Physical Chemistry–I.
Waves and OpticsChemical bondingGases and liquidsPractical work
Physics, Chemistry or Mathematics
The available options are Waves and Optics, Inorganic & Physical Chemistry–I and Linear Programming Problem.
Wave physicsPhysical chemistryOptimisationTransportation
03 / FIRST 8 WEEKS
Design
sprint.
A suggested opening sequence. A week may be marked complete when a representative problem can be solved and its design decision explained.
Measure algorithms
Distinguish time from space and use asymptotic notation to compare growth.
Solve recurrences
Use substitution, iteration and the Master Method on recursive algorithms.
Model the process
Compare waterfall, iterative, prototyping and spiral lifecycle models.
Divide and conquer
Analyse binary search, merge sort, quicksort, heaps and matrix multiplication.
Write requirements
Produce a concise SRS and transform requirements into DFDs and models.
Strategy selection
Greedy and dynamic-programming solutions are contrasted using proof and counterexample.
Design and estimate
Apply modularity, coupling, cohesion, structure charts, UML, metrics and COCOMO.
Test the system
Connect black-box, white-box, validation and system tests to documented requirements.
0 / 8 weeks complete
04 / SYLLABUS LENS
Course
details.
Switch between Major and Minor perspectives without losing the semester-level picture.
BCOSMAJ06C · 6 CREDITS
Design and Analysis of Algorithm
Analysis and strategies
Asymptotics, recurrences, divide-and-conquer, greedy methods and dynamic programming.
Graph algorithms and complexity
Traversal, topological sort, shortest paths, connected components and NP-hard/NP-complete classes.
Suggested checkpoint
For one problem, implement two approaches, measure them and explain why their growth differs.
BCOSMAJ07C · 6 CREDITS
Software Engineering
Process and requirements
Layered technology, lifecycle models, requirement analysis, modelling and SRS quality.
Management and design
Estimation, metrics, COCOMO, scheduling, quality assurance, modularity, coupling, cohesion and UML.
Testing and laboratory
Black-box, white-box, basis-path, validation and system testing; produce SRS, DFD, ERD and UML for real problems.
BPHSMEA35C / BPHSMEB35C · 4 CREDITS
Waves and Optics
Oscillations, waves and sound
Superposition, beats, Lissajous figures, travelling/standing waves, acoustics and Fourier ideas.
Wave optics
Interference, Michelson interferometer, diffraction, polarization and optical fibres.
Practical work
Any five experiments from Lissajous figures, prism optics, Fresnel biprism, diffraction grating and resolving power.
BCEMMEA35C / BCEMMEB35C · 4 CREDITS
Inorganic & Physical Chemistry–I
Chemical bonding · 15 lectures
Ionic and covalent bonding, Born–Haber cycle, polarization, VBT, hybridization, VSEPR and molecular-orbital treatment.
Gases and liquids · 30 lectures
Kinetic theory, Maxwell distribution, real-gas behaviour, van der Waals equation, viscosity and surface tension.
Practical work
Surface tension by stalagmometer and viscosity by Ostwald viscometer.
BMTMMEB35T · 4 CREDITS
Linear Programming Problem
Formulation and simplex
Canonical/standard forms, graphical solutions, basic feasible solutions, simplex, Big-M and two-phase methods.
Duality and allocation
Duality, transportation problems, degeneracy, Vogel approximation and assignment by the Hungarian method.
05 / COMPLETE SYLLABUS
Official content,
cleanly set.
Each course expands to display its full module sequence. Minor 1 and Minor 2 variants share the same subject content but use their corresponding MEA/MEB codes.
MAJ-6Design and Analysis of Algorithm
CodeBCOSMAJ06C
L-P-Tu4-2-0
Credits6
ModeCombined
Introduction · 10 lectures
Insertion sort, merge sort, time/space complexity, asymptotic notation and recurrence solving by substitution, iteration and the Master Method.
Divide and Conquer · 10 lectures
General method, quicksort, randomized algorithms, binary search, heapsort and matrix multiplication.
Greedy Algorithms · 8 lectures
Greedy strategy, Kruskal’s and Prim’s minimum-spanning-tree algorithms, and Huffman coding.
Dynamic Programming · 10 lectures
Memoization, tabulation, knapsack, matrix-chain multiplication and longest common subsequence.
Graph Algorithms · 12 lectures
BFS, DFS, topological sorting, strongly connected components, Bellman–Ford, Dijkstra and Floyd–Warshall.
Complexity Theory · 10 lectures
Non-deterministic algorithms, NP-hard and NP-complete classes, and Cook’s theorem.
Algorithm Laboratory
Implement sorting, maximum/minimum, recursive and iterative binary search, knapsack, Prim, Kruskal, single-source/all-pairs shortest paths, job sequencing, N-Queens and sum of subsets.
OFFICIAL SKBU RECORD · COMPUTER SCIENCE · SEMESTER 5
MAJ-7Software Engineering
CodeBCOSMAJ07C
L-P-Tu4-2-0
Credits6
ModeCombined
Introduction · 6 lectures
Evolving role and characteristics of software; layered technology; process framework; framework and umbrella activities.
Software Life-Cycle Models · 6 lectures
Classical and iterative waterfall, prototyping and spiral models, their application and comparison.
Requirement Analysis · 10 lectures
Requirement-engineering process, analysis and modelling, data-flow diagrams, SRS need, characteristics and components.
Project and Quality Management · 16 lectures
Estimation, metrics, COCOMO, scheduling, quality concepts, assurance, reviews and process/project metrics.
Design Engineering · 12 lectures
Design concepts, modularity, coupling/cohesion, function-oriented design, structure charts, transform/transaction-centred conversion and UML.
Testing Strategies · 10 lectures
Testing fundamentals, conventional software strategy, validation, system testing, black-box and white-box methods, and basis-path testing.
Software Engineering Laboratory
For selected real-life problems, prepare an SRS, DFD, ERD and UML models.
OFFICIAL SKBU RECORD · COMPUTER SCIENCE · SEMESTER 5
MINOR · PHYSICSWaves and Optics
Minor 1 codeBPHSMEA35C
Minor 2 codeBPHSMEB35C
L-P-Tu3-1-0
Credits4
Oscillations and Wave Motion · 9 lectures
Collinear and perpendicular harmonic oscillations, beats, Lissajous figures, string waves, normal modes, group/phase velocity, plane and spherical waves.
Sound · 9 lectures
Forced vibration, resonance, Fourier theorem, intensity/loudness, musical scales, reverberation, Sabine’s formula and auditorium acoustics.
Wave Optics and Interference · 15 lectures
Huygens principle, division of amplitude/wavefront, Young, Lloyd, Fresnel biprism, thin films, Newton’s rings and Michelson interferometer.
Diffraction, Polarization and Fibre · 12 lectures
Fraunhofer/Fresnel diffraction, zone plates, polarization states and controlled propagation in optical fibres.
Practical · any five
Lissajous figures, prism focusing/refractive index/dispersion, Fresnel biprism, diffraction grating and resolving power.
OFFICIAL SKBU RECORD · PHYSICS · SEMESTER 5
MINOR · CHEMISTRYInorganic & Physical Chemistry–I
Minor 1 codeBCEMMEA35C
Minor 2 codeBCEMMEB35C
L-P-Tu3-1-0
Credits4
Chemical Bonding · 15 lectures
Ionic-bond characteristics, radius-ratio rules, lattice energy, Born–Landé and Born–Haber treatments; covalent bonding, Fajan’s rules, Lewis structures, formal charge, VBT, hybridization, Bent’s rule, dipoles, VSEPR and MO diagrams for B₂, C₂, N₂ and O₂.
Kinetic Theory of Gases · 20 lectures
Pressure/temperature, collision frequency, mean free path, effusion, Maxwell distributions, equipartition, real-gas deviations, van der Waals equation, critical constants, corresponding states and viscosity.
Liquids · 10 lectures
Surface tension and stalagmometer; viscosity and Ostwald viscometer; temperature effects.
Practical
Determine surface tension by stalagmometer and relative/absolute viscosity by Ostwald viscometer.
OFFICIAL SKBU RECORD · CHEMISTRY · SEMESTER 5
MINOR 2 · MATHEMATICSLinear Programming Problem
CodeBMTMMEB35T
L-P-Tu4-0-0
Credits4
Lectures60
Formulation and Feasibility
Optimisation problems, LPP definition and mathematical formulation, canonical/standard forms, graphical solutions, basic and feasible solutions, and reduction to a basic feasible solution.
Simplex and Duality
Fundamental theorems, improved solutions, unboundedness, optimality, simplex algorithm, Big-M/two-phase techniques, duality properties and the dual simplex relationship.
Transportation and Assignment
Initial transportation solutions by North-West Corner, row/column/matrix minima and Vogel methods; loops, optimality, degeneracy and unbalanced problems; assignment by Hungarian method.
OFFICIAL SKBU RECORD · MATHEMATICS · SEMESTER 5
06 / STUDY OPERATING SYSTEM
Three rules
for engineered work.
Prove before coding
State the invariant, correctness idea and complexity before implementation.
Document decisions
Requirements, diagrams and test cases are part of the software—not decoration around it.
Test against intent
Every test should trace back to a requirement, edge case or stated quality goal.
07 / SUGGESTED MASTERY TARGETS
Expected evidence includes an analysed algorithm and a documented, tested software design.
01Analyse time and space complexity
02Select an algorithmic strategy
03Model requirements and architecture
04Design systematic software tests
These targets are suggested study guidance. Minor options reflect the department-confirmed selection set; final allotments remain authoritative.