Answer / sandeep

node * reverse(node * list)
{
node *p, *q, *r;
p = list;
q = p->next;
while(q->next != NULL)
{
q = p->next;
r = q->next;
p->next = r;
q->next = p;
p = p->next;
}
q->next = p;
p->next = NULL;
return q`;
}

Answer / mahesh

refer to the page number 456 in ds by sahani

Answer / hasan ali mirza

list reverse(list L)
{
stack S;
position Lpos = first(L);
while(Lpos->element != NULL)
{
push(Lpos->element, S);
Lpos = Lpos->next;
}
makeEmpty(L);
Lpos = first(L);
while(isempty(S) == FALSE)
{
insert(pop(S), Lpos);
Lpos = Lpos->next;
}
return L;
}

Answer / hasan ali mirza

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int preceed(char c);
void push(char c);
char pop();
char stk[30];
int tos=-1;
int main()
{
int i,j=0,n,u,v;
char infix[30],postfix[30],c;
printf("Enter the infix expression:");
scanf("%s",&infix);
n=strlen(infix);
for(i=0;i<n;i++)
{
if((infix[i]>='a'&&infix[i]<='z')||(infix[i]>='A'&&infix[i]<='Z'))
{
postfix[j]=infix[i];
j++;
}
else if(infix[i]=='^'||infix[i]=='*'||infix[i]=='/'||infix[i]=='+'||infix[i]=='-')
{
u=preceed(stk[tos]);
v=preceed(infix[i]);
while(u>=v&&stk[tos]!='(')
{
postfix[j]=pop();
j++;
u=preceed(stk[tos]);
}
push(infix[i]);
}
else if(infix[i]=='(')
{
push(infix[i]);
}
else if(infix[i]==')')
{
c=pop();
while(c!='(')
{
postfix[j]=c;
j++;
c=pop();
}
}
else
{
printf("Equation has error\n");
exit(0);
}
}
while(tos!=-1)
{
postfix[j]=pop();
j++;
}
postfix[j]=='\0';
printf("The equation in postfix:%s",postfix);
}
void push(char c)
{
tos++;
stk[tos]=c;
}
char pop()
{
char val;
val=stk[tos];
tos--;
return(val);
}

int preceed(char c)
{
int v;
switch(c)
{
case '^':v=3;
break;
case '*':
case '/':v=2;
break;
case '+':
case '-':v=1;
break;
default:v=0;
break;
}
return(v);
}

hi........ i am a student of computer science. i want to earn some money on net so that i can help my parents. so please suggest me some sites which give online part time jobs without any registration charges. please help me. i will be very thankful to you. varinder.

1 Answers  

---

explain various object oriented programming fetures

0 Answers  

---

write an algorithm in O(n) time for finding the kth smaalest element form an array of n elements , where n and k are entered by user

0 Answers  

---

THERE iS ANY DEFAULT CONNECTION STRING FOR WINDOWS APPLICATION IN VB.NET2005 FROM WHICH AFTER CHANGING PROJECT DIRECTORY TO OTHER PLACE AND WE DID NOT CHANGE DATABASE PATH INB SQL CONNECTION ?????

0 Answers  

---

need tcs questn papers from 2007 to 2009 plzzzmail to 9015.rama@gmail.com its urgent

0 Answers  

---

If you have two 132KV distance scheme and you are using fibre for comms but the two relays on are not compatible interms of comms what can you use to allow communication between the two relays.

0 Answers   Eskom,

---

i have passed my gRaduation in BCA and now im looking for post graduation from Germany, i haver passed my ielts wth 6 band, nw plz tell me some question that wll ambessay ask

0 Answers  

---

Can you connect Active Directory to other 3rd-party Directory Services? Name a few options.

0 Answers  

---

explain in detail about life cycle of thread

0 Answers  

---

Why Mother Board is called Mother Board & not Father Board?

12 Answers   Microsoft, Precision Infomatic, SoftStream,

---

how many protocols are available and what are they?

0 Answers   IIHT,

---

hello sir,pls fdorward previous group-I exam papers .....

0 Answers   APPSC,

---