November 2nd

This week we continued to learn about algorithm analysis and really got in to the definitions of Big- O(upper bound), and big-Omega (lower bound).We also learned how to prove if a function of Big O and Big Omega.

The importance of this week was understanding the concept of time complexity and growth rate of functions.  With this understanding, proving whether functions are Big-O, Big-Omega, or Big-Theta(growth in-between big-Omega and Big-O).

This understanding is important in understanding how the speed in an algorithm is essential in concise programming.


October 26

Proofs, proofs, and proofs!!!!!  The main focus recently has been all about the structure of proofs and thinking about how to prove a statement logically.  The way of thinking it takes to solve proofs is all about asking the right questions about the problem.   I have been grasping the material so far and the quizzes in tutorials have been pretty simple.  I am working on the next assignment right now and so far I haven't seen anything that I don't understand.  I just have to keep studying like I have been and I'll continue to do well in the class.

October 13

HAPPY THANKSGIVING!!!

This week in csc165 we had our first test!  I was not too worried about the test as it primarily focused on the logic we have been learning through the first part of the year. I feel like I did okay on the test and may have let my nervousness get to me a bit.  I will do better on the next one though!

In our lecture we focused on the structure of proofs and how to go about proving logic statements with proofs.  I have always HATED proofs. Because they are very tedious and long. But I found that the structure of the proofs we are doing are pretty nice and easy.  They have a formula that takes away the tediousness of knowing where to start the proof.  The formula is to "assume" your universal variables and existential variables. Then 'let' your existential variable be something, then use 'then' statements to conclude your proof.  By the time I got to the tutorial I had the grasp of these proofs down.

The next step I have to take is to really study how to figure out where to look in the symbolic sentences for the logical way to actually prove the sentence.

See you next week!

-Caleb


October 5

This week was a very interesting week if you are lucky enough to be a student of CSC165! We learned about implication, (more) disjunction, mixed quantifiers, and of course proofs! This week was also fun because we also had our first assignment to work on. A1 was basically a review of everything we have learned prior to this week, so it was nice to refresh our knowledge, especially because our midterm is coming up.

But let's discuss this week!  So far this class has been moving at a nice pace.  I understand everything pretty well so far and that was shown by the tutorial where I had the right ideas on how to answer the questions.  The hardest part of this week was definitely proofs because of the steps it takes to really get from one end of an equation to another.  I was at first a little scared to see proofs involving sign notation, but it wasn't bad at all.  In fact, the rules in the course text made it really easy to get from one end of the notation to the other.  I am now going to review everything we have learned for the midterm on monday.

See you next week!

-CS


September 27

This week in the lecture we continued learning the language of math!  We worked on conjunction, disjunction, implication, and negation.  I am starting to really grasp this language.  The best way for me to understand it, is to really think about how logical the symbols are.  For example, when using the (and) symbol, you have to think about if (and) would make sense in a given statement.  You couldn't say, there exists an X in C where P and Q are true,  if set P and Q don't overlap, in this case you would use (or).  To really get the hang of this language, I've been practicing writing statements that will get me to really ingrain this in to my mind.

In the tutorial this week, we continued practicing and reviewing the (and), (or), (not), and other symbols.  The tutorial questions were tough for me before the tutorial, but the TA did a great job explaining how to really use the symbols.
Ex. For question 1A) I thought the answer was originally:

(There exists)X(in)C, (not)P(X, csc108)
but I soon realized that if "There is NO prerequisite for CSC108" the no means that for every x, there is no prerequisite.  So I should've used (for all).

(For all)X(in)C, (not)P(X, csc108)

I thought this week was challenging to a degree but I have really grasped the material, and I can't wait to see the last of the symbolic notation next week!

First Slog Post!

I am very excited to really learn this material!

I went in to the first lecture not really knowing what to expect out of this class.  I was thinking that this would either be a really easy math class or a really hard computer science class with math.  It looks like it's going to be challenging but also really informative! I like how the instructor really interacts with the students during the lecture.  I am striving for a double major in computer science and drama, and I really love the small, intimate classes that the drama program offers.  I wish the lectures were smaller, but because the instructor engages with us, it makes the class feel a lot like a seminar.  I also really enjoy how my lecture is three hours long, but acts like three one - hour lectures with breaks in between.  It compacts all the learning and yet feels very spread out.  I hope the instructor continues to teach them in this way because the breaks in between allow me to speak with a friend about the material and then get ready for the new stuff.

The first lecture was very basic and I didn't really take any information away from it that I already knew, but it was the second lecture that got me thinking and also excited.  The main thing that challenged me and also got me really focused were implications! I was struggling at first with the idea of P > Q, but then after some of the examples it really clicked.  Some of my favorite ones were:

" If you eat your vegetables, then you can have dessert." Where P is eat your vegetables, which then means you have Q; your dessert!

"If you think I'm lying, then you're a liar!" P is "you think I'm lying." Q is "you're a liar."

These are the main points I newly discovered from the lecture and I can't wait to see what the next lectures have in store!

I also recently had my first tutorial and I thought it was a little messy at first.  They gave us the wrong room but as soon as we entered the right room, the tutorial got good!  I like the setup of working on the tutorial exercise, going over the exercise, and then taking a short quiz that uses material similar to the exercise. I hope they continue with this format because it is exactly what a tutorial should be.

This is Caleb, signing out!