PLEASE CAN ANYONE OUT THERE HELP ME WITH THIS CLASS WORK,I KNOW THERE ARE SO MANY PEOPLE OU THERE WHO CAN EASILY HELP ME SORT THIS PROBLEM OUT.THANKS .


WRITE PROGRAMS WITH THE FOLLOWING INPUT AND OUTPUT
1. GIVEN AN ARITHMETIC EXPRESSION IN PREFIX/POSTFIX FORM, FIND ITS VALUE.
(OPERATIONS: +ADDITION,-SUBTRACTION, *MULTIPLICATION,/DIVISION, AND EXPONENTIATION; NUMBERS OF OPERATIONS K: 6< K<10).

2. GIVEN THE LIST OF EDGES (VERTEX PAIRS) AND THEIR WEIGHTS OF A WEIGHTED UNDIRECTED CONECTED GRAPH AND START VERTICE, USE PRIMS ALGORITHM TO FIND A MINIMAL SPANNING TREE OF THIS GRAPH
NUMBER OF VERTICES N: 9 < N < 15,
NUMBER OF EDGES M: 12 < M < 19)

3. GIVEN THE ORDERED PAIRS OF VERTICES ASSOCIATED TO THE EDGES OF A DIRECTED GRAPH, CONSTRUCT AN INCIDENCE MATRIX FOR THE GRAPH, DETERMINE THE IN-DEGREE AND OUT-DEGREE OF EACH VERTEX.
NUMBER OF VERTICES N: 9 < N < 15,
NUMBER OF EDGES M: 12  < M < 19.

ugocugo,

The assignment is for you to and you alone to do. We can point you in the right direction by giving you resources and online help. Don't expect anyone to do it for you.

Here are some C/C++ resources that might help

1. www.cprogramming.com
2. http://knowfree.net/category/it-ebooks/cc

Check them out.

Good luck