Answer Posted / abdur rab

struct node {
int data;
struct node* next;
};

int mid_element ( struct node* _node )
{
struct node* cur_ptr;
struct node* cur_next_ptr;

if ( NULL == _node ) return ( -1 );
else {
cur_ptr = _node;
cur_next_ptr = _node;
while ( ( NULL != cur_ptr -> next )
&& ( NULL != cur_next_ptr -
> next )
&& ( NULL != cur_next_ptr -
> next -> next ) )
{
cur_ptr = cur_ptr -> next;
cur_next_ptr = cur_next_ptr ->
next -> next;
}
}

return ( cur_ptr -> data );
}

write a sorting prgm to sort 50 nos and sum them and also remove all the occurrences of 15 and print it?

2181

---

What is use of integral promotions in c?

1207

---

Why double pointer is used in c?

1087

---

How do you list a file’s date and time?

1108

---

What is the use of c language in real life?

1070

---

is it possible to create your own header files?

1163

---

What is return type in c?

1189

---

what is a constant pointer in C

1245

---

Explain setjmp()?

1116

---

why return type of main is not necessary in linux

2150

---

Write a program to swap two numbers without using the third variable?

1116

---

What is storage class?

1122

---

Why do we use pointer to pointer in c?

1135

---

What is volatile variable in c with example?

1089

---

Lists the benefits of c programming language?

1202

---