yuren1978

I think the answer of 7 steps comes from the fact that you can reorder the i2 and i3,so reduce a clock wait since i3 is not depending on the i1's result.

I know 0^n1^n is not regular, but how about the Language 0^m1^n .

Which of the following BNF rules is equivalent to P-> Q Q-> P Q| e where is a variable and is any binary operator. A> P-> PP | B> P-> PP| C> P->PP| D> P->P| E> None of the above.

"Programming Language Pragmatics" is what I read. http://www.amazon.com/exec/obidos/ASIN/1558604421/o/qid%3D939955587/sr%3D8-3/002-3385999-6440001

I really don't think it matter, it will never test you detail on a particular language, it only tests your understanding of the concepts.

Thanks, makes sense to me.

One pipe line has four stages, fetch instructions, fetch operands, execute, and write back. Each stage will use one clock, then how many clocks are needed to finish the following codes: R1=R2+R1 R3=R1+1 R5=R2+1. A) Less than 5 B) 5 C) Six, D) Seven, E) More than seven. Thanks for the help.

I think booklet has all the correct answers.

Here is advice ranji posted on another forum, and I hope there is no copywright issue for me to forward it here. Hey guys.. I took the test this Saturday and I think I did kinda ok! I took the test last year too and did abysmally... Well... it's not fair to go into details of questions and topics covered but just a few things.. 1) Spend as much time as you possibly could with "Introduction to Algorithms" and read EVERYTHING! 2) Equally important are your Discrete Math funds... especially GRAPH THEORY. 3) Then comes algo analysis - asymptotic notations.. time and space complexity.. n recurrence relations 4) You're surely gonna end up with a few quesions on Probability.. Expectation, Bayesian probability... n jazz like that... I was never good at this.. I think it's just not meant for me.. I messed up on these questions last year.. I prepared for it this year n still left all of them blank ! 5) Then there's everythign else.. Theory (NP completeness, decidability) and Architecture n OS n Compilers n what not... It's hard to prepare extensively but for starters you shd concentrate on the first three areas I mentioned. Besides, practice problems solving ... " Time is scarcest resource " n if u're a CS graduate .. given unlimited time on the test, why even a couple of extra hours.. you shd be able to score above 800 :) It's just a very perosnal opinion. That's what I inferred from my experience last year... worked on it this year and it helped a lot! Good luck to all of you who'll be taking the test in December or next year or whenever. Ranji

some_username I believe your raw score is 740, and the percentile is 55%, no offense, since I am almost the same with yours.

I attempted all of them, but with a lot of guessing, and I am just not feeling comfortable to leave it blank.

Yes, I also heard that book is very misleading. And honestly, I will definetely review books based on test questions. Sometimes, when you read through a book, you just cannot really concentrate on what is really neaded if you are not sure how those knowledges are tested.

Good job, thanks!!!

http://www.amazon.com/exec/obidos/tg/listmania/list-browse/-/33Z7ZGNA6K54U/102-3420043-5872142