Answer Posted / ashwini

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


struct node mid_element(struct node* head)//since we pass addr
{
int count=0,n_count,i=0;
struct node* temp,*mid;
temp=mid=head;
while(temp -> ptr != NULL)
{
count++;
temp = temp->otr;
}
count++;

if(count % 2)
{
n_count = (count/2)+1;
for(i=0 ; i<n_count ; i++)
mid = mid -> ptr;
}

return mid;
}

How can you draw circles in C?

1198

---

Was 2000 a leap year?

1093

---

Write a factorial program using C.

1123

---

What is the use of pointers in C?

1137

---

What are the types of data types and explain?

1138

---

Is fortran still used in 2018?

1099

---

shorting algorithmS

2315

---

write a program to print data of 5 five students with structures?

2093

---

show how link list can be used to repersent the following polynomial i) 5x+2

2403

---

How can you call a function, given its name as a string?

1210

---

When should structures be passed by values or by references?

1087

---

Why we write conio h in c?

1082

---

What is the advantage of a random access file?

1259

---

What is main return c?

1050

---

Explain what are the different data types in c?

1271

---