- Guías de estudio, Notas de estudios & Resúmenes

Coen 12 Final Questions With 100% Correct Answers

-

9 páginas

Escrito en 2025/2026

Grado A+

TestITandFixIT

COEN 12 FINAL EXAM BIG-O RUNTIMES ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS Selection Sort - Answer -Best Case: O(n^2) Average Case: O(n^2) Worst Case: O(n^2) Stability: Depends Heap Sort - Answer -Best Case: O(nlogn) Average Case: O(nlogn) Worst Case: O(nlogn) Stability: Unstable

-

3 páginas

Escrito en 2024/2025

Grado A+

AdelineJean

Coen 12 Better Questions With 100% Correct Answers

-

19 páginas

Escrito en 2025/2026

Grado A+

TestITandFixIT

Coen 12 Final Exam Big-O Runtimes Questions With 100% Correct Answers

-

5 páginas

Escrito en 2025/2026

Grado A+

TestITandFixIT

Coen 12 Final Exam Questions With 100% Correct Answers

-

18 páginas

Escrito en 2025/2026

Grado A+

TestITandFixIT

Coen 12 Midterm 1 Questions With 100% Correct Answers

-

7 páginas

Escrito en 2025/2026

Grado A+

TestITandFixIT

Package Deal::: Coen 12 Exams 2025/2026 Questions And 100% Correct Answers

-

6 artículos

mercylynneh

COEN 12 MIDTERM 1 ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS ADT - Answer -Encapsulate Data and Operations on Data, static ADTs so far? - Answer -Set & Bag Big O - Answer -analyzes the complexity of the code Big O rules - Answer -Take the highest growing factor and drop everything else. sequential search algorithm - Answer -loop through the whole set and search for element sequential search big o - Answer -O(n) Binary Search Algorithm - Answer -takes mid point and compares an...

-

3 páginas

Escrito en 2024/2025

Grado A+

mercylynneh

COEN 12 MIDTERM 2 ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS List - Answer -unordered collection of items, not necessarily distinct (other ADT outside of SET and BAG) Types of List - Answer -1. stacks 2. queue How to search a List - Answer --indexing -name/id/key -position Stack - Answer --linear list with all additions and deletions restricted to one end (top) -insert: push -remove/delete: pop -obeys last in first out (LIFO) -uses an array When to Use Stack - Answer -Wh...

-

37 páginas

Escrito en 2024/2025

Grado A+

mercylynneh

COEN 12 FINAL EXAM BIG-O RUNTIMES ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS Selection Sort - Answer -Best Case: O(n^2) Average Case: O(n^2) Worst Case: O(n^2) Stability: Depends Heap Sort - Answer -Best Case: O(nlogn) Average Case: O(nlogn) Worst Case: O(nlogn) Stability: Unstable Insertion Sort - Answer -Best Case: O(n) Average Case: O(n^2) Worst Case: O(n^2) Stability: Stable Shell Sort - Answer -Best Ca

-

3 páginas

Escrito en 2024/2025

Grado A+

mercylynneh

COEN 12 FINAL EXAM ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS What is the run-time efficiency of the following program? for(i = 1; i <= n; i++) printf("%d", i); - Answer -O(n) Calculate the run-time efficiency of the following program segment for(i = 1; i <= n; i++) for(j = 1; j <= n; j++) for(k = 1; k <= n; k++) printf("%d %d %dn", i, j, k); - Answer -O(n^3) If the algorithm doIT has an efficiency factor of 5n, calculate the runtime efficiency of ...

-

8 páginas

Escrito en 2024/2025

Grado A+

mercylynneh

COEN 12 EXAM ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS O(1) Constant: The number of times that a code passes through is not reliant on a number n Example: int getFirstElement(const std::vector<int>& arr) { return arr[0]; } int main() { std::vector<int> numbers = {5, 12, 9, 2, 17, 6}; int result = getFirstElement(numbers); std::cout << "The first element is: " << result << std::endl; return 0; }O(logn) Logarithmic: The number of times ...

-

12 páginas

Escrito en 2024/2025

