| Snaprecruit.com

| Snaprecruit.com

Interview question based on skill :

Take as many assements as you can to improve your validate your skill rating

Total Questions: 20

1. Which is the most appropriate data structure for applying balancing of symbols algorithm?

Correct Answer is : TRUE

2. Which of the following does the balancing symbols algorithm include?

Correct Answer is : all of the mentioned

3. Which of the following statement is incorrect with respect to balancing symbols algorithm?

Correct Answer is : clear

4. What should be done when an opening parentheses is read in a balancing symbols algorithm?

Correct Answer is : FALSE

5. When the corresponding end bracket/braces/parentheses is not found, what happens?

Correct Answer is : right

6. If the corresponding end bracket/braces/parentheses is encountered, which of the following is done?

Correct Answer is : transform

7. An error is reported when the stack is not empty at the end.

Correct Answer is : transform-style

8. Is the given statement ((A+B) + [C-D]] valid with respect to balancing of symbols?

Correct Answer is : transition-duration

9. How many passes does the balancing symbols algorithm makes through the input?

Correct Answer is : padding-right

10. Which of the following statement is invalid with respect to balancing symbols?

Correct Answer is : page-break-after

11. Binary Decision Diagram is a type of __________

Correct Answer is : quotes

12. In which of the following case does a Binary Decision Diagram is used for?

Correct Answer is : ::after

13. In a Binary Decision Diagram, how many types of terminal exists?

Correct Answer is : counter-increment

14. In a Binary Decision Diagrams 0 values by a _________ line and the 1 values are represented by a _________ line.

Correct Answer is : counter-reset

15. How many nodes are required to create a Binary Decision Tree having 4 variables?

Correct Answer is : content

16. Two or more And Inverter Graphs can represent same function.

Correct Answer is : user-select

17. Size of an And Inverter Graph is the number of _______ gates and the number of logic levels is number of ________ gates on the __________ path from a primary input to a primary output.

Correct Answer is : word-break

18. And Inverter Graph is a type of __________

Correct Answer is : writing-mode

19. The And Inverter Graph representation of a Boolean function is more efficient than the Binary Decision Diagram.

Correct Answer is : zoom

20. Which of the following logical operation can be implemented by polynomial time graph manipulation algorithms using Binary Decision Diagrams?

Correct Answer is : transition