Scribd
Upload
11 views2 pages

Imp Questions 1

The document contains a series of questions and answers related to algorithms, graph theory, and finite state machines. It covers concepts such as path expressions, state matrices, transitions, and state diagrams. Each question is followed by multiple-choice answers, indicating the correct option for each concept.

Uploaded by

prabhasstylo2004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views2 pages

Imp Questions 1

The document contains a series of questions and answers related to algorithms, graph theory, and finite state machines. It covers concepts such as path expressions, state matrices, transitions, and state diagrams. Each question is followed by multiple-choice answers, indicating the correct option for each concept.

Uploaded by

prabhasstylo2004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1. _____procedure algorithm is used for converting a flow graph into a path expression.

[ a]
a) Reduction b) Structured c) Probability d) Push/Pop
2. ______ Rule is explained as the term in first expression is summed up with each term in second
expression.
[ b ]
a) Loop b) Parallel c) Serial d) None
3. Each term in path expression is concatenated with each term in second path expression is called
___Rule.
[ c ]
a) Loop b) Parallel c) Serial d) None
4. A __ is defined as a combination of attributes belonging for the time being to a person or thing. [d ]
a) Input b) Output c) Transition d) State
5. Any expression that consists of path names and ORs between two nodes are called _______. [ a]
a) Path Expression b) Path Sum c) Path Product d) None
6. The ________ denotes the paths in parallel nodes. [ b]
a) Path Expression b) Path Sum c) Path Product d) None
7. The name of a path that consists of two successive segments is expressed by the concatenation is called
________. [ c]
a) Path Expression b) Path Sum c) Path Product d) None
8. If X and Y denote the same set of paths, then the union of these sets is unchanged is ___ rule. [ d]
a) Reduction b) Distributive c) Assumption d) Absorption
9. A _____ Matrix is a square matrix with one row and one column for every node in the graph. [ a]
a) Graph b) State c) Data Flow d) None
10. The link that joins two states is known as _______. [ b ]
a) Input b) Transition c) Output d) State

1. If there are more than one link between two nodes are known as _____ parallel transitions or
multiple transitions ______________________.
2. Representing a graph matrix with 0’s and 1’s is called __ adjacency matrix
______________________.
3. If the row in a connected matrix contains two or more 1’s them it is a ___ multiple outgoing
edges or multiple connections ____________.
4. A __ relation_______________ is nothing but a property that connects any two things.
5. If there is an entry 1 in the diagonal of corresponding node then that node is a _______ self-loop
or self-transition. __________.
6. FSM stands for____ Finite State Machine ____________________________________________.
7. The behaviour of the system is represented in graphical form is known as ____ state diagram or
state transition diagram _________________.
8. The representation of state graph in the form of a table is known as ___ state transition table
_________________.
9. K V Charts stands for ______ Karnaugh-Veitch chart
___________________________________.
10. The link that joins two states is known as a ___ Transition __________________________.

You might also like