I completed all the math courses listed on the quiz site, but didn't find the highest level I've got, either. Have forgotten most of the contents now though, especially the number theory/abstract algebra.

I didn't recognize the two scientists in the quiz. The second one looks like Newton, but not sure.

My last chemistry lecture took place at least 4 years ago, while I was studying in the department of material engineering in China. Believe it or not, till now I still remember _all_ the elements in the periodic table. The version I memorized has 104 elements. Unfortunately I learnt it in chinese, I can recognize all the symbols like Mn, KMnO4, HClO, HClO2, HClO3, HClO4, NaF, NaBr, CH2OOCH, C6H6... and write out the reaction equations without mistakes but when these things are in _English_ words, I could only guess. Didn't bother to google for such a quiz. (Googling with keywords in Chinese characters is too much trouble) [ February 06, 2005: Message edited by: Ellen Zhao ]

P.S.: Isn't Differential Equations the most challenging level of mathematics listed in the quiz? (Took that course with Dr. Hamburger as the instructor at OSU.)

Isn't Differential Equations the most challenging level of mathematics listed in the quiz? (Took that course with Dr. Hamburger as the instructor at OSU.)

Perhaps it's subjective. Linear algebra for me came after differential equations in college, and I'm fairly sure that's typical for mos curriculums. Maybe the quiz assumes later courses imply more difficult concepts?

Ellen Zhao
Ranch Hand

Joined: Sep 17, 2002
Posts: 581

posted

0

Originally posted by Michael Ernest: Maybe the quiz assumes later courses imply more difficult concepts?

I'm not sure what the "theory and logic" concretely is in the quiz. Generally, discrete math is more difficult than non-discrete. Above linear algebra there's abstract algebra which, normally has contents like set theory, graph theory, number theory...Many fancy encoding algorithms are usually interleaving/non-linear, requires knowledge in abstract algebra to understand and implement. Algebra structure deals with computability and complexicity, which I feel is one of the most difficult parts in computer science. The formalisation of real-world, non-directly-mathematic problems is the task of formal logic. When problems are formalised with formal logic or dynamic logic (formal logic plus time), then the decidedness, completeness, uniqueness and efficiency of the solution can be mathematically proved or examed with things like deduction system. For relatively small-scale software system, good gut feel and experience are enough to keep the entropy low. But for large-scale software system, people had better resort to theoreticans and get some solid mathematical proof/exam on the architecture and algorithms...In fact things like time-prooved design patterns and enterprise architectures are nothing but good encapsulations for algebra structures.

I'm not sure which order of the logic the quiz is intended to exam. Things like truth value table is the most basic in the formal logic thus not that difficult. But when things go further, all the algebra structures like Hoare Calculus, Herbrand Universe, etc, etc are therein, one really needs hard work to get things straight. [ February 16, 2005: Message edited by: Ellen Zhao ]

I'm not sure what the "theory and logic" concretely is in the quiz. Generally, discrete math is more difficult than non-discrete. Above linear algebra there's abstract algebra which, normally has contents like set theory, graph theory, number theory...Many fancy encoding algorithms are usually interleaving/non-linear, requires knowledge in abstract algebra to understand and implement. Algebra structure deals with computability and complexicity, which I feel is one of the most difficult parts in computer science. The formalisation of real-world, non-directly-mathematic problems is the task of formal logic. When problems are formalised with formal logic or dynamic logic (formal logic plus time), then the decidedness, completeness, uniqueness and efficiency of the solution can be mathematically proved or examed with things like deduction system. For relatively small-scale software system, good gut feel and experience are enough to keep the entropy low. But for large-scale software system, people had better resort to theoreticans and get some solid mathematical proof/exam on the architecture and algorithms...In fact things like time-prooved design patterns and enterprise architectures are nothing but good encapsulations for algebra structures.

I'm not sure which order of the logic the quiz is intended to exam. Things like truth value table is the most basic in the formal logic thus not that difficult. But when things go further, all the algebra structures like Hoare Calculus, Herbrand Universe, etc, etc are therein, one really needs hard work to get things straight.

Mm. I'd guess the quiz authors think a true nerd takes linear algrbra, whereas any would-be engineer takes differential equations.