Help

Options

focusNode

Didn't know it?
click below

Knew it?
click below

Don't Know

Remaining cards (0)

Know

retry

shuffle

restart

0:00

Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

Normal Size Small Size show me how

Stack #4390623

Question	Answer
GCD (24,60) 16 14 18 12	12
It refers to the correctness refers to the input-output behavior of the algorithm Group of answer choices Functional Technical Process Algorithm	Functional
GCD (700,24) Group of answer choices 4 5 6 7	4
Muhammad ibn Musa al-Khwarizmi – 9th century mathematician T/F	TRUE
Program testing is the process of executing a program with the intent of finding errors. True False	True
_________ thus a sequence of computational steps that transform the input into the output.	algorithm
A sequence of computational steps that transform the input into the output. Group of answer choices Process Procedure Algorithm Steps	Algorithm
There are how many elements of a problem statement	3
______ refers to an algorithm is asserted when it is said that the algorithm is correct with respect to a specification.	correctness
Analysis of algorithms is the determination of the amount of time and space resources required to execute it. Group of answer choices True False	true
Vertices sets: a finite set V of items. Group of answer choices True False	true
Refers to rearrange the items of a given list in ascending or descending order. Group of answer choices organization group sorting union	sorting
Sorting ______ is a special piece of information used to guide sorting.	key
collection of points called vertices, some of which are connected by line segments called edges. Group of answer choices Pattern Trees Sequence Graph	graph
It is a sequence of characters from an alphabet Group of answer choices none of the above pattern series of text string	string
A sequence of n items of the same data type that are stored contiguously in computer memory and made accessible by specifying a value of the array’s index. Group of answer choices Linked list Collection Selection Array	array
Linked list is sequence of zero or more nodes each containing two kinds of information: some data and one or more links called pointers to other nodes. Group of answer choices True False	true
A sorting property that if it preserves the relative order of any two equal elements in its input Group of answer choices stability consistency firmness Performance	stability
Edges set E of vertex pairs. Group of answer choices True False	True
gcd (224,602)	4
GCD (345,12) Group of answer choices 5 3 4 6	3
A criterion where all operations to be performed must be sufficiently basic that they can be done exactly and in finite length.	effectiveness
______ refers to an algorithm is asserted when it is said that the algorithm is correct with respect to a specification.	correctness
There are how many elements of a problem statement	3
There are how many steps involved in solving computational problems Group of answer choices 9 10 12 11	9
Program testing is the process of executing a program with the intent of finding errors. Group of answer choices True False	true
________ refers to Rearrange the items of a given list in ascending or descending order.	sorting
Refers to rearrange the items of a given list in ascending or descending order. Group of answer choices organization sorting group union	sorting
Cycle A simple path of a positive length that starts and ends a the same vertex. Group of answer choices True False	true
Arrays is sequence of n items of the same data type that are stored contiguously in computer memory Group of answer choices True False	true
Adjacent Linked list is collection of linked lists, one for each vertex, that contain all the vertices adjacent to the list’s vertex. Group of answer choices True False	true
is a sorting property that does not require extra memory, except, possibly for a few memory units Group of answer choices In set in Place in Value In motion	in Place
__________ string consist of letters, numbers, and special characters.	text
collection of points called vertices, some of which are connected by line segments called edges. Group of answer choices Sequence Trees Pattern Graph	graph
_________ is a sorting property that does not require extra memory, except, possibly for a few memory units	in place
__________ A sequence of n items of the same data type that are stored contiguously in computer memory and made accessible by specifying a value of the array’s index.	array
Pseudocode gives a high-level description of an algorithm without the ambiguity associated with plain text but also without the need to know the syntax of a particular programming language. Group of answer choices True False	true
The presence of documentation helps keep track of all aspects of an application and it improves on the quality of a software product. Group of answer choices True False	true
_________ is any well-defined computational procedure that takes some value, or set of values, as input and produces some value, or set of values, as output.	algorithm
It refers to the process that a program must end finite number of steps.	finitness
A sorting property that if it preserves the relative order of any two equal elements in its input Group of answer choices firmness consistency Performance stability	stability
Sorting ______ is a special piece of information used to guide sorting. Group of answer choices application key series function	key
Process that means must be falsifiable Group of answer choices Prediction Hypothesis Evaluation Experiment	Hypothesis
__________ programming technique that terminates when a base case is recognized	recursion
__________ A powerful technique that can be used in place of iterations.	recursion
Experiments must be reproducible Group of answer choices True False	true
There are 5 scientific method use on performance and comparing algorithms Group of answer choices True False	true
__________ statement in a function calls itself repeatedly	recursion
There are how many scientific method use on performance and comparing algorithms Group of answer choices 8 5 6 7	5
Process where it terminates when the loop condition fails Group of answer choices Recursion Loops Repetition Iteration	iteration
A powerful technique that can be used in place of iterations. Group of answer choices Repetition Iteration Recursion Loops	recursion
__________ uses repetition structure	iteration
n log n, log n! is an example of that type of time complexity class Group of answer choices Quadratic Constant cubic quasilinear	quasilinear
What do you call the sum of cost x frequency for all operations Group of answer choices Total running time Frequency running time Sum running time Average running time	total running time
What is the basic operation when solving searching for key in a list of n items Group of answer choices key comparison visiting a vertex division multiplication of two numbers	key comparison
double, _int64 data type consume 8 bytes Group of answer choices True False	true
When the input size measures the matrix dimension or total number of elements what is the basic operation Group of answer choices multiplication of two numbers division key comparison visiting a vertex	multiplication of two numbers
Space Complexity = Auxiliary Space + Input space Group of answer choices True False	true
What is the basic operation when checking primality of a given integer n Group of answer choices visiting a vertex division multiplication of two numbers key comparison	division
Finding the median value in a sorted array of numbers Group of answer choices Linear Logarithmic Constant Quadratic	constant
n! is an example of that type of time complexity class Group of answer choices factorial Logarithmic Constant polynomial	factorial
n2 + n, n10 is an example of that type of time complexity class Group of answer choices Linear Constant polynomial Logarithmic	polynomial
Hypothesis must be falsifiable Group of answer choices True False	true
Space Efficiency or space complexity is the amount of memory units required by the algorithm including the memory needed for the i/p & o/p Group of answer choices True False	true
Hypothesize is a model that is consistent with the observation Group of answer choices True False	true
A process where repeating until the hypothesis and observation agree Group of answer choices Predict Hypothesize Verify Validate	validate
__________ consumes less memory	iteration
__________ A process in which a function calls itself directly or indirectly	recursion
__________ terminates when the loop condition fails	iteration
Constant is the space taken by instruction, variable and identifiers Group of answer choices True False	true
Is a count denoting number of times of execution of a statement. Group of answer choices Time Complexity CPU count Frequency count Space complexity	frequency count
1.1^n, 10^n is an example of that type of time complexity class Group of answer choices Constant exponential Logarithmic polynomial	exponential
Data Space is the amount of space used by the variables and constants Group of answer choices True False	true
Computing sine values take about how many nanoseconds Group of answer choices 15.5 17.5 19.5 13.5	13.5
This algorithmic check for the efficiency looking at the max input of n Group of answer choices none of the above best average worst	worst
n2 is an example of that type of time complexity class Group of answer choices Constant Logarithmic Quadratic Linear	quadratic
Verify means the predictions by making further observations Group of answer choices True False	true
A process in which a function calls itself directly or indirectly Group of answer choices Iteration Loops Recursion Repetition	recursion
A programming technique that makes the code smaller Group of answer choices Loops Repetition Recursion Iteration	recursion
Predict is events using the hypothesis Group of answer choices Verify Validate Hypothesize Predict	predict
indicates how fast an algorithm runs Group of answer choices Repetition Recursion Time efficiency Iteration	time efficiency
float, _int32 and unsigned long data type consume 4 bytes Group of answer choices True False	true
Adding floating point numbers takes about how many nanoseconds to compute Group of answer choices 4.7 4.8 4.6 4.9	4.6
What is the basic operation when solving searching for key in a list of n items Group of answer choices key comparison multiplication of two numbers visiting a vertex division	key comparison
In a multi-user system _____ depends on many factors such as: System load, Number of other programs running, Instruction set used and Speed of underlying hardware Group of answer choices CPU count Time Complexity Executing time Space complexity	executing time
__________ programming technique that makes the code smaller
Observe show features of the natural world Group of answer choices True False	true
A statement that repeatedly executes until the controlling condition becomes false Group of answer choices Repetition Iteration Loops Recursion	loops
Predict is events using the hypothesis Group of answer choices True False	True
Instruction Space is the amount of memory used to save the compiled version of instructions. Group of answer choices True False	true
Auxiliary Space is the extra space or the temporary space used by the algorithm during its execution. Group of answer choices True False	true
Bool, char, unsigned char data types consume size of 1 byte Group of answer choices True False	true
What is the time efficiency of the brute force string match? Group of answer choices exponential O(mn) (nm2) O(1)	O(mn)
Which is an advantage of using brute force from the following list? Group of answer choices It is neither as соnѕtruсtіvе nоr as сrеаtіvе as ѕоmе оthеr dеѕіgn tесhnіԛuеѕ It rаrеlу уіеldѕ еffісіеnt аlgоrіthmѕ Sоmе brute-fоrсе algorithms are unacceptab	It hаѕ wide applicability аnd is known for іtѕ ѕіmрlісіtу
What is the time complexity of the brute force solution? Group of answer choices O(n) O(mn) O(1) Exponential	O(mn)
Which is an advantage of using a brute force from the following list? Group of answer choices It is neither as соnѕtruсtіvе nоr as сrеаtіvе as ѕоmе оthеr dеѕіgn tесhnіԛuеѕ Sоmе brute-fоrсе algorithms are unacceptably slow It rаrеlу уіеldѕ еffісіеnt а	It уіеldѕ rеаѕоnаblе аlgоrіthmѕ for some іmроrtаnt problems, such as searching, string mаtсhіng, аnd matrix multiplication
How many sub-arrays does selection sort maintains? Group of answer choices 2 5 4 3	2
Compares a given pattern with all substrings of a given text. Group of answer choices Brute force string matching Brute force None of the above selection sort	Brute force string matching
Complete the code snippet below, pseudocode of brute force string for i ← to n-m do j ← 0 while j<m and P[j} = T[i+j] do _________ if j=m return i return -1 Group of answer choices J <- j * 1 J <- j / 1 J <- j +1 J<- j - 1	J <- j +1
This approach is used in real-world decision-making processes in a wide variety of fields, such as finding the least wasteful way to cut raw materials, selection of investments and portfolios Group of answer choices Dynamic programming Knapsack problem	Knapsack problem
This approach is an example of combinatorial optimization. Group of answer choices Dynamic programming Traveling Salesman Brute force Knapsack problem	Knapsack problem
A brute force problem that has to visit each one of the cities starting from a certain one (e.g. the hometown) and returning to the same city. Group of answer choices Traveling Traveling man Traveling Around Traveling Salesman	Traveling Salesman
It derives its name from the problem faced by someone who is constrained by a fixed-size backpack and must fill it with the most valuable items. Group of answer choices Dynamic programming Traveling Salesman Brute force Knapsack problem	Knapsack problem
There are how many steps in the selection sort algorithm Group of answer choices 6 5 7 4	5
Compares a given pattern with all substrings of a given text. Group of answer choices Brute force string matching Brute force selection sort None of the above	Brute force string matching
In the given code snippet below, pseudocode of brute force string, what does m represents? for i ← to n-m do j ← 0 while j<m and P[j} = T[i+j] do _________ if j=m return i __________ Group of answer choices characters representing	characters representing a pattern
What is the other term use to describe brute force? Group of answer choices Full search In-depth search Extensive search Exhaustive Search	Exhaustive search
The 0-1 Knapsack problem can be solved using Greedy algorithm Group of answer choices False True	false
What is the time complexity of the brute force algorithm used to solve the Knapsack problem? Group of answer choices O(n) O(1) O(2^n) Exponential	O(2^n)
It refers to the general problem-solving technique and algorithmic paradigm that consists of systematically enumerating all possible candidates for the solution and checking whether each candidate satisfies the problem's statement.	Brute force
Compares a given pattern with all substrings of a given text. Group of answer choices Brute force string matching Brute force None of the above selection sort	Brute force string matching
The searching phase in quick search algorithm has good practical behaviour. Group of answer choices False True No answer text provided. No answer text provided.	True
______ is an algorithm compares the pattern to the text, one character at a time, until un-matching characters are found: Group of answer choices Divide and conquer Dynamic programming Transform and conquer Brute force	brute force
An algorithm that calculate the total distance for every possible route and then select the shortest one. Group of answer choices Divide and Conquer Greedy Dynamic Programming Exhaustive Search	Exhaustive Search
It refers to an algorithm that is an effective method that can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a function. Group of answer choices Divide and Conquer Brute force Dynamic Prog	brute force
Refers to a string of M characters to search for Group of answer choices string pattern text string matching	pattern
Given input string = “THIS IS A TEST TEXT” and pattern string = “TEXT”. Find the first index of the pattern match using quick search algorithm Group of answer choices 14 15 16 17	15
The Knapsack problem is an example of ____________ Group of answer choices Transform and conquer Greedy Brute Force Divide and Conquer	Brute Force
It generates a list of all potential solutions to the problem in a systematic manner evaluate potential solutions one by one, disqualifying infeasible ones Group of answer choices Dynamic programming Brute force Traveling Salesman Divide and Conquer	Brute Force
A process there it involves searching for an element with a special property, usually among combinatorial objects such as permutations, combinations, or subsets of a set. Group of answer choices Dynamic programming Traveling Salesman Brute force Divi	Brute Force
Which of the following sorting algorithms has the lowest worst-case complexity? Group of answer choices Merge Sort Insertion Sort Bubble Sort Quick Sort	Merge Sort
A binary search is to be performed on the list: 1 5 10 13 48 68 100 101 How many comparisons would it take to find number 101? Group of answer choices C 1-2 0-1 3-4 4-5	3-4
Quick Sort can be categorized into which of the following? Group of answer choices Greedy Algorithm Divide and Conquer Dynamic Programming Decrease and Conquer	divide and Conquer
Which of the following is true about merge sort? Group of answer choices Merge Sort works better than quick sort if data is accessed from slow sequential memory. Merge Sort is stable sort by nature All of the above Merge sort outperforms heap sort in	All of the above
What do you call the step that receives a lot of smaller sub-problems to be solved. Group of answer choices Solve Crack Answer Rejoin	solve
What is the correct formula use in binary search Group of answer choices mid = low + (high - low) / 2 mid = low * (high - low) / 2 mid = low + (high + low) / 2 mid = low - (high - low) / 2	mid = low + (high - low) / 2
Merge Sort can be categorized into which of the following? Group of answer choices Greedy Algorithm Dynamic Programming Divide and Conquer Decrease and Conquer	Divide and Conquer
What is the time complexity of quick sort for average case? Group of answer choices O (n log n) Exponential O (1) O (n^2)	O (n log n)
Binary search is similar to that methodology? Group of answer choices Dynamic Programming Divide and Conquer Greedy Algorithm Decrease and Conquer	Divide and Conquer
Sorting Algorithm that looks for a particular item by comparing the middle most item of the collection Group of answer choices Quick Bubble Merge Binary	Binary
When computing for p3 what the exact formula is? Group of answer choices p3=(c/d)e p3=(cd)e p3=(c+d)e p3=(c-d)+e	p3=(c + d)e
Strassen’s Matrix Algorithm was proposed by _____________ Group of answer choices Virginia Williams Andrew Strassen Victor Jan Volker Strassen	Volker Strassen
When computing for p2 what the exact formula is? Group of answer choices p2=(a+b)h p2=(a+b)h p2=(a+b)h p2=(a+b)h	p2 = (a + b) h
When computing for p7 what the exact formula? Group of answer choices p7=(a-c)+(e+f) p7=(a*c)(e+f) p7=(a-c)+(e-f) p7=(a-c)(e+f)	p7 = (a - c)(e + f)
Which of the following areas do closest pair problem arise? Group of answer choices computational geometry numerical problems string matching graph colouring problems	computational geometry
When computing for p4 what the exact formula? Group of answer choices p4=d(g-e) p4=d+(g-e) p4=d+(g+e) p4=d-(g+e)	p4 = d(g - e)
What is the best time complexity of Strassen algorithm Group of answer choices O (1) Exponential O(n^2) O(n^2.8074)	O(n^2.8074)
What is the running time of naïve matrix multiplication algorithm? Group of answer choices O(n) O(n^3) O(n^2.8074) O(n^4)	(n^3)
There are how many steps in the closest pair algorithm? Group of answer choices 7 8 9 6	7
It is a highly efficient sorting algorithm and is based on partitioning of array of data into smaller arrays Group of answer choices Bubble Sort Merge Sort Quick Sort Insertion Sort	Quick Sort
In this searching algorithm, it is mandatory for the target array to be sorted Group of answer choices Binary Quick Merge Bubble	Binary
Select the best description to explain what a binary search algorithm is Group of answer choices Elements do not need to be in order, compare to the middle value, split the list in order and repeat Elements do not need to be in order, check each item i	Put the elements in order, compare with the middle value, split the list in order and repeat
What is the auxiliary space complexity of merge sort? Group of answer choices O(n) O(n log n) O(1) Exponential	O(n)
A binary search is to be performed on the list: 3 5 9 10 123 How many comparisons would it take to find number 9? Group of answer choices 6-7 2-3 0-1 4-5	0-1
What do you call the sorting technique that divides the array into equal halves and then combines them in a sorted manner? Group of answer choices Bubble Sort Quick Sort Merge Sort Insertion Sort	Merge Sort
What do you call the step in the Divide and conquer approach that involves breaking the problem into smaller sub-problems? Group of answer choices Break Halt Collapse Breakdown	Break
Is the first geometric problems that were treated at the origins of the systematic study of the computational complexity of geometric algorithms. Group of answer choices Binary Search Closest Pair Merge sort Strassen Algo	Closest Pair
A method that compute its problem of computational geometry. Group of answer choices Merge sort Strassen Algo Closest Pair Binary Search	Closest Pair
What is the basic operation of closest pair algorithm using brute force technique? Group of answer choices Area Euclidean distance Manhattan distance Radius	Euclidean distance
The Strassen algorithm is named after? Group of answer choices Vilker Strassen Volkar Strassen Volker Strassen Victor Strassen	Volker Strassen
Strassen’s matrix multiplication algorithm follows ___________ technique. Group of answer choices Dynamic Backtracking Dynamic Divide and Conquer	Divide and Conquer
A method that easily modified to find the points with the smallest distance Group of answer choices Merge sort Binary Search Strassen Algo Closest Pair	Closest Pair
What year did Strassen published his algorithm that proves the n3 general matrix multiplication was not optimal? Group of answer choices 1968 1970 1967 1969	1969
Strassen’s algorithm is a/an_____________ algorithm. Group of answer choices Accurate Recursive Non-recursive Approximation	Recursive
Problem solving approach where the problem in hand, is divided into smaller sub-problems and then each problem is solved independently. Group of answer choices Greedy Algorithm Decrease and Conquer Dynamic Programming Divide and Conquer	Divide and Conquer
What is the optimal time required for solving the closest pair problem using divide and conquer approach? Group of answer choices O(n!) Exponential O(1) O(n log n)	O(n log n)
The Strassen algorithm is known as a? Group of answer choices Matrix multiplication Matrix Division Matrix subtraction Matrix Addition	matrix multiplication
When computing for p1 what is the exact formula? Group of answer choices p1=(c+d)e p1=a(a-b)h p1=a(f-h) p1=d(g-e)	p1 = (c + d)e
Which of the following method is used for sorting in merge sort? Group of answer choices selection merging partitioning D exchanging	Merging
What is the worst-case time complexity of Merge sort? Group of answer choices O (1) Exponential O (n log n) O (n2)	O (n log n)
What is the space complexity of Strassen algorithm Group of answer choices Exponential O(n^2) A O (log n) O(n^2.8074)	O(n^2)
What is the space complexity of quick sort? Group of answer choices O (n^2) O (n log n) Exponential O (1)	O (n log n)
What is the formula use in the binary search if a new mid value needs to be set.	low = mid + 1; mid = low + (high - low) / 2
What is the average-case time complexity of Merge sort? Group of answer choices Exponential O (n2) O (1) O (n log n)	O (n log n)
Using brute force algorithm in solving Strassen algorithm how many multiplication and addition are required? Group of answer choices 6 multiplication 6 addition 8 multiplication 6 addition 6 multiplication 4 addition 8 multiplication 4 addition	8 multiplication 4 addition
How many recursive calls it will take to solve the Strassen Algorithm? Group of answer choices 6 7 9 8	7
What is the time complexity of quick sort for best case? Group of answer choices O (n^2) O (n log n) O (1) Exponential	O (n log n)
What is the worse time complexity of Strassen algorithm Group of answer choices O(n^3.8074) O(n^2.8074) O(n^3.8974) O(n^2.8974)	O(n^2.8074)
What is the time complexity of binary search? Group of answer choices Exponential O (n log) O (1) O (n^2)	O (n log)
What was the algorithm that Strassen algorithm was compared which resulted to a faster matrix multiplication? Group of answer choices Coppersmith algorithm Smith-Winograd algorithm Copper Winograd algorithm Coppersmith-Winograd algorithm	Coppersmith-Winograd algorithm
What is the time complexity of quick sort for worse case? Group of answer choices Exponential O (1) O (n log n) O (n^2)	O (n^2)
What is the worse time complexity of Strassen algorithm Group of answer choices O(n^3.8974) O(n^3.8074) O(n^2.8074) O(n^2.8974)	O(n^2.8074)
What is the best time complexity of Strassen algorithm Group of answer choices O(n^2) Exponential O (1) O(n^2.8074)	O(n^2.8074)
What is the optimal time required for solving the closest pair problem using divide and conquer approach? Group of answer choices O(n log n) O(1) Exponential O(n!)	O(n log n)
When computing for p3 what the exact formula is? Group of answer choices p3=(c+d)e p3=(c-d)+e p3=(cd)e p3=(c/d)e	p3=(c+d)e
What is the average-case time complexity of Merge sort? Group of answer choices O (n2) O (1) O (n log n) Exponential	O (n log n)
In divide and conquer, the time is taken for merging the subproblems is? Group of answer choices Exponential O(n log n) O(n!) O(1)	O (n log n)
In divide and conquer, the time is taken for merging the subproblems is? Group of answer choices O(n!) Exponential O(n log n) O(1)	O(n log n)
What is the space complexity of Strassen algorithm Group of answer choices O(n^2.8074) O(n^2) A O (log n) Exponential	A O (log n)

Created by: user-1925923

"Know" box contains:
Time elapsed:
Retries: