Aspire Faculty ID #16380 · Topic: NIMCET 2010 · Just now
NIMCET 2010

Given below is a binary tree, where every letter has been coded with a
string of digits 0 and 1. At any node going left is denoted by 1; at any node going right is denoted by 0. Thus
N is denoted as: 10000. All the codes are in Binary notation.
If all the codes are converted into decimal notation, then how many letters have their values greater than L?

Solution

Code for L = 0110 (decimal 6) Letters greater than L (higher numeric code): N = 0111 → 7 S = 01111 → 15 X = 000 → 0 (not greater) Others are lower. So only N and S → 2 letters.

Previous 10 Questions — NIMCET 2010

Nearest first

Next 10 Questions — NIMCET 2010

Ascending by ID
Ask Your Question or Put Your Review.

loading...