Introduction
This document outlines the examination scheme for the first semester of the B.Sc. (Honours) Mathematics program. The scheme details the course structure, credit distribution, examination pattern, and assessment methodology implemented from the academic year 2010-2011 onwards.
The program aims to provide students with a strong foundation in mathematical concepts, theories, and applications, while developing critical thinking and analytical skills essential for advanced studies and careers in mathematics and related fields.
Program Objectives
The B.Sc. (Honours) Mathematics program is designed to:
- Provide a comprehensive understanding of fundamental mathematical concepts and theories
- Develop problem-solving skills through mathematical reasoning
- Prepare students for advanced studies in mathematics and related disciplines
- Cultivate research aptitude and independent thinking
- Develop computational skills applicable to mathematical problems
- Enhance communication skills for effective presentation of mathematical ideas
Course Structure
The first semester of the B.Sc. (Honours) Mathematics program comprises the following courses:
| Course Code | Course Title | Credits | Hours/Week | Type |
|---|---|---|---|---|
| MATH-101 | Calculus | 6 | 5 | Theory |
| MATH-102 | Linear Algebra | 6 | 5 | Theory |
| MATH-103 | Discrete Mathematics | 5 | 4 | Theory |
| MATH-104 | Programming in C | 5 | 4 | Theory + Practical |
| ELECTIVE-1 | General Elective I | 4 | 4 | Theory |
| ENGL-101 | English Communication | 3 | 3 | Theory |
| Total Credits for Semester I: | 29 | |||
Course Descriptions
MATH-101: Calculus
Course Objective: To provide a strong foundation in differential and integral calculus, focusing on concepts, techniques, and applications.
Syllabus Outline:
- Real numbers and their properties: Order, absolute value, intervals
- Functions: Definition, types, graphs, basic operations
- Limits: Definition, properties, indeterminate forms, continuity
- Differentiation: Rules, applications, chain rule, implicit differentiation
- Applications of derivatives: Maxima/minima, curve tracing, mean value theorems
- Integration: Indefinite integrals, methods of integration
- Definite integrals: Properties, fundamental theorem of calculus
- Applications of definite integrals: Areas, volumes, arc lengths
- Sequences and series: Convergence tests, power series
MATH-102: Linear Algebra
Course Objective: To develop understanding of vector spaces, linear transformations, matrices, and their applications.
Syllabus Outline:
- Systems of linear equations: Gaussian elimination, row echelon form
- Matrices: Operations, determinants, inverse matrices
- Vector spaces: Subspaces, linear independence, bases, dimension
- Linear transformations: Kernel, range, rank-nullity theorem
- Eigenvalues and eigenvectors: Diagonalization
- Inner product spaces: Gram-Schmidt process, orthogonal projections
MATH-103: Discrete Mathematics
Course Objective: To introduce fundamental concepts of discrete structures and mathematical reasoning.
Syllabus Outline:
- Sets, relations, and functions: Equivalence relations, partial orders
- Logic: Propositional calculus, predicate calculus, inference rules
- Proof techniques: Direct proof, contrapositive, contradiction, induction
- Combinatorics: Permutations, combinations, binomial theorem
- Recurrence relations: Solving linear recurrence relations
- Graph theory: Basic concepts, trees, applications
MATH-104: Programming in C
Course Objective: To develop programming skills using C language and its application to mathematical problems.
Syllabus Outline:
- Introduction to programming: Algorithm development, flowcharting
- C fundamentals: Data types, operators, expressions
- Control structures: Decision making, loops
- Functions: Recursion, parameter passing
- Arrays: One-dimensional, multi-dimensional
- Pointers: Pointer arithmetic, arrays and pointers
- Structures and unions
- File handling
- Numerical methods programming
ELECTIVE-1: General Elective I
Students may choose from a range of elective courses offered by other departments, typically selected based on:
- Personal interest
- Relevance to mathematics concentration
- Career objectives
Common electives include Introduction to Economics, Fundamentals of Physics, or Introduction to Philosophy.
ENGL-101: English Communication
Course Objective: To enhance English language skills, focusing on effective oral and written communication in academic and professional contexts.
Syllabus Outline:
- Grammar and usage
- Writing skills: Paragraphs, essays, reports
- Reading comprehension
- Communication strategies for presentations
- Academic writing techniques
- Technical report writing
Examination Pattern
Theory Papers
The evaluation for theory courses consists of two components:
| Component | Weightage |
|---|---|
| Internal Assessment | 20% |
| Semester End Examination | 80% |
| Total | 100% |
Internal Assessment Components:
- Class participation: 5%
- Assignments: 5%
- Mid-semester test: 10%
Semester End Examination:
- Duration: 3 hours
- Maximum marks: 80
- Question pattern: A mix of short answer, descriptive, and analytical questions
Practical Examination (MATH-104)
For courses with practical components (Programming in C), the evaluation includes:
| Component | Weightage |
|---|---|
| Internal Assessment (Practical record, viva) | 20% |
| End-semester Practical Examination | 80% |
| Total | 100% |
End-semester Practical Examination:
- Duration: 3 hours
- Maximum marks: 80
- Format: Two programming problems to be solved on a computer
- Viva voce examination based on the practical work
Grading System
The letter grades for each course and overall semester are awarded according to the following percentage of marks:
| Percentage Range | Grade | Grade Point |
|---|---|---|
| 90-100 | O (Outstanding) | 10 |
| 80-89 | A+ (Excellent) | 9 |
| 70-79 | A (Very Good) | 8 |
| 60-69 | B+ (Good) | 7 |
| 50-59 | B (Above Average) | 6 |
| 40-49 | C (Average) | 5 |
| Below 40 | F (Fail) | 0 |
Examination Guidelines
The following guidelines apply to all examinations:
- Students must appear for all examinations as per the schedule announced by the examination department.
- A minimum of 75% attendance in each course is mandatory to be eligible to appear for the semester-end examination.
- Use of unfair means during examinations will result in cancellation of the affected paper(s) and possible disciplinary action.
- Request for re-evaluation must be submitted within 15 days of the declaration of results, following the prescribed procedure.
- Supplementary examinations will be conducted for students who fail in one or more courses, as per university regulations.
- Students will be required to carry their university identity cards to all examination venues.
- Mobile phones, programmable calculators, and other electronic devices are prohibited in examination halls unless specifically permitted.
Academic Regulations
To successfully complete the first semester and progress to subsequent semesters, students must adhere to the following regulations:
- Clear all courses with a minimum passing grade (C or above)
- Maintain a minimum Semester Grade Point Average (SGPA) of 4.5
- Fulfill the attendance requirement of at least 75% in each course
- Complete and submit all assignments and practical work as specified
- Adhere to the university's code of conduct and academic integrity policies
Recommended Study Materials
The following textbooks are recommended for the courses in Semester I:
For Calculus (MATH-101)
- Thomas' Calculus by Maurice D. Weir and Joel Hass
- Calculus by Michael Spivak
- Calculus: Early Transcendentals by James Stewart
For Linear Algebra (MATH-102)
- Linear Algebra and Its Applications by Gilbert Strang
- Introduction to Linear Algebra by Serge Lang
- Linear Algebra Done Right by Sheldon Axler
For Discrete Mathematics (MATH-103)
- Discrete Mathematics and Its Applications by Kenneth H. Rosen
- Concrete Mathematics by Ronald Graham, Donald Knuth, and Oren Patashnik
- Discrete Mathematics with Applications by Susanna S. Epp
For Programming in C (MATH-104)
- The C Programming Language by Brian W. Kernighan and Dennis M. Ritchie
- Programming in C by Stephen G. Kochan
- Let Us C by Yashavant Kanetkar
Tutorial System
To enhance the learning experience and provide additional academic support, a tutorial system has been implemented:
- Small group tutorials (10-15 students) are conducted weekly for each core mathematics course
- Tutors facilitate problem-solving sessions and address individual difficulties
- Additional problem sheets are provided for practice
- Special tutorials are arranged for students needing extra assistance before examinations
