All categories

4 years ago

Consider the following code: x=9 y = -2 z=2 print (x + y * z) What is output?

Computers and Technology

1 answer:

Goryan [66]4 years ago

3 0

Answer:

Explanation: The reason why is because adding a negative is pretty much subtracting by 2. 9-2=7. Then multiply 7 by 2 like add 7 to 7 and you get 14.

You might be interested in

In the original UNIX operating system, a process executing in kernel mode may not be preempted. Explain why this makes (unmodifi

Elena L [17]

Answer:

the preemption is -> The ability of the operating

system to preempt or stop a currently

scheduled task in favour of a higher priority

task. The scheduling may be one of, but not

limited to, process or 1/0 scheduling etc.

Under Linux, user-space programs have always

been preemptible: the kernel interrupts user

space programs to switch to other threads,

using the regular clock tick. So, the kernel

doesn't wait for user-space programs to

explicitly release the processor (which is the

case in cooperative multitasking). This means

that an infinite loop in an user-space program

cannot block the system.

However, until 2.6 kernels, the kernel itself was

not preemtible: as soon as one thread has

entered the kernel, it could not be preempted to

execute an other thread. However, this absence

of preemption in the kernel caused several

oroblems with regard to latency and scalability.

So, kernel preemption has been introduced in

2.6 kernels, and one can enable or disable it

using the cONFIG_PREEMPT option. If

CONFIG PREEMPT is enabled, then kernel code

can be preempted everywhere, except when the

code has disabled local interrupts. An infinite

loop in the code can no longer block the entire

system. If CONFIG PREEMPT is disabled, then

the 2.4 behaviour is restored.

So it suitable for real time application. Only

difference is we don't see many coders using it

5 0

3 years ago

Determine the Bcd equivalent 1100111110101001

Vilka [71]

Answer:

01010011000101100001

Explanation:

In computing and electronic systems, a binary-coded decimal (BCD) is a digital encoding method for decimal numbers in which each digit is represented by its own binary sequence.

8 0

3 years ago

Input a list of employee names and salaries and store them in parallel arrays. End the input with a sentinel value. The salaries

4vir4ik [10]

Using the knowledge in computational language in JAVA it is possible to write the code being Input a list of employee names and salaries and store them in parallel arrays

<h3>Writting the code in JAVA:</h3>

BEGIN

DECLARE

employeeNames[100] As String

employeeSalaries[100] as float

name as String

salary, totalSalary as float

averageSalary as float

count as integer

x as integer

rangeMin, rangeMax as float

INITIALIZE

count = 0;

totalSalary =0

DISPLAY “Enter employee name. (Enter * to quit.)”

READ name

//Read Employee data

WHILE name != “*” AND count < 100

employeeNames [count] = name

DISPLAY“Enter salary for “ + name + “.”

READ salary

employeeSalaries[count] = salary

totalSalary = totalSalary + salary

count = count + 1

DISPLAY “Enter employee name. (Enter * to quit.)”

READ name

END WHILE

//Calculate average salary with mix , max range

averageSalary = totalSalary / count

rangeMin = averageSalary - 5

rangeMax = averageSalary + 5

DISPLAY “The following employees have a salary within $5,000 of the mean salary of “ + averageSalary + “.”

For (x = 0; x < count; x++)

IF (employeeSalaries[x] >= rangeMin OR employeeSalaries[x] <= rangeMax )

DISPLAY employeeNames[x] + “\t” + employeeSalaries[x]

END IF

END FOR

END

See more about JAVA at brainly.com/question/12978370

#SPJ1

5 0

2 years ago

The computer that is used in scientific research is ........

MrRa [10]

Answer:

supercomputers are the computer that is used in scientific research.

6 0

3 years ago

Consider the following definition of a recursive method. public static int mystery(int[] list, int first, int last) { if (first

ozzi

Answer:

c. 27

Explanation:

In recursion method, a method calls itself until a condition becomes true and returned back. In mystery(), at first time, first is 0 and last is 4. Condition is checked and 0!=4 so else part is executed in which again mystery is called with first as 1 and last 4. This will go again and again until first=4.
When first=4 it is also equal to last so if part is executed and alpha[4] is returned which is 9, now it comes alpha[3] +9 which is 8+9 =17 .
It is returning values to its previous calls that is why it will reduce to alpha[0]+alpha[1]+alpha[2]+17 which is nothing but sum of all elements of a alpha
Then, 1+4+5+8+9=27.

5 0

3 years ago