Mathematics I - Syllabus

Course Overview and Structure

Embark on a profound academic exploration as you delve into the Mathematics I course () within the distinguished Tribhuvan university's BCA department. Aligned with the BCA Curriculum, this course (CACS104) seamlessly merges theoretical frameworks with practical sessions, ensuring a comprehensive understanding of the subject. Rigorous assessment based on a 60 + 20 + 20 marks system, coupled with a challenging passing threshold of , propels students to strive for excellence, fostering a deeper grasp of the course content.

This 3 credit-hour journey unfolds as a holistic learning experience, bridging theory and application. Beyond theoretical comprehension, students actively engage in practical sessions, acquiring valuable skills for real-world scenarios. Immerse yourself in this well-structured course, where each element, from the course description to interactive sessions, is meticulously crafted to shape a well-rounded and insightful academic experience.


 Course Description 

This course includes several topics from algebra and analytical geometry such as 

set theory and real & complex number; relation, functions and graphs; sequence 

and series; matrices and determinants; permutation & combination; conic section 

and vector in space which are essential as mathematical foundation for 

computing.

Course Objectives 

The general objective of this course is to provide the students with basic

mathematical skills required to understand Computer Application Courses.

Units

Key Topics

  • Challenges and Approach of E-government Security
    SE-1

    This topic covers the challenges faced by e-government in terms of security and the approaches to address them. It explores the importance of security in e-government and the ways to mitigate risks.

  • Security Management Model
    SE-2

    This topic introduces a security management model for e-government, outlining the key components and processes involved in ensuring the security of e-government systems.

  • E-Government Security Architecture
    SE-3

    This topic delves into the architecture of e-government security, including the design and implementation of secure systems and infrastructure for e-government services.

  • Security Standards
    SE-4

    This topic covers the security standards and guidelines for e-government, including international standards and best practices for ensuring the security of e-government systems and data.

  • Data Transaction Security
    SE-5

    Security measures for protecting data during transactions in e-commerce.

  • Security Mechanisms
    SE-6

    Various security mechanisms used in e-commerce including cryptography, hash functions, digital signatures, authentication, access controls, intrusion detection systems, and secured socket layer (SSL).

  • javax.servlet.http Package
    SE-7

    Exploring the javax.servlet.http package, including key classes and interfaces. Understanding how to use the package to develop HTTP-based servlets.

  • Handling HTTP Requests and Responses
    SE-8

    Understanding how to handle HTTP requests and responses using servlets, including request and response objects.

  • Using Cookies
    SE-9

    Understanding how to use cookies in servlets, including setting and retrieving cookie values.

  • Session Tracking
    SE-10

    Understanding how to track user sessions using servlets, including session creation and management.

  • Introduction to JSP
    SE-11

    Introduction to JavaServer Pages (JSP), including their role in web development and key features.

Key Topics

  • Relational Database Design Using ER-to-Relational Mapping
    RE-1

    Learn how to design relational databases using ER-to-relational mapping, including mapping of regular entities, weak entities, relationship types, multivalued attributes, and N-ary relationships.

  • Informal Design Guidelines for Relational Schemas
    RE-2

    Understand informal design guidelines for relational schemas, including semantics of attributes in relations, redundant information in tuples and update anomalies, NULL values in tuples, and generation of spurious tuples.

  • Functional Dependencies
    RE-3

    Study functional dependencies, including definition, inference rules, Armstrong's axioms, attribute closure, equivalence of functional dependencies, and minimal sets of functional dependencies.

  • Normal Forms Based on Primary Keys
    RE-4

    Explore normal forms based on primary keys, including First Normal Form, Second Normal Form, Third Normal Form, and their general definitions.

  • Boyce-Codd Normal Form
    RE-5

    Learn about Boyce-Codd Normal Form, a higher normal form that ensures a relational schema is in a good structure.

  • Multivalued Dependency and Fourth Normal Form
    RE-6

    Understand multivalued dependency and Fourth Normal Form, which eliminates multivalued dependencies in a relational schema.

  • Properties of Relational Decomposition
    RE-7

    Study properties of relational decomposition, including attribute preservation, dependency preservation, and loss-less/non-additive join.

  • Applications of Recursion
    RE-8

    This topic explores the various applications of recursion in problem-solving, including tree traversals and dynamic programming.

