Csc 1351 exam - Study guides, Class notes & Summaries

File infile = new File(""); Answer: Declare and initialize a File variable infile for the file with name Scanner in = new Scanner(infile); Answer: Declare and initialize a Scanner variable in that reads from infile String word = (); Answer: Declare and initialize a variable word with the first word from the file. (); Answer: Close the scanner. PrintWriter out = new PrintWriter(""); Answer: Declare and initialize a PrintWriter variable out ...

Give the most restrictive O(f(n)) for: 8n Answer: O(n) Give the most restrictive O(f(n)) for: 3+9n Answer: O(n) Give the most restrictive O(f(n)) for: 7log2n+20 Answer: O(log n) Give the most restrictive O(f(n)) for: 7log2n+n Answer: O(log n) Give the most restrictive O(f(n)) for: Answer: O(1) Give the most restrictive O(f(n)) for: (n^6+3n+4)(n^2+2n-1)^100 Answer: O(n^206) What is the best and worst case for selection sort? Answ...

Three examples of ADTs Answer: Arrays, Array lists, Strings Nodes consist of two items, what are they? Answer: data, next In order to delete a node you must have what? Answer: current position and previous position What is included in a linked list node? I) a reference to the next node II) an array reference III) a data element Answer: I and III insert the missing code in the following code fragment. The fragment is intended to add a new node to t...

Recursion Answer: The same computation occurs repeatedly Recursive Computation Answer: Solves a problem by using the solution to the same problem with simpler values In many cases, a recursive solution is easier to understand and implement correctly than an iterative solution Answer: True Occasionally, a recursive solution runs much slower than its iterative counterpart Answer: True In most cases, the iterative and recursive approaches have comparable ...