Bissoy.com
Doctors Medicines MCQs Q&A

Which of the following is a correct statement? I. For some programming languages, there are parsing algorithms with an O(3) complexity. II. A recursive programming language can be constructed with static storage allocation. III. In the context of bottom-up parsing, no L-attributed definition can be evaluated. IV. Code-improvement modifications can be carried out at both the intermediate and source code levels.

Which of the following is a correct statement? I. For some programming languages, there are parsing algorithms with an O(3) complexity. II. A recursive programming language can be constructed with static storage allocation. III. In the context of bottom-up parsing, no L-attributed definition can be evaluated. IV. Code-improvement modifications can be carried out at both the intermediate and source code levels. Correct Answer I and IV

In recursion, space is used but recursive calls can’t be calculated by the compiler.

Related Questions

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
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.
Five friends went for a trip where each carried a certain number of apples with them. The number of apples carried by C was 1 less than that by D, which was 5 more than the number of apples carried by E. The total number of apples carried by A and B both was equal to the average number of apples carried by C, D and E. If D carried more apples than B and they together carried 14 apples, which of the following is a possible value of the apples carried by A?
Given below are some famous algorithms and some algorithm design paradigms Algorithms Design Paradigm  1. Dijkstra's shortest path algorithms  (a) Greedy design  2. Floyd-Warshall's all-pair-shortest path algorithms  (b) Divide and conquer  3. Kruskal's minimum spanning tree algorithm  (c) Dynamic programming  4. Merge Sort algorithm     Which of the following correspondence is correct?
For any two languages L1 and L2 such that L1 is context-free and L2 is recursively enumerable but not recursive, which of the following is/are necessarily true? I. L̅1 (complement of L1) is recursive II. L̅2 (complement of L2) is recursive III. L̅1 is context-free IV. L̅1 ∪ L2 is recursively enumerable
A learner in a village in the state of Jharkhand knows her mother tongue and Hindi, the language of home and in her neighbourhood. She learns English in school. Which of the languages come under language acquisition and which of the languages come under language learning? I. Mother tongue and Hindi come under language acquisition II. English comes under language learning III. Hindi comes under language learning IV. All the three languages come under language acquisition
Which of the following statement(s) is/are TRUE? (i) The family of context-free languages are the proper subset of the family of regular languages. (ii) The family of recursive languages is a proper subset of the family of recursively enumerable languages.
Study the accompanying Venn diagram that represents groups of persons speaking five different languages as follows. Oblong circle = Marathi ; Rectangle = Kannada, Circle = English, Triangle = Gujarati, Equilateral quadrangle = Hindi Using above information select the false statement/s from following list. (a) Area c represent persons speaking 5 languages but area d represents persons speaking 4 languages only. (b) Areas b and d represent persons speaking same number of languages. (c) Areas f, b and e represent persons speaking same languages. (d) Areas g and h represent persons who speak two languages only. 
Read the passage carefully and choose thebest answer to each question out of the four alternativesand click the button corresponding to it. To know language is to be able to speak it; even a childwho does not yet attend school can speak his or herlanguage. In order to speak a language it is important tolisten to it and to read a few pages in it everyday. A childpicks up language and learns to talk just as (s)he learnsto walk. Walking and talking comes naturally to a child asit grows. In our country, a child may grow up speakingmore than one language, if these languages are spoken inthe home and in the neighbourhood. we call this multilingualism. A child speaks a language or languagesmuch before (s)he starts going to school. To know alanguage then is first of all to be able to speak it as easilyand naturally as a tree year old child does. Later on thechild will learn to read and write in that language. In orderto read and write in a language, one has to speak it. But itis possible to speak a language but not able to read orwrite in it. A baby does not speak until it is nine monthsold but it understands a few words at six months of age.It has been listening ever since it was born, and even alittle before that. So the first strategy in speaking alanguage is to listen. It is necessary for one to __________ the language before(s)he writes in that language.
Statement : It has been reported by one of the TV channels that the answer papers of Board examination of one State are evaluated by students studying in the same standard with the help of model answers as instructed by the examiners.

Courses of Action :
I. All such examiners should be immediately suspended from their official positions.
II. All such papers evaluated by the students should be immediately confiscated and got evaluated by qualified teachers.
III. The Board should explore possibilities even though they are remote, of getting the answer papers of this examination evaluated by computerised machines.