Answer Posted / praveen vinny

/*
What if I want to print the sum of two numbers inside a
string without using a semicolon
*/

#include<iostream.h>
void main()
{
int a,b;
if(cout<<"Please enter two numbers : ")
if(cin>>a>>b)
if(cout<<"Sum = "<<(a+b))
}

The number of measuring units from an arbitarary starting point in a record,area,or control block to some other point a) recording pointer b) offset c) branching d) none

1307

---

Is return a keyword in c?

1147

---

How do you view the path?

1182

---

Why do some versions of toupper act strangely if given an upper-case letter?

1114

---

What are the advantages of external class?

1122

---

What does malloc () calloc () realloc () free () do?

1104

---

Why structure is used in c?

1238

---

what are bit fields? What is the use of bit fields in a structure declaration?

2200

---

Write a factorial program using C.

1120

---

program to find error in linklist.(i.e find whether any node point wrongly to previous nodes instead of next node)

2146

---

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 }

3237

---

Is main is user defined function?

1210

---

How to throw some light on the b tree?

1153

---

How to compare array with pointer in c?

1167

---

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

1249

---