|
UET Taxila
http://www.uettaxila.edu.pk
| Welcome
to the course website.
|
 |
Course Management System - UET Taxila
COURSE DESCRIPTION Discrete Mathematics is a course in which the emphasis will be placed on learning and creating algorithms to perform certain computations or to process information within a discrete (finite) set. Counting, optimization, recursively defined functions, modeling situations with graphs, arranging objects, sequences, and series are a few of the topics that will be explored. As the use of computers (a discrete machine) continues to increase, so will the expansion and importance of discrete mathematics. Following are the main goals for this course. Students will
•Analyze and evaluate graphs made of vertices and edges that model real world problems.
•Define, use, and differentiate such concepts as Euclidean path, Hamiltonian path, Hamiltonian circuit, and isomorphism.
•Understand and apply graph coloring to real situations, such as scheduling.
•Find the number of possible ways independent objects from a given set may be selected or find the number of ways events may occur.
•Analyze and evaluate situations where elements are ordered or repeated.
•Calculate the probability of a given event occurring.
•Solve problems by applying the exclusion-inclusion principle, pigeonhole, and Catalan numbers.
•Distinguish between convergent and divergent sequences and series.
•Identify the results of repeating algorithms.
•Analyze and evaluate graphs made of vertices and edges that model real world problems.
•Define, use, and differentiate such concepts as Euclidian path, Euclidian circuit, Hamiltonian path, Hamiltonian circuit, and isomorphism.
•Define and use algorithms, such as breadth-first, depth-first, and minimum spanning tree algorithm, the shortest path, and the four color conjecture to solve problems.
•Understand and apply graph coloring to real situations, such as scheduling.
•Find the number of possible ways independent objects from a given set may be Calculate the probability of a given event occurring.
|
|
|
| |
| | |
|
|
