Question 1

A computational problem is

Accepted Answer

A)  a problem that can be solved using an algorithm 
B)  one that arises in the writing of computer programs 
C)  one that arises when a program runs out of memory,or has some other kind of runtime error 
D)  None of the above 
A)  a problem that can be solved using an algorithm 
B)  one that arises in the writing of computer programs 
C)  one that arises when a program runs out of memory,or has some other kind of runtime error 
D)  None of the above

Question 2

A contiguous segment of an array is specified using two subscripts,lower and upper.Which expression gives the position of the element in the middle of the array segment?

Accepted Answer

A)  lower + upper / 2 
B)  lower /2 + upper 
C)  (upper - lower./2 
D)  lower + (upper - lower./ 2 
A)  lower + upper / 2 
B)  lower /2 + upper 
C)  (upper - lower./2 
D)  lower + (upper - lower./ 2

Question 3

The two criteria most often used to measure the efficiency of an algorithm are

Accepted Answer

A)  efficiency and style 
B)  space and time 
C)  style and time 
D)  execution and speed 
A)  efficiency and style 
B)  space and time 
C)  style and time 
D)  execution and speed

Question 4

Consider the code
Static void doQuickSort(int array[ ],int start,int end){
Int pivotPoint;
If (start < end){
PivotPoint = partition(array,start,end);
DoQuickSort(array,start,pivot-1);
DoQuickSort(array,pivot+1,end);
}
}
In this code,the value pivotPoint returned by partition

Accepted Answer

A)  is the value of the array element that is greater than each element of the first sublist,and less or equal to each element of the second sublist 
B)  is the position of the array element that is greater than each element of the first sublist,and less or equal to each element of the second sublist 
C)  is the element X such that half the elements of the array are less than X,and half the elements of the array are greater or equal to X 
D)  None of the above 
A)  is the value of the array element that is greater than each element of the first sublist,and less or equal to each element of the second sublist 
B)  is the position of the array element that is greater than each element of the first sublist,and less or equal to each element of the second sublist 
C)  is the element X such that half the elements of the array are less than X,and half the elements of the array are greater or equal to X 
D)  None of the above

Question 5

Assuming a method
Int findMax(int array[ ],int last)that returns the subscript of the largest value in the portion of an array whose elements are at 0 through last (inclusive),a method for sorting an array in ascending order can be written as follows:
Void sort(int array[ ]){
For (int last = array.length-1;last >=1;last --){
Int maxPos = findMax(array,last);
// Code is missing
}
}
If a method
Void swap(int array[ ],int pos1,int pos2)can be used to swap the contents of two array entries,then the logic for the missing code is

Accepted Answer

A)  swap(array,maxPos,last); 
B)  swap(array,maxPos,last-1.; 
C)  swap(array,array[maxPos],array[last].; 
D)  sway(array,array[maxPos],array[last-1].; 
A)  swap(array,maxPos,last); 
B)  swap(array,maxPos,last-1.; 
C)  swap(array,array[maxPos],array[last].; 
D)  sway(array,array[maxPos],array[last-1].;

Question 6

To compare String objects for the purpose of sorting,a programmer should

Accepted Answer

A)  use the comparison operator < 
B)  use the comparison operator < = 
C)  use the compareTo method of the Comparable interface 
D)  use the relational operator < to compare references to the String objects 
A)  use the comparison operator < 
B)  use the comparison operator < = 
C)  use the compareTo method of the Comparable interface 
D)  use the relational operator < to compare references to the String objects

Question 7

The method int getPosition(int array[],int X)is designed to return the position of X within the array.If X is not in the array,the method may return either -1 or array.length.Which of the following is a correct implementation for this method?

Accepted Answer

A)  int k = 0;
While (array[k] != X){k ++};return k; 
B)  int k = 0;
While (k < array.length.{if (array[k] != X.return -1;else return k;} 
C)  int k = 0;
While (k < array.length && array[k] != X.{ k++;} return k; 
D)  int k = 0;
While (k < array.length && array[k] != X.{ k++;return k;} 
A)  int k = 0;
While (array[k] != X){k ++};return k; 
B)  int k = 0;
While (k < array.length.{if (array[k] != X.return -1;else return k;} 
C)  int k = 0;
While (k < array.length && array[k] != X.{ k++;} return k; 
D)  int k = 0;
While (k < array.length && array[k] != X.{ k++;return k;}

Question 8

On the average,performing a sequential search on an array of N elements will require

Accepted Answer

A)  N comparisons 
B)  N-1 comparisons 
C)  N/2 comparisons 
D)  None of the above 
A)  N comparisons 
B)  N-1 comparisons 
C)  N/2 comparisons 
D)  None of the above

Question 9

The best way to measure the goodness of an algorithm is

Accepted Answer

A)  to write a computer program that uses the algorithm and time its execution 
B)  to write a computer program that uses the algorithm and run it on the hardest and largest inputs 
C)  to look at its worst case and average case complexity functions 
D)  to look at the sum of its execution time and the space it uses 
A)  to write a computer program that uses the algorithm and time its execution 
B)  to write a computer program that uses the algorithm and run it on the hardest and largest inputs 
C)  to look at its worst case and average case complexity functions 
D)  to look at the sum of its execution time and the space it uses

Question 10

A search for an item X in a portion of a sorted array works by repeatedly selecting the middle item and comparing it to X.If X is not found there,the search method selects either the portion of the array to the left of the middle item,or the portion of the array to the right of the middle item,and continues the search.This method is called

Accepted Answer

A)  sequential search 
B)  binary search 
C)  selection search 
D)  None of the above 
A)  sequential search 
B)  binary search 
C)  selection search 
D)  None of the above

Question 11

The addition of two integers

Accepted Answer

A)  is always a basic step 
B)  is a basic step in algorithms that use addition to define more complex operations such as multiplication 
C)  is a basic step if there is a fixed bound on the size of the integers 
D)  All of the above 
A)  is always a basic step 
B)  is a basic step in algorithms that use addition to define more complex operations such as multiplication 
C)  is a basic step if there is a fixed bound on the size of the integers 
D)  All of the above

Question 12

Let F be an algorithm with complexity function f(n),and let G be an algorithm with complexity function g(n).If the ratio f(n)/g(n)converges to 0 as n increases to infinity,then

Accepted Answer

A)  the algorithm F is asymptotically faster than G 
B)  the algorithm G is asymptotically faster than F 
C)  the two algorithms are asymptotically equivalent in efficiency 
D)  None of the above 
A)  the algorithm F is asymptotically faster than G 
B)  the algorithm G is asymptotically faster than F 
C)  the two algorithms are asymptotically equivalent in efficiency 
D)  None of the above

Question 13

An array of 4 elements is being sorted in ascending order using the insertion sort algorithm.How many comparisons will insertion sort perform if the array was originally sorted in descending order?

Accepted Answer

A)  2 comparisons 
B)  4 comparisons 
C)  6 comparisons 
D)  None of the above 
A)  2 comparisons 
B)  4 comparisons 
C)  6 comparisons 
D)  None of the above

Question 14

The Quicksort algorithm works by

Accepted Answer

A)  repeatedly comparing adjacent items and swapping them so smaller values come before larger values 
B)  repeatedly locating the smallest value in the unsorted portion of the array and moving it toward the lower end of the array 
C)  repeatedly taking the first value in the unsorted portion of the array and placing it at its proper place in the part of the array that is already sorted 
D)  partitioning the unsorted portion of the array into two sublists and a pivot and recursively sorting the two sublists 
A)  repeatedly comparing adjacent items and swapping them so smaller values come before larger values 
B)  repeatedly locating the smallest value in the unsorted portion of the array and moving it toward the lower end of the array 
C)  repeatedly taking the first value in the unsorted portion of the array and placing it at its proper place in the part of the array that is already sorted 
D)  partitioning the unsorted portion of the array into two sublists and a pivot and recursively sorting the two sublists

Question 15

Let F be an algorithm with complexity function f(n),and let G be an algorithm with complexity function g(n).If the ratio f(n)/g(n)converges to 2 as n increases to infinity,then

Accepted Answer

A)  the two algorithms are equivalent in efficiency and there is no clear winner 
B)  implementations of F will require twice as much time as implementations of G 
C)  we can deduce that F runs in linear time while G runs in quadratic time 
D)  implementations of F will require twice as much space as implementations of G 
A)  the two algorithms are equivalent in efficiency and there is no clear winner 
B)  implementations of F will require twice as much time as implementations of G 
C)  we can deduce that F runs in linear time while G runs in quadratic time 
D)  implementations of F will require twice as much space as implementations of G

Question 16

The Quicksort algorithm

Accepted Answer

A)  is in O(n)in the worst case 
B)  is in O(n log n.in the worst case 
C)  is in O(n log n.in the average case 
D)  is in O(log n.in the average case 
A)  is in O(n)in the worst case 
B)  is in O(n log n.in the worst case 
C)  is in O(n log n.in the average case 
D)  is in O(log n.in the average case

Question 17

If a[ ] is an array of integers,the pseudo code
Int k = 0
Int m = 1
While m < a.length
If a[m] < a[k] Then
K = m
End If
M = m+1
End While
Describes a strategy for

Accepted Answer

A)  sorting an array in ascending order 
B)  sorting an array in descending order 
C)  implementing a part of the logic for bubble sort 
D)  determining the location of the smallest value in the array 
A)  sorting an array in ascending order 
B)  sorting an array in descending order 
C)  implementing a part of the logic for bubble sort 
D)  determining the location of the smallest value in the array

Question 18

A basic step is

Accepted Answer

A)  an operation that can be executed within a constant amount of time 
B)  an operation that is used only in the simplest algorithms 
C)  one that is implemented in a library package 
D)  None of the above 
A)  an operation that can be executed within a constant amount of time 
B)  an operation that is used only in the simplest algorithms 
C)  one that is implemented in a library package 
D)  None of the above

Question 19

If an algorithm with an input size of n has a nested loop,and both loops make a complete pass over the input,then the performance of the algorithm will be

Accepted Answer

A)  constant time 
B)  linear time 
C)  logarithmic time 
D)  quadratic time 
A)  constant time 
B)  linear time 
C)  logarithmic time 
D)  quadratic time

Question 20

The role of the partition(array,start,end)method in Quicksort

Accepted Answer

A)  is to sort the segment of the array between start and end 
B)  is to identify the position of the largest value in the part of the array that lies between start and end 
C)  is to split the array into two sorted sublists on either side of the pivot element 
D)  None of the above 
A)  is to sort the segment of the array between start and end 
B)  is to identify the position of the largest value in the part of the array that lies between start and end 
C)  is to split the array into two sorted sublists on either side of the pivot element 
D)  None of the above

A computational problem is

A contiguous segment of an array is specified using two subscripts,lower and upper.Which expression gives the position of the element in the middle of the array segment?

The two criteria most often used to measure the efficiency of an algorithm are

Consider the code Static void doQuickSort(int array[ ],int start,int end){ Int pivotPoint; If (start < end){ PivotPoint = partition(array,start,end); DoQuickSort(array,start,pivot-1); DoQuickSort(array,pivot+1,end); } } In this code,the value pivotPoint returned by partition

To compare String objects for the purpose of sorting,a programmer should

The method int getPosition(int array[],int X)is designed to return the position of X within the array.If X is not in the array,the method may return either -1 or array.length.Which of the following is a correct implementation for this method?

On the average,performing a sequential search on an array of N elements will require

The best way to measure the goodness of an algorithm is

The addition of two integers

Let F be an algorithm with complexity function f(n),and let G be an algorithm with complexity function g(n).If the ratio f(n)/g(n)converges to 0 as n increases to infinity,then

An array of 4 elements is being sorted in ascending order using the insertion sort algorithm.How many comparisons will insertion sort perform if the array was originally sorted in descending order?

The Quicksort algorithm works by

Let F be an algorithm with complexity function f(n),and let G be an algorithm with complexity function g(n).If the ratio f(n)/g(n)converges to 2 as n increases to infinity,then

The Quicksort algorithm

If a[ ] is an array of integers,the pseudo code Int k = 0 Int m = 1 While m < a.length If a[m] < a[k] Then K = m End If M = m+1 End While Describes a strategy for

A basic step is

If an algorithm with an input size of n has a nested loop,and both loops make a complete pass over the input,then the performance of the algorithm will be

The role of the partition(array,start,end)method in Quicksort

Introduction to Computers and Java

Java Fundamentals

Decision Structures

Loops and Files

Methods

A First Look at Classes

A First Look at Gui Applications

Arrays and the Arraylist Class

A Second Look at Classes and Objects

Text Processing and More About Wrapper Classes

Inheritance

Exceptions and Advanced File Io

Advanced Gui Applications

Applets and More

Recursion

Generics

Collections

Array-Based Lists

Linked Lists

Stacks and Queues

Binary Trees, Avl Trees, and Priority Queues

Filters

Exam 16: Sorting, Searching, and Algorithm Analysis

A computational problem is

A contiguous segment of an array is specified using two subscripts,lower and upper.Which expression gives the position of the element in the middle of the array segment?

The two criteria most often used to measure the efficiency of an algorithm are

Consider the code Static void doQuickSort(int array[ ],int start,int end){ Int pivotPoint; If (start < end){ PivotPoint = partition(array,start,end); DoQuickSort(array,start,pivot-1); DoQuickSort(array,pivot+1,end); } } In this code,the value pivotPoint returned by partition

To compare String objects for the purpose of sorting,a programmer should

The method int getPosition(int array[],int X)is designed to return the position of X within the array.If X is not in the array,the method may return either -1 or array.length.Which of the following is a correct implementation for this method?

On the average,performing a sequential search on an array of N elements will require

The best way to measure the goodness of an algorithm is

The addition of two integers

Let F be an algorithm with complexity function f(n),and let G be an algorithm with complexity function g(n).If the ratio f(n)/g(n)converges to 0 as n increases to infinity,then

An array of 4 elements is being sorted in ascending order using the insertion sort algorithm.How many comparisons will insertion sort perform if the array was originally sorted in descending order?

The Quicksort algorithm works by

Let F be an algorithm with complexity function f(n),and let G be an algorithm with complexity function g(n).If the ratio f(n)/g(n)converges to 2 as n increases to infinity,then

The Quicksort algorithm

If a[ ] is an array of integers,the pseudo code Int k = 0 Int m = 1 While m < a.length If a[m] < a[k] Then K = m End If M = m+1 End While Describes a strategy for

A basic step is

If an algorithm with an input size of n has a nested loop,and both loops make a complete pass over the input,then the performance of the algorithm will be

The role of the partition(array,start,end)method in Quicksort

Introduction to Computers and Java

Java Fundamentals

Decision Structures

Loops and Files

Methods

A First Look at Classes

A First Look at Gui Applications

Arrays and the Arraylist Class

A Second Look at Classes and Objects

Text Processing and More About Wrapper Classes

Inheritance

Exceptions and Advanced File Io

Advanced Gui Applications

Applets and More

Recursion

Generics

Collections

Array-Based Lists

Linked Lists

Stacks and Queues

Binary Trees, Avl Trees, and Priority Queues

Filters