Artificial Intelligence
Formulate problems, search state spaces, represent knowledge, reason under uncertainty and build elementary neural models.
Bring together intelligent search, processor-level programming and visual computation—then anchor the semester with two carefully chosen Minor courses.
All three Major courses follow the university curriculum. The Minor menus contain only the department-confirmed options; the combination preview does not constitute allotment.
Semester 7 spans symbolic intelligence, low-level hardware control and mathematical image construction.
Formulate problems, search state spaces, represent knowledge, reason under uncertainty and build elementary neural models.
Understand processor architecture, write assembly-language programs and interface memory and peripheral devices.
Generate primitives, transform and clip objects, model geometry, remove hidden surfaces and render scenes.
The available options are Thermal and Statistical Physics and Inorganic & Physical Chemistry–II.
The available options are the corresponding Physics or Chemistry course and Numerical Methods & Basic Computer Programming in C.
A suggested study sequence. Each week ends with a visible artefact: a trace, diagram, program or rendered result.
Define agents, environments, states, actions, goals and performance measures.
Map buses, registers, memory and I/O around a microprocessor-based system.
Implement Bresenham line and midpoint circle algorithms; compare generated pixels.
Compare uninformed, greedy best-first, A*, hill-climbing and simulated annealing.
Practise data transfer, arithmetic, logic, branching, loops and indexed operations.
Use homogeneous coordinates for 2D/3D transformations and apply line/polygon clipping.
Move from propositions to first-order logic, resolution, forward and backward chaining.
Present a small AI search, assembly routine or graphics pipeline with traceable output.
The tabs provide fast orientation, while the full syllabus accordions support lecture and revision planning.
Agents, uninformed/informed/local search, AND–OR graphs, minimax and alpha–beta pruning.
Propositional and first-order logic, resolution, chaining, Bayes, belief networks and fuzzy reasoning.
Biological comparison, perceptron learning, feed-forward networks and error.
Implement and explain one search problem, including state representation, frontier behaviour and result.
Internal organisation, buses, memory/I/O interfacing and troubleshooting.
Data transfer, arithmetic, logic, branching, loops, indexing, instruction formats and assembly.
Address decoding, cache, keyboard/display, timers, interrupts, DMA, video and communication interfaces.
Raster/random scan hardware, line/circle/ellipse algorithms, filling, clipping and 2D/3D transformations.
Curves, surfaces, hidden-surface elimination, illumination, shading, colour and animation.
Laws, processes, entropy, potentials, Maxwell relations and thermodynamic identities.
Velocity distribution, transport, radiation and Maxwell–Boltzmann, Fermi–Dirac and Bose–Einstein statistics.
Balancing methods, oxidimetry/reductimetry, group trends and compounds of selected p-block families.
Zeroth and first laws, state/path functions, heat, work, internal energy, enthalpy and gas expansions.
Errors, nonlinear equations, linear systems, interpolation and numerical integration.
Language structure, types, operators, conditions, loops, arrays, functions and small numerical programs.
Course modules follow the SKBU detailed records. Minor 1 and Minor 2 variants share subject content and use their respective MEA/MEB codes.
Definitions, importance, evolution and applications of AI; environment-based classification, intelligent agents and agent types.
Search principles; uninformed, partial-information and informed strategies; greedy best-first, A*, hill-climbing and simulated annealing.
AND–OR graphs, game playing, minimax and alpha–beta pruning.
Knowledge-based systems, propositional logic, rules, resolution, first-order logic, syntax/semantics, quantifiers, Horn clauses, refutation, forward and backward chaining.
Uncertainty, probability and Bayes’ rule, inference, belief networks, utility-based approaches and fuzzy reasoning.
ANN fundamentals, biological comparison, perceptrons, learning, feed-forward networks and error.
Using Python, Prolog or another suitable language: facts/queries, arithmetic, Tower of Hanoi, 8-puzzle, 4-Queens, travelling salesperson and water-jug problems.
OFFICIAL SKBU RECORD · COMPUTER SCIENCE · SEMESTER 7
Internal architecture and operation, applications, system-bus architecture, memory and I/O interfaces, memory-segment interfacing, testing and troubleshooting.
Data transfer, arithmetic, logical and branch operations; loops, counting, indexing, additional transfers, register organisation, instruction formats and assembly-language programming.
Memory-address decoding, cache and cache controllers, I/O, keyboard/display, timers, subroutines, interrupts, interrupt/DMA/video controllers and communication interfaces.
Sixteen-bit multiplication/division and BCD arithmetic; searches; array addition/subtraction; binary–ASCII conversion; HCF/LCM; and bubble sort.
OFFICIAL SKBU RECORD · COMPUTER SCIENCE · SEMESTER 7
Basic elements and applications of computer graphics.
Raster- and random-scan display architectures and input/output devices.
Raster scan lines, circles, ellipses, thick primitives, polygon filling, line/polygon clipping, 2D/3D transformations, viewing, parallel/perspective projections and vanishing points.
Curves and surfaces, hidden-surface elimination, illumination and shading, colour models and computer animation.
Bresenham line, midpoint circle, Cohen–Sutherland line clipping, Sutherland–Hodgman polygon clipping, 2D/3D transformations, parallel/perspective projection and Hermite/Bézier curves.
OFFICIAL SKBU RECORD · COMPUTER SCIENCE · SEMESTER 7
Zeroth, first, second and third laws; internal energy; heat/work; thermodynamic processes; heat capacities; reversibility; Carnot cycle; entropy and absolute zero.
Enthalpy, Gibbs/Helmholtz/internal-energy functions, Maxwell relations, Joule–Thomson effect, Clausius–Clapeyron equation and TdS equations.
Maxwell velocity distribution, mean free path, transport, equipartition, specific heat, blackbody radiation, Planck, Wien, Rayleigh–Jeans and Stefan–Boltzmann laws.
Phase space, macrostates/microstates, entropy and probability; Maxwell–Boltzmann, Fermi–Dirac and Bose–Einstein distributions.
Mechanical equivalent of heat, Planck constant, thermal conductivity, resistance thermometry, thermocouples, cooling curves, RTD calibration and Stefan constant.
OFFICIAL SKBU RECORD · PHYSICS · SEMESTER 7
Balancing equations by oxidation-number and ion–electron methods; oxidimetry and reductimetry.
Electronic configurations, forms, oxidation states, inert-pair effect and important compounds for B/Al/Ga/In/Tl; C/Si/Ge/Sn/Pb; N/P/As/Sb/Bi; O/S/Se/Te; and F/Cl/Br/I groups.
Intensive/extensive variables, state/path functions, system types, zeroth and first laws, heat, work, internal energy, enthalpy, heat capacities and reversible/irreversible/free gas expansions.
Qualitative semi-micro analysis of mixtures containing three radicals from the stated acid- and basic-radical groups.
OFFICIAL SKBU RECORD · CHEMISTRY · SEMESTER 7
Absolute/relative, round-off and truncation errors; bisection, fixed-point and Newton–Raphson methods; Gaussian elimination and Gauss–Seidel; finite differences; Lagrange and Newton interpolation; Newton–Cotes, trapezoidal and Simpson integration.
Computer languages; C structure, character set, identifiers, constants and declarations; operators and precedence; input/output, assignment, decisions, loops, arrays and functions; programs for ordering, series, primes, factorial, temperature conversion, triangle area, interest, mean and standard deviation.
OFFICIAL SKBU RECORD · MATHEMATICS · SEMESTER 7
For search, assembly and rasterisation, a hand trace exposes misunderstandings early.
Write down states, registers, coordinate systems and assumptions before calculating.
Maintain small executable examples and screenshots of output throughout the semester.
These targets and the eight-week plan are suggested guidance. Official course structure and modules remain separate and traceable.