1. Binary search tree was given. Find 4th smallest element.
2. Some code in assembly was given and given five options. What is being calculated?
Ans: (xy) 2 + y + z
3. Represent (-5)10 in 2's complement representation in 8 bits
4. Expression was given. Draw tree and then find the postfix
5. Some commands in the assembly language were given. Then need to convert this code in assembly
for (i=0 ; i<=10 ; i++)