Answer Posted / ravi

add 32 bit part of each number first and and then other
32 bit part use the carry register as well in the process

i want to know the procedure of qualcomm for getting a job through offcampus

1919

---

What is pragma c?

601

---

What is nested structure?

562

---

Explain what would happen to x in this expression: x += 15; (assuming the value of x is 5)

798

---

Hi how many types of software editions are there and their difference (like home editions, enterprise, standard etc) can u please help me

1448

---

---

Calculate the weighted average of a list of n numbers using the formula xavg = f1x1+f2x2+ ….+ fnxn where the f’s are fractional weighting factors, i.e., 0<=fi<1, and f1+f2+….+fn = 1

3636

---

What is bin sh c?

569

---

What is dynamic dispatch in c++?

546

---

a number whose only prime factors are 2,3,5, and 7 is call humble number,,write a program to find and display the nth element in this sequence.. sample input : 2,3,4,11,12,13, and 100.. sample output : the 2nd humble number is 2,the 3rd humble number is 3,the 4th humble number is ,the 11th humble number is 12, the 12th humble number is 14, the 13th humble number is 15, the 100th humble number is 450.

4528

---

Explain what is wrong with this program statement? Void = 10;

754

---

the process of defining something in terms of itself is called (or) in C it is possible for the functions to call themselves. A function called a) nested function b) void function c) recursive function d) indifinite function

748

---

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 }

2701

---

What is the hardest programming language?

657

---

Explain how can I pad a string to a known length?

634

---

The performance of an operation in several steps with each step using the output of the preceding step a) recursion b) search c) call by value d) call by reference

663

---