The data structure and the operations of the virtual machine defined by the implementation of Java programming language Select one: A. All of the mentioned B. are implemented by physical devices C. are implemented as software routines D. are implemented as a set of microistructions anda micropogram Clear my choice A referencing operation is defined as an operation with an identifier and a referencing environment as parameters and returns only a Data object as a result, Select one: True False Major storage for ML, LISP and Prolog is a heap. Get storage - allocate(x) free storage - tree(x) Problem: Dangling and garbage are occurred when we use the code O a allocate (x): x=y: free(x) o b. allocate(x): allocate(x) Oca and brespectively Od band a respectively o e none of the mentioned If most of the bindings of a programming language are performed at compilation time then: O a. The language will be more efficient O b. The language will be less efficient c. The language will be more flexible Od. The language will be less flexible .e. a and a Question 19 Not yet answered Based on the following declarations type A: array[1.10 Jot integer, type B: array[1.10]of integer, Var C:A: Marked out of 200 F Flag question Var Z:B; Assuming whole data operations, what is the correct answer O a C-Z is legal according to nome equivalence b. C=2 is an error occording to name equivalence Oc.C=Z is legal, according to structure equivalence da and e band Assuming static scope, the non local referencing environment at statment and statement for the following program segment are Main Var X, Y, Z : real procedure MI( X: real); Var D : real begin Mi call N2 (Y): statement end MI; procedure N2(C: real); Var D B: real begin N2; statement end N2; begin main; cal MICA); end main a. At statement: Main:M:N2: Y Z At Statement MainME N2XYZ b. At statement: Main; MIN2: :2. At statement2 N2;M;X 0.a and b d. At Statamenti: N2: X . At statement: N2 moiniz e. None of the mentioned