To all sections:
-Take home prelim problem exercise with a follow up defense next week (July 26, 27).
-This will serves as 40% of your prelim grade.
-Grading will be based on your answers and the correctness of your solution.
-A group of two.
On the day of submission bring the following:
1. Laptop
2. Hard-copy of your source code
Requirements of the defense:
-Working solution.
-Original source code.
PROBLEM:
Parsing Arithmetic Expressions
This problem involves the usage of Stack and Queue.
This application is parsing (that is, analyzing) arithmetic expressions like 2+3 or 2*(3+4) or ((2+4)*7)+3*(9–5), and the storage structure it uses is the stack.
It's easier for the algorithm to use a two-step process:
1. Transform the arithmetic expression into a different format, called postfix notation.
2. Evaluate the postfix expression.
Step 1 is a bit involved, but step 2 is easy. In any case, this two-step approach results in a simpler algorithm than trying to parse the arithmetic expression directly.
-----
Groupings
Agal:
ABREU, Chester Duane G.
AMANTIAD, Jan Rhais L.
Cacs:
CABILI, SHERWIN A.
CANO, Rommel John S.
Depo:
DUMORAN, Gel Dante E.
PAYLAGA, Jon Paolo J.
Saac:
SUDARIA, CYRUS ALLAN C.
AMBOLODE, Von Michael C.
Agam:
ANDAYA, Princess Cecile G.
Araña, Dale Brian M.
Acea:
ARCAMO, Anthea Izza C.
ECHAVEZ, Marie Beth A.
Esen:
EDAROS, NAIDA S.
FABRICANTE, Zarah Mae N.
Lemo:
LEOPOLDO, June Karl P.
MERCADO, Nel Ian O.
Mopa:
MODEQUILLO, Charles Mathius M.
PONCE, April Rose A.
Resad:
RABE, ANGELA PEARL E.
SALOMSON, Ederlina D.
Sate:
SY, Chrissan G.
TAMSE, Lady Jane G.
Usel:
UMPA, Al-Mohajerani S.
ENRIQUEZ, John Daniel
Asal:
ADRAQUE, Honey Grace S.
APAL, Joren Ezra L.
Bocas:
BONCALES, Ergelie L.
CANOY, Juñel S.
Jeam:
JERUSALEM, JAYSON A.
MALALES, Vincent Q.
Miquiem:
MILA, VERCILLIUS JR. A.
Quiamco, Thor Wendel M.
Sebs:
SERATE, Silver Gems B.
SUMINGUIT, Dexter Lyn M.
Tab:
TALABA, Mark Sunday C.
APAS, CARLO JOEL B.
Baba:
BAGUIO, Kristopher Joseph C.
BASHER, HANAN T.
No comments:
Post a Comment