Detect cycle in a linked list. A singly-linked data structure is a data structure made up of nodes where each node has a pointer to the next node (or a pointer to null). Suppose that you have a pointer to the first node of a singly-linked list data structure:Determine whether a singly-linked data structure contains a cycle. You may use only two pointers into the list (and no other variables). The running time of your algorithm should be linear in the number of nodes in the data structure.If a singly-linked data structure contains a cycle, determine the first node that participates in the cycle. you may use only a constant number of pointers into the list (and no other variables). The running time of your algorithm should be linear in the number of nodes in the data structure.You may not modify the structure of the linked list.

As root, edit /etc/abs.conf to include your desired repositories: vim /etc/abs.conf. Remove the ! in front of the appropriate repositories, for example: REPOS=(core extra community !testing)

4.Download the Arch Build System(ABS) tree. As root, run:abs. Your ABS tree is now created under /var/abs. The above step is done once for all(run abs from time to time to update the source tree though). Next,

5.say if you want the source code of the Linux command find1)find out which package the command find belongs to: pacman -Qo echo which find. The result is “usr/bin/find is owned by findutils 4.4.2-3”.