Programming Fundamentals Java Review

(T/F) An iterator does not abstract the process of scanning through a collection of objects

F

(T/F) ListIterator is a java iterator, which is used to iterate many elements at a time from a list implemented object.

F

(T/F) A container of an abstract data structure that supports element access through iterators. An iterator abstracts the process of scanning through a collection of elements. begin(): end() An iterator behaves like a pointer to an element *p ++p

T

(T/F) A doubly linked list is a linked days structure that consists a set of sequentially linked records called nodes

T

Assuming the Stack is not empty, POP() Means: a.) Remove the top element from the stack b.) Insert an element from the top of the stack c.) Return the number of elements in stack d.) Remove the last element in stack

a.)

A queue is a container of elements that are inserted and removed according to the _____________. a.) FOFI b.) FIFO c.) FOFI d.) OFIF

b.)

A stack is a container of object that are inserted and removed according to the _____________. a.) FIFO b.) LIFO c.) LILO d.) LIOF

b.)

What is contiguous memory allocation? a.) When vector allocates memory dynamically its called contiguous memory allocation. b.) Implementation of lists can be array-based, this is known as contiguous memory allocation. c.)Implementation of queues can be array-based, this is known as contiguous memory allocation. d.)None of the above

b.)

In Stack, Push (e) Means: a.) Remove the top element b.) Return e from the stack c.) Insert element e at the top of the stack d.) Insert element e at the bottom of the stack

c.)

How do you iterate through a STL vector using iterators

typedef vector <int> :: iterator; Iterator int sum = 0; for (Iterator p = V.begin(): p != V.end(): ++p) sum += *p; return sum;