Blog

In big-Oh notation, when we consider the order of the number of visits an algorithm makes, what do we ignore? I    power of two terms II   the coefficients of the terms III  all lower order terms

Which of the following statements about running times of algorithms is correct?

Given an ordered array with 31 elements, how many elements must be visited in the worst case of binary search?

Complete the following code snippet, which is intended to determine if a value is even or odd using mutual recursion: public static boolean isEven(int n) { if (n == 0) { return true; } else { return isOdd(Math.abs(n) – 1); } } public static boolean isOdd(int n) { if (n == 0) { _________ } else { return isEven(Math.abs(n) – 1); } }

Suppose you push integer elements 1,2,3,4 onto a stack in that order. Then pop an element off the stack and add that element to a queue. You repeat that process three more times. In what order will you remove the elements from the queue?

Which of the following statements about the try/finally statement is NOT true?

When a program throws an exception within a method that has no try-catch block, which of the following statements about exception handling is true?

Suppose you push integer elements 1,2,3,4 onto a stack in that order. Then pop an element off the stack and add that element to a queue. You repeat that process three more times. In what order will you remove the elements from the queue?

Selection sort has O(n2) complexity. If a computer can sort 1,000 elements in 4 seconds, approximately how many seconds will it take the computer to sort 1,000 times that many, or 1,000,000 elements?

Which layout manager constructor call would be best-suited to create a telephone keypad GUI which has three rows of three keys that are labeled 1,2,3; 4,5,6; and 7,8,9; respectively, as well as a fourth row of three keys labeled *, 0, #?