Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Explain Garbage collection
In this method two passes are made over the memory to identify new areas. In the first pass it traverses all pointers pointing to allocated areas and marks the memory areas which are in use. The second pass finds out all unmarked areas and declares them to be free. The garbage collection overheads are not incremental. They are acquired every time the system runs out of free memory to allocate to new requests. Two major approaches to reuse free memory area in a heap are:
First-fit: Allocate the first hole which is big enough. Searching can start either at the starting of the set of holes or where the previous first-fit search ended. Searching is stopped when a free hole is found that is large enough
Best-fit: Allocate the smallest hole which is big enough; whole list is searched, unless ordered by size. This strategy generates the smallest leftover hole.
How to pass data from list to report? ABAP/4 gives three ways of passing data: ---Passing data automatically using system fields ---Using statements in the program to tak
Q. Types of messages? The messages can be of many types. A specific field of all messages may be reserved to signify message type. The message passing primitives are like thi
A macro definition consists of ? Ans. A macro Definition have: A macro prototype statement, one or various model statements and also Macro pre-processor statements
Disc shapes and diameters: A Mini-CD is 8 centimeters in diameter. The digital data on a CD start at the center of the disc and proceeds toward the edge, whi
The logic circuit given below, converts a binary code y 1 y 2 y 3 into Ans. Gray code is X1 = Y1, X2 = Y1 XOR Y2 , X3 = Y1 XOR Y2 XOR Y3 For
Recombination: Therefore during the selection and mating process then the GA repeatedly lines up pairs of individuals for reproduction. Hence the next question is how to gener
Q. Code Density and Smaller Faster Programs? Memory was very expensive in older computer. So there was a need of less memory utilization, which is it was cost effective to have
what is asymptotic notation
Give a suitable algorithm of non-repudiation in designing e-cash based system. The algorithm of non-repudiation in designing e-cash based system is as illustrated below: Ke
The 16 keys (4x4 matrixes) keypads diagram is shown in figure 4 above. Let see how the keypad is connected. Each square of the alphanumeric has to be pushed to make a switch or con
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd