Answer Posted / naresh lingampally

Comparing XP and VISTA

there is visually a change in the Start Menu.

The Security feature is more expertise

later version of Vista came with Windows mail as default
email client.

Write a program in c to replace any vowel in a string with z?

1078

---

Is c language still used?

936

---

Is boolean a datatype in c?

1014

---

How can I open a file so that other programs can update it at the same time?

1134

---

Explain which function in c can be used to append a string to another string?

1039

---

What are the 5 organizational structures?

971

---

How will you print TATA alone from TATA POWER using string copy and concate commands in C?

1327

---

Give a one-line C expression to test whether a number is a power of 2. [No loops allowed - it's a simple test.]

1024

---

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 }

3130

---

What is the incorrect operator form following list(== , <> , >= , <=) and what is the reason for the answer?

1386

---

Explain about the constants which help in debugging?

1313

---

Explain what is wrong with this statement? Myname = ?robin?;

1526

---

List a few unconditional control statement in c.

932

---

Do pointers take up memory?

1086

---

the maximum length of a character constant can be a) 1 character b) 8 characters c) 256 chaacters d) 125 characters

2240

---