CSIT 211 Final Exam Questions with Correct Answers

CSIT 211 Final Exam Questions with Correct Answers An algorithm has liner time complexity and can process an input of size n in a certain amount of time. If algorithm runs on a computer that has a processor that is 5 times as fast, how large of an input can be processed in the same amount of time - Answer-5n Big â " Oh notation establishes a(n) ____________ on a growth function - Answerupper bound Which of the following is a true statement? - Answer-All of the above are true. A linked list can hold ______ nodes - Answer-any number of The queue operation that returns the element after the element at the front of the queue (that is, the second element in the queue) without removing the element at the front of the queue, is ________. - Answer-none of these is correct Which of the following statements best describes this line of code? numbers[5] = 12; - Answer-The value 12 is put into the numbers array at the location with index 5. The first operation of a queue is similar to the ______ operation of a stack - Answerpeek A(n) _____________________ is a data structure that uses object reference variables to create links between objects. - Answer-link structure Recursion occurs when - Answer-a method calls itself A queue is a ____________________ data structure. - Answer-FIFO Which of the following statements is generally true about a linked list implementation of a queue? - Answer-The linked list implementation of a queue maintains references to both ends, the front and the rear, of the linked list. A _______________ search is more efficient than a linear search. - Answer-binary A stack is the ideal collection to use when _______________________ - Answerevaluating a postfix expression The List ADT (Abstract Data Type) provides how many operations to remove an element from a list? - Answer-3 The commitment to execute certain code to carry out a method invocation is referred to as _________________. - Answer-execution When adding elements to an ordered list, the elements are ordered according to - Answer-the order of the calls to the add operation to add them to the list. As with queues and stacks, the first step in removing an element from a list collection is to - Answer-determine if the element is in the first or the last position in the collection. In an array implementation of a stack, we can include code that will automatically allocate more memory if every element of the array is occupied. Which stack operation should invoke this code? - Answer-None of the above A __________________ search looks through the search pool one element at a time. - Answer-linear In Java, a(n) ___________________ is a collection of constants and abstract methods. - Answer-abstract class A Stack interface is defined and has an isEmpty() abstract method. What should this method return? - Answer-a double representing the average of the values of the items in the stack A self-referential object is an object that - Answer-has a pointer to another object of the same type Which of the following is a method in the .List interface? - Answer-addBefore Suppose we have an array of String objects identified by the variable names. Which of the following for loops will not correctly process each element in the array. - Answerfor(String name : names) ____________ is the process of catching an exception in the chain of method calls from the method where the exception occurred up to the main method. - Answer-Error handling The Comparable interface contains which of the following methods? - AnswercompareTo The Exception class and the Error class are subclasses of the ___________________ class. - Answer-Catchable A double-ended queue allows - Answer-adding elements at one end and removing them from both ends ________ can be used to sort the same set of objects in multiple ways - AnswerComparator objects Which of the following is a valid declaration for a two-dimensional array? - Answer-int[][] matrix; Which of the following situations could be implemented using a Stack? - Answer-a person who wants to un-do several ch