Course Pro Forma Program Ijazah Sarjana Muda Perguruan Dengan Kepujian (Matematik Pendidikan Rendah) MTE 3104 3(3+0) 45 hours English Nil One / Two 1. Define the various tools in decision mathematics 2. Apply mathematics algorithms, heuristic algorithms, sorting, searching, graphs, linear programming and critical paths analysis in decision making 3. Select appropriate tools for making decision in mathematics 4. Integrate knowledge and understanding of decision mathematics and
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online from Scribd
Course Pro Forma Program Ijazah Sarjana Muda Perguruan Dengan Kepujian (Matematik Pendidikan Rendah) MTE 3104 3(3+0) 45 hours English Nil One / Two 1. Define the various tools in decision mathematics 2. Apply mathematics algorithms, heuristic algorithms, sorting, searching, graphs, linear programming and critical paths analysis in decision making 3. Select appropriate tools for making decision in mathematics 4. Integrate knowledge and understanding of decision mathematics and
Course Pro Forma Program Ijazah Sarjana Muda Perguruan Dengan Kepujian (Matematik Pendidikan Rendah) MTE 3104 3(3+0) 45 hours English Nil One / Two 1. Define the various tools in decision mathematics 2. Apply mathematics algorithms, heuristic algorithms, sorting, searching, graphs, linear programming and critical paths analysis in decision making 3. Select appropriate tools for making decision in mathematics 4. Integrate knowledge and understanding of decision mathematics and
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online from Scribd
Course Pro Forma Program Ijazah Sarjana Muda Perguruan Dengan Kepujian (Matematik Pendidikan Rendah) MTE 3104 3(3+0) 45 hours English Nil One / Two 1. Define the various tools in decision mathematics 2. Apply mathematics algorithms, heuristic algorithms, sorting, searching, graphs, linear programming and critical paths analysis in decision making 3. Select appropriate tools for making decision in mathematics 4. Integrate knowledge and understanding of decision mathematics and
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online from Scribd
Download as doc, pdf, or txt
You are on page 1/ 3
Cikgu Madrid
Course Pro Forma Program Ijazah Sarjana Muda Perguruan Dengan Kepujian (Matematik Pendidikan Rendah) Course Title Course Code Credit Contact Hours Language Of Delivery Prerequisite To Entry Semester Learning Outcomes Decision Mathematics (Matematik Keputusan) MTE 3104 3(3+0) 45 hours English Nil One/ Two 1. Define the various tools in decision mathematics
searching, graphs, linear programming and critical paths analysis in decision making 3. Select appropriate tools for making decision in mathematics
4. Integrate knowledge and understanding of Decision Mathematics
and mathematical modeling in daily life Synopsis This course introduces students to another useful branch of mathematics. It provides information about introduction to decision Mathematics, types of searches, linear programming, graphs, networks, critical path analysis, algorithms, heuristic algorithms and methods of sorting. Kursus ini memperkenalkan pelajar kepada satu lagi matematik yang berguna. Kursus ini menyediakan maklumat pengenalan kepada Matematik keputusan, jenis-jenis pemprograman linear, graf, rangkaian, analisa laluan algoritma, algoritma heuristik dan kaedah mengisih. cabang tentang carian, kritikal,
Cikgu Madrid Topic 1 Content Introduction What is Decision Mathematics? Tools in Decision Mathematics Types of searches Linear search algorithm Indexed sequential search algorithm Binary search algorithm Linear Programming Types of Linear Programming problems o Infinitely many solutions o Empty feasible regions o Unbounded feasible regions o Degeneracy o The Simplex Method in Linear Programming Hours 1
10
Graphs Definitions of graph, edge, degree Types of graphs o simple graph o walk, trail, path, cycle o Hamiltonian cycle o digraph o incidence matrix o planar graph o bipartite graph Networks Kruskals Algorithm Prims Algorithm Dijkstras Algorithm Critical Path Analysis Introduction and definition of Critical Path Analysis The elements of a network diagram : dummies, events, key even, symbols. Constructing a network diagram Analyzing a network diagram Resource Management Algorithms Introduction and definition of Algorithms Ways of communicating algorithms
11
Cikgu Madrid
Heuristic Algorithms First-fit Algorithm First-fit decreasing Algorithm Full bins Methods of Sorting Interchange sort Bubble sort Shuttle sort Quick sort Total
45
Assessment Main References
Coursework Examination
50% 50%
Parramore, K. et. al (2004). Decision Mathematics 1 D1. 3rd ed. UK. British Library Publication. Parramore. K. et. al (2004). Decision Mathematics 2 and C. 3rd ed. UK. British Library Publication.
Additional References
Hebborn , John (2000). Decision mathematics. UK : Paperback. Savage, Sam L. (2002). Decision making with insight. UK : Paperback. Smith, K.J. (2001). The nature of mathematics. 9th ed. CA:Thompson Learning.
