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?
Which of the following is NOT an advantage of "short circuit" evaluation of the following expression?
i<n && x[i]=y[i]
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?
Most of the following statements describe useful things that interrupts can do, but one does not. Which of the following statements is NOT true?
Each node in a binary tree is a record with three fields: value, left, and right. Suppose R1 points to a node in the tree. Which instruction would put a pointer to the right subtree into R5?
Each node in a binary tree is a record with three fields: value, left, and right. Suppose R1 points to a node in the tree. Which instruction would put the value of that node into R3?
Each node in a binary tree is a record with three fields: value, left, and right. Suppose p is a pointer to a node in the tree. Which instruction would make R1 point to that node?