课程

You've reached Level 30

"Hi, Amigo!" "Hi, Bilaabo!" "I want to tell you a little about different numbering systems." "You've already heard that people use the decimal system. Here are the main facts of this system: 1) 10 digits are used to write numbers: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9. 2) The number 543 means 5 hundreds + 4 tens + 3 ones. "This is equivalent to writing 5*100 + 4*10 + 3*1, which can be written as 5*102 + 4*101 + 3*100 ..."

"Hi, Amigo!"

"Hi, Amigo!" "I want to tell you about numeric operators." "Bilaabo already told me!" "Really? Then I'll ask just a couple of questions." "How do you increase a variable by 1? Give me as many options as possible." "Easy ..."

"Hi, Amigo!"

"Hi, Amigo!" "Now we'll have a small lesson on logical operators." "What logical operators do you know?" "OR (||), AND (&&), NOT(!)" "Yep. Good job. And do you remember how they work?" "Yes." "OR yields true when at least one operand is true." "AND yields true when both operands are true." "NOT changes true to false, and false to true." "That's right. And in what order are the operators evaluated ..."

"Hi, Amigo!"

"Hi, Amigo!" "One more little lesson about bitwise operators." "You know that in addition to the logical operators AND (&&), OR (||) and NOT (!), there are also bitwise operators AND (&), OR (|), NOT (~), and XOR(^), right?" "Yep. Bilaabo once gave a very good lesson about this." "Well, about these operators. I've got two things to tell you:" "First, just like logical operators, they can be applied to boolean ..."

"Hi, Amigo!"

"Hi, Amigo!" "Today I'm going to tell you about some interesting things in Java." "Infinity." "In Java, the double type has special values for positive infinity and negative infinity. A positive number divided by 0.0 yields positive infinity, and a negative number — negative infinity. " "These concepts are represented by special Double constants ..."

"Hi, Amigo!" "I'd also like to talk about bitmasks and XOR." "You already know that numbers consist of bits and you can perform various operations on these bits. A bitmask is a representation of several different logical values (true/false values) as a single integer. In this case, each boolean-value corresponds to a specific bit. Here's how this could be done ..."

"Hi, Amigo!" "Let's continue our lessons on how to google." "Here are some exercises ..."