A set is a collection of distinct objects considered as a whole. [Wikipedia – http://en.wikipedia.org/wiki/Set ] A set can be thought of as a collection of objects – or elements – and these objects can be anything, data – numerical – or indeed other sets. Elements in a set are in no particular order, and […]
Read MorePropositional and Predicate Logic
A Proposition is a declarative sentence, which may be shown to be either true, or false, whether the statement is true or false is not – however – relevant. Both “1+2-=3” and “1+2=4” are example of propositions. Predicate logic allows us to explore the truthfulness of a statement, it has an expressive power which propositional […]
Read MoreCombinatorics
Combinatorics is a branch of mathematics concerned with the study of finite objects, and has many applications in the field of Computer Science. Combinatorics is useful in problem solving, and is most often involves ideas such as counting elements in a set, or calculating permutations or combinations of elements in a set.
Read MoreAlgorithms & Time Complexity
Rosen describes an algorithm as: “An algorithm is a finite set of precise instructions for performing a computation or for solving a problem.” An algorithm can be expressed in a number of different ways however, it could be explained in plain English, written in a generic pseudocode (not a true programming language in itself, but […]
Read More