What is the corresponding UCS2 code?

[Franco]

i was preparing for my compsci exam doing past papers
and encountered a few questions i don't get
can someone help me please?

The following bytes are encountered in a UTF8 stream. What is the corresponding UCS2 code? (Express your answer in hexadecimal)
23 E8 96 BC C2 8B

i don't know wat's UTF8 and UCS2, can't find it in my lecture notes


another question
Express the performance of the following methods using big-Oh notation in terms of the parameter n. Give reasons for your answers.

public void determineComplexity(int n) {
int add = 0;
if (n ==0)
add++
else{
determineComplexity(n/10);
}
}

for this one, is the answer equals
O(n/10)?
if n = 1000
it'll take 3 times before n == 0

 

[TenaliRaman]

For 1>
use google, i found these two links
http://czyborra.com/utf/
http://www.uazone.com/multiling/unicode/ucs2.html

For 2>
Dont u think O(n/10) is wrong?
Take ur own example,
for n=1000, the program runs 3 times
is n/10 = 3?

-- AI

 

[ravenprp]

The corresponding UCS2 code for the given UTF8 stream would be 0023 4E2C 000D 000B. UTF8 is a character encoding system that uses variable-length code units, while UCS2 is a fixed-length encoding system that uses two bytes to represent each character. In terms of performance, the determineComplexity method would have a time complexity of O(log n), as the input is divided by 10 in each recursive call, resulting in a logarithmic growth rate. Therefore, if n = 1000, it would take approximately 3 recursive calls before n == 0.