Scribd
Upload
780 views7 pages

BS Math 2nd semester-BZU

This document provides information about two mathematics courses - MATH 104 Discrete Structures and MATH 106 Programming Languages for Mathematicians. MATH 104 focuses on set theory, logic, and mathematical proofs. It covers topics like sets, relations, cardinality, equivalence relations, and induction. MATH 106 introduces students to programming in C and C++ by covering variables, loops, conditional statements, functions, arrays, pointers, structures, and files. Both courses aim to strengthen students' mathematical problem solving and computational skills.

Uploaded by

hamza naeem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
780 views7 pages

BS Math 2nd semester-BZU

This document provides information about two mathematics courses - MATH 104 Discrete Structures and MATH 106 Programming Languages for Mathematicians. MATH 104 focuses on set theory, logic, and mathematical proofs. It covers topics like sets, relations, cardinality, equivalence relations, and induction. MATH 106 introduces students to programming in C and C++ by covering variables, loops, conditional statements, functions, arrays, pointers, structures, and files. Both courses aim to strengthen students' mathematical problem solving and computational skills.

Uploaded by

hamza naeem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

BS Mathematics

Semester 2nd
MATH 104 Discrete Structures
Prerequisite(s): None
Credit Hours: 3 + 0

Recommended Text: Rosen KH, Discrete Mathematics and its Applications (12th
edition), 1999, McGraw Hill, New York

Background and Goals: This course lays a strong emphasis on understanding


and utilizing various strategies for composing mathematical proofs.

Contents:

Set and Relations: Basic notions, set operations, Venn diagrams, extended-set
operations, indexed family of sets, countable and uncountable sets, relations,
cardinality, equivalence relations, congruence, partitions, partial order,
representation of relations, mathematical induction.

Elementary Logic: Logics of order zero and one, Propositions and connectives,
truth tables, conditionals and biconditionals, quantifiers, methods of proof, proofs
involving quantifiers.

7
MATH 106 Programming Languages for Mathematicians

Prerequisite(s): Introduction to Computers & Calculus II


Credit Hours: 3 + 1
Recommended Books:

1. Aho, AV, Ulman JD, Foundation of Computer Science, 1995, Computer


Science Press, WH Freeman, New York
2. Hein JL, Theory of Computation: An Introduction (1st edition), Jones &
Bartlett, Boston
Background and Goals: The purpose of this course is to introduce students
to operating systems and environments

Contents: Introduction to operating systems, C language, building blocks,


variables, input/output, loops (FOR, WHILE, DO), decisions (IF, IF ELSE, ELSE
IF) construct switch statement, conditional statement, function hat returns a
value using argument to pass data to another function, external variable,
arrays and strings, pointers, structure, files and introduction to C++

You might also like