Catalog Search
> Engineering/Engineering Technology
> 16.501
Note: This course is not available for the current semester.
Course No: 16.501; Last Offered: No Data;
Course Description
A comprehensive course addressing the diversity of discrete algebraic systems needed in digital system synthesis and analysis. Logic Sets and Functions. Introduction to algorithms including recursive algorithms, integers, elementary matrix theory. Mathematical reasoning and proofs, proof by induction. Basics of counting, combinatorics, generalized permutations and combinations, elements of discrete probability. Recurrence relations and solution of recurrence relations, generating functions. Relations and their properties, equivalence relations, partial and total orderings. Graph theory, Euler and Hamilton graphs and paths, shortest path algorithm, planar graphs. Trees, spanning trees and minimum spanning trees, binary trees.
Prerequisites & Notes
- Prerequisites:
- Special Notes:
- Credits: 3;
Questions About This Course?
Contact the Advising Center at 978-934-2474 or
Continuing_Education@uml.edu
Use the Back button in your browser to go back to search results.