Which statement is used to traverse a linked list? *node++ next->link next++ nex

Question

Which statement is used to traverse a linked list?

       *node++
       next->link
       next++
       next=next->link

Question 2.2. A struct with a struct pointer is necessary to create a linked list

       True
       False

Question 3.3. The main difference between a stack and a queue is:

       The data structure used to create them
       The way items are pushed
       The way items are popped
       They are exactly the same

Question 4.4. An STL iterator is of type pointer

       True
       False

Question 5.5. Which header file is required to use arrays?

       iostream
       fstream
       vector
       None of the above

Question 6.6. It is possible to create a dynamic array without using pointers.

       True
       False

Question 7.7. Elements can be pushed and popped in the front and back in a deque

       True
       False

Question 8.8. An array must be used in order to create a linked list

       True
       False

Question 9.9. A string array could be used to create a stack

       True
       False

Question 10.10. It takes only one node pointer to delete an element from a linked list

       True
       False

Question 11.11. Vectors can be used without the inclusion of a special header file

       True
       False

Question 12.12. A deque is a __________________

       Sequence container
       Associative container
       Container adapter
       iterator

Which statement is used to traverse a linked list?

       *node++
       next->link
       next++
       next=next->link

Explanation / Answer

1) next = next -> link . because it'll go to next location where either the values are stored or NULL.

2) True. Without nesting a structure, its not possible to create a linked list.

3) The way items are popped because insertion or keeping is same but removing or picking is not same as queue picks last one wheras stack picks first.

4) True. The name itself indicates that it'll traverse or iterate or point to the locations.

5) None of the above but when if need to print the data, iostream should be used.

6) False, dynamically means at runtime, which means it has to be added or removed anywhere in an array.

7) True, as of its fast insertion and deletion.

8) False, Linked list is contrary to an array.

9) True, but if strings are inserted in a stack.

10) True, its possible to delete a node through one node.

11) False, it must use vector header file.

12) Sequence containers.

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.