--%>

Manipulating the kernel objects

How the handle useful in manipulating the kernel objects?

E

Expert

Verified

Whenever you call a function which accepts a kernel object handle like an argument, you pass the value returned through one of the Create* functions. Internally, the function looks into your process’s handle table to obtain the address of the kernel object you desire to manipulate and then manipulates the object’s data structure in a well-defined manner.

   Related Questions in Science

  • Q : Difference between program & operating

    Difference between program & operating system process: The process may be called the active state of a program. It also gives the status of given task mentioned in that particular program, it provides the info

  • Q : Need of the concept of process Need of

    Need of the concept of process: Processes are inert. We know that process is fundamentally the active state of a program which is the set of instruction intended to execute some specific job. Preceding to execution, the instructions should be converte

  • Q : Examples of parasitism Write down some

    Write down some examples of the parasitism.

  • Q : Describing the term mutualism What do

    What do you mean by the term mutualism?

  • Q : Prgramming problem on Pseudocode Write

    Write a program that input from user, the number of hrs worked and hours pay rate for staff and output their total pay. The program must process an arbitrary number of staff the user will terminate input by entering 0 for hours worked and rate of pay. Employ a class c

  • Q : What is Assembler Assembler : An

    Assembler: An assembler is a program which takes fundamental computer instructions and transforms them into a pattern of bits which the computer's processor can utilize to execute its fundamental operations. Some people state such instructions assembl

  • Q : Advantages winCE compared to GPOS

    Normal 0 false false

  • Q : To recognize VXVM version Normal 0

    Normal 0 false false

  • Q : Define Greedy Best-First Search Greedy

    Greedy Best-First Search: It uses a heuristic that attempts to predict how close the end of a path is to the goal state, so that paths which are judged to be closer to the state are explored first.

  • Q : Disadvantages of Layered Model

    Disadvantages of Layered Model: Layered model of data communication is less efficient as compared to Monolithic model of data communication. The layered module requires a frequent switching betwee