Scribd
Upload
27 views4 pages

STMQB1

The document contains a question bank about state transition models and state machines. It includes multiple choice questions about topics like path expressions, node reduction, state graphs, and decision tables. Key areas covered are concatenation of path segments, reducing path expressions, identifying different types of states, elements of state graphs, and the order of grouping in Karnaugh-Veitch charts.

Uploaded by

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

STMQB1

The document contains a question bank about state transition models and state machines. It includes multiple choice questions about topics like path expressions, node reduction, state graphs, and decision tables. Key areas covered are concatenation of path segments, reducing path expressions, identifying different types of states, elements of state graphs, and the order of grouping in Karnaugh-Veitch charts.

Uploaded by

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

STM Question bank

1. Two successive path segments is expressed by concatenation is known as [ ]


a) Path product b) Path sum c) Path d) Path Expression
2. ABC+BCD+CDE+EFG is in the form of [ ]
a) Sum of products b) Product of additions
b) c) Reduction of sums d) Product of sums
3. The first steps in node reduction is [ ]
a) Combine all parallel links b) Combine all Serial links
c) Remove self loops d) Remove the node
4. The order of grouping in KV charts should be [ ]
a) Octets,islands,pairs,quads b) Octets, quads, pairs, islands
c) quads, pairs, islands, Octets d) islands, pairs, quads, Octets
5. The elements of state graph does not include [ ]
a) States b) input/output c) transitions d) State machines
6. If there are 2 immaterial cases in a table then the expansion would result in
_______columns or cases
a)4 b) 8 c)16 d) 2
7. The bugs in state graphs are due to [ ]
a) No of states b) Impossible states
c) Equivalent states d) All of the above
8. The state where “engine is not working and vehicle is running” is example of
[ ]
a) Reachable state b) Impossible state
c) Equivalent state d) Contradictory state
9. In a good state graph [ ]
a) bugs are easy to find b) Sequence of inputs does not lead
to initial state
c) Bugs are more d) Both a and b
10. The state where no input sequence can reach is known as [ ]
a) Dead state b) Reachable state
c) Unreachable state d) Ambiguous State
11. Outputs in a state graph are not dependent on [ ]
a) Transitions b) Inputs c) Both a and b d)None
12.The state where “engine is not working and vehicle is running” is example of
a) Reachable state b) Impossible state [ ]
c) Equivalent state d) Contradictory state
13. The elements of state graph does not include
a) States b) input/output c) transitions d) State machines
14. ABCD+BCD+CD+AB can be reduced to [ ]
a) CD+AB b) 1 c) CD d) AB
15. Outputs and inputs in state diagram are separated by [ ]
a)*(asterisk) b)/(slash) c)-(eiphen) d) none
16. The order of grouping in KV charts should be [ ]
a) Octets, islands, pairs, quads b) Octets, quads, pairs, islands
c) Quads, pairs, islands, Octets d) islands, pairs, quads, Octets
17. It two distinct domains are overlapped, then they are said to be [
]
a) Ambiguous b) over specified c) contradictory d) unambiguous
18. The path expression for the following loop would be [ ]

a)z*x b)zx c)zx* d)z+ x


19. The list of names of conditions is known as [ ]
a) Condition Stub b) Condition Entry
b) Action Entry d) Action stub
20. According to laws of Boolean Algebra expression AB = [
]
a)A . B b) A + B c) A + B d) A+B

II. Fill in the Blanks

1. The behavior of FSM is invariant under all _____________________

2. In union of specified domains is incomplete the domain is said to be

______________

3. The translator will convert decision table into ________________


4. If A and B are two parallel paths then their equivalent path would be__________

5. The logic in the simplest form is_________________________

6. Is path product commutative? ______

7. The process who’s come out is a truth value is known as _______________

8. _____________denote the parallel set of paths

9. ABCD+ABC+AB+A CD+BC can be reduces to___________________________

10. Self loop can be removed by replacing it with _______if a is the path

expression of that loop.

11. The elements of decision table are___________________

12. KV charts are used to analyze __________

13. Path expression would be easy to analyze compared to

__________________

14. Don’t care conditions generally occur in__________

15. The implementation of combinational program is based on______________

16. _________is the table which consists of set of conditions and corresponding

action

17. The set of different input values is known as________________

18. The entries which do not play any role in decision table are known

as________

19. The bugs that occur due to dead states are known as__________________

20. A________is the condition which describes the behavior of the system

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy