Answer Posted / sivaprabhu

main()
{
int a,b,c;
printf("enter the values a,b");
scanf("%d%d",&a,&b);
c=a-(~b)-1;
printf("the sum is %d",c);
}

Why does the call char scanf work?

1170

---

What is the explanation for the dangling pointer in c?

1077

---

Can the sizeof operator be used to tell the size of an array passed to a function?

1074

---

What is the description for syntax errors?

1106

---

What are global variables?

1136

---

What is 1d array in c?

1046

---

I have a varargs function which accepts a float parameter?

1010

---

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 }

3143

---

What is time complexity c?

957

---

what is bit rate & baud rate? plz give wave forms

1926

---

What will be your course of action for a push operation?

1066

---

What is main return c?

945

---

Explain how many levels deep can include files be nested?

1041

---

Are pointers really faster than arrays?

982

---

Explain how do you print an address?

1101

---