Question 1
How many pointers are needed to build a linked list in a backward manner?
a. one
b. two
c. three
d. four

Question 2
Every node (except of the last node) in a singly linked list contains ____.
a. the address of the previous node
b. the address of the next node
c. no address information
d. the next node

Question 3
The length of a linked list is the number of nodes in the list.

Question 4
In a doubly linked list, item insertion requires updating four pointers in certain nodes.

Question 5
Linked lists allow you to overcome the size limitations of an array data type.

Question 6
In a linked list, the address of the first node in the list is stored in a separate location, called the ____ or first.
a. pointer
b. top
c. front
d. head

Question 7
Which of the following is a basic operation on singly linked lists?
a. Make a copy of the linked list
b. Determine whether the list is full
c. Swap the head and the last nodes
d. Retrieve the data of an arbitrary node

Question 8
Each node of a singly linked list has two components: ____ and ____.
a. info; head
b. link; back
c. back; head
d. info; link

Question 9
Building a linked list forward requires exactly two pointers.

Question 10
Every node in a doubly linked list has two pointers: ____ and ____.
a. current; next
b. previous; next
c. back; next
d. previous; current

Question 11
Memory for the components of an array does not need to be contiguous.

Question 12
Data can be organized and processed sequentially using an array, called a(n) ____ list.
a. ascending
b. ordered
c. sequential
d. linked

Question 13
What is the purpose of the following code?

current = head;

while (current != NULL)
//Process current
current = current->link;

a. Insertion of a node
b. Traversal of a linked list
c. Selection of a node
d. Creation of a new list

Question 14
Suppose that the pointer head points to the first node in the list, and the link of the last node is NULL. The first node of the linked list contains the address of the ____ node.
a. tail
b. second
c. first
d. head

Question 15
To insert an item into a linked list, the address in each node must be changed.

Question 16
When you build a linked list in the backward manner, a new node is always inserted at the end of the linked list.

Question 17
You can use the pointer head of a linked list to traverse the list.

Question 18
In a linked list, if a new item is always inserted in the beginning or in the end of the list and the data we read is unsorted, the linked list will be unsorted.

Question 19
The statement p->link = p->link->link; removes a node from the linked list and deallocates the memory.

Question 20
In a doubly linked list, the function search returns true if searchItem is found in the list.

now what do you whant ??
do you need to check the answers or what!

I think if you expect us to look at your homework, you should explain how your got to your answers.

Many of these questions are a bit vague and deliberately ambiguous , e.g. question 4.
Since there are only two points per node, you only update two pointers.

Anyway, you have at >5 wrong. So do some work and write some linked list so you understand this.

It looks like you're trying to get us to solve your homework for you. If you have specific questions about the theory or mechanics behind any one question, I'll be happy to help. I'm not going to solve specific homework problems for you.

I was just looking for someone to check my homework for me. I just wanted to know which answers were wrong so that I could correct them. I am actually having a lot of trouble with programming codes and questions. I cannot understand my teacher and everyone in class is always busy so I am trying to find help from here. I just want someone to check my homework. I don't know if I have questions because I don't know what's right or wrong.I do not need anyone to do my homework for me, I would just like some guidance.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.