Lab Question

1
********************String Problem ************************
#include<stdio.h>
#include<conio.h>
char finalvalue[100];
char* orderstring(char orginal[]);
char* casereverse(char value[]);
char* reversestring(char value[]);
int wordcount(char value[]);
int allcharcount(char value[]);
int main()
{
char orginal[100];
gets(orginal);
puts(reversestring(orginal));
//allcharcount(orginal);
//printf("%d",wordcount(orginal));
return 0;
}
//All character Count
int allcharcount(char value[]){
int i,j,k;
int alpa,number,sp;
alpa=0;
number=0;
sp=0;
i=0;
while(value[i]!='0'){

2
if( (value[i]>='a' && value[i]<='z') ||
(value[i]>='A' && value[i]<='Z')){
alpa++;
}
else if(value[i]>='0' && value[i]<='9'){
number++;
}
else{
sp++;
}
i++;
}
printf("alpha=%d number=%d special=%d",alpa,number,sp);
return 0;
}
Input:abc123$
Output:alpha=3 number=2 special=1
//word count
int wordcount(char value[]){
int n,i,j,k;
int count=1;
n=strlen(value);
for(i=0;i<n;i++){
if( value[i]==' ' || value[i]=='n'){
count++;
}

3
}
return count;
}
Input:this is mehedi
Output:3
// String Reverse
char* reversestring(char value[]){
int i,j,k,n;
//char finalvalue[100];
n=strlen(value);
j=0;
for( i=n-1;i>=0;i--){
finalvalue[j]=value[i];
j++;
}
finalvalue[j]='0';
return finalvalue;
}
Input:I love bangladesh
Output:hsedalgnab evol I
//UppertoLower and LowertoUpper Case
char* casereverse(char value[]){
int i;
i=0;
while(value[i]!='0'){
if(value[i]>='a' && value[i]<='z'){
value[i]=value[i]-32;
}

4
else if(value[i]>='A' && value[i]<='Z'){
value[i]=value[i]+32;
}
i++;
}
return value;
}
Input: love
Output: iLOVE
//String Order ascending
char* orderstring(char orginal[]){
int i,j,k,n,temp;
n=strlen(orginal);
for(i=0;i<n-1;i++){
for(j=i+1;j<n;j++){
if(orginal[i]>orginal[j]){
temp=orginal[i];
orginal[i]=orginal[j];
orginal[j]=temp;
}
}
}
return orginal;
}
Input: zyab1
Output: 1abyz
int check_anagram(char a[], char b[])

5
{
int first[26] = {0}, seiond[26] = {0}, i = 0;
// Calculating frequency of characters of first string
while (a[i] != '0')
{
first[a[i]-'a']++;
i++;
}
i = 0;
while (b[i] != '0')
{
seiond[b[i]-'a']++;
i++;
}
// Comparing frequency of characters
for (i = 0; i < 26; i++)
{
if (first[i] != seiond[i])
return 0;
}
return 1;
}
Input: creative reactive
Output: 1

6
******************Number Problem***********************
#include<stdio.h>
#include<conio.h>
int fast_last_position_replace(int a);
int reverse(int n);
int main(){
int i,j,k,p;
printf("Enter the value=");
scanf("%d",&p);
//fast_last_position_replace(p);
//printf("%d",fast_last_position_replace(p));
printf("%d",reverse(p));
return 0;
}
//Number Reverse
int reverse(int n){
int result=0;
int rem;
while(n!=0){
rem=n%10;
result=result*10+n%10;
n/=10;
}
return result;
}
Input: 123456

7
Output: 654321
//First and Last Number Repalace
int fast_last_position_replace(int a){
int x,y,i,j,b,n;
n=1;
b=a;//future use
if(a>0){
y=a%10; //last position
}
while (a!=0){
x=a%10;
if(a>=1 && a<=9){
x=a; //fist digit
}
a=a/10;
n=n*10;
}
n=n/10;
b=(b-y);
b=(b+x);
b=b-(x*n);
b=b+(y*n);
return b;
}
Input:123456
Output:623451
int prime(int n){

8
int i;
if(n<=1) return 0;
for(i=2;i<=n/2;i++){
if(n%i==0) return 0;;
}
return 1;
}
Input:10
Output:0
int factorial(int n){
if(n<=1) return 1;
else return (n*factorial(n-1));
}
Input:4
Output:24
int feb(int n)
{
if (n == 0 || n == 1)
return n;
else
return (feb(n-1) + feb(n-2));
}
Input: 4
Output:0 1 1 4
int gcd(int a,int b){
if(b==0) return a;

9
else return gcd(b,a%b);
}
int perfectnumber(int number){
int i,sum;
sum=0;
for (i = 1; i <= (number - 1); i++)
{
rem = number % i;
if (rem == 0)
{
sum = sum + i;
}
}
return sum;
}
int convertBinaryToDecimal(long long n)
{
int decimalNumber = 0, i = 0, remainder;
while (n!=0)
{
remainder = n%10;
n /= 10;
decimalNumber += remainder*pow(2,i);
i++;
}
return decimalNumber;
}
long long convertDecimalToBinary(int n)

10
{
long long binaryNumber = 0;
int remainder, i = 1, step = 1;
while (n!=0)
{
remainder = n%2;
n /= 2;
binaryNumber += remainder*i;
i *= 10;
}
return binaryNumber;
}
****************Pyramid and Pattern*************
#include <stdio.h>
int pyramidnumber(int n);
int halfpyramid(int n);
int floydstringle(int n){
int main()
{
int n;
printf("Enter the number :");
scanf("%d",&n);
return 0;
}
int pyramidnumber(int n){

11
int num = 1, i, j, k;
for ( i = 1 ; i <= n ; i++ )
{
num = i;
for ( j = 1 ; j<= n-i ; j++ )
printf(" ");
for ( k = 1 ; k <= i ; k++ )
{
printf("%d", num);
num++;
}
num--;
num--;
for ( k = 1 ; k < i ; k++)
{
printf("%d", num);
num--;
}
printf("n");
}
return 0;
}
Input : 5
Output:
1
232
34543
4567654

12
567898765
int halfpyramid(int n){
int i, j;
for(i=1; i<=n; ++i)
{
for(j=1; j<=i; ++j)
{
printf("* ");
}
printf("n");
}
return 0;
}
Input : 5
Output:
*
* *
* * *
* * * *
int floydstring(int n){
int i, j;
for(i=1; i <= n; i++)
{
for(j=1; j <= i; ++j)
{
printf("%d ", i);
}

13
printf("n");
}
return 0;
}
Input : 3
Output:
1
2 2
3 3 3
****************Array example*************
#include <stdio.h>
int max;
int min;
int maxMin(int value[]);
int binarySearch(int value[],int n,int find);
int* reverse_array(int a[],int n)
int main()
{
int value[100],n;
int i;
int *p;
scanf("%d",&n);
printf("Enter the value :n");
for( i=0;i<n;i++){
scanf("%d",&value[i]);
}
p= reverse_array(value,n);

14
for( i=0;i<n;i++){
scanf("%d",*(p+i));
}
}
int binarySearch(int value[],int n,int find){
int first,last,midle,j,k;
first=0;
last=n-1;
midle=(first+last)/2;
while(first<=last){
if(value[midle]>find){
last=midle-1;
}
else if(value[midle]<find){
first=midle+1;
}
else if(value[midle]==find){
return midle+1;
break;
}
midle=(first+last)/2;
}
if(first>last){

15
return -1;
}
return -1;
}
int maxMin(int value[]){
int j;
max=value[0];
min=value[0];
for(j=1;j<5;j++){
if(max<value[j]){
max= value[j];
}
else if( min>value[j]){
min=value[j];
}
}
return 0;
}
long linear_search(long a[], long n, long find) {
long i;
for (i = 0 ;i < n ; i++ ) {
if (a[i] == find)
return i+1;
}
return -1;

16
}
int* reverse_array(int a[],int n) {
int j=0,i;
int final[100];
for (i = n - 1; i>=0; i--)
final[j++] = a[i];
return final;
}
int* marge_sort(int a[],int b[],int m,int n) {
int k=0,i,j, temp;
int sorted[100];
//marge sort
for(i=0;i<m;i++){
sorted[k++]=a[i];
}
for(i=0;i<n;i++){
sorted[k++]=b[i];
}
// Bubble sort
for(i=0;i<m+n;i++){
for(j=i+1;j<m+n;j++){
if(sorted[i]>sorted[j]){
temp=sorted[i];
sorted[i]=sorted[j];
sorted[j]=temp;

17
}
}
return sorted;
}
How many bit difference
Sample input: a=12 b=25
Sample output: 4
#include <stdio.h>
#include <math.h>
int decimalToBinary (int n);
int main ()
{
int a, b, c, d, count, binary;
count = 0;
scanf ("%d", &a);
scanf ("%d", &b);
c = a ^ b;
printf ("decimal value=%dn", c);
binary = decimalToBinary (c);
printf ("binary value=%dn", binary);
while (binary != 0)
{
if (binary % 10 == 1)
{
count++;
}
binary /= 10;
}
printf ("Difference Bit=%dn", count);
return 0;
}
Int decimalToBinary (int n)
{
int binary, i, reminder;
binary = 0;
i = 1;
while (n != 0)
{
reminder = n % 2;
binary += reminder * i;

18
i *= 10;
n /= 2;
}
return binary;
}
select
sales.*
from sales where
ROWNUM<= (select count(*)*(.10) from sales)

Lab Question

More Related Content

Similar to Lab Question (20)

More from Export Promotion Bureau (20)

Recently uploaded (20)

Lab Question