Test s for prime or not?


#include<stdio.h>
void main(void)
{
           int no,rem,cnt;
        Printf("enter No");
        scanf("%d",&no);
        cnt=2;
        while(cnt<=no)
       {

              rem=no % cnt;
              if (rem==0)
              {
              printf("No is not prime");
              exit(0);
              }
              cnt++;
        }
          printf("No is Prime");
}

Test plan tree can include several type of tests
Manual test scripts
Win Runner test scripts
Batch of Win Runner test scripts
Visual API test scripts
Load Runner scenario scripts and Vuser scripts

Trapdoor is a secret undocumented entry point into a program used to grant access without normal methods of access authentication. A trap is a software interrupt, usually the result of an error condition.

In a cached system, the base addresses of the last few referenced pages is maintained in registers called the TLB that aids in faster lookup. TLB contains those page-table entries that have been most recently used. Normally, each virtual memory reference causes 2 physical memory accesses-- one to fetch appropriate page-table entry, and one to fetch the desired data. Using TLB in-between, this is reduced to just one physical memory access in cases of TLB-hit.

Document type definition. An optional part of the XML document prolog, as specified by the XML standard. The DTD specifies

constraints on the valid tags and tag sequences that can be in the document. The DTD has a number of shortcomings, however,

and this has led to various schema proposals. For example, the DTD entry says that the XML

element called username contains parsed character data-that is, text alone, with no other structural elements under it. The

DTD includes both the local subset, defined in the current file, and the external subset, which consists of the definitions

contained in external DTD files that are referenced in the local subset using a parameter entity.

In situations like, where the copy on write bit of a page is set and that page is shared by more than one process, the Kernel allocates new page and copies the content to the new page and the other processes retain their references to the old page. After copying the Kernel updates the page table entry with the new page number. Then Kernel decrements the reference count of the old pfdata table entry.

In cases like, where the copy on write bit is set and no processes are sharing the page, the Kernel allows the physical page to be reused by the processes. By doing so, it clears the copy on write bit and disassociates the page from its disk copy (if one exists), because other process may share the disk copy. Then it removes the pfdata table entry from the page-queue as the new copy of the virtual page is not on the swap device. It decrements the swap-use count for the page and if count drops to 0, frees the swap space.