Computer Fundamentals & Programming using C
Build from binary and logic gates to structured programs, arrays, pointers, dynamic memory and files.
Boolean logicControl flowFunctionsPointers
A practical roadmap for Sidho-Kanho-Birsha University students—connecting the official syllabus to weekly actions, small wins, and a confident start.
The Major, Multidisciplinary, Skill Enhancement, and Value-Added courses are fixed. Choose one Minor elective.
Each course has a different job. Together, they build computational thinking, scientific range, practical software fluency, and environmental awareness.
Build from binary and logic gates to structured programs, arrays, pointers, dynamic memory and files.
Choose a scientific lens: motion, energy and oscillations—or atoms, periodicity, kinetics and solids.
Learn data preparation, mining, statistics, machine learning ideas and Python foundations.
Understand hardware, operating systems, MS Office, spreadsheets, presentations, internet and email.
Explore resources, ecosystems, biodiversity, pollution, policy, communities and field-based inquiry.
A sensible sequence for the opening half of the semester. Check each week as you complete its small, concrete outcome.
Set up a C compiler, Python, folders and a study calendar. Read every course outcome once.
Number systems, data representation, computer components, environmental systems.
C syntax, variables, operators and I/O. Create five tiny console programs.
Conditionals and loops. Use Excel formulas and chart one small dataset.
Break programs into functions. Learn mean, median, mode and standard deviation.
Work with arrays and strings. Clean a CSV and write three observations.
Tackle minor-course numericals and map one local environmental issue.
Build a mini C project, prepare a one-page concept map, then test yourself.
A clear, compact reading of the supplied official syllabus. Use it as an index, then follow your department’s current notices for assessment dates.
Computer generations, hardware/software, Boolean algebra, logic gates, number systems, compilation and program structure.
Types, variables, constants, storage classes, input/output, operators, conversion, conditions and loops.
Passing arrays, function declarations, call by value/reference, recursion and library functions.
Structures and unions, pointer arithmetic, dynamic allocation, text files, random access, macros and directives.
By mid-semester, aim to independently write, debug and explain a menu-driven C program using functions and arrays.
Analytics, warehouses, OLAP/OLTP, preprocessing, structured data, cleaning, classification and association rules.
Supervised and unsupervised learning, central tendency, deviation, correlation, regression, covariance, PCA and clustering.
Objects, classes, methods, data structures, control flow, modules, packages and file handling.
Characteristics, generations, hardware/software, memory, number systems and operating-system functions.
Word processing, Excel functions and charts, data analysis, macros, PowerPoint layouts, animation and hyperlinks.
Networks, transmission media, browsers, search engines, URLs, email and safe internet use.
Environmental basics; forests, water, minerals, food, energy, land and sustainable development.
Ecosystems, food chains, energy flow, biodiversity values, hotspots, threats and conservation.
Air, water, soil and noise pollution; waste, disasters, environmental laws, climate change and public health.
Study a local environmental asset, pollution site, species group or simple ecosystem and produce a report.
Vectors and ordinary differential equations.
Newton’s laws, momentum, work, energy, rotation and gravitation.
SHM and damping, elastic constants and torsion, plus foundational special relativity.
Choose experiments involving precision measurement, pendulums, flywheels, springs or elastic constants.
Hydrogen spectrum, Bohr and Sommerfeld models, quantum numbers, electronic configuration and Aufbau principle.
Blocks, radii, ionization potential, electron affinity, electronegativity and periodic trends.
Rate laws, reaction order, integrated forms, half-life, Arrhenius equation, collision and transition-state theories.
Crystal systems, symmetry, Miller indices, Bragg’s law, ionic structures and crystal defects.
Faithfully transcribed from the supplied SKBU pages and screenshots. Obvious spelling, punctuation, spacing, and capitalization errors have been corrected without changing academic meaning.
Open a course to see its complete Semester 1 syllabus. Lecture counts and practical requirements are retained so that this page can serve as a reliable study checklist.
Understand the functions and history of computers; design the logical structure of programs in C; identify input/output functions and format specifiers; and understand built-in and user-defined functions.
Write pseudocode; implement derived and user-defined data types; explain pointers and file data structures and their operations; and debug and test code.
Uses, history, and generations of computers; software and hardware; computer peripherals; basic components and storage; Boolean algebra; logic gates; switching functions and their simplification; data representation; computer arithmetic; number systems and codes; base conversion; complements; fixed- and floating-point representation; character representation; addition, subtraction, and magnitude comparison.
Concept of logic; need for programming; a brief history of C; form and basic syntax of a C program; blocks; compilation and execution; and comments.
Basic data types; declaration and definition of variables; variable memory maps; scope; storage-class specifiers; initialization; constants; the const qualifier; operators; formatted console I/O; unformatted console I/O using getchar() and putchar(); and header files.
Operator precedence, type conversion, type casting, conditional statements, and loops.
Arrays: types, declaration, initialization, and passing arrays to functions; strings; general form, declaration, and definition of functions; call by value and call by reference; arguments to main() (argc and argv); returning from functions; functions returning values or pointers; void functions; variable-length parameter lists; recursion; and library functions.
Structure basics; accessing members; structure assignments; arrays and pointers to structures; passing structures to functions; nested and self-referential structures; bit-fields; unions; and typedef.
Pointer variables and assignments; pointer/address arithmetic; comparison; arrays of pointers; multiple indirection; pointers to functions; and common pointer-related problems.
Static and dynamic memory allocation; malloc(), calloc(), and free().
Opening and closing files; reading and writing text files; random access; preprocessor directives; and macros.
if, if–else, else-if ladders, switch, and break.for, while, and do–while loops; continue.Understand key data-science technologies; association rules, classification, regression, and clustering; analyse data-mining models; and demonstrate knowledge of data-analysis techniques.
Perform data preprocessing; apply mining techniques; implement data-mining tools to solve complex problems; and gain hands-on experience of data analysis using Python.
Data analysis; data analytics; need for analytics; introduction to data warehouses, OLAP, and OLTP; data preprocessing; structured and unstructured data; dataset centralization; extracting basic insights; cleaning and preparing data; data marts; data-mining concepts and algorithms; classification; and association-rule mining.
Concepts and types of artificial intelligence; types of machine learning; supervised and unsupervised learning; mean, median, mode, standard deviation, correlation, regression, covariance, curve fitting, principal component analysis, and clustering.
Object-oriented programming concepts; classes, objects, and methods; Python data structures; control statements; user-defined modules; packages; and file handling.
Learn basic computer terminology and architecture; develop skills in word processing, spreadsheets, and presentation software; and understand the fundamentals of operating systems and computer networks.
Use Microsoft Office applications; analyse data in Microsoft Excel; understand how operating systems work; and use the internet safely.
Characteristics, applications, and types of computers; components of computer systems; input and output devices; computer generations; hardware and software; types of software; memory; computing, data, and information; computer arithmetic and number systems (binary, decimal, octal, and hexadecimal); binary arithmetic; ASCII, EBCDIC, and BCD codes; operating systems and their functions.
Word: word-processing basics; opening and closing documents; text creation, manipulation, and formatting; objects; tables; and merging documents. Excel: spreadsheet basics; functions and formulas; charts and graphs; data analysis; and macros. PowerPoint: opening and viewing slides; AutoLayouts; custom animation; slide transitions; charts and graphs; and hyperlinks.
Computer networks and their types; internet and intranet; internetworking devices; transmission media; the World Wide Web; popular web browsers; search engines; web pages and websites; URLs; email; and applications of the internet.
Develop awareness of environmental issues and an understanding of natural resources, ecology, ecosystems, biodiversity, conservation, and environmental management. Produce practical knowledge through environment-related project work.
Definition, nature, scope, and importance; components of the environment; environmental education.
Ecology; population and community ecology; ecosystem concepts and types; food chains, food webs, and ecological succession; energy flow and energy-flow models.
Levels and values of biodiversity; biodiversity hotspots and mega-diverse countries; threats; threatened and endemic Indian species; in-situ and ex-situ conservation; ecosystem services and their ecological, economic, social, ethical, aesthetic, and informational values.
Nature, causes, effects, and control of air, water, soil, and noise pollution; solid-waste causes, effects, disposal, and management of biomedical and municipal wastes; disaster management for floods, earthquakes, cyclones, and landslides.
Constitutional provisions: Articles 48A and 51A(g); Environment (Protection) Act, 1986; Air (Prevention and Control of Pollution) Act, 1981; Water (Prevention and Control of Pollution) Act, 1974; Forest (Conservation) Act, 1980; Wildlife (Protection) Act, 1972; climate change, global warming, ENSO, acid rain, ozone-layer depletion, and the Montreal and Kyoto Protocols.
Human population growth and environmental impacts; health and disease; communicable and non-communicable diseases; public awareness; the Chipko Movement, Silent Valley Movement, and Narmada Bachao Andolan.
Select one internally evaluated topic: an environmental asset (river, forest, grassland, hill, or mountain); environmental pollution in an urban, rural, industrial, or agricultural setting; common plants, insects, birds, or wildlife; or a simple pond, river, or hill-slope ecosystem.
Develop a comprehensive understanding of classical mechanics: motion, forces, work, energy, momentum, rotation, gravitation, oscillations, and elasticity, with practical problem-solving applications.
Apply Newton’s laws to dynamic systems; solve mechanics problems analytically; apply work, energy, momentum, and rotation to real situations; analyse elasticity and harmonic motion; and establish a foundation for further study in physics and engineering.
Vectors (4 lectures): vector algebra; scalar and vector products; derivatives of a vector with respect to a parameter.
Ordinary Differential Equations (4): first-order homogeneous equations; second-order homogeneous equations with constant coefficients.
Laws of Motion (7): frames of reference; Newton’s laws; particle systems; centre of mass.
Momentum and Energy (5): conservation of momentum; work and energy; conservation of energy; rocket motion.
Rotational Motion (4): angular velocity and momentum; torque; conservation of angular momentum.
Gravitation (7): Newton’s law; central-force motion; planar motion; conservation of angular momentum; constant areal velocity; Kepler’s laws; circular satellites; geosynchronous orbits; GPS; weightlessness; physiological effects on astronauts.
Oscillations (4): simple harmonic motion; the SHM differential equation and solutions; kinetic, potential, and total energy and time averages; damped oscillations.
Elasticity (5): Hooke’s law; stress–strain diagram; elastic moduli and constants; Poisson’s ratio; stretching and twisting work; twisting couple; static torsion; torsional pendulum; rigidity modulus, moment of inertia, and Searle’s method.
Special Relativity (5): constancy of light speed; postulates; length contraction; time dilation; relativistic velocity addition.
Theory: H. K. Dass and R. Verma, Mathematical Physics; Resnick, Halliday, and Krane, Physics; Sears, Zemansky, and Young, University Physics; C. Kittel et al., Mechanics; V. S. Soni, Mechanics; Chatterjee and Sengupta, General Properties of Matter; S. Banerji and A. Banerjee, Special Theory of Relativity; Ronald Lane Reese, University Physics; A. B. Gupta, College Physics, Vol. 1.
Practical: Chattopadhyay and Rakshit, An Advanced Course in Practical Physics; C. L. Arora, B.Sc. Practical Physics; B. Ghosh and K. G. Mazumdar, Advanced Practical Physics; G. Sanon, B.Sc. Practical Physics.
Provide foundational ideas in general inorganic and physical chemistry through atomic structure, periodic properties, chemical kinetics, and solids.
Develop in-depth knowledge of atomic structure, understand periodic properties of the elements, and apply the basic principles of chemical kinetics and solid-state chemistry.
Bohr’s theory for the hydrogen atom (simple mathematical treatment); the atomic spectrum of hydrogen and Bohr’s model; Sommerfeld’s model; quantum numbers and their significance; Pauli’s exclusion principle; Hund’s rule; electronic configurations of many-electron atoms; the Aufbau principle and its limitations.
Classification by electronic configuration; characteristics of s-, p-, d-, and f-block elements; positions of hydrogen and the noble gases; atomic and ionic radii; ionization potential; electron affinity; electronegativity; and periodic and group-wise variations in s- and p-block elements.
Rate laws; order and molecularity; extent of reaction; rate constants; first-, second-, and nth-order reactions and their differential and integrated forms, with derivations; pseudo-first-order reactions; determining reaction order using half-life and differential methods; opposing, consecutive, and parallel reactions; temperature dependence of rate constants; the Arrhenius equation and activation energy; collision theory; Lindemann theory of unimolecular reactions; and an outline of classical transition-state theory.
Forms of solids; crystal systems; unit cells; Bravais lattices; symmetry elements; laws of crystallography, including constancy of interfacial angles and rational indices; Miller indices and interplanar distances; Bragg’s law; NaCl, KCl, and CsCl structures (qualitative treatment); crystal defects; glasses; and liquid crystals.
J. D. Lee, Concise Inorganic Chemistry; B. E. Douglas and D. H. McDaniel, Concepts and Models of Inorganic Chemistry; M. C. Day and J. Selbin, Theoretical Inorganic Chemistry; Shriver and Atkins, Inorganic Chemistry; F. A. Cotton, G. Wilkinson, and P. L. Gaus, Basic Inorganic Chemistry; A. G. Sharpe, Inorganic Chemistry; J. E. Huheey, E. A. Keiter, and R. L. Keiter, Inorganic Chemistry: Principles of Structure and Reactivity; P. W. Atkins and J. de Paula, Physical Chemistry; D. M. P. Mingos, Essential Trends in Inorganic Chemistry; J. Burgess, Ions in Solution; Misra, Giri, Roy, and Chanda, Snatak Rasayan.
Practical references: S. P. Dey, Snatak Parikshagare Rasayan, Vol. I; G. N. Mukherjee, University Handbook of Undergraduate Chemistry Experiments; Nad, Mahapatra, and Ghoshal, An Advanced Course in Practical Chemistry.
For programming, one working program teaches more than an hour of passive video. Type, run, break, repair.
Write every unresolved question in one place. Clear the list weekly with peers or faculty.
Use 24-hour, 7-day and 30-day reviews. Short retrieval beats rereading.
Honours with Research includes a rigorous 12-credit project in Semester 8; the supplied framework notes a minimum of 75% across the first six semesters for eligibility.