CSC 1351
Louisiana State University
All 6 results
Sort by
-
LSU CSC 1351 Exam 2 with Answers 2024/2025
- Exam (elaborations) • 2 pages • 2024
-
- $14.99
- + learn more
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...
-
CSC 1351 Test 1 Detailed Answer Test 2024/2025
- Exam (elaborations) • 4 pages • 2024
-
- $13.99
- + learn more
.txt files Answer: most portable type of data file 
 
Scanner class Answer: can be used to read .txt files 
 
PrintWriter Answer: used to write .txt files using print, println & printf 
 
S Answer: is a PrintStream object 
 
close( ); Answer: used before file reading and writing; closes a scanner 
 
FileNotFoundException Answer: this exception happens when the input for the Scanner does not exist 
 
 Answer: exceptions are a part of this cl...
-
CSC 1351 Midterm Question And Solution Paper 2024/2025
- Exam (elaborations) • 9 pages • 2024
-
- $14.99
- + learn more
obstraction Answer: (information hiding) hiding any information that is unnecessary to the user 
 
Encapsulation Answer: Grouping into a class of various objects along with their attributes and methods - meaning, grouping related items into a single unit. This helps handle more complex types of data, such as images and graphs. 
 
Principle of Least Privilege Answer: A security discipline that requires that a particular user, system, or application be given no more privile...
-
CSC 1351 Final Exam Answer-Integrated Exam 2024/2025
- Exam (elaborations) • 13 pages • 2024
-
- $14.99
- + learn more
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 ...
-
CSC 1351 Exam 1 with Answers 2024/2025
- Exam (elaborations) • 194 pages • 2024
-
- $14.99
- + learn more
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 ...
Want to regain your expenses?
-
CSC 1351 Answer-Integrated Exam 2024/2025
- Exam (elaborations) • 18 pages • 2024
-
- $14.49
- + learn more
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...
How much did you already spend on Stuvia? Imagine there are plenty more of you out there paying for study notes, but this time YOU are the seller. Ka-ching! Discover all about earning on Stuvia