Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Which of the following are true?1. A programm...
Start Learning for Free
Which of the following are true?
1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.
2. 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.
3. Recursion in programming languages cannot be implemented with dynamic storage allocation.
4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme
5. Programming 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.
1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.
2. 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.
3. Recursion in programming languages cannot be implemented with dynamic storage allocation.
4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme
5. Programming 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.
- a)2 and 5 only
- b)1,3 and 4 only
- c)1,2 and 5 only
- d)2, 3 and 5 only
Correct answer is option 'D'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Most Upvoted Answer
Which of the following are true?1. A programming language which does n...
To determine which of the given statements are true, let's analyze each statement one by one.
1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.
This statement is true. Static storage allocation is a memory allocation technique in which memory is allocated to variables and data structures during the compile-time. Since the programming language does not permit global variables and nesting of procedures/functions, the compiler can determine the maximum amount of memory required for the program and allocate it statically. Recursion can still be implemented by using the stack, which is a static data structure.
2. Multi-level access link (or display) arrangement is needed to arrange activation records only if the programming language being implemented has nesting of procedures/functions.
This statement is true. Multi-level access link (or display) arrangement is used to keep track of the activation records of nested procedures/functions. It allows accessing variables and parameters from different levels of nesting. If the programming language does not have nesting of procedures/functions, then there is no need for multi-level access link arrangement.
3. Recursion in programming languages cannot be implemented with dynamic storage allocation.
This statement is false. Recursion can be implemented with dynamic storage allocation. Dynamic storage allocation is a memory allocation technique in which memory is allocated and deallocated at runtime. Recursive function calls can create activation records on the stack dynamically as they are called and deallocated when they return, allowing recursion to be implemented.
4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme.
This statement is false. Nesting of procedures/functions and recursion can be implemented without a dynamic heap allocation scheme. As mentioned earlier, recursion can be implemented with dynamic storage allocation on the stack. The stack provides a natural way to manage the activation records of nested procedures/functions.
5. Programming 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.
This statement is true. A stack-based storage allocation scheme for activation records assumes a fixed-size activation record structure. However, if a programming language allows a function to return a function as its result, the size of the activation record may vary depending on the returned function. This requires a more flexible memory allocation scheme, such as heap allocation, to handle the varying sizes of activation records.
In conclusion, the true statements are:
- Statement 2: Multi-level access link (or display) arrangement is needed to arrange activation records only if the programming language being implemented has nesting of procedures/functions.
- Statement 3: Recursion in programming languages cannot be implemented with dynamic storage allocation.
- Statement 5: Programming 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.
1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.
This statement is true. Static storage allocation is a memory allocation technique in which memory is allocated to variables and data structures during the compile-time. Since the programming language does not permit global variables and nesting of procedures/functions, the compiler can determine the maximum amount of memory required for the program and allocate it statically. Recursion can still be implemented by using the stack, which is a static data structure.
2. Multi-level access link (or display) arrangement is needed to arrange activation records only if the programming language being implemented has nesting of procedures/functions.
This statement is true. Multi-level access link (or display) arrangement is used to keep track of the activation records of nested procedures/functions. It allows accessing variables and parameters from different levels of nesting. If the programming language does not have nesting of procedures/functions, then there is no need for multi-level access link arrangement.
3. Recursion in programming languages cannot be implemented with dynamic storage allocation.
This statement is false. Recursion can be implemented with dynamic storage allocation. Dynamic storage allocation is a memory allocation technique in which memory is allocated and deallocated at runtime. Recursive function calls can create activation records on the stack dynamically as they are called and deallocated when they return, allowing recursion to be implemented.
4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme.
This statement is false. Nesting of procedures/functions and recursion can be implemented without a dynamic heap allocation scheme. As mentioned earlier, recursion can be implemented with dynamic storage allocation on the stack. The stack provides a natural way to manage the activation records of nested procedures/functions.
5. Programming 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.
This statement is true. A stack-based storage allocation scheme for activation records assumes a fixed-size activation record structure. However, if a programming language allows a function to return a function as its result, the size of the activation record may vary depending on the returned function. This requires a more flexible memory allocation scheme, such as heap allocation, to handle the varying sizes of activation records.
In conclusion, the true statements are:
- Statement 2: Multi-level access link (or display) arrangement is needed to arrange activation records only if the programming language being implemented has nesting of procedures/functions.
- Statement 3: Recursion in programming languages cannot be implemented with dynamic storage allocation.
- Statement 5: Programming 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.
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Top Courses for Computer Science Engineering (CSE)View all
Which of the following are true?1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.2. 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.3. Recursion in programming languages cannot be implemented with dynamic storage allocation.4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme5. Programming 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.a)2 and 5 onlyb)1,3 and 4 onlyc)1,2 and 5 onlyd)2, 3 and 5 onlyCorrect answer is option 'D'. Can you explain this answer?
Question Description
Which of the following are true?1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.2. 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.3. Recursion in programming languages cannot be implemented with dynamic storage allocation.4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme5. Programming 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.a)2 and 5 onlyb)1,3 and 4 onlyc)1,2 and 5 onlyd)2, 3 and 5 onlyCorrect answer is option 'D'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Which of the following are true?1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.2. 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.3. Recursion in programming languages cannot be implemented with dynamic storage allocation.4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme5. Programming 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.a)2 and 5 onlyb)1,3 and 4 onlyc)1,2 and 5 onlyd)2, 3 and 5 onlyCorrect answer is option 'D'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which of the following are true?1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.2. 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.3. Recursion in programming languages cannot be implemented with dynamic storage allocation.4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme5. Programming 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.a)2 and 5 onlyb)1,3 and 4 onlyc)1,2 and 5 onlyd)2, 3 and 5 onlyCorrect answer is option 'D'. Can you explain this answer?.
Which of the following are true?1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.2. 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.3. Recursion in programming languages cannot be implemented with dynamic storage allocation.4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme5. Programming 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.a)2 and 5 onlyb)1,3 and 4 onlyc)1,2 and 5 onlyd)2, 3 and 5 onlyCorrect answer is option 'D'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Which of the following are true?1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.2. 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.3. Recursion in programming languages cannot be implemented with dynamic storage allocation.4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme5. Programming 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.a)2 and 5 onlyb)1,3 and 4 onlyc)1,2 and 5 onlyd)2, 3 and 5 onlyCorrect answer is option 'D'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which of the following are true?1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.2. 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.3. Recursion in programming languages cannot be implemented with dynamic storage allocation.4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme5. Programming 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.a)2 and 5 onlyb)1,3 and 4 onlyc)1,2 and 5 onlyd)2, 3 and 5 onlyCorrect answer is option 'D'. Can you explain this answer?.
Solutions for Which of the following are true?1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.2. 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.3. Recursion in programming languages cannot be implemented with dynamic storage allocation.4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme5. Programming 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.a)2 and 5 onlyb)1,3 and 4 onlyc)1,2 and 5 onlyd)2, 3 and 5 onlyCorrect answer is option 'D'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Which of the following are true?1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.2. 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.3. Recursion in programming languages cannot be implemented with dynamic storage allocation.4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme5. Programming 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.a)2 and 5 onlyb)1,3 and 4 onlyc)1,2 and 5 onlyd)2, 3 and 5 onlyCorrect answer is option 'D'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Which of the following are true?1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.2. 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.3. Recursion in programming languages cannot be implemented with dynamic storage allocation.4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme5. Programming 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.a)2 and 5 onlyb)1,3 and 4 onlyc)1,2 and 5 onlyd)2, 3 and 5 onlyCorrect answer is option 'D'. Can you explain this answer?, a detailed solution for Which of the following are true?1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.2. 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.3. Recursion in programming languages cannot be implemented with dynamic storage allocation.4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme5. Programming 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.a)2 and 5 onlyb)1,3 and 4 onlyc)1,2 and 5 onlyd)2, 3 and 5 onlyCorrect answer is option 'D'. Can you explain this answer? has been provided alongside types of Which of the following are true?1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.2. 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.3. Recursion in programming languages cannot be implemented with dynamic storage allocation.4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme5. Programming 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.a)2 and 5 onlyb)1,3 and 4 onlyc)1,2 and 5 onlyd)2, 3 and 5 onlyCorrect answer is option 'D'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Which of the following are true?1. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation.2. 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.3. Recursion in programming languages cannot be implemented with dynamic storage allocation.4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme5. Programming 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.a)2 and 5 onlyb)1,3 and 4 onlyc)1,2 and 5 onlyd)2, 3 and 5 onlyCorrect answer is option 'D'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
Follow Us
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup