MATH211 Applications of Discrete Mathematics for Computer Systems and IT
This course studies problems that involve finite or discrete data sets. Logic and set notation form a foundation for creating structure in data storage and information retrieval. Tools used include truth tables, methods of proof, Venn diagrams , graphs, trees, paths, and matrices. Additional topics include defining formal languages and recognizing syntactically correct sentences. Additional techniques include automata, digraphs, state transition tables and context free grammars.
Corequisite
None