Explain the meaning of the terms garbage collection, fragmentation, relocation and compaction.
-
Garbage Collection:
- Garbage collection is a memory management technique used in programming languages, particularly in languages with automatic memory allocation and deallocation mechanisms (e.g., Java, C#, Python).
- It refers to the process of automatically reclaiming memory that is no longer in use by the program.
- Garbage collection identifies and deallocates memory blocks that are no longer reachable or referenced by the _______ __________ _____ ________ _________ ___ ___ __________ __________ ___ ____ _______.
______ ____ ________ _____ ________.
______ __________ ______ __________ ________ ____ _________ ________.
_______ ____ __________ ________ ___ ____ ___ ___ ________.
__________ _________ ___ ___ ____ _______ ___ __________.
_________ _______ _____ ________ _______ ____ _____ __________ _________ _____.
_____ ____ _______ ________ _________ _________.
_________ ________ ___ ________ ____ _________ ___ _________ ___ ___ ___.
____ ___ _____ __________ _______ ___ ________.
_________ ______ __________ __________ __________ __________ ____ ________ ___ __________ __________.
_______ ___ _______ _______ _________ ______ _____ ______ _______ _________ _____.
____ __________ ____ ____ _________ __________ __________ ___.
_______ _______ ________ ___ ______ _______ ________.
______ _________ ____ ____ __________ __________ ____ _______ ______.
_______ ____ ____ _______ ______ ____ ____ _________ ______ _____ _______ ________.
__________ _____ ___ _____ _______ ______ ______ __________.
_________ _________ ______ _______ ___ __________ ______ ___ _________ _____.
______ _________ _____ _____ _______ _______.
________ ____ ____ __________ _____ _______ _______.
_____ ________ __________ ___ ____ ____ _____ ___ ___.
__________ ____ ________ _________ __________ ________.
______ ___ ______ ________ _______ ____.
____ ___ _____ _________ ___ ________.
____ _______ __________ ________ _____ _______ __________ __________ ___ ________.
___ ________ ______ _____ __________ ____ ___ _____ _______ ___.
__________ _________ ________ ___ ___ __________.
_________ __________ _____ _____ _______ ___ ________ ___ _________.
_____ _______ ________ _________ ______ ______ _________ ___ __________ _____ ____.
__________ _______ _______ ___ ____ _____ _____ __________.
__________ ____ ______ _______ ____.
__________ ________ ____ ______ ______ _____ ________ ____ _________ _______ ________ _________.
__________ _______ ____ _________ ________ __________ ____ ______ ____ _____.
____ _______ _____ _____ __________ ___.
_____ _______ _______ _________ __________ _______ ______ ___ ________.
_______ _____ _________ ________ _____ _____.
_____ ___ _________ _________ __________ _______ __________ _______ _____.
________ _____ ____ ____ ___ _______.
____ _________ _________ _____ _________ _________ ______ ________ _________ __________ ________.
________ ___ __________ __________.
Get Full Answer on WhatsApp
Suppose you wish to solve the equation for x. Rearrange this equation to get an appropriate fixed point iteration method. Then write a program to get an approximate value of the root of the equation. The initial guess must be entered by the user. Your programme must be able to flag a warning message if the initial guess is too far from the exact root. In that case, your program must be able to suggest an initial guess to the user. Terminate the program and print the current value of the root as soon as the difference between two successive approximations becomes smaller than 0.005
Explain how will you read a three-dimensional array using for loops.
How is an external variable defined? How is it initialised? What happens when an external variable definition does not include the assignment of an initial value?
Explain the use of the functions getchar(), putchar(), gets() and puts() functions, with a suitable program
What does the following C function compute? Discover.
int some fun(int n)
{
if(n%2 == 0)
return 2;
int d, s = sqrt(n);
2
for(d = 3; d <= s; d = d+2)
if(n%d == 0)
return d;
return n;
}
Define a structure of type hms containing three integer members, called hour, minute and second, respectively. Then define a union containing two members, each a structure of type hms. Call the union members local and home, respectively. Declare a pointer variable called time that points to this union.
A C program contains the following statements:
char u, v = ‘A’;
char *pu, *pv = &v;
*pv = v+1;
u = *pv + 1;
pu = &u;
Suppose each character occupies one byte of memory. If the value assigned to u is stored in (hexadecimal) address F8C and the value assigned to v is stored in the address F8D, then
i) What value is represented by &v?
ii) What value is assigned to pv?
iii) What value is represented by *pv?
iv) What value is assigned to u?
v) What value is represented by &u?
vi) What value is assigned to pu?