Professional Documents
Culture Documents
COM316 Assignment
COM316 Assignment
P101/0949g/19
1 .A
DFS is not guaranteed to find an optimal path; iterative deepening is. DFS may
explore the entire graph before finding the target node; iterative deepening only
does this if the distance between the start and end node is the maximum in the
graph.
B
State Space Tree : It is a tree constructed from all transition of an algorithm or any
design of your code from initial state to final state. Basically it is used for showing
flow of recursive piece of code. Search Space Tree : It is tree (Basically Decision
tree) constructed from which an algorithm searches
C
Top-down Parsing is a parsing technique that first looks at the highest level of the
parse tree and works down the parse tree by using the rules of grammar while
Bottom-up Parsing is a parsing technique that first looks at the lowest level of the
parse tree and works up the parse tree by using the rules of grammar
D
Here, I think, one has to rely on world knowledge that a hammer is used to
drive a nail through the surface of an object into its interior.
4
Similarlities
In both finding corresponding points and disparities is the same and they are
area of computer vision
Differences