Answer Posted / v.haritha

It gives an error message as "NON PORTABLE POINTER CONVERSION"
because a variable of character data type can store only a
single character where as in this case the variable is
initialized with a string.




answered by V.HARITHA undergoing c training yet
to join b.tech.

Why doesnt this code work?

1060

---

Is main a keyword in c?

1136

---

In cryptography, you could often break the algorithm if you know what was the original (plain) text that was encoded into the current ciphertext. This is called the plain text attack. In this simple problem, we illustrate the plain text attack on a simple substitution cipher encryption, where you know each letter has been substituted with a different letter from the alphabet but you don’t know what that letter is. You are given the cipherText as the input string to the function getwordSets(). You know that a plain text "AMMUNITION" occurs somewhere in this cipher text. Now, you have to find out which sets of characters corresponds to the encrypted form of the "AMMUNITION". You can assume that the encryption follows simple substitution only. [Hint: You could use the pattern in the "AMMUNITION" like MM occurring twice together to identify this]

2472

---

Write a program of prime number using recursion.

1089

---

Do you know what are bitwise shift operators in c programming?

1103

---

How can I rethow can I return a sequence of random numbers which dont repeat at all?

1192

---

What is meant by realloc()?

1143

---

What is typeof in c?

1015

---

Are enumerations really portable?

1025

---

Difference between goto, long jmp() and setjmp()?

1180

---

Once I have used freopen, how can I get the original stdout (or stdin) back?

1075

---

What is wrong with this program statement?

1037

---

What does *p++ do?

1023

---

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 }

3187

---

What is data type long in c?

1076

---