Scribd Logo
Upload

Welcome to Scribd!

  • 46 views

    Syllabus 1MA462 1

    Uploaded by

    apostolos
    This document outlines a course syllabus for Discrete Mathematics, a 7.5 credit course offered by the Faculty of Technology, Department of Mathematics. The course covers topics including logic, set theory, relations and functions, induction, generating functions, combinatorics, difference equations, and graphs. Students will be assessed through written exams and a project presented orally and in writing. A course evaluation will be conducted to gather student feedback and analyze for future offerings.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Syllabus 1MA462 1

    Uploaded by

    apostolos
    46 views2 pages
    This document outlines a course syllabus for Discrete Mathematics, a 7.5 credit course offered by the Faculty of Technology, Department of Mathematics. The course covers topics including logic, set theory, relations and functions, induction, generating functions, combinatorics, difference equations, and graphs. Students will be assessed through written exams and a project presented orally and in writing. A course evaluation will be conducted to gather student feedback and analyze for future offerings.

    Original Description:

    syllabus

    Original Title

    syllabus-1MA462-1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines a course syllabus for Discrete Mathematics, a 7.5 credit course offered by the Faculty of Technology, Department of Mathematics. The course covers topics including logic, set theory, relations and functions, induction, generating functions, combinatorics, difference equations, and graphs. Students will be assessed through written exams and a project presented orally and in writing. A course evaluation will be conducted to gather student feedback and analyze for future offerings.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    46 views2 pages

    Syllabus 1MA462 1

    Uploaded by

    apostolos
    This document outlines a course syllabus for Discrete Mathematics, a 7.5 credit course offered by the Faculty of Technology, Department of Mathematics. The course covers topics including logic, set theory, relations and functions, induction, generating functions, combinatorics, difference equations, and graphs. Students will be assessed through written exams and a project presented orally and in writing. A course evaluation will be conducted to gather student feedback and analyze for future offerings.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    Jnr: 

    2015/2065­3.1.2

    Course syllabus 
    Faculty of Technology 
    Department of Mathematics 

    1MA462 Diskret matematik, 7,5 högskolepoäng 
    Discrete Mathematics, 7.5 credits 

    Main field of study 
    Mathematics 
    Subject Group 
    Mathematics 
    Level of classification 
    First Level 
    Progression 
    G1F 
    Date of Ratification 
    Approved by Faculty of Technology 2015­05­22 
    The course syllabus is valid from spring semester 2016 
    Prerequisites 
    1MA101 Basic Mathematics 7.5 credits or 1MA141 Basic Mathematics for Computer 
    Scientists, 7.5 hp or equivalent. 

    Objectives 
    The student should be able to:

    l interpret, communicate and argue using mathematic notions. 
    l define exactly central concepts of the course, derive relations between them and 
    apply them to solve problems. 
    l solve combinatorial problems using different methods. 
    l perform proofs by mathematical induction. 
    l use generating functions in problem solving 
    l perform logical deductions using truth tables and deduction schemes. 
    l use quantifiers, and construct some simple expressions in predicate calculus. 
    l solve linear recurrence relations. 
    l know elementary properties of graphs. Decide if a graph has an Euler circuit, if it
    is planar etc. Construct the chromatic polynomial for a graph. 
    l know the basic facts about relations, especially about Equivalence Relations and 
    Partial Orders. Be able to represent them as graphs and as matrices. 
    l know the basic facts about Function. Decide whether they are one­to­one and if 
    they are onto. Derive the inverse function in case there is one 

    Content 
    l Logic: Truth tables, deduction schemes. Some predicate calculus formalism. 
    l Set Theory: The principle of duality. De Morgan’s laws. The principle of inclusion
    and exclusion. 
    l Relation and Functions: Theory of functions. Properties of relations. Equivalence 
    relations. Partial orders. Representation of relations graphs and as matrices. 
    Content 
    l Logic: Truth tables, deduction schemes. Some predicate calculus formalism. 
    l Set Theory: The principle of duality. De Morgan’s laws. The principle of inclusion
    and exclusion. 
    l Relation and Functions: Theory of functions. Properties of relations. Equivalence 
    relations. Partial orders. Representation of relations graphs and as matrices. 
    l Induction: The well­ordering principle. Mathematical induction. Recusive 
    definitions and recursive procedures 
    l Generating Functions. 
    l Combinatorics. 
    l Difference Equations. Linear recurrence relations. 
    l Graphs: Euler circuits. Hamilton cycles. Planar graphs. Graph coloring and 
    chromatic polynomials. Something about trees. 

    Type of Instruction 
    Lectures and seminars. Compulsory assignments may be given during the course. 
    Examination 
    The course is assessed with the grades A, B, C, D, E, Fx or F. 
    The grade A constitutes the highest grade on the scale and the remaining grades follow 
    in descending order where the grade E is the lowest grade on the scale that will result in
    a pass. The grade F means that the student’s performance is assessed as fail (i.e. 
    received the grade F). 
     
    The student’s knowledge is assessed in the form of written examinations and a project. 
    This is presented orally and in writing. 
    Course Evaluation 
    During the course or in close connection to the course, a course evaluation is to be 
    carried out. The result and analysis of the course evaluation are to be communicated to 
    the students who have taken the course and to the students who are to participate in the 
    course the next time it is offered. The course evaluation is carried out anonymously. The
    compiled report will be filed at the Faculty. 
    Credit Overlap 
    The course cannot be included in a degree along with the following course/courses of 
    which the content fully, or partly, corresponds to the content of this course:1MA162 
    Discrete Mathematics, 7.5 credits 
    Other 
    The grade A constitutes the highest grade on the scale and the remaining grades follow 
    in descending order where the grade E is the lowest grade on the scale that will result in
    a pass. The grade F means that the student’s performance is assessed as fail (i.e. 
    received the grade F). 
    Required Reading and Additional Study Material 
    Required reading 
    Kenneth H. Rosen.Discrete mathematics and its Applications, McGraw­Hill, senaste 
    upplagan. 500 (830) pages. 
     

    You might also like