Answer Posted / vignesh1988i

#include<stdio.h>
#include<conio.h>
int string(char *,char);
void main()
{
char str[100],ch;
int c;
printf("enter the string :");
gets(str);
printf("enter the character to be searched :");
scanf("5c",&ch);
c=string(&str[0],ch);
printf("the character %c occurs for %d times ",ch,c);
getch();
}
int string(char *a,char ch)
{
int count=0;
for(int j=0;*a!='\0';j++)
{
if(*a==ch)
{
count++;
*(a++);
}
}
return count;
}

how to build a exercise findig min number of e heap with list imlemented?

1596

---

Is null always equal to 0(zero)?

566

---

What is the use of define in c?

578

---

Write program to remove duplicate in an array?

589

---

Why is c called c?

611

---

---

Explain how do you determine a file’s attributes?

584

---

What is the full form of getch?

562

---

Write the Program to reverse a string using pointers.

604

---

What is the g value paradox?

623

---

You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

2694

---

What is string constants?

648

---

what value is returned to operating system after program execution?

1587

---

What is a function simple definition?

600

---

What is floating point constants?

675

---

Why isnt any of this standardized in c?

624

---