main() { int i=1; while (i<=5) { printf("%d",i); if (i>2) goto here; i++; } } fun() { here: printf("PP"); }

3 Answers   ME,

---

Explain the process of converting a Tree into a Binary Tree.

0 Answers   Ignou,

---

can we access one file to one directory?

1 Answers  

---

Write code for finding depth of tree

2 Answers   Adobe,

---

stripos — Find position of first occurrence of a case- insensitive string int stripos ( char* haystack, char* needle, int offset ) Returns the numeric position of the first occurrence of needle in the haystack string. Note that the needle may be a string of one or more characters. If needle is not found, stripos() will return -1. The function should not make use of any C library function calls.

0 Answers  

---

---

Describe for loop and write a c program to sum the series X + x2/2! + x3 /3! + …….. up to fifteen terms.

2 Answers  

---

Explain b+ tree?

0 Answers  

---

What is the purpose of the statement: strcat (S2, S1)?

0 Answers  

---

WAP to accept first name,middle name & last name of a student display its initials?

5 Answers   AITH, NIIT,

---

Is null valid for pointers to functions?

0 Answers  

---

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

0 Answers   Huawei,

---

Write a c program to print the even numbers followed by odd numbers in an array without using additional array

1 Answers   Tech Mahindra,

---