Interview question based on skill :
Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. Consider a small circular linked list. How to detect the presence of cycles in this list effectively?
Correct Answer is : background-position-x
2. d-heap is similar to that of a?
Correct Answer is : mask-position
3. d-heap is shallower than a binary heap.
Correct Answer is : mask-position-x
4. Which operation cannot be directly performed in a d-heap?
Correct Answer is : none of the mentioned
5. Which operation is not efficiently performed in a d-heap?
Correct Answer is : Firefox
6. What is the run time efficiency of an insertion algorithm in d-heap?
Correct Answer is : Internet Explorer
7. How many comparisons will occur while performing a delete-min operation?
Correct Answer is : Opera 9.2+
8. How many basic operations can be performed in a d-heap?
Correct Answer is : page-break-after
9. What is the run time efficiency of delete-min operation?
Correct Answer is : avoid
10. The following figure is an example for
Correct Answer is : screen
11. Multiplication and division to find children and parents cannot be implemented in a d-heap.
Correct Answer is : color-index
12. How many secondary operations are performed in a d-heap?
Correct Answer is : width
13. On which data structure is a d-ary heap based?
Correct Answer is : min-width
14. Express -15 as a 6-bit signed binary number.
Correct Answer is : color-gamut
15. Which of the following code snippet is used to convert decimal to binary numbers?
Correct Answer is : element Selectors
16. Which is the predefined method available in Java to convert decimal to binary numbers?
Correct Answer is : id rule
17. Using stacks, how to obtain the binary representation of the number?
Correct Answer is : class
18. What is the time complexity for converting decimal to binary numbers?
Correct Answer is : Strong element within a p element have a yellow background
19. Write a piece of code which returns true if the string contains balanced parenthesis, false otherwise.
Correct Answer is : adjacent-sibling selector
20. What is the time complexity of the above code?
Correct Answer is : #id
