amathur

Hey people, whilr registering for the agre subject test we gave the name of 4 institutions to report the score to. And were given the option of reporting both subject and genral gre scores. But at no point was the registeration/confirmation number/ any other detail for the genral gre was taken. My question is can i assume that both my genral and subject gre test scores will be mailed to all of these 4 institutions ?? Or what should i do now ? Thanks Abhi

ya bilash is right on most counts, the wuestions were really conceptual and required thorough grasp of the theory. In one of the DFS questions i thought 2 options were correct. Most of the choices were very close And the study guide by criis was veryyyy helpful, should have spent more time on it.

I need an answer to the following questions, pls reply fast as time is running out for the 12 nov test thanks 6. Which of the following does not help in writing programs for pipelined architectures: A. Unrolling short loops B. Writing short code segments with lot of subroutines C. Using registers as far as possible. D. Using direct/immediate modes of access E. Fixed-length integer instructions 8. In a packet delivery system, a packet is retransmitted when lost, till it is successfully transmitted. If the probability of loss is C, and retransmissions are independent, what is the expected number of unsuccessful transmission before a successful transmission: 11. Policy 1: Allocate a file on disk contiguously Policy 2: Allocate a file on arbitrary blocks on disk Which of the following is/are the advantage of Policy 1: I. It is good for reading large files sequentially II. Files are easily expandable in this method III. Random access is faster in this method 15. In an AVL tree with 1000 nodes, path length is the length of a path from root to a leaf node. a) at least one path has path length >100. b) all paths have path length >100. c) no path has path length >100. d) cannot be determined from the above info. 17. For an ambigous grammar, the compiler writer can either (approach 1) use a non-ambigous version of the same grammar, or (approach 2) retain the ambigous grammar, but resolve the ambiguity by introducing precedence and associative of operators. Why would he sometimes prefer approach 2 to approach 1? I. an ambigous grammar can produce at most two derivations II. ambiguous grammars being smaller, they result in shorter code III. ambigous grammars reduce parsing time by avoiding chain reduction

ya thats correct but can u give some explanation for it . Thnx

logic question

another problem is that most common implementations of a bst do not contain the parent field.

no the answer i have is a , but it may not be correct so please post the explanation also.

Question On Processor Architecture

@bilash, got it thanks, i guess with option c the numbers are 6 and -6 then. Abt question 221, i cant understand it at all???

what if it doesnt havea right tree?

This appears to be a very common topic on agre, so bettetr to be sure of the answer. Suppose you have a pointer to one of the nodes of a binary search tre, what is the order of finding the next highest node . I.e if a binary search treee consists of integers , and u have pointer to the node contaning 5, what is the order of finding the next biggest number , and the mechanism.

why cant the two integers be 12 and -12 , then option e fits