Crowdly

Most instructions are used for just one purpose, but lea can be used for several purposes. Which one of the following is NOT something you can do with lea?

follow a pointer: i.e. implement (*p)

add a constant to a register

increment the stack pointer

load a constant into a register

❌

create a pointer to an element of a record

create a pointer to a variable: i.e. implement (&x)

Переглянути це питання

Suppose R4=i, and we are implementing a jump table to go to jt[i], where jt contains n elements. Several computations should be performed on i before actually making the jump. Which of the following is NOT one of these computations?

If i<0, don't enter the jump table, but go to an error handler

Take the absolute value of i

Compute 2*i, because each element of the jump table is two words long

if i>=n, don't enter the jump table, but go to an error handler

Переглянути це питання

The reason for using a header node to point to a linked list is

Given a pointer p to a node in a list, you can insert a new node

before (*p) but not after (*p).

❌

It is impossible to have a pointer which is not part of a record

❌

Given a pointer p to a node in a list, you can insert a new node

after (*p) but not before (*p), and if the new node should go

at the beginning that means it can be inserted after the header

✅

Переглянути це питання

Which of the following is NOT an advantage of "short circuit"

evaluation of the following expression?

i<n && x[i]=y[i]

The short circuit evaluation requires fewer conditional jump

instructions than a complete evaluation

If i<n is False, then evaluating x[i]=y[i] could cause an

invalid array access

It is more efficient to skip evaluating the second part of

the expression if the first part is false

Переглянути це питання

Suppose we have an integer code, and we need to execute a different statement for each value of the code from 0 to n-1. Which statement correctly describes the time complexity?

An if-then-elif-elif statement would take time O(n)

A jump table would take time O(1)

✅

An if-then-elif-elif statement would take time O(1)

A jump table would take time O(log n)

❌

An if-then-elif-elif statement and a jump table would take

approximately the same time, if n is very large

❌

Переглянути це питання

Most of the following statements describe useful things that interrupts can do, but one does not. Which of the following statements is NOT true?

Interrupts enable I/O devices to receive service quickly, before