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;
}

what are the facialities provided by you after the selection of the student.

2172

---

How can you tell whether a program was compiled using c versus c++?

1043

---

Can you mix old-style and new-style function syntax?

1040

---

Write an efficient algo and C code to shuffle a pack of cards.. this one was a feedback process until we came up with one with no extra storage.

1014

---

What is use of #include in c?

1086

---

What are the types of data structures in c?

1079

---

What is const volatile variable in c?

978

---

Explain the use of keyword 'register' with respect to variables.

968

---

How do you sort filenames in a directory?

1122

---

What are void pointers in c?

959

---

What is gets() function?

1070

---

can anyone please tell about the nested interrupts?

2063

---

What does main () mean in c?

1054

---

What is data types?

1017

---

Explain the use of 'auto' keyword

1070

---