Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

1. The actual value of NULL is Select one: a. -1 b. 0 c. 99999 d. -99 2. There i

ID: 3685248 • Letter: 1

Question

1.

The actual value of NULL is Select one: a. -1 b. 0 c. 99999 d. -99

2.

There is no need for error checking when popping a stack.

Select one:

True

False

3.

Select one:

a. You have a syntax error.

b. You get a complete and identical copy of list2 into list1.

c. list1 and lsit2 now name the same list.

d. no problem

4.

A linked list is not fixed in size.

Select one:

True

False

5.

If you want to declare a node type struct and typedef a pointer type for that node, in which order must you make these declarations?

Select one:

a. First the node pointer, then the node, since the node has a pointer in it.

b. first the node, then the typedef

c. It doesn't matter which order you do them in.

d. You cannot do both of them in the same program.

6.

The last node in a linked list as defined in the text should always point back to the head of the list.

Select one:

True

False

7.

If you have a node pointer named head, which is pointing to a valid node, how do you access the member variable in the node named item?

Select one:

a. head.item

b. *head.item

c. (*head).item

d. head->item

e. All of these

f. head.item or *head.item

g. (*head).item or head->item

8.

The discipline for a stack is

Select one:

a. .data first inserted is the data first out.

b. for a misbehaving stack, 30 lashes.

c. data last inserted is the data first out.

d. depends on the application of the stack.

9.

Most applications that use a stack will store a struct or class object on the stack.

Select one:

True

False

10.

f you need to access the last element of a linked list with N nodes in it, how many comparisons do you need to make to find the last element?

Select one:

a. 0

b. 1

c. N-1

d. N

Explanation / Answer

1.The actual value of NULL is unknown.

2.false.while poping the stack there is need for error checking for wther there are any elements are not

3.list1 and lsit2 now name the same list.

4.true.linked list follows dynamic memory storage allocatin