Write a C procram to G.C.D. of two no. using recursion.
#include<stdio.h> #include<conio.h> int gcd(int,int); main() { int a,b,temp,result; printf("\n Enter two numbers"); scanf("%d %d",&a,&b); if(a<b) { temp=a; a=b; b=temp; } result=gcd(a,b); printf("\n The G.C.D=%d",result); getch(); } int gcd(int x,int y) { int rev; rev=x%y; if(rev==0) return(y); else y=gcd(y,rev); }
Output:
Write a C- Program To Determine If The Given String Is A Palindrome Or Not.
What is linear searching?
Explain the concept of frequency reuse in cellular systems.
Write a C program to find factorial(using recursion) of any no.
Write a C program to find the multiplication table of any no.
Short Notes :Lines of Code (LOC)
Convert the Regular Expression 
into e-NFA and then corresponding DFA.
Write a C program to print pattern below:
*
* *
* * *
* * * *
