Answer / rekha

"memmove" can safely handle the situation where the source
string overlaps the destination string

an example
ptr = memmove( s1, s2, N );

"memmove" copies exactly N characters from the string "s2"
into the area of memory pointed to by "s1". Unlike the
function "strncpy", "memmove" does not check for the
terminating '\0' of string "s2"; it simply copies N
characters. It does not put a terminating '\0' on the end of
string "s1".

Why does notstrcat(string, "!");Work?

0 Answers  

---

int main() { unsigned char a = 0; do { printf("%d=%c\n",a,a); a++; }while(a!=0); return 0; } can anyone please explain me output????

1 Answers  

---

what is the difference between c and java?

1 Answers  

---

main() { printf(5+"Vidyarthi Computers"); }

6 Answers  

---

write a program for egyptian fractions in c?

1 Answers   Satyam,

---

---

Given a single Linked list with lakhs of nodes and length unknown how do you optimally delete the nth element from the list?

1 Answers   Oracle,

---

Is c a great language, or what?

0 Answers  

---

how can i sort numbers from ascending order and descending order using turbo c..

1 Answers  

---

program to find the ASCII value of a number

8 Answers  

---

Write a function expand(s1,s2) that expands shorthand notations like a-z in the string s1 into the equivalent complete list abc...xyz in s2 . Allow for letters of either case and digits, and be prepared to handle cases like a-b-c and a-z0-9 and -a-z. z-a:zyx......ba -1-6-:-123456- 1-9-1:123456789987654321 a-R-L:a-R...L a-b-c:abbc

0 Answers  

---

Read N characters in to an array . Use functions to do all problems and pass the address of array to function. 1. Print only the alphabets . If in upper case print in lower case vice versa.

1 Answers  

---

how to calculate the time complexity of a given algorithm? pls give exaples..mainly for the coplexities such as O(log n),O(n log n)...

1 Answers   Infosys,

---