Practicing DFSA and Regular expressions

Practicing DFSA and Regular expressions

After going to the tutorials on the last week, I finally got how to simplify a DFSA down to a few basic states and find out its regular expression.

Let’s Devise a DFSA that accepts the language of strings over {0,1} with even number of both 0 and 1s. From the DFSA, let’s devise the regular expression that denotes the same language.

The DFSA would probably look like this:

The final regular expression would be: R*+(SQ*T)*

Hard but Interesting

So, the problem that was bothering me these weeks was there were no practice questions for this course. But I was lucky enough to get hold of some past exercises from last year's student. Hopefully it can help me get back on track

The contents we are learning in class are getting harder and harder. But in my perspective, it's getting gradually interesting and useful as it goes. 

take the Divide and Conquer method as an example. On Wednesdays' class, Heap showed us how after using the divide & conquer method,the efficiency exponentially increases as the data space increase. 

That was actually very interesting! Back in high school computer science, or even in CSC108, efficiency was introduced to me as must learns. I had to memorize sorts' efficiencies and their graphs. 

Such as something like this, comparing the efficiency between quick sort, insertion sort and bubble sort.

Those were really confusing for me at the time, until Heap taught us step by step how to make a algorithm more efficient using the unwinding and divide & conquer. 

I started to understand now, that the reason I'm learning this: learning how to logical steps to make better programs.

Can't wait for next week.

Deeply concerned

It has been a while since I created this slog, It was not until yesterday that I found out I have to post things every week, OOPS.

Hope this post will make up to the previous ones I have missed.
Let's start before the midterm. As hard to accept it is, second year is way more tough than first year. Not only I get a quiz every week from almost all my classes, midterms, assignments are also hitting me hard in my tight schedule.
236 at the beginning was still easy to understand, complete induction, mathematical induction etc are still very similar from what I learnt in 165. However, I let my guards down. well ordering and structural induction was really hard to understand.
And the most irritating thing I found was, it was hard to catch up only by reading lecture notes and going to tutorials. What I hope the professor provides, are problem sets. so I can practice more of my proofing skills.
However I did not find any, and as I was doing the midterm which worth 20% of my final. I felt depressed, in deep doubt whether I will pass this course. and the result was not surprising, i failed.
So I'm really really curious, is there any way, that I can take to catch up?
Please advice.

Robert

Hello World
Hello CSC236 SLOG