C Answers

Arjun wants to count total number of digits of an integer number (N).Help him to generate the programme for the same

There are N coding questions and the score for Ith question must be in the range of 1 to N(inclusive). All the coding questions follow one rule that higher the score higher is difficulty level. Now Tom is trying to assign the score to each question in a sorted difficulty order such that 1st question is of least difficulty level and Nth question is of most difficulty level. And it is also possible that more than one question can have equal score.

Delhi government has issued a circular to control the pollution due to vehicle. It has prohibited the

use of odd numbers registered vehicle on Monday, Wednesday and Friday and not to use even

number registered vehicles on Tuesday, Thursday and Saturday. Sunday they have to use public

transport so no vehicle should be used.A software application is to be developed by Delhi Government which will inform the owner of the

vehicle on which day they can use the vehicle.

 The initial value of the radius of a circle is equal to one unit and each succeeding radius is one unit greater than the value before it. Write a program that computes the area of the circle starting with r = 1.0 to r = 5.0. Print out each radius and the corresponding area of the circle.

Write an algorithm to calculate income tax is annual income is given text as calculate followers

Objective: Write C programs which implement following page replacement policies.

a) First In First Out (FIFO)

b) Least Recently Used (LRU)

To avoid wasting processor time waiting for an active process to become unblocked. The OS will swap

one of the process out of the main memory to make room for a new process or for a process in

Ready- Suspend state. Therefore, the OS must choose which process to replace. Thus, when a page

fault occurs, the OS has to change a page to remove from memory to make room for the page that

must be brought in. If the page to be removed has been modified while in memory it must be written

to disk to bring the disk copy up to date. Replacement algorithms can affect the system's

performance.

 Replace the page that has been in memory longest, is the policy applied by FIFO. Pages from memory are removed in round-robin fashion. Its advantage is it's simplicity.

#include<stdio.h>

void ex_function(int a,int b);

int main()

{

  int n1,n2,r1,r2;

  scanf("%d %d",&n1,&n2);

  ex_function(n1,n2);

  if(n1==r1 && n2==r2)

   printf("True");

  else

   printf("False");

  return 0;

}

void ex_function(int a, int b)

{

  int i,n,r1=0,r2=0,rem;

  for(i=1;a>0;i++){

      rem=a%10;

      r1=r1*10+rem;

      a=a/10;

  }

  for(i=1;b>0;i++){

      rem=b%10;

      r2=r2*10+rem;

      b=b/10;

  }

  printf("%d\n",r1);

  printf("%d\n",r2);

}

Write a C program to find common divisors between two numbers in a given pair.

Write a C program to reverse the digits of a given number and add it to the original, If the sum is not a palindrome repeat this procedure. 

Write a C program to find common divisors between two numbers in a given pair.