Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. Which class in Java can be used to represent bit array?
Correct Answer is : animation-timing-function
2. What is a Cartesian tree?
Correct Answer is : 5
3. Is the below tree representation of 50,100,400,300,280 correct way to represent cartesian tree?
Correct Answer is : column-count
4. Which of the below statements are true
i.Cartesian tree is not a height balanced tree
ii.Cartesian tree of a sequence of unique numbers can be unique generated
Correct Answer is : columns
5. What is the speciality of cartesian sorting?
Correct Answer is : /* comments */
6. Consider a sequence of numbers to have repetitions, how a cartesian tree can be constructed in such situations without violating any rules?
Correct Answer is : @charset
7. After applying the below operations on a input sequence, what happens?
i. construct a cartesian tree for input sequence
ii. put the root element of above tree in a priority queue
iii. if( priority queue is not empty) then
.search and delete minimum value in priority queue
.add that to output
.add cartesian tree children of above node to priority queue