Key Topics

  • Challenges and Approach of E-government Security
    SE-1

    This topic covers the challenges faced by e-government in terms of security and the approaches to address them. It explores the importance of security in e-government and the ways to mitigate risks.

  • Security Management Model
    SE-2

    This topic introduces a security management model for e-government, outlining the key components and processes involved in ensuring the security of e-government systems.

  • E-Government Security Architecture
    SE-3

    This topic delves into the architecture of e-government security, including the design and implementation of secure systems and infrastructure for e-government services.

  • Security Standards
    SE-4

    This topic covers the security standards and guidelines for e-government, including international standards and best practices for ensuring the security of e-government systems and data.

  • Data Transaction Security
    SE-5

    Security measures for protecting data during transactions in e-commerce.

  • Security Mechanisms
    SE-6

    Various security mechanisms used in e-commerce including cryptography, hash functions, digital signatures, authentication, access controls, intrusion detection systems, and secured socket layer (SSL).

Key Topics

  • Introduction to Matrices
    MA-1

    This topic introduces the concept of matrices, including their definition, notation, and basic operations. It lays the foundation for further study of matrices and their applications.

  • Types of Matrices
    MA-2

    This topic covers the different types of matrices, including square matrices, diagonal matrices, identity matrices, and zero matrices. It explains their properties and characteristics.

  • Equality of Matrices
    MA-3

    This topic defines and explains the concept of equality of matrices, including the conditions for two matrices to be equal and the rules for comparing matrices.

  • Algebra of Matrices
    MA-4

    This topic covers the basic algebraic operations of matrices, including addition, subtraction, multiplication, and scalar multiplication. It explains the rules and properties of these operations.

  • Determinants
    MA-5

    This topic introduces the concept of determinants, including their definition, calculation, and properties. It explains the importance of determinants in matrix theory and their applications.

  • Transpose, Minors, and Cofactors of a Matrix
    MA-6

    This topic covers the concepts of transpose, minors, and cofactors of a matrix, including their definitions, calculations, and properties. It explains their relationships and applications.

  • Properties of Determinants
    MA-7

    This topic explains the various properties of determinants, including the multiplication property, addition property, and scalar multiplication property. It highlights their importance in matrix theory.

  • Singular and Non-Singular Matrices
    MA-8

    This topic defines and explains the concepts of singular and non-singular matrices, including their properties and characteristics. It highlights their importance in matrix theory and applications.

  • Adjoint and Inverse of Matrices
    MA-9

    This topic covers the concepts of adjoint and inverse of matrices, including their definitions, calculations, and properties. It explains their relationships and applications.

  • Linear Transformations
    MA-10

    This topic introduces the concept of linear transformations, including their definition, notation, and basic properties. It explains their importance in matrix theory and applications.

  • Orthogonal Transformations
    MA-11

    This topic covers the concept of orthogonal transformations, including their definition, properties, and applications. It highlights their importance in matrix theory and linear algebra.

  • Rank of Matrices
    MA-12

    This topic explains the concept of rank of matrices, including its definition, calculation, and properties. It highlights its importance in matrix theory and applications.

Key Topics

  • Activity Life Cycle
    AN-1

    Understanding the different stages of an activity's life cycle, including creation, start, resume, pause, stop, and destroy. This topic covers the methods that are called during each stage.

  • Creating Multiple Activities
    AN-2

    Learning how to create multiple activities in an Android application, including defining and implementing separate activities for different tasks.

Key Topics

  • Basic Principle of Counting
    PE-1

    Introduction to the fundamental principle of counting, which is used to solve various counting problems in mathematics. This principle is essential in understanding permutation and combination.

  • Permutation of a Set of Objects All Different
    PE-2

    Exploring the concept of permutation when all objects in a set are distinct and unique. This topic covers the formulas and techniques used to calculate the number of permutations in such cases.

  • Permutation of a Set of Objects Not All Different
    PE-3

    Understanding permutation when a set contains objects that are not all distinct. This topic covers the modifications to the permutation formula to accommodate repeated objects.

  • Permutation of Circular Arrangement
    PE-4

    Applying permutation concepts to circular arrangements, where the order of objects matters but the starting point is arbitrary. This topic covers the special considerations for circular permutations.

  • Permutation with Repeated Use of the Same Object
    PE-5

    Examining permutation scenarios where objects can be reused, and the implications on the permutation formula. This topic covers the techniques used to calculate permutations in such cases.

  • Combination of Things All Different
    PE-6

    Introducing the concept of combination, where the order of objects does not matter. This topic covers the formulas and techniques used to calculate the number of combinations when all objects are distinct.

  • Properties of Combination
    PE-7

    Exploring the properties and characteristics of combinations, including the relationships between combinations and permutations. This topic covers the advanced concepts and applications of combination.

Lab works

Laboratory Works

Mathematica and/ or Matlab should be used for above mentioned topics.