Discrete Structures (Computer Science - Engineering Foundations )
*** Course Description: ***
Propositional and first-order logic; basic proof techniques; graphs, trees; analysis of algorithms; asymptotic analysis; recurrence relations.
*** Course Goals / Objectives: ***
Be competent with using propositional logic
Be familiar with first-order predicate logic
Be familiar with proving by contradiction, by ordinary induction and by strong induction
Be familiar with using asymptotic notation
Be familiar with analyzing running time of simple iterative algorithms
Be familiar with graph theory
Be exposed to analyzing running time of recursive algorithms
Be exposed to sorting and searching
Be exposed to designing graph algorithms
*** Course Topics: ***
Mathematical reasoning
Analysis of simple algorithms
Sorting and searching
Graph theory
Graph algorithms
**** Note: ****
We'll begin by communicating through WhatsApp messages only. After our initial chat or your response on Teacherson, I'll schedule a call as needed.