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.

Is c compiled or interpreted?

1201

---

What are control structures? What are the different types?

1095

---

Is it possible to initialize a variable at the time it was declared?

1224

---

Explain what are compound statements?

1066

---

What is the function of this pointer?

1350

---

#include show(int t,va_list ptr1) { int a,x,i; a=va_arg(ptr1,int) printf(" %d",a) } display(char) { int x; listptr; va_star(otr,s); n=va_arg(ptr,int); show(x,ptr); } main() { display("hello",4,12,13,14,44); }

1285

---

Q.1 write aprogram to stack using linklist o insert 40 items? Q.2 write a program to implement circular queue with help of linklist?

2136

---

What is character constants?

1190

---

How to delete a node from linked list w/o using collectons?

2786

---

what is the role you expect in software industry?

2154

---

Write a program to display all the prime nos from 1 to 1000000, your code should not take time more than a minute to display all the nos.

2083

---

Explain void pointer?

1053

---

Does * p ++ increment p or what it points to?

1125

---

explain what are actual arguments?

1096

---

What is fflush() function?

1141

---