Technical Questions

#include "mem.h"

#include "alloc.h"

main()

{

      int area;

      char *dest;

      char src[] = "Life is the camera and you are the target"

                                  "so keep smiling always";

      area = sizeof (src);

      dest = malloc (area);

      memmove (dest, src, area);

      printf("\n%s", dest);

      printf("\n%s",src);

}

Output: 12

Explanation:
Binary value of a=1 is 00001 (in 5 bit)
Binary value of b=3 is 00011 (in 5 bit)
Binary value of c=3 is 000011 (in 6 bit)

In memory it is represented as:
Let address of bit1 is 500 which initialize to char pointer p. Since can is one byte data type so p++ will be 501. *p means content of memory location 501 which is (00001100) and its binary equivalent is 12. Hence output is 12.

A view may be a subset of the database or it may contain virtual data that is derived from the database files but is not explicitly stored .

Placement algorithms determine where in available real-memory to load a program. Common methods are first-fit, next-fit, best-fit. Replacement algorithms are used when memory is full, and one process (or part of a process) needs to be swapped out to accommodate a new program. The replacement algorithm determines which are the partitions to be swapped out.

Routable protocols can work with a router and can be used to build large networks. Non-Routable protocols are designed to work on small, local networks and cannot be used with a router

One way is shorting the two inputs of the NAND gate and passing the input.

truth table:

A B output

1 1 0

0 0 1

The second way is passing the input to only one input (say A) of the NAND gate. Since the other input  (say B is floating, it is always logic one.

Truth table:

A B output

1 1 0 

0 1 1