Dark Mode

Recent questions tagged runtime-environment

0 votes

1 answer

31

runtime enviornment

arch asked in Compiler Design Nov 7, 2017

by arch

339 views

1 vote

1 answer

32

made easy
main() { int xyz; st1; st2(); f(); g(); h(); st3; ) how many stack entry required?? ans is 2 why??

Mukesh Yadav asked in Compiler Design Oct 25, 2017

by Mukesh Yadav

297 views

0 votes

1 answer

33

UGC NET CSE | December 2009 | Part 2 | Question: 31
In an absolute loading scheme which loader function is accomplished by assembler ? (A) re-allocation (B) allocation (C) linking (D) loading

rishu_darkshadow asked in Operating System Sep 17, 2017

by rishu_darkshadow

2.4k views

2 votes

1 answer

34

please solve this Q
Q. Which of the following parameter is not included in the activation record of recursive function call? 1.Local variables of function 2.Return value of function 3. Global variables of program 4.Access link

kallu singh asked in Compiler Design Sep 5, 2017

4.6k views

3 votes

1 answer

35

Doubt in access link and control link in activation record?
Can anybody explain me access link and control link in activation record?I am confused what is different between them IF POSSIBLE GIVE EXAMPLE ALSO THANKS A LOT

Himanshu Goyal asked in Compiler Design Aug 3, 2017

by Himanshu Goyal

3.5k views

0 votes

1 answer

36

MadeEasy material
How storage mapping is done by compilers ? Even though actual loading of program in memory is done by loader. PS: This is the exact question as given in book, but i think it is memory mapping ?

shashank023 asked in Compiler Design Jun 17, 2017

993 views

3 votes

1 answer

37

Test by Bikram | Mock GATE | Test 4 | Question: 30
Consider the following statements: $S_1$: An increase in the number of page frames allotted to a process always increases the page fault rate in $\text{FIFO}$ page replacement policy, regardless of the page reference sequence $S_2$: It is not ... statements is/are CORRECT? Only $S_1$ Only $S_2$ Both $S_1$ and $S_2$ Neither $S_1$ nor $S_2$

Bikram asked in Operating System May 14, 2017

by Bikram

670 views

4 votes

1 answer

38

Test by Bikram | Mock GATE | Test 4 | Question: 2
Consider the following statements : $S1$: Automatic garbage collection is not essential to implement recursion. $S2$: Operator precedence parser falls under the category of top down parsers. $S3$: To evaluate a postfix expression, an operator stack is required. Which of the ... true ? $S1$ & $S3$ $S1$ & $S2$ $S2$ & $S3$ $S1$ & $S4$

Bikram asked in GATE May 14, 2017

by Bikram

432 views

5 votes

3 answers

39

ISRO2017-70
We use malloc and calloc for: Dynamic memory allocation Static memory allocation Both dynamic memory allocation and static memory allocation None of these

sh!va asked in Programming in C May 7, 2017

by sh!va

7.1k views

5 votes

1 answer

40

Test by Bikram | Mock GATE | Test 2 | Question: 14
Consider the following code snippet. void first(int p, int t) { p += t; t += p; } main() { int p = 4; first(p , p); } What is the final value of $p$ in both call by value and call by reference respectively ? $4$ and $12$ $5$ and $12$ $12$ and $16$ $4$ and $16$

Bikram asked in Compiler Design Jan 24, 2017

by Bikram

498 views

0 votes

1 answer

41

Activation Record
Activation Record can be known at A. Compile Time B. Run Time C. Loading Time D. None of these

Samujjal Das asked in Compiler Design Jan 17, 2017

by Samujjal Das

1.5k views

4 votes

2 answers

42

Test by Bikram | Mock GATE | Test 1 | Question: 11
Consider following recursive functions: function fib(n : integer); integer begin if (n = 0) or (n = 1) then fib = 1 else fib = fib(n-l) + fib(n-2) end The above function is run on a computer with a stack of $x$ ... we can execute this function for maximum value $n = 10$ without overflowing the stack. Then the size of the stack is ______ $Bytes$.

Bikram asked in GATE Jan 16, 2017

by Bikram

1.4k views

8 votes

2 answers

43

Test by Bikram | Mock GATE | Test 1 | Question: 9
Consider the following program fragment : int foo(int ,int ); int a; int ar[4] = { 1,0, 2,3}; main() { a = 0; foo(ar[a], ar[ar[a]]); printf("%d,%d ,%d,%d ", ar[0] , ar[1] ,ar[2] , ar[3]); } foo(int x, int y) { x= x+1; y ... be printed by the program if parameter passed by call by name? $1, 50, 2, 3$ $3, 50, 2, 3$ $3, 50, 3, 4$ $3, 2, 2, 3$

Bikram asked in GATE Jan 16, 2017

by Bikram

1.7k views

2 votes

4 answers

44

Virtual Gate Test Series: Compiler Design - Stack Allocation
Consider the following two statements$:$ $S_{1}:$ Activation records can have a permanent lifetime in case of static allocation. $S_{2}:$ Activation records can have nested lifetime in case of stack allocation. Which of the option is correct regarding $S_{1}$ and $S_{2}$ respectively True, True True, False False, True False, False

ManojK asked in Compiler Design Jan 9, 2017

by ManojK

1.5k views

2 votes

1 answer

45

Static vs Dynamic Links in activation records

rahul sharma 5 asked in Compiler Design Dec 29, 2016

by rahul sharma 5

1.7k views

5 votes

1 answer

46

GATE CSE 1988 | Question: 8i
Consider the procedure declaration: Procedure P (k: integer) where the parameter passing mechanism is call-by-value-result. Is it correct if the call, P (A[i]), where A is an array and i an integer, is implemented as below. create a new local variable, ... P using z for k; set A [i] to z; Explain your answer. If this is incorrect implementation, suggest a correct one.

go_editor asked in Compiler Design Dec 19, 2016

1.7k views

19 votes

1 answer

47

GATE CSE 1988 | Question: 2xv
What is printed by following program, assuming call-by reference method of passing parameters for all variables in the parameter list of procedure P? program Main(inout, output); var a, b:integer; procedure P(x, y, z:integer); begin y:=y+1 z:=x+x end P; begin a:=2; b:=3; p(a+b, a, a); Write(a) end.

go_editor asked in Compiler Design Dec 19, 2016

2.2k views

18 votes

4 answers

48

GATE CSE 1988 | Question: 2xii
Consider the following program skeleton and below figure which shows activation records of procedures involved in the calling sequence. $p \rightarrow s \rightarrow q \rightarrow r \rightarrow q.$Write the access links of the activation records to enable correct access and ... procedure r; begin q end r; begin r end q; procedure s; begin q end s; begin s end p;

go_editor asked in Compiler Design Dec 18, 2016

6.1k views

2 votes

1 answer

49

Compiler-Static Allocation Strategy:No of activation Records Present?
Is it 0 or 1?

KISHALAY DAS asked in Compiler Design Dec 9, 2016

by KISHALAY DAS

430 views

0 votes

1 answer

50

true statement is:
Consider the following statements: S1: When you statically link a file into an executable, the contents of the file are included during link time. S2: When you link dynamically, it is only during run time when a pointer to the file which is linked in is included in the executable and then the contents of said file are loaded. Which of the above statements is/are true?

Akriti sood asked in Compiler Design Dec 8, 2016

438 views

3 votes

1 answer

51

GATE CSE 1989 | Question: 10a
Will recursion work correctly in a language with static allocation of all variables? Explain.

makhdoom ghaya asked in Compiler Design Dec 5, 2016

by makhdoom ghaya

1.3k views

2 votes

4 answers

52

made easy sheet
please expain all four questions.

Shivam Shukla 1 asked in Compiler Design Dec 5, 2016

by Shivam Shukla 1

920 views

5 votes

1 answer

53

GATE CSE 1989 | Question: 8b
Indicate the result of the following program if the language uses (i) static scope rules and (ii) dynamic scope rules. var x, y:integer; procedure A (var z:integer); var x:integer; begin x:=1; B; z:= x end; procedure B; begin x:=x+1 end; begin x:=5; A(y); write (y) ...end.

makhdoom ghaya asked in Compiler Design Dec 3, 2016

by makhdoom ghaya

1.6k views

3 votes

1 answer

54

Test by Bikram | Compiler Design | Test 1 | Question: 22
The language which supports _______ needs heap allocation in the runtime environment. Dynamic Data Structure Static Scoping Global Variable Recursion

Bikram asked in Compiler Design Nov 25, 2016

by Bikram

221 views

4 votes

2 answers

55

GATE CSE 1990 | Question: 11a
What does the following program output? program module (input, output); var a:array [1...5] of integer; i, j: integer; procedure unknown (var b: integer, var c: integer); var i:integer; begin for i := 1 to 5 do a[i] := i; b:= 0; c := 0 for i := 1 to 5 do write (a[i]); ... b := 5; c := 6; end; begin i:=1; j:=3; unknown (a[i], a[j]); for i:=1 to 5 do write (a[i]); end;

makhdoom ghaya asked in Compiler Design Nov 25, 2016

by makhdoom ghaya

1.8k views

17 votes

2 answers

56

GATE CSE 1990 | Question: 4-v
State whether the following statements are TRUE or FALSE with reason: The Link-load-and-go loading scheme required less storage space than the link-and-go loading scheme.

makhdoom ghaya asked in Compiler Design Nov 23, 2016

by makhdoom ghaya

4.3k views

1 vote

1 answer

57

vaishali jhalani asked in Compiler Design Nov 23, 2016

by vaishali jhalani

1.5k views

17 votes

3 answers

58

GATE CSE 1990 | Question: 2-v
Match the pairs in the following questions: ...

makhdoom ghaya asked in Compiler Design Nov 19, 2016

by makhdoom ghaya

8.4k views

1 vote

1 answer

59

Doubt regarding access link
I searched a lot and tried understanding access link in activation record, but didn't get very far. Please explain? Access link points to activation record associated with nearest enclosing scope of program. What does it mean?

thor asked in Compiler Design Nov 17, 2016

by thor

396 views

0 votes

1 answer

60

Compiler and Interpreter

KISHALAY DAS asked in Compiler Design Nov 12, 2016

by KISHALAY DAS

1.3k views

Page:

Recent questions tagged runtime-environment