Package deal
Introduction to algorithms and the digital society
Introduction to algorithms and the digital society
[Show more]Introduction to algorithms and the digital society
[Show more]Java: Flowcharts and Algorithms 
sequence - ANSWER-order of which things should happen 
selection - ANSWER-decisions (if, else) 
case - ANSWER-like selection 
Repetition/Iteration - ANSWER-loops 
keywords for pseudocode - ANSWER-input, output, for, if-then-else, repeat-until, while, 
case, initializ...
Preview 1 out of 1 pages
Add to cartJava: Flowcharts and Algorithms 
sequence - ANSWER-order of which things should happen 
selection - ANSWER-decisions (if, else) 
case - ANSWER-like selection 
Repetition/Iteration - ANSWER-loops 
keywords for pseudocode - ANSWER-input, output, for, if-then-else, repeat-until, while, 
case, initializ...
Algorithms and Computing 
Algorithm - ANSWER-A finite set of instructions that accomplishes a task. 
Selection - ANSWER-Choosing between different paths based on a condition. 
Switch statements - ANSWER-Selecting a specific code block based on the value of a 
variable. 
Iteration - ANSWER-Repeating ...
Preview 1 out of 2 pages
Add to cartAlgorithms and Computing 
Algorithm - ANSWER-A finite set of instructions that accomplishes a task. 
Selection - ANSWER-Choosing between different paths based on a condition. 
Switch statements - ANSWER-Selecting a specific code block based on the value of a 
variable. 
Iteration - ANSWER-Repeating ...
Algorithm Design and Anlysis 
Quick sort: runs fast on the arrays that are already sorted - --False 
Quick Sort: Best-case time complexity - --Big-Theta(n) where is the number of elements 
in the array 
Quick Sort: Average-case time complexity - --O(n*logn) 
Quick Sort: Worst-case time complexity - ...
Preview 2 out of 7 pages
Add to cartAlgorithm Design and Anlysis 
Quick sort: runs fast on the arrays that are already sorted - --False 
Quick Sort: Best-case time complexity - --Big-Theta(n) where is the number of elements 
in the array 
Quick Sort: Average-case time complexity - --O(n*logn) 
Quick Sort: Worst-case time complexity - ...
AQA A-Level computer science 03 / 
Fundamentals of Algorithms 
bubble sort - ANSWER-Compares each pair of elements in the array and swaps them if 
necessary. 
O(N^2) because it passes through the array N times. Since each pass through the array 
is N operations, this is N times N operations = N^2 op...
Preview 1 out of 4 pages
Add to cartAQA A-Level computer science 03 / 
Fundamentals of Algorithms 
bubble sort - ANSWER-Compares each pair of elements in the array and swaps them if 
necessary. 
O(N^2) because it passes through the array N times. Since each pass through the array 
is N operations, this is N times N operations = N^2 op...
Module 1: Algorithms and Flowcharting 
Algorithm - --a step-by-step procedure, which defines a set of instruction to be executed 
in a certain order to get the desired output 
Software Methodology - --part of the ________________________ is to design a 
program 
Problem Solving Phase - --an algorith...
Preview 1 out of 2 pages
Add to cartModule 1: Algorithms and Flowcharting 
Algorithm - --a step-by-step procedure, which defines a set of instruction to be executed 
in a certain order to get the desired output 
Software Methodology - --part of the ________________________ is to design a 
program 
Problem Solving Phase - --an algorith...
U6 Algorithms 
Efficiency - ANSWER-A measure of how many steps are needed to complete an 
algorithm. 
Linear Search - ANSWER-A search algorithm which checks each element of a list in 
order until the desired value is found or all the elements in the list have been checked 
Binary search - ANSWER-a s...
Preview 1 out of 2 pages
Add to cartU6 Algorithms 
Efficiency - ANSWER-A measure of how many steps are needed to complete an 
algorithm. 
Linear Search - ANSWER-A search algorithm which checks each element of a list in 
order until the desired value is found or all the elements in the list have been checked 
Binary search - ANSWER-a s...
Week 1: Introduction to algorithms and the 
digital society 
What is the premise of an algorithm? (According to BBC Ideas) - ANSWER-data goes in 
- a set of instructions are followed - then a product comes out 
What does BBC Ideas say about whether or not we should be scared of algorithms? - 
ANSWER...
Preview 2 out of 8 pages
Add to cartWeek 1: Introduction to algorithms and the 
digital society 
What is the premise of an algorithm? (According to BBC Ideas) - ANSWER-data goes in 
- a set of instructions are followed - then a product comes out 
What does BBC Ideas say about whether or not we should be scared of algorithms? - 
ANSWER...
Data Science 11 - Clustering algorithms 
k-Means and variants; Initialization: 
• Randomly chooses k points from X used as the initial means 
• k-Means++: Pick initial means, such that they are uniformly distributed in the space. 
This leads to faster convergence 
k-Means and variants; Represent...
Preview 2 out of 5 pages
Add to cartData Science 11 - Clustering algorithms 
k-Means and variants; Initialization: 
• Randomly chooses k points from X used as the initial means 
• k-Means++: Pick initial means, such that they are uniformly distributed in the space. 
This leads to faster convergence 
k-Means and variants; Represent...
DFS - Input - ANSWER-a graph, G = (V, E) 
DFS- Output - ANSWER-vertices labeled with pre/post order numbers 
DFS - Runtime - ANSWER-O(|V|+|E|) 
Explore - Input - ANSWER-a graph, G = (V, E) and a starting vertex v 
Explore - Output - ANSWER-visited[u] is set to true for all vertices reachable from v ...
Preview 1 out of 2 pages
Add to cartDFS - Input - ANSWER-a graph, G = (V, E) 
DFS- Output - ANSWER-vertices labeled with pre/post order numbers 
DFS - Runtime - ANSWER-O(|V|+|E|) 
Explore - Input - ANSWER-a graph, G = (V, E) and a starting vertex v 
Explore - Output - ANSWER-visited[u] is set to true for all vertices reachable from v ...
alg quiz 
Consider the following generalization of the Activity Selection Problem: You are given a 
set of n activities each with a start time si, a finish time fi, and a weight wi. Design a 
dynamic programming algorithm to find the weight of a set of non-conflicting activities 
with maximum weight...
Preview 1 out of 4 pages
Add to cartalg quiz 
Consider the following generalization of the Activity Selection Problem: You are given a 
set of n activities each with a start time si, a finish time fi, and a weight wi. Design a 
dynamic programming algorithm to find the weight of a set of non-conflicting activities 
with maximum weight...
Algorithms - Final Study Cards 
True 
Is the following a property that holds for all non-decreasing positive functions f and g? 
(True=Yes/ False=No) 
If f(n) = O(n2) and g(n) = Theta(n2), then f(n) = O(g(n)). 
log(n3), log( n! ), 10000n2, n2log(n), 2n 
Rank the following functions by increasing ord...
Preview 2 out of 12 pages
Add to cartAlgorithms - Final Study Cards 
True 
Is the following a property that holds for all non-decreasing positive functions f and g? 
(True=Yes/ False=No) 
If f(n) = O(n2) and g(n) = Theta(n2), then f(n) = O(g(n)). 
log(n3), log( n! ), 10000n2, n2log(n), 2n 
Rank the following functions by increasing ord...
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Stuvia is a marketplace, so you are not buying this document from us, but from seller Hkane. Stuvia facilitates payment to the seller.
No, you only buy these notes for $17.49. You're not tied to anything after your purchase.
4.6 stars on Google & Trustpilot (+1000 reviews)
73918 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now