Computer Science Mojo

~ David's Notes on coding, software and computer science

Tag: Discrete Math

Graph Basics

Category: Algorithm     Tag: Algorithm   Discrete Math  
By: David     On: Mon 29 May 2017      Pageviews: 0
Some basic concept on graphs

Continue reading »

How to classify and compare algorithm asymptotic runtimes

Category: Algorithm     Tag: Algorithm   Discrete Math   Runtime  
By: David     On: Fri 11 September 2015      Pageviews: 22
Asymptotic runtimes can be classified to help with comparison and understanding. There are also some tricky examples that can't be classified at first sight, but will require simple mathematical transformations.

Continue reading »

What are the types of Proofs methods, Rules of inference, Propositional equivalence

Category: Math     Tag: Discrete Math   Proofs  
By: David     On: Sat 05 September 2015      Pageviews: 8
Confusing terminology aside, this is a summary of the most important stuff needed for doing proof problems in Discrete Mathematics

Continue reading »

What are the diffrent ways of saying proposition p → q

Category: Math     Tag: Discrete Math  
By: David     On: Sat 29 August 2015      Pageviews: 7
The simple statement p → q in discrete mathematics gets confusing when put into English. Here is a table of the common ways of saying p → q:

Continue reading »