Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Which of the following are true? (i) A programming language option does not permit global variables of any king and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation (ii) Multi-level access link (or display) arrangement is needed to arrange activation records-only if the programming language being implemented has nesting of procedures/function (iii) Recursion in programming languages cannot be implemented with dynamic storage allocation (iv) Nesting of procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records (v) Languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation records.
Which of the following statements are CORRECT? 1) Static allocation of all data areas by a compiler makes it impossible to implement recursion. 2) Automatic garbage collection is essential to implement recursion 3) Dynamic allocation of activation records is essential to implement recursion 4) Both heap and stack are essential to implement recursion
Which of the following properties of the recursive function is/are correct? A. Recursion helps to create a shortcode B. Recursion is effective where terms are generated successively to compute a value C. Recursion is not useful for branching processes
Which of the following is/are approach(es) adopted by social scientists in understanding sociology? I. Comparative Approach II. Functionalist Approach III. Historical Approach IV. Statistical Approach
Which of the following statements are TRUE? I There exist parsing algorithms for some programming languages hose complex are less than θ(n 3) II A programming language which allows recursion can be implemented with static storage allocation III No L-attributed definition can be evaluated in the framework of bottom-up parsing IV Code improving transformations can be performed at both source language and intermediate code level
The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds.
Consider a computer network using the distance vector routing algorithm in its network layer. The partial topology of the network is as shown below. The objective is to find the shortest-cost path from the router R to routers P and Q. Assume that R does not initially know the shortest routes to P and Q. Assume that R has three neighbouring routers denoted as X, Y, and Z. During one iteration, R measures its distance to its neighbours X, Y, and Z as 3, 2, and 5, respectively. Router R gets routing vectors from its neighbours that indicate that the distance to router P from routers X, Y, and Z are 7, 6, and 5, respectively. The routing vector also indicates that the distance to router Q from routers X, Y, and Z are 4, 6, and 8, respectively. Which of the following statement(s) is/are correct with respect to the new routing table of R, after updation during this iteration ? 
Is there a difference between iteration and recursion?
Iteration requires more system memory than recursion.
Which two approaches are good in communication messages to the community?
1. Participatory Approach
2. Training and Visit Approach
3. Commodity Specialised Approach
4. Direct approach by the community
Select the correct answer