Answer

(A + B) * (A – C)
INPUT A
STORE A
INPUT B
STORE B
INPUT C
STORE C
LOAD A
ADD B
STORE SUM
LOAD A
SUBT C
STORE DIFF
STORE DIFF2
LOAD DIFF
SUBT ONE
SKIPCOND 100
JUMP HERE
CLEAR
STORE ANS
JUMP SHOW
HERE, LOAD SUM
STORE ANS
LOOP, LOAD DIFF
SUBT ONE
STORE DIFF
SKIPCOND 800
JUMP SHOW
LOAD ANS
ADD SUM
STORE ANS
JUMP LOOP
SHOW, LOAD A
OUTPUT
LOAD B
OUTPUT
LOAD C
OUTPUT
LOAD SUM
OUTPUT
LOAD DIFF2
OUTPUT
LOAD ANS
OUTPUT
HALT
A, DEC 0
B, DEC 0
C, DEC 0
SUM, DEC 0
DIFF, DEC 0
DIFF2, DEC 0
ONE, DEC 1
ANS, DEC 0

Schedule for Project Presentation

8:00 - 10:00 IT2A
10:00 - 12:00 CS2
1:00 - 3:00 IT2B
3:00 - 4:00 IT2C

*I would not entertain late comers.

Final Project Group Topics

Group	Project
1	Trees Root, Siblings, External Node, Ancestors, Descendant, Depth, Height, Degree Operations: Insert, Remove, Search, Display
2	Traversal - Trees PreOrder Operations: Insert, Remove, Search, Display
3	Traversal - Trees InOrder Operations: Insert, Remove, Search, Display
4	Traversal - Trees PostOrder Operations: Insert, Remove, Search, Display
5	Tree Application Arithmetic Expression Tree Operations: Display
6	Binary Tree – Number of nodes, number of external nodes, number of internal nodes, height Operations: Insert, Remove, Search, Display
7	Directed Graph Operations make-graph(): graph Create a new graph, initially with no nodes or edges. make-vertex(graph G, element value): vertex Create a new vertex, with the given value. make-edge(vertex u, vertex v): edge Create an edge between u and v. In a directed graph, the edge will flow from u to v. get-edges(vertex v): edge-set Returns the set of edges flowing from v get-neighbors(vertex v): vertex-set Returns the set of vertexes connected to v
8	Undirected Graph Operations make-graph(): graph Create a new graph, initially with no nodes or edges. make-vertex(graph G, element value): vertex Create a new vertex, with the given value. make-edge(vertex u, vertex v): edge Create an edge between u and v. In a directed graph, the edge will flow from u to v. get-edges(vertex v): edge-set Returns the set of edges flowing from v get-neighbors(vertex v): vertex-set Returns the set of vertexes connected to v
9	Weighted Graph Operations (an extension of undirected/directed graph operations) make-edge(vertex u, vertex v, weight w): edge Create an edge between u and v with weight w. In a directed graph, the edge will flow from u to v.
10	Graph Traversal Depth – First Traversal
11	Graph Traversal Breadth-First Search
12	Weighted graphs: Dijkstra’s algorithm
13	Travelling Salesman Problem

Reporting Update

Report Schedule
IT2A - Thursday/February 19, 2009
IT2B - Thursday/February 19, 2009
IT2C - Wednesday/February 18, 2009
CS2 - Friday/February 20, 2009

The presentation of your topics will start according to the date specified above for your respective classes.

Lab Exam

Visit this site - http://www.coders2020.com/what-is-infix-prefix-postfix-how-can-you-convert-from-one-representation-to-another-how-do-you-evaluate-these-expressions. This will serve as your guide for your upcoming midterm lab exam this monday.

Stack and Queue

The codes for stack and queue are already available under Course Materials-> Handouts/ Learning Modules in elms.

Top Students for Prelim

1. EMAN, ROÑARD C. (BSIT2B) 96
2. PAASA, PATRICK ANGELO P. (BSIT2C) 93
3. LASAY, NORRIS LEMUEL C. (BSCS2) 90
4. ZABATE, MARVIN JOHN B. (BSCS2) 88
5. LUI, ADRIAN E.(BSCS2) 88
6. JAMIO, PAUL JOHN I. (BSIT2B) 88
7. MEDILLO, DARWIN I. (BSIT2A) 88
8. REANCHO, LIRALYN S.(BSIT2A) 88
9. AMARANTO, MAYLYN T. (BSIT2C) 88
10. BERNARDINO, JAMES CARL H. (BSIT2C) 88
11. CARILLO, RAFFY D. (BSCS2) 88