If we have extra time, I have practice problems from previous exams
Logic and Proofs are the theoretical foundation of the course which teaches you how to derive additional information from some given information. Thoroughly understanding the proofing techniques is incredibly important because you will be using these techniques throughout the rest of the course.
Sets are unordered collections of distinct objects, which have their own unique properties and laws. An example of a set is Z, the set of all integers. Another example is the set V of all vowels, V = {a, e, i, o, u}. You will learn about set operations, functions which map from sets to sets, and you will use sets when doing proofs.
Functions are mappings from inputs to outputs, from set A to set B. Functions also have their own properties and sub-topics, such as correspondences and composition. For example, think about the function f(x) = x^2 + 1 which maps from Z->Z+, from the set of all integers to the set of all positive integers.
In contrast to the unordered sets, sequences are ordered structures. Take for example the sequence 0, 1, 1, 2, 3, 5, 8, ... , the well known Fibonacci sequence, where each number is the sum of the two preceding numbers (given first is 0 and second is 1). Summations are the addition of terms over a sequence, and these have handy applications to algorithm analysis.
Combinatorics, pronounced (com-bin-a-tor-icks), is the study of arranging objects. You'll learn about how many ways you can arrange a number of objects in ordered or unordered arrangements of objects. For example, how many bit strings can be made from a sequence of 8 bits?
Probability centers around the likelihood of a certain event happening given a set of conditions. You'll learn about finite probability, probabilities of compliments and unions of events, conditional probabilities, dependent vs. independent events, and much more.
the study of relationships between elements of sets.