QUESTION 4 A decision tree is read from left to right, with the conditions along the various branches and the actions at the far left. O True O False QUESTION 5 A is logically impossible in a data flow diagram (DFD) because a process must act on input, shown by an incoming data flow, and produce output, represented b an outgoing data flow. O a. black hole O b. gray matter O c. server farm O d. spontaneous combustion QUESTION 6 A(n) shows the object classes and relationships involved in a use case. O a. modeling diagram O b. class diagram

We saw the mechanics of Tree Traversals and discussed how they're different from one another, but if we want to write practical software, we also need to know when we should be using the techniques we're learning about. In each of the scenarios described below in which a tree traversal is required, what would be the appropriate kind of tree traversal to use? For each one, briefly explain (in no more than a sentence or two) why. 1. You're writing an analysis tool for a hierarchical organization, in which there is one person fundamentally in charge, to whom some number of people report, to each of whom some number of people report, and so on. There is a ranking in the organization, so the person in charge has rank 1, the people who report to that person have the rank 2, the people who report to the rank-2 people have the rank 3, and so on. Your input is this kind of organizational hierarchy. Your desired output is to be able to find the highest-ranking person (i.e., the person with the…

(a) Design a PDA P that recognizes the language L = {r#y : x, y E {1}* ^ |r| > ly|} over the alphabet E = {1, #}. Draw a state diagram according to the format of the textbook and the slides, i.e., start with an empty stack. Furthermore, ensure that every move either pushes or pops, but not both. (b) Obviously, you can casily create a CFG for such a trivial language like L. Here, you are asked to not just produce any CFG for L, but follow the procedure PDA-to-CFG to obtain such a grammar. Even for such a simple PDA, the grammar would be a bit lengthy. Therefore, we make one modification. You don't have to write any rules that involve variables that generate the empty language. Such rules would have no effect anyway.

Automata Theory Create a PDA to recognize the following language: L = {0n12n | n >= 0}.Since drawing is difficult in this environment, you may create the PDA as follows:1. First specify the 6 elements of the PDA (e.g., Q = {...}, SIGMA = {...} etc) and their contents.2. Then specify the transitions in a list as follows. (When you specify the transition, use the same notation that Sipser would use in a state transition diagram.)q1 to q2: <here specify the transition>q2 to q3: <here specify the transition>etc.

Exist any benefits or drawbacks to utilizing state-space representation?