DESIGN AND IMPLEMENTATION OF PROGRAMMING LANGUAGES

just need the answer a or b or c or d or e just

Question 22: Random selection operation of a component is implemented efficiently if the storage representation of the data object is sequential. a) True. b) False. 00101 11110110 01010140 1010101 Question 23 : Dynamic data types are implemented using a heap based on the operations: Get storage - allocate(x) free storage - free(x) Problem: Dangling and garbage are occurred when we use the code: a) allocate (x); x=y; free(x). b) allocate (x); allocate(x). c) a and b respectively. d) b and a respectively. e) none of the mentioned. Question 24 : A referencing operation is defined as an operation with an identifier and a referencing environment as parameters and returns a data object or a code of a subprogram. a) True. b) False. OD 1010 11110110 0101010 1010