Answer Posted / vikram

No output.Since a float variable is compared with double
constant,condition will not satisfy.
if you don't believe,try your hand on it.

Can a pointer point to null?

578

---

What is the easiest sorting method to use?

626

---

What math functions are available for integers? For floating point?

614

---

What is the difference between declaring a variable by constant keyword and #define ing that variable?

2681

---

stripos — Find position of first occurrence of a case- insensitive string int stripos ( char* haystack, char* needle, int offset ) Returns the numeric position of the first occurrence of needle in the haystack string. Note that the needle may be a string of one or more characters. If needle is not found, stripos() will return -1. The function should not make use of any C library function calls.

1839

---

---

Explain do array subscripts always start with zero?

750

---

Which header file should you include if you are to develop a function which can accept variable number of arguments?

795

---

What is time complexity c?

557

---

What is scanf () in c?

654

---

Write the program with at least two functions to solve the following problem. The members of the board of a small university are considering voting for a pay increase for their 10 faculty members. They are considering a pay increase of 8%. Write a program that will prompt for and accept the current salary for each of the faculty members, then calculate and display their individual pay increases. At the end of the program, print the total faculty payroll before and after the pay increase, and the total pay increase involved.

2641

---

What are the 5 types of organizational structures?

540

---

What language is lisp written in?

606

---

How can type-insensitive macros be created?

689

---

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 }

2703

---

1234554321 1234 4321 123 321 12 21 1 1 12 21 123 321 1234 4321 1234554321

3132

---