data structures and program design

1.Complete the program that solves the Eight Queens problem.  The program’s output should look similar to:

 

                                 |1|0|0|0|0|0|0|0|

                                 |0|0|0|0|0|0|1|0|

                                 |0|0|0|0|1|0|0|0|

                                 |0|0|0|0|0|0|0|1|

                                 |0|1|0|0|0|0|0|0|

                                 |0|0|0|1|0|0|0|0|

                                 |0|0|0|0|0|1|0|0|

                                 |0|0|1|0|0|0|0|0|

 Where a 1 represents a queen chess piece on the board, and a 0 represents an empty square on the board.

 

2.  Design and implement a class of postfix calculators. Use the algorithm given on page 374 to evaluate postfix expressions, as entered into the calculator. Use only the operators +, -, *, %, and /. Assume that the postfix expressions have single digit numbers in the expression and are syntactically correct.