Logical Tree with its derived basic Thesaurus
001 ACM_ds, Discrete Structures
Discrete structures are foundational material for computer science By foundational we mean that relatively few computer scientists will be working primarily on discrete structures, but that many other areas of computer science require the ability to work with concepts from discrete structures Discrete structures include important material from such areas as set theory, logic, graph theory, and combinatory The notion of formal, mathematical proof is a unifying theme throughout the area.
|
Global Keywords
Functions, Relations, Sets, Basic Logic, Proof techniques, Basics counting, Graphs, Trees, Discrete probability.
|
001001 DS1, Functions, relations, and sets.
Functions, Surjections , Injections, Inverses, Composition, Relations, Reflexivity, Symmetry, Transitivity, Sets, Venn diagrams, Cartesian products, Power sets, Pigeonhole principle, Cardinality, Countability,
001002 DS2, Basic logic
Propositional logic, Logical connectives, Truth tables, Normal forms, Conjunctive, Disjunctive, Validity, Predicate logic, Universal quantification, Existential quantification, Modus ponens, Modus tollens, Predicate logic limitations.
001003 DS3, Proof techniques
Implication Notions, Converse, Inverse, Contra positive, Negation, Contradiction, Formal proofs structure, Direct proofs, Counterexample Proof, Contraposition, Contradiction, Mathematical induction, Strong induction, Recursive, Mathematical definitions, Well orderings.
001004 DS4, Basics of counting
Counting, Arguments, Pigeonhole principle, Permutations, Combinations, Recurrence Relations, Master Theorem.
001005 DS5, Graphs and trees
Trees, Undirected graphs, Directed graphs, Spanning trees, Traversal strategies.
001006 DS6, Discrete probability
Finite space, Finite measure, Events, Conditional probability, Independence, Bayes' rule, Integer, Random variables, Expectation.
|
|
|
E-mail 
