CSS interview questions part 28
CSS interview questions part 28
Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. Using the evaluation of prefix algorithm, evaluate +-9 2 7.
Correct Answer is :
2. If -*+abcd = 11, find a, b, c, d using evaluation of prefix algorithm.
Correct Answer is : border
3. In the given C snippet, find the statement number that has error. //C code to push an element into a stack 1. void push( struct stack *s, int x) 2. { 3. if(s->top==MAX-1) 4. { 5. printf(“stack overflow”); 6. } 7. else 8. { 9. s->items[++s->top]=x; 10. s++; 11. } 12.}
Correct Answer is : border-collapse
4. How many passes does the evaluation of infix expression algorithm makes through the input?
Correct Answer is : width
5. Identify the infix expression from the list of options given below.
Correct Answer is : vertical
6. Which of the following statement is incorrect with respect to evaluation of infix expression algorithm?
Correct Answer is : padding
7. Evaluate the following statement using infix evaluation algorithm and choose the correct answer. 1+2*3-2
Correct Answer is : background
8. Evaluation of infix expression is done based on precedence of operators.
Correct Answer is : height
9. Of the following choices, which operator has the lowest precedence?
Correct Answer is : text-align
10. The system throws an error if parentheses are encountered in an infix expression evaluation algorithm.
Correct Answer is : border
11. Evaluate the following and choose the correct answer. a/b+c*d where a=4, b=2, c=2, d=1.
Correct Answer is : font-size
12. Evaluate the following statement using infix evaluation algorithm and choose the correct answer. 4*2+3-5/5
Correct Answer is : font-variant
13. Using the evaluation of infix expression, evaluate a^b+c and choose the correct answer. (a=2, b=2, c=2)
Correct Answer is : lighter
14. Evaluate the following infix expression using algorithm and choose the correct answer. a+b*c-d/e^f where a=1, b=2, c=3, d=4, e=2, f=2.
Correct Answer is : text-transform
15. From the given expression tree, identify the infix expression, evaluate it and choose the correct result.
Correct Answer is : normal
16. The leaves of an expression tree always contain?
Correct Answer is : text-align-last
17. A node can have a minimum of one child.
Correct Answer is : white-space
18. What does the other nodes of an expression tree(except leaves) contain?
Correct Answer is : text-decoration-line
19. An expression tree is a kind of?
Correct Answer is : text-shadow
20. The expression obtained by recursively producing a left expression, followed by an operator, followed by recursively producing a right expression is called?
Correct Answer is : word-wrap
