Answer Posted / ajay george

void rev(node *nPtr, node *prevPtr)
{
if(nPtr->next==NULL)
{
head=nPtr;
}
else
{
rev(nPtr->next, nPtr);
}
nPtr->next=prevPtr;
prevPtr->next=NULL;
}

Given a spherical surface, write bump-mapping procedure to generate the bumpy surface of an orange

2858

---

how to test pierrot divisor

2256

---

In a gymnastic competition, scoring is based on the average of all scores given by the judges excluding the maximum and minimum scores. Let the user input the number of judges, after that, input the scores from the judges. Output the average score. Note: In case, more than two judges give the same score and it happens that score is the maximum or minimum then just eliminate two scores. For example, if the number of judges is 5 and all of them give 10 points each. Then the maximum and minimum score is 10. So the computation would be 10+10+10, this time. The output should be 10 because 30/3 is 10.

2380

---

What is the match merge ? compare data step match merge with proc sql merge - how many types are there ? data step vs proc sql

2405

---

why nlogn is the lower limit of any sort algorithm?

2373

---

---

Write a Program in 'C' To Insert a Unique Number Only. (Hint: Just Like a Primary Key Numbers In Database.) Please Some One Suggest Me a Better Solution for This question ??

1770

---

#include int main(void) { int a=4, b=2; a=b<>2 ; printf("%d",a); return 0; }

1067

---

What is full form of PEPSI

1865

---

How to palindrom string in c language?

8836

---

write a c program to input initial & final time in the format hh:mm and find the time intervel between them? Ex inputs are initial 06:30 final 00:05 and 23:22 final 22.30

2219

---

Design an implement of the inputs functions for event mode

2957

---

3) Int Matrix of certain size was given, We had few valu= es in it like this. =97=97=97=97=97=97=97=97=97=97=97 1 = | 4 | | 5 | &= nbsp; | 45 =97=97=97=97=97=97=97=97=97=97=97 &n= bsp; | 3 | 3 | 5 | = | 4 =97=97=97=97=97=97=97=97=97=97=97 34 |&nbs= p; 3 | 3 | | 12 | &= nbsp; =97=97=97=97=97=97=97=97=97=97=97 3 | &nbs= p; | 3 | 4 | = | 3 =97=97=97=97=97=97=97=97=97=97=97 3 | = ; | | | = ; 3 | =97=97=97=97=97=97=97=97=97=97=97 &= nbsp; | | 4 | = ; | 4 | 3 We w= ere supposed to move back all the spaces in it at the end. Note: = If implemented this prog using recursion, would get higher preference.

3317

---

Write a routine to implement the polymarker function

4375

---

How do you verify if the two sentences/phrases input is an anagram using predefined functions in string.h and by using arrays?

2019

---

why do you use macros? Explain a situation where you had to incorporate macros in your proc report? use a simple instream data example with code ?

2258

---