This is a review guide for an upcoming test, please answer these questions as be

Question

This is a review guide for an upcoming test, please answer these questions as best as possible. Thank you! It should be related to C language!

1. T     /      F   One benefit of arrays over linked list ADTs is that inserting and deleting items is much quicker O( 1 ) with an array vs. the linked list notation of O ( n ).

2. T     /      F   There is no restriction on the size of a linked list.

3. T     /      F Stacks and Queues are not considered an ADT linear data structure

4. T     /      F It is easy to tell if an ADT is a stack, queue or linear linked list by looking at the structure of it.

5. The two stack operations are ________________ (putting items on the stack) and _______________ (when you take items off the stack).

6. The two queue operations are _______________ (putting items in the queue) and ________________ (when you remove items from the queue).

7. LIFO is used to describe _________________ operations.

8. FIFO is used to describe _________________ operations.

9. “Bag” ADT operations include
            a) check for a full bag
            b) check for duplicates in the bag
            c) intersection
            d) none of the above

10. Bank teller waiting lines, ticket windows in ski areas, entrances from rides at an amusement park would all be examples of a _______________________ .

Explanation / Answer

10.

Bank teller waiting lines, ticket windows in ski areas, entrances from rides at an amusement park would all be examples of a FIFO

8.

FIFO is used to describe First In First Out operations.

7.

LIFO is used to describe Last in first out operations.

6.

The two queue operations are enqueue (putting items in the queue) and dequeue (when you remove items from the queue).

5.

The two stack operations are PUSH (putting items on the stack) and POP (when you take items off the stack).

4. T / F It is easy to tell if an ADT is a stack, queue or linear linked list by looking at the structure of it.

False

3. T / F Stacks and Queues are not considered an ADT linear data structure

false

2. T / F There is no restriction on the size of a linked list.

false

1. T / F One benefit of arrays over linked list ADTs is that inserting and deleting items is much quicker O( 1 ) with an array vs. the linked list notation of O ( n ).

false

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

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