Urch Forums

# pankaj.chawla

1st Level

104

1. ## 97-99--Nov04

Answer is B since more subroutines means more branches which means more pipiline stalling.
2. ## some twisting questions fellas

ya my mistake. aneways thats great news. thats something to be really proud of :)
3. ## some twisting questions fellas

as i said earlier there can be 0,1.... or n exchanges in first pass. so the number of possibilities is (n+1) from 0 to n. mutliplying every possibility by its probability(rhymes here, huh!) which is 1/(n+1) because every case is equally likely to happen, we get the formula >> 1*1/(n+1) + 2*1/(n+1)....... n*1/(n+1) = (n*(n+1)/2)*1/(n+1) = n/2
4. ## Computer Arithmetic Excess - N representation of floating numbers

take a look at this page>> http://en.wikipedia.org/wiki/One's_complement#Excess-N in general n is added to every number. for example 3(011 in binary) is added to every number in excess-3 notation. so to get the original exponent u hv to subtract 3 from it. for example if the exponent given is 011 it will be equal to 0 giving u 2^0 as the answer in base 2. i read somewhere that it is done to make sure that every exponent is representated as a positive quantity.
5. ## Processes ( Round Robin )

nevermind. its good to share some light moments while doing something so intense :)
6. ## some twisting questions fellas

atlast someone replied :) here is my input >> 12) when calculating probability, u consider all the cases. i mean to say that in the first pass 0 or 1 or 2 or 3..... or n exchanges will take place and all cases are equally likely. so the average number of exchanges in first pass will be 1*1/(n+1) + 2*1/(n+1)....... n*1/(n+1) = (n*(n+1)/2)*1/(n+1) = n/2 so the probability of exchange on first pass will be (n/2)*1/n = 1/2 now i dont know how to generalize it for ith pass but from the answer choices u can eliminate a) and d). the answer cannot be c because probability will decrease with increasing i which is not so in c) so the answer has to be b). even if u dont know how to calculate parobability, u can always make a good guess. probability will always decrease with increasing i so eliminate a) and c). now probability of exchange being 1 on first pass is unlikely while being 1/2 is more probable so the answer has to be b). 10) pavelbuet is correct. u hv to make all the parse trees. 13)pavelbuet is correct. 11) if option d) is n(log n) / log n*log n = n/log n. answer is d otherwise answer is b. pavelbuet d) is not decreasing but its growth rate is less than n. 15)pavelbuet is right. there is something wrong. if question was to find which is correct then the answer would hv been a).
7. ## Processes ( Round Robin )

maybe becoz we dont consider the process to be in the middle of the list of processes. u cannot say that a process's execution time started when it was 3rd or 4th in the list of processes.
8. ## Processes ( Round Robin )

well i think that n*T came from the following logic>> the process needs T sec to complete in the absence of competition. now with n processors in total every process will get 1 instruction executed in n seconds. so total time taken by a process is n*T. in short>> execution time when no competition = T secs when competition, 1 instruction = n secs so total time when competition = n*T secs the above solution considers that the process entered in the queue and it was the last process. smthing like this>> p1 p2 p3 | p1 p2 p3 | p1 p2 p3| p3 entered the queue and it took a total of n*T time to get it executed. if u consider the process as the first one in the queue u will arrive at the answer n*(T-1) + 1. now i dont know which answer to consider as the correct one.
9. ## real questions

can anybody give me a link to it or upload the material somewhere else. i m unable to find the link to it on http://www.gter.net
10. ## real questions

hey pavelbuet plz upload it on rapidshare. megaupload says all download slots are in use. btw u cant see anything or u cant understand what is being displayed. i m asking this becoz i too hv some files which i cant understand.
11. ## question on newton's method

whatever u do it will always involve guesswork and that exactly is what i dont want to do. therefore i want to find a proper method to it.
12. ## question on newton's method

i agree that it has a quadratic convergence but it is not exactly n^2. i mean that quadratic convergence does not imply that in the first iteration accuracy is upto 1 decimal place, in the second upto 4 decimal places and so on. also it depends on the approximate zero that we choose. there has to be a method to it. although in this question i think no other option would fit.
13. ## question on newton's method

Newton Raphson method is used to calculate the square root of 2 using the iteration x(i+1) = (x(i) + 2/x(i))/2 if the intial value x(0) is chosen as 1.5, then the number of iterations needed to get an accuracy of 10^(-14) are (a) 2 (b) 4 © 8 (d) 16 (e) 32 again i dont know the correct answer. plz tell me how to solve this one.
14. ## question

i guess u r right...... my mistake :)
15. ## question

we cannot consider a*(b+c)* since it will violate the above restriction so only one a can appear in the string. if u still dont undertsand take an example suppose if u consider the string "aabcbc" formed from a*(b+c)* it will be followed by an a so it will be invalid. ya i m still an undegrad :)
16. ## question

@pavelbuet sorry for d late reply. i live in hostel and come on weekends so...... for the second part the point is there will be only one 'a' in the string since the only part to consider is (ab*c*) and not a*(b+c)*. so the strings will be like this>> abbb accc abcc abbc
17. ## question

well done pavelbuet. [clap] i think u r right........ i will post more questions and hopefully this forum will be alive again;) one correction to the above answer. the answer to the second part is linearly. in this we only hv to consider the part (ab*c*). now u can choose b's in O(n) ways and then u r left with only one way of choosing c's. hope u got my point.
18. ## question

@pavelbuet how did u do it "informally"?? i am not sure too but i think it can be done using binomial coefficients like this>> let p stand for a* similarly (b+c)*>>q a>>r b*>>s c*>>t then the solution to the first problem should be the solution to p+q+r+s+t = N where 0 0 r = 1 0 0 now we have to find the coefficient of x^n in x*((x^0+x^1+x^2.......+x^(N-1)))^4 which gives us the answer. i dont remember how to calculate the coefficient so any help would be appreciated. i think second one can be solved using this method too........ But the problem is that they are not asking for the exact answer and the method is quite tedious so maybe there is some other way.:hmm:
19. ## question

some activity for this silent forum........ Plz solve these questions>> A regular language is described by the following regular expression>> a*(b+c)*ab*c* The number of strings of length N grows as a function of N (a) linearly (b) quadratic © cubic (d) exponential (e) logarithmic Suppose in the above question we add the restriction that all the a's must come before all the b's and all the b's must come before all the c's, then the number of strings of length N grows as a function of N (a) linearly (b) quadratic © cubic (d) exponential (e) logarithmic By the way i dont know the correct answer to these questions.
20. ## Whats the status of ur prep ?

Hello people!! I hv started preparing for AGRE a bit. For now i m reading cormen and practicing with some questions to acquaint myself with "AGRE type" problems. hope i m on d right path........
21. ## 1570, V-770, M-800, me-elated

@bohemian u can solve them again if u dont remember d answers :) @soporifix i think someone on testmagic posted a scanned pdf version of it. search it. otherwise go to d google group GRE_material. u will find d scanned version there. @dipen01 i solved it after i was comfortable wid barrons. i wont say i was over wid it as i did not know all d words till d end :) its gud if u give d tests after u hv gone thru d barrons wordlists
22. ## 1570, V-770, M-800, me-elated

practice as much as u can is all i can say. do solve big book questions. it is an excellent book. d more u see d new words being used in sentences d better it will be for u. this actually helps in remembering them plus give d powerprep test as many times as u can. sure u can get a gud score in verbal if u r thru wid d barrons. just keep practicing.......... i finished big book in one month solving two sections of quant and two of verbal each day. best of luck.
23. ## 1570, V-770, M-800, me-elated

@bohemian i meant that u shud do it as many times as u can before ur exam. u shudnt stop revising it. i revised 5 of d 50 lists daily before my exams. u can go for 10 also. i was revising d list a day before my test too but i guess that is ur personal choice. if u want to relax before ur exam dont do it.
24. ## 1570, V-770, M-800, me-elated

@yogesh thanx. no tricks here yogesh. maybe it is my personal view but d only way i see it is to keep on revising d list(from barrons ofcourse) until u can do it nomore :)
25. ## 1570, V-770, M-800, me-elated

@Mits83 thanx buddy.
×

• #### Activity

×
• Create New...