A circularly linked list:
a. Is the same as any other linked list.
b. Has no end, as the list value of the last value in the list points to the record number of the first value in the list.
c. Is connected to the empty list.
d. b and c.
b. Has no end, as the list value of the last value in the list points to the record number of the first value in the list.
Computer Science & Information Technology
You might also like to view...
Describe an application of replicated data items in which serializability is not needed.
What will be an ideal response?
Computer Science & Information Technology
Outline the procedure for profiling a C/C++ program in LINUX and UNIX.
What will be an ideal response?
Computer Science & Information Technology