Answer Posted / jaroosh

The above method is working of course, but is not the most
efficient. Other methods are however quite complex and not
so easy to explain.
Anyway, to exemplify this aforementioned method, maybe not
the most efficient code, but off the top of my head, hope
there are no misspellings.

bool isCyclic(LinkedNode *list)
{
if(list == NULL || list->next == NULL) return false;
LinkedNode *node1 = list, *node2 = node1->next;
while(node1 != node2)
{
if(node1==NULL || node2==NULL || node2->next == NULL)
return false;
node1 = node1->next;
node2= node2->next->next;
}
return true;
}

NOTE: the assumption is that for noncyclic list, the last
node has next pointer set to NULL.

Explain the advantages of using macro in c language?

1052

---

What is a void pointer in c?

1158

---

Explain is it better to bitshift a value than to multiply by 2?

1252

---

What is anagram in c?

984

---

Explain pointers in c programming?

1161

---

What is pointer to pointer in c language?

1213

---

What are the types of data types and explain?

1137

---

What is the data segment that is followed by c?

1142

---

What is the difference between exit() and _exit() function?

1104

---

Is c object oriented?

1020

---

Explain what is the benefit of using const for declaring constants?

1092

---

What does calloc stand for?

1248

---

How old is c programming language?

1065

---

What is the use of volatile?

1152

---

What is s in c?

1099

---