Grado A+

mercylynneh

COEN 12 FINAL EXAM ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS What is the run-time efficiency of the following program? for(i = 1; i <= n; i++) printf("%d", i); - Answer -O(n) Calculate the run-time efficiency of the following program segment for(i = 1; i <= n; i++) for(j = 1; j <= n; j++) for(k = 1; k <= n; k++) printf("%d %d %dn", i, j, k); - Answer -O(n^3) If the algorithm doIT has an efficiency factor of 5n, calculate the runtime efficiency of ...

-

8 páginas

Escrito en 2024/2025

Grado A+

mercylynneh

Bundle For Coen 12 Exams 2025/2026 Q&A 100% Pass

-

6 artículos

AdelineJean

COEN 12 MIDTERM 1 ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS ADT - Answer -Encapsulate Data and Operations on Data, static ADTs so far? - Answer -Set & Bag Big O - Answer -analyzes the complexity of the code Big O rules - Answer -Take the highest growing factor and drop everything else. sequential search algorithm - Answer -loop through the whole set and search for element sequential search big o - Answer -O(n) Binary Search Algorithm - Answer -takes mid point and compares an...

-

3 páginas

Escrito en 2024/2025

Grado A+

AdelineJean

COEN 12 MIDTERM 2 ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS List - Answer -unordered collection of items, not necessarily distinct (other ADT outside of SET and BAG) Types of List - Answer -1. stacks 2. queue How to search a List - Answer --indexing -name/id/key -position Stack - Answer --linear list with all additions and deletions restricted to one end (top) -insert: push -remove/delete: pop -obeys last in first out (LIFO) -uses an array When to Use Stack - Answer -Wh...

-

37 páginas

Escrito en 2024/2025

Grado A+

AdelineJean

COEN 12 FINAL EXAM ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS What is the run-time efficiency of the following program? for(i = 1; i <= n; i++) printf("%d", i); - Answer -O(n) Calculate the run-time efficiency of the following program segment for(i = 1; i <= n; i++) for(j = 1; j <= n; j++) for(k = 1; k <= n; k++) printf("%d %d %dn", i, j, k); - Answer -O(n^3) If the algorithm doIT has an efficiency factor of 5n, calculate the runtime efficiency of ...

-

8 páginas

Escrito en 2024/2025

Grado A+

AdelineJean

COEN 12 EXAM ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS O(1) Constant: The number of times that a code passes through is not reliant on a number n Example: int getFirstElement(const std::vector<int>& arr) { return arr[0]; } int main() { std::vector<int> numbers = {5, 12, 9, 2, 17, 6}; int result = getFirstElement(numbers); std::cout << "The first element is: " << result << std::endl; return 0; }O(logn) Logarithmic: The number of times ...

-

12 páginas

Escrito en 2024/2025

Grado A+

AdelineJean

COEN 12 FINAL EXAM ACTUAL 2025/2026 QUESTIONS AND 100% CORRECT ANSWERS What is the run-time efficiency of the following program? for(i = 1; i <= n; i++) printf("%d", i); - Answer -O(n) Calculate the run-time efficiency of the following program segment for(i = 1; i <= n; i++) for(j = 1; j <= n; j++) for(k = 1; k <= n; k++) printf("%d %d %dn", i, j, k); - Answer -O(n^3) If the algorithm doIT has an efficiency factor of 5n, calculate the runtime efficiency of ...

-

8 páginas

Escrito en 2024/2025

Grado A+

AdelineJean

ADT - CORRECT ANSWER - Encapsulate Data and Operations on Data, static ADTs so far? - CORRECT ANSWER - Set & Bag Big O - CORRECT ANSWER - analyzes the complexity of the code Big O rules - CORRECT ANSWER - Take the highest growing factor and drop everything else. sequential search algorithm - CORRECT ANSWER - loop through the whole set and search for element sequential search big o - CORRECT ANSWER - O(n) Binary Search Algorithm - CORRECT ANSWER - takes mid point and compares and then cut...

-

2 páginas

Escrito en 2024/2025

Grado A+

Brainarium