39998

Solution 1:

The Iterator types define for traversing the items in a sequence. Iterators have same advantages and power as the pointers. But same time, there are also risks and inconveniences. We can accidentally modify data that we are not supposed to. This can be done with the help of pointer. But we can partially solve that problem by using const modifier.

The const_iterator provides basically the same functionality as a regular iterator. But there is one exception that data cannot be modified because modifying the data “pointed to” by the const_iterator is disallowed.

Solution 2:

a) Insert a new element after the current iterator position: const_iterator

b) Replace the data stored in the currently selected item: iterator

c) Retrieve the data stored in the currently selected item: const_iterator

d) Insert a new element before the currently selected item: iterator

Solution 4:

Expression: 10 2 * 5 / 6 2 5 * + –

Solution 5:

Expression: 10 * 5 / 6 2 5 * + –

It will throws an exception, because to perform ‘*’, there should be one more operand along with 10.

Solution 6:

Expression:  y – 7 * 35 + 4 / 6 – 10

Expression:  ( x + 15 ) * ( 3 * ( 4 – (5 + 7 / 2 ) ) )

Solution 8:

Algorithm to display all the elements in a queue:

Display() method
j = front
MAX = rear
while loop from j to MAX
print element at index ‘j’
j = j + 1
While loop end
Display() End