The new forums will be named Coin Return (based on the most recent vote)! You can check on the status and timeline of the transition to the new forums here.
Please vote in the Forum Structure Poll. Polling will close at 2PM EST on January 21, 2025.
Computer Architecture without Discrete Mathematics (school belly-aching)
Right now I am taking a class about Computer Architecture towards my Computer Science major, but before the class had begun our teacher basically related to us that without taking "Discrete Mathematics for Computing" before this class (it was apparently a pre-req in the past but that has changed) we would be putting ourselves at a GREAT disadvantage.
I am concurrently enrolled in Discrete Mathematics but I'm wondering if there is anything extra I should be doing to avoid a problem. One of the things we are required to be efficient at is binary math, so primarily I would like to know if there are websites/tutorials/programs that can help somebody become more proficient in that area.
The other areas of study in this class include assembly language (for a fictitious RISC machine), layers of abstraction, the relation between hardware and software, logic gates, and probably a few more things I'm neglecting to remember. Are there any general resources for this field of study that would improve my chances at excelling in this course? I do not feel completely lihe class so far but seeing as how we have not gone past the first chapter I'm not exactly confident in my ability to keep up with the entirety of our course.
Thank you for any help or resources you can provide. I know I was a little bit vague so if you want me to clarify any area or provide more materials for you in order to help me just let me know. Thank you and take care.
Mostly what I needed for my Computer Organization class (which is essentially the follow up to Architecture) was Boolean Algebra. Binary should be taught (or at least it was for me) in architecture, and then reiterated in Organization.
Binary arithmetic isn't hard really, just needs getting used to.
Just study up on boolean algebra, ones complement, and twos complement, and how to convert between binary, decimal, and hexadecimal.
I took Computer Architecture at the same time as Discrete Math and don't believe it hurt me much. Of course this comes down to the course plan, but taking it at the same time like you are may give you an advantage, as the courses can help reinforce parts of each other while it's fresh in your mind.
Binary arithmetic isn't bad, it's just a different way of thinking. Remember that you are just working in a different base but the same principles as base 10 still apply. I don't have a recommended tutorial but you may just want to read ahead in your Discrete Math book to see if it covers the topic well.
As for the other topics - I took an EE course because I was a Computer Systems Engineering major, so I already knew more about that stuff (logic gates, etc) than most students in the class. Even without that though, I didn't see anyone else who was a CS major having huge issues with it.
Don't let the professor scare you! As long as you stay focused and do your best I'm sure you'll be fine. They wouldn't have removed it as a pre-req if it was 100% critical (or at least I'd hope not).
Discrete math is about as unrelated to architecture as it gets. I mean, binary arithmetic is very, very related, but that takes about 10 minutes to learn and is completely separate from stuff like big-O notation, structural induction, etc. that you learn in a discrete math course.
I'm going to go ahead and say that you'll be fine. Like, really fine.
Thank you guys so much for the positive reinforcement, it really helps put me at ease. I still plan to be dedicated to my coursework but it helps take an edge off worrying about "if I should drop or not" after hearing you guys relate your experience. It's very appreciated!
And thank you for your offer, clsCorwin, I might have to take you up on it some time! :-)
As others said, you'll have zero disadvantage from never taking the Discrete Maths course, unless you have a very wacky CA class, which from your initial post doesn't seem to be the case.
Depending on how much you're interested in the subject, an excellent resource is Tanenbaum's "Computer Organization". If you have a university library odds are they have a copy and it's a very good and not at difficult read.
Posts
Well, might as well use the space.
Those logic gates are mostly what the boolean algebra for.
Also, feel free to PM me if you have any specific questions later on. I'm no expert, but its still fresh in my mind.
See how many books I've read so far in 2010
Binary arithmetic isn't hard really, just needs getting used to.
Just study up on boolean algebra, ones complement, and twos complement, and how to convert between binary, decimal, and hexadecimal.
See how many books I've read so far in 2010
Binary arithmetic isn't bad, it's just a different way of thinking. Remember that you are just working in a different base but the same principles as base 10 still apply. I don't have a recommended tutorial but you may just want to read ahead in your Discrete Math book to see if it covers the topic well.
As for the other topics - I took an EE course because I was a Computer Systems Engineering major, so I already knew more about that stuff (logic gates, etc) than most students in the class. Even without that though, I didn't see anyone else who was a CS major having huge issues with it.
Don't let the professor scare you! As long as you stay focused and do your best I'm sure you'll be fine. They wouldn't have removed it as a pre-req if it was 100% critical (or at least I'd hope not).
Discrete math is about as unrelated to architecture as it gets. I mean, binary arithmetic is very, very related, but that takes about 10 minutes to learn and is completely separate from stuff like big-O notation, structural induction, etc. that you learn in a discrete math course.
I'm going to go ahead and say that you'll be fine. Like, really fine.
We started with logic, worked into boolean algebra, and into the wide world of induction (regular induction, strong form, and structural) after that.
But yea, what he said, don't worry about it.
See how many books I've read so far in 2010
And thank you for your offer, clsCorwin, I might have to take you up on it some time! :-)
Depending on how much you're interested in the subject, an excellent resource is Tanenbaum's "Computer Organization". If you have a university library odds are they have a copy and it's a very good and not at difficult read.
See how many books I've read so far in 2010
I've never read it, but I've heard about it being used as a textbook, so it may be suitable too.
See how many books I've read so far in 2010