Comsc 21 new blogsite

I will be posting everything about comsci 21 in a new blogsite: www.trabia-bob.blogspot.com...
Specifications for the 2nd programming assignment are also there.
See you there!

CMSC21 joke

Just got this from e-mail. Ticklish for those who can understand it. :D
The Teacher asked the student to write
"I Will Not Throw Paper Airplanes in the Class"
500 times.

Attention IT1 students

I decided to put all my posts about IT1 in my new blog, "Galbaldia"... Click this link to read the tutorials... :: : : :: : :: www.galbaldia-bob.blogspot.com CHEERS!

Template Walkthrough

If you want to learn how to edit templates, click this link:
http://help.blogger.com/bin/answer.py?answer=751&query=sidebar&topic=&type=f

Start Blogging With Blogger

WHAT's A BLOG
http://www.blogger.com/tour_start.g

BLOGGER BASICS

If you want to start a new blog....
Click on this link to learn how...

http://www.mtroyal.ab.ca/ADC/workshops/_student_tutorials/_assignments/student_blog/index_new.htm#top

COMSC 21 PROGRAMMING ASSIGNMENT 1

To all students of Comsci 21 for 2nd Semester AY' 2005-2006

Here are the details for your first programming assignment:

You are to make a program that emulates a bank account record keeping system.
You will implement this system using an array of records (max : 1000)

Here are the fields of each record in the system:
1. Account Number
2. Last Name
3. First Name
4. Middle Name
5. Date of Birth (Format : mm/dd/yyyy)
6. Cash in Bank (or Balance... Formula : Cash Deposited - Cash Withdrawn)
7. Cash Deposited
8. Cash Withdrawn

Records should be sorted by Account Number (in increasing order)

Here are the functions that your system should offer(They should be the options in your MENU):
1.) Add Record
2.) Delete Record(Account Number);
3.) Edit Record (Account Number);
4.) Display Record (Account Number);
5.) Withdraw (Account Number, Amount);
6.) Deposit (Account Number, Amount);
7.) View All Records

Deadline will be on : March 8, 2006
If you have any questions, just post it in "COMMENTS"

Methods of Proof in Propositional Logic (Part 1)

It's fun to know that Comsc56 (Discrete Mathematics) was assigned to me this semester. I finally have the chance to review and clarify things about logic and stuff. I never knew that I had been missing so much in this subject until I scanned our textbook and saw the title "Propositional Logic" (Sparkle! Sparkle!). For this day, I'll talk about one of the 3 methods that we used to prove that a set of propositions is valid.

This is with the assumption that you already know how to represent propositions correctly in symbols...

Chain of Reasoning:
In this method, you just have to remember your goal and the way in which you can reach your goal. Your goal is to arrive at the conclusion given the set of premises. Simple huh? The question now is how we can achieve that goal (ze difficult part). You need to use the premises and some transformations on the premises which will produce new premises until you form the conclusion. How? By using the rules of logic and the rules of inference. (I shall be discussing them in my next blog) .

Let's look at this argument and prove that it's valid...

If Bert eats the cookie then Martha will make a salad.
If Lara kisses Bert then Bert will eat the cookie
Lara kisses Bert
----------------------------------------------------------
Then Martha will make a salad

The set of premises are separated from the conclusion by the broken line. To prove this argument using the chain of reasoning method, we first have to represent them using symbols.

Let B represent the fact the Bert will eat the cookie
Let L represent the fact the Lara will kiss Bert
and let M represent the fact that Martha will make a salad

By using the symbols and the operations available in propositional logic, the argument can be simplified into the following:
B -> M
L -> B
L
-----------
therefore M

Now, let's use Chain of Reasoning to prove that with the stated facts, Martha is sure to make a salad.
Reason
1. B->M Premise
2. L->B Premise
3. L Premise
4. B Modus Ponens ( 2,3)
5. M Modus Ponens (4,1)
We now reach M which is the conclusion. This will be the end of our proof.

Another possible solution could appear like this:

Reason
1. B->M Premise
2. L->B Premise
3. L Premise
4. L->M Hypothetical Syllogism (Transitivity) (2,1)
5. M Modus Ponens ( 3,4)
End of Proof...


The first three reasons are the premises. Stating them is necessary because the succeeding steps can only be done by manipulating them (using the rules of logic and inference).

The other reasons such as Modus Ponens and Transitivity may sound foreign or vague to you
at present. I shall talk about them in my next blog. See you then :)