Answer / coder_1

Create two pointers, each set to the start of the list.
Update each as follows:

while (pointer1) {
pointer1 = pointer1->next;
pointer2 = pointer2->next; if (pointer2)
pointer2=pointer2->next;
if (pointer1 == pointer2) {
print (\"circular\n\");
}
}

If a list is circular, at some point pointer2 will wrap
around and be either at the item just before pointer1, or
the item before that. Either way, it?s either 1 or 2 jumps
until they meet.

Answer / pratyu

node *ptr1,*ptr2;
ptr1=head;
ptr2=head->next;
while(ptr2)
{
if(ptr1==ptr2)
printf("circular linked list");

ptr2=ptr2->next;
}
printf("not a circular linked list");

Answer / priya

This is the function to check if the linklist is circular:

bool CLinklist::ifcircular()
{
node *ptr1,*ptr2;
ptr1 = front;
ptr2 = front;

while(ptr1)
{
ptr1 = ptr1->link;
ptr2 = ptr2->link;

if(ptr2)
ptr2 = ptr2->link;

if(ptr1 == ptr2)
return 1;
}
}

Answer / shruti

consider home pointer as the starting pointer of the linked
list.
consider temp as the temporary pointer.


temp = home;
while(temp != NULL)
{
if(temp -> next == start)
{
flag = 1;
break;
}
else
flag = 0;
temp = temp -> next;
}

if(flag == 1)
printf("Circular");
else
printf("Not circular");

Answer / nirwal

hi All

specialy the two pointer solution techies


what about the loop in the link list ?

how you differentiate b/w circular list and list having the
loop?

Think again...........

Answer / abhi

while(q->next->next=NULL)
{
p=p->next;
q=q->next->next;
if(p==q)
{
printf("loof is find");
break;
}
}

Answer / shahid khan abbasi

bool hasCircle(List l)
{
Iterator i = l.begin(), j = l.begin();
while (true) {
// increment the iterators, if either is at the end,
you're done, no circle
if (i.hasNext()) i = i.next(); else return false;

// second iterator is travelling twice as fast as first
if (j.hasNext()) j = j.next(); else return false;
if (j.hasNext()) j = j.next(); else return false;

// this should be whatever test shows that the two
// iterators are pointing at the same place
if (i.getObject() == j.getObject()) {
return true;
}
}
}

Answer / burmeselady

start from pointer1
check all node's next pointer is null or not starting from
pointer1 until pointer1
if a node next pointer is null=> it is not circular.
else it is circular

Answer / ishan

by checking whether link field in the last node contains
the address of the first node.

Answer / lohitha

node *ptr1,*ptr2;
ptr1=head;
ptr2=head->next;
while(ptr2)
{
if(ptr1==ptr2)
{
printf("circular linked list");
break;
}
ptr2=ptr2->next;
}
printf("not a circular linked list");

Write a procedure to implement highlight as a blinking operation

2 Answers  

why nlogn is the lower limit of any sort algorithm?

0 Answers  

how to create a 3x3 two dimensional array that will give you the sums on the left and bottom columns

0 Answers  

void main() { static int i=i++, j=j++, k=k++; printf(“i = %d j = %d k = %d”, i, j, k); }

3 Answers  

main() { 41printf("%p",main); }8

1 Answers  

main() { if ((1||0) && (0||1)) { printf("OK I am done."); } else { printf("OK I am gone."); } } a. OK I am done b. OK I am gone c. compile error d. none of the above

5 Answers   HCL,

main() { int i = 257; int *iPtr = &i; printf("%d %d", *((char*)iPtr), *((char*)iPtr+1) ); }

1 Answers   CSC,

main() { char s[ ]="man"; int i; for(i=0;s[ i ];i++) printf("\n%c%c%c%c",s[ i ],*(s+i),*(i+s),i[s]); }

1 Answers   DCE,

main(int argc, char *argv[]) { (main && argc) ? main(argc-1, NULL) : return 0; } a. Runtime error. b. Compile error. Illegal syntax c. Gets into Infinite loop d. None of the above

4 Answers   HCL, LG,

main() { int i=10; void pascal f(int,int,int); f(i++,i++,i++); printf(" %d",i); } void pascal f(integer :i,integer:j,integer :k) { write(i,j,k); }

1 Answers  

Cluster head selection in Wireless Sensor Network using C programming language.

0 Answers  

Write a C program to print ‘Campus Force training’ without using even a single semicolon in the program.

3 Answers   Wipro,