Sp06m2 - Points off 1 2 3 4 Total off Net Score CS 307...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Points off 1 2 3 4 Total off Net Score CS 307 – Midterm 2 – Spring 2006 Name__________________________________________ UTEID login name _______________________________ TA's Name ___________________________ (Chendi or Vinod) Instructions: 1. Please turn off your cell phones 2. There are 4 questions on this test. 3. You have 2 hours to complete the test. 4. You may not use a calculator on the test. 5. When code is required, write Java code. 6. When writing methods, assume the preconditions of the method are met. 7. In coding question you may add helper methods if you wish. 8. After completing the test please turn it in to one of the test proctors and show them your UTID. 1. (2 points each, 30 points total) Short answer. Place you answers on the attached answer sheet. If the code contains a syntax error or other compile error, answer “compile error”. If the code would result in a runtime error / exception answer “Runtime error”. If the code results in an infinite loop answer “Infinite loop”. Recall that when asked for Big O your answer should be the most precise Big O function. For example Selection Sort has an average case Big O of O(N^2), but per the formal definition of Big O it is correct to say Selection Sort also has a Big O of O(N^3). I want the most precise Big O function. (Closest without going under.) A. What is the output of System.out.println( fuji(5) ); public int fuji(int n){ if( n <= 0 ) return 1; else return n + fuji( n – 1 ); } CS 307 – Midterm 2 – Spring 2006 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
B. What is the output of System.out.println( giant(8) ); public int giant(int n){ int result = 0; if( n <= 2 ) result = 1; else result = 2 + giant( n – 3 ); return result; } C. What is the output of System.out.println( trek(5) ); public int trek(int n) { if( n <= 1 ) return 3; else return 1 + trek( n – 2 ) + trek( n - 1 ); } Consider a SinglyLinkedList that uses Node objects as discussed in class. The SinglyLinkedList class has references to the first node in the list, myHead , and the last node in the list, myTail . Assume the data in every node in the list is an integer. Consider the following two methods which are instance methods in the SinglyLinkedList class. // pre: none // post: return the total of all integers in the list. public int getTotal(){ return helper(myHead, 0); } private int helper(Node n, int total){ if( n == null ) return total; else return helper( n.getNext(), total + n.getData() ); } D. Given N elements in the singly linked list what is the Big O time for method getTotal ? E. Given N elements in the singly linked list what is the Big O space for method getTotal ? CS 307 – Midterm 2 – Spring 2006 2
Background image of page 2
F. Consider the following methods for a List class. The List behaves like a List from the Java standard library as discussed in class. Method Summary
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/30/2010 for the course CS 307 taught by Professor Scott during the Spring '08 term at University of Texas.

Page1 / 18

Sp06m2 - Points off 1 2 3 4 Total off Net Score CS 307...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online