- Study guides, Class notes & Summaries
Looking for the best study guides, study notes and summaries about ? On this page you'll find 8 study documents about .
8 results
Exam (elaborations)
UCF Foundation Exam with Questions and Answers
UCF Foundation Exam with Questions and Answers 
 
Injective Function (one-to-one) ANSWER f(a) = f(b) -> (a=b) for all a & b in domain f 
Never more than one incoming arrow, but not always an arrow from left to all of right values 
if A ->B then |A| <= |B| 
 
Surjective (onto) ANSWER For all b in B, there exists an a in A such that f(a) = b 
Multiple arrows can go to an ANSWER on the right, and every value on right will have an arrow going to it. 
if A->B then |A|>=|B| 
 
Bijec...
Exam (elaborations)
UCF Foundation Exam Prep with Questions and Answers
PopularUCF Foundation Exam Prep with Questions and Answers 
 
Rand Function ANSWER srand(time(0); 
 
rand() % (max_number + 1 - minimum_number) + minimum_number 
 
Sorting Algorithms ANSWER Selection: 
- find minimum element and swap with beginning. Increase array by one 
 
Bubble: 
- Go through entire row and swap if the number is greater than the next 
- repeat from the beginning over and over until everything is sorted 
 
Insertion: 
- compare next 2 numbers and if the right one is less, slide ...
Exam (elaborations)
UCF Foundation Exam (Computer Science) QUESTIONS WITH Correct Answers
NewInjective Function (one-to-one) - ANSWERSf(a) = f(b)->(a=b) for all a & b in domain f 
Never more than one incoming arrow, but not always an arrow from left to all of right values 
If A->B then |A|<=|B| 
 
Surjective (onto) - ANSWERSFor all b in B, there exists an a in A such that f(a) = b 
Multiple arrows can go to an answer on the right, and every value on right will have an arrow going to it. 
if A->B then |A|>=|B| 
 
Bijective - ANSWERSBoth injective and Surjective. One-to-one...
Exam (elaborations)
UCF Foundation Big-Oh Runtimes Exam with Questions and Answers
UCF Foundation Big-Oh Runtimes Exam with Questions and Answers 
 
Head insert - Linked List - w/o tail pointer ANSWER O(1) 
 
Head insert - Linked List - w/ tail pointer ANSWER O(1) 
 
Tail insert - Linked List - w/o tail pointer ANSWER O(n) 
 
Tail insert - Linked List - w/ tail pointer ANSWER O(1) 
 
Head delete - Linked List - w/o tail pointer ANSWER O(1) 
 
Head delete - Linked List - w/ tail pointer ANSWER O(1) 
 
Tail delete - Singly Linked List - w/o tail pointer ANSWER O(n) 
 
Tai...
Exam (elaborations)
UCF foundation Exam prep with Complete Solutions
UCF foundation Exam prep with Complete Solutions 
 
Worst case Selection sort ANSWER O(n^2) 
 
worst case bubble sort ANSWER Bubble sort has a worst-case and average complexity of О(n2) 
 
Reccurence relation for merge ANSWER T(0) = T(1) = c1 
T(n) = 2T(n/2) + O(n) (for n > 1) 
 
best case Finding the maximum value in an unsorted linked list of n elements ANSWER O(n) 
 
best case Inserting an item into a binary search tree of n elements ANSWER O(1) 
 
best case Inserting an item into a ...
Exam (elaborations)
UCF Foundation Exam (Pass or Die Edition) with Questions and Answers
UCF Foundation Exam (Pass or Die Edition) with Questions and Answers 
 
Best Runtime of Bubble Sort ANSWER O(n) 
 
Worst Runtime of Bubble Sort ANSWER O(n^2) 
 
Average Runtime of Bubble Sort ANSWER O(n^2) 
 
Best Runtime of Selection Sort ANSWER O(n^2) 
 
Worst Runtime of Selection Sort ANSWER O(n^2) 
 
Average Runtime of Selection Sort ANSWER O(n^2) 
 
Best Runtime of Insertion Sort ANSWER O(n) 
 
Worst Runtime of Insertion Sort ANSWER O(n^2) 
 
Average Runtime of Insertion Sort ANSWER...
Package deal
UCF Bundled Exams and Study Guides 2024/2025 with complete solutions
UCF Bundled Exams and Study Guides 2024/2025 with complete solutions
Exam (elaborations)
UCF Foundation Exam Questions And Answers With Verified Solutions Graded A+
Average Runtime of Bubble Sort - O(n^2) 
Average Runtime of Insertion Sort - O(n^2) 
Average Runtime of Selection Sort - O(n^2) 
Best Case Runtime for BST Search, Insertion, and Deletion - O(log n) 
Best Case Runtimes for AVL Tree Search, Insertion and Deletion - O(log n) 
Best Runtime of Bubble Sort - O(n) 
Best Runtime of Insertion Sort - O(n) 
Best Runtime of Selection Sort - O(n^2) 
Equation for Linear Probing - index = (hVal + i) % h->TABLE_SIZE; 
Equation for Quadratic Probing - index =...