BCA Semester 1 Subjects & Curriculum

Browse subject folders below to access unit-by-unit syllabus, textbooks, video lectures, and PDF study notes for Bachelor of Computer Applications.

Browse Subject Folders

Semesters: Semester 1 3 Semester 2 Semester 3 4 Semester 4 Semester 5 Semester 6

Subject Folders

Subjects in Semester 1

Select any subject folder below to explore its complete syllabus, notes, textbooks, and resources.

6 Subjects Available

BCA-1001T

Mathematical Foundation for Computer Science – I

Course Code BCA-1001T Category CC-I (Core Course) Teaching Scheme 3L + 0T : 0P Credits & Hours 3 Credits (45 hrs) Examination Scheme & Evaluation Max Marks: 100 | Theory: 100 (Internal Assessment: 25, External End-Sem Exam: 75) NEP 2020 CBCS Course Outcomes (COs) Upon successful completion of this course, students will be able to: CO1 Understand the fundamental mathematical concepts such as sets, functions, matrix algebra, and discrete mathematics. CO2 This course enables the students to use mathematical models and techniques to analyse and understand problems in computer science. CO3 Understand how mathematical principles provide succinct abstractions of computer science problems and help them to efficiently analysis. CO4 Understand Eigen values, Eigen vectors, and the Cayley-Hamilton Theorem, and analyse matrix transformations and their applications in various domains. Unit-Wise Detailed Syllabus UNIT I Set, Relation, and Function 11 Proposed Lectures Sets & Relations: Set, Set Operations, Properties of Set operations, Subset, Venn Diagrams, Cartesian Products. Relations on a Set, Properties of Relations, Representing Relations using matrices and digraphs, Types of Relations, Equivalence Relation, Equivalence relation and partition on set, Closures of Relations, Warshall's algorithm. Functions: Functions, properties of functions (domain, range), composition of functions, surjective (onto), injective (one-to-one) and bijective functions, inverse of functions. Exponential and Logarithmic functions, Polynomial functions, Ceiling and Floor functions. UNIT II Counting and Recurrence Relation 11 Proposed Lectures Basics of Counting: Basics of counting, Pigeonhole Principle, permutations, combinations, Binomial coefficients, and Binomial Theorem. Recurrence Relations: Recurrence relations, their order, and methods for solving linear recurrence relations with constant coefficients using characteristic equation roots (real roots only). Non-linear recurrence relations and generating functions. UNIT III Elementary Graph Theory 11 Proposed Lectures Topics: Basic terminologies of graphs, connected and disconnected graphs, subgraphs, paths, and cycles. complete graphs, digraphs, weighted graphs, Euler and Hamiltonian graphs, as well as trees, their properties, the concept of spanning trees, and planar graphs, along with definitions and basic results related to these topics. UNIT IV Matrix Algebra 12 Proposed Lectures Topics: Types of matrices and their algebraic operations such as addition, subtraction, and multiplication. Determinants, symmetric and skew-symmetric matrices, orthogonal matrices, the rank and inverse of a matrix, and applications of matrices in solving systems of linear equations using Cramer's Rule. Eigen values, eigenvectors, Cayley-Hamilton Theorem. Text Books Kolman B., Busby R., and Ross S., Discrete Mathematical Structures, 6th Edition, Pearson Education, 2015. Deo Narsingh, Graph Theory with Application to Engineering and Computer Science, Prentice Hall India, 1979. Vasishtha A. R. and Vasishtha A. K., Matrices, Krishna Prakashan, 2022. Garg R., Engineering Mathematics, Khanna Book Publishing Company, 2024. Garg R., Advanced Engineering Mathematics, Khanna Book Publishing Company, 2023. Reference Books Grimaldi Ralph P. and Ramana B. V., Discrete and Combinatorial Mathematics: An Applied Introduction, 5th Edition, Pearson Education, 2007. Rosen Kenneth H. and Krithivasan Kamala, Discrete Mathematics and its Applications, McGraw Hill, India, 2019. West Douglas B., Introduction to Graph Theory, 2nd Edition, Pearson Education, 2015. Stephen Andrilli and David Hecker, Elementary Linear Algebra, 4th Edition, Elsevier Science, 2010. Discrete Mathematics and it's applications by Kenneth Rosen, McGraw Hill.

3.0 Credits 1 Notes

Open Subject Folder

BCA 1002T / BCA 1002P

Computer Architecture

Course Type: CC-II (Core Course with Practical). Theory (3 credits) + Practical (2 credits). Covers digital logic, CPU structure, memory organization, and assembly/hardware interfacing.

5.0 Credits 1 Notes

Open Subject Folder

BCA 1003 T

Indian Knowledge System

Course Type: GEC-I (Generic Elective Course). Overview of traditional Indian knowledge systems, history of sciences, mathematics, and philosophy.

2.0 Credits Syllabus Ready

Open Subject Folder

BCA 1004T / BCA 1004P

Problem Solving Techniques

Course Type: SEC-I (Skill Enhancement Course with Practical). Theory (3 credits) + Practical (2 credits). Covers algorithmic problem solving, flowcharts, pseudocode, and programming logic.

5.0 Credits 1 Notes

Open Subject Folder

BCA 1005 T

General English – I

Course Type: AEC-I% (Ability Enhancement Course / Alternative NPTEL/SWAYAM Course). Focuses on professional communication, technical writing, grammar, and comprehension.

2.0 Credits Syllabus Ready

Open Subject Folder

BCA 1006 T

Environmental Science and Sustainability

Course Type: VAC-I (Value Added Course). Covers ecosystem dynamics, environmental pollution, natural resource management, and sustainable development.

2.0 Credits Syllabus Ready

Open Subject Folder

Study Materials