CSS interview questions part 29
CSS interview questions part 29
Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. The average depth of a binary tree is given as?
Correct Answer is : CSS ON/Images ON
2. Only infix expression can be made into an expression tree.
Correct Answer is : CSS OFF/Images ON
3. An expression tree is created using?
Correct Answer is : CSS ON/Images ON
4. #ERROR!
Correct Answer is : The Phark method
5. An expression tree’s nodes can be deleted by calling?
Correct Answer is : Radu Darvas Technique
6. In an expression tree algorithm, what happens when an operand is encountered?
Correct Answer is : Langridge method
7. Free lists are used in
Correct Answer is : Lindsay method
8. What are implicit and explicit implementations of freelists?
Correct Answer is : The Leon method
9. What datastructures can be used in implementing a free list?
Correct Answer is : The Levin Technique
10. What are different ways of implementing free lists and which is simple among them?
Correct Answer is : Radu Darvas Shim
11. What is buddy memory management of free lists ?
Correct Answer is : Phark method
12. How does implicit free lists(garbage collection) works in adding memory to free list ?
Correct Answer is : Nash Image replacement
13. Assume there is a free list which contains nodes and is filled with a value if it is already assigned and the value will be the size of requested block else will be 0. z = startpoint; while ((z < end) && \\ didn't reach end (*z <= len)) \\ too small to satisfy request { assign this block } The above code represents what ?
Correct Answer is : visible
14. How are free blocks linked together mostly and in what addressing order?
Correct Answer is : collapse
15. Accessing free list very frequently for wide range of addresses can lead to
Correct Answer is : Internet Explorer
16. Which of the following statements for a simple graph is correct?
Correct Answer is : fill
17. In the given graph identify the cut vertices.
Correct Answer is : scale-down
18. What is the number of edges present in a complete graph having n vertices?
Correct Answer is : IE
19. The given Graph is regular.
Correct Answer is : PlotKit
20. In a simple graph, the number of edges is equal to twice the sum of the degrees of the vertices.
Correct Answer is : Pie chart
