Help
Options
Didn't know it?
click below
click below
Knew it?
click below
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
Normal Size Small Size show me how
Algorithm
| Question | Answer |
|---|---|
| Process where it terminates when the loop condition fails | Iteration |
| A powerful technique that can be used in place of iterations. | Recursion |
| Hypothesis must be falsifiable | True |
| Process that means must be falsifiable | Hypothesis |
| Verify means the predictions by making further observations | True |
| Predict is events using the hypothesis | Predict |
| n3 is an example of that type of time complexity class | cubic |
| n2 + n, n10 is an example of that type of time complexity class | polynomial |
| There are 5 scientific method use on performance and comparing algorithms | True |
| __________ programming technique that terminates when a base case is recognized | recursion |
| n! is an example of that type of time complexity class | factorial |
| Constant is the space taken by instruction, variable and identifiers | True |
| n log n, log n! is an example of that type of time complexity class | quasilinear |
| Hypothesize is a model that is consistent with the observation | True |
| Experiments must be reproducible | True |
| __________ terminates when the loop condition fails | iteration |
| n3 is an example of that type of time complexity class | cubic |
| Instruction Space is the amount of memory used to save the compiled version of instructions. | True |
| Finding the smallest or largest item in an unsorted array | Linear |
| This algorithmic check for the efficiency looking at the max input of n | worst |
| Is a count denoting number of times of execution of a statement. | Frequency count |
| Data Space is the amount of space used by the variables and constants | True |
| Space Complexity = Auxiliary Space + Input space | True |
| A programming technique that makes the code smaller | Recursion |
| A process in which a function calls itself directly or indirectly | Recursion |
| Validate means repeating until the hypothesis and observation agree | True |
| What is the basic operation when solving for graph problems | visiting a vertex |
| What is the basic operation when solving searching for key in a list of n items | key comparison |
| Time efficiency or time complexity indicates how fast an algorithm runs | True |
| __________ A statement that repeatedly executes until the controlling condition becomes false. | Iteration |
| n2 is an example of that type of time complexity class | Quadratic |
| double, _int64 data type consume 8 bytes | True |
| Auxiliary Space is the extra space or the temporary space used by the algorithm during its execution. | True |
| _int16, short, unsigned short consume 2 bytes | True |
| What do you call the sum of cost x frequency for all operations | Total running time |
| A process where repeating until the hypothesis and observation agree | Validate |
| Finding the median value in a sorted array of numbers | Constant |
| 1.1n, 10n is an example of that type of time complexity class | exponential |
| float, _int32 and unsigned long data type consume 4 bytes | True |
| Bool, char, unsigned char data types consume size of 1 byte | True |
| __________ statement in a function calls itself repeatedly | recursion |
| __________ A process which breaks a task into smaller subtasks | recursion |
| When the input size measures the matrix dimension or total number of elements what is the basic operation | multiplication of two numbers |
| Computing sine values take about how many nanoseconds | 13.5 |
| 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 | Executing time |
| __________ uses repetition structure | iteration |
| Observe show features of the natural world | True |
| Environmental Stack is the current variables are pushed onto the system stack, where they wait for further execution and then the call to the inside algorithm(function) is made. | True |
| __________ programming technique that makes the code smaller | recursion |
| 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 | True |
| Binary Search belongs in what class. | Logarithmic |
| What is the basic operation when checking primality of a given integer n | division |
| 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. | True |
| GCD (700,24) | 4 |
| It refers to a sequence of unambiguous instructions for solving a problem | Algorithm |
| Refers to rearrange the items of a given list in ascending or descending order. | sorting |
| A sorting property that if it preserves the relative order of any two equal elements in its input | stability |
| A criterion where all operations to be performed must be sufficiently basic that they can be done exactly and in finite length | Effectiveness |
| The presence of documentation helps keep track of all aspects of an application and it improves on the quality of a software product. | True |
| Analysis of algorithms is the determination of the amount of time and space resources required to execute it. | True |
| It refers to the correctness refers to the input-output behavior of the algorithm | Functional |
| Queue uses FIFO / LILO approach. | True |
| Finding a given value, called a search key, in a given set. | searching |
| Cycle A simple path of a positive length that starts and ends a the same vertex. | True |
| searching for a given word/pattern in a text | String Matching |
| Model development is an __________ process | Iterative |
| There are how many elements of a problem statement | 3 |
| Program testing is the process of executing a program with the intent of finding errors. | True |
| Muhammad ibn Musa al-Khwarizmi – 9th century mathematician | True |
| There are how many steps involved in solving computational problems | 9 |
| Ordered Tree is a rooted tree in which all the children of each vertex are ordered | True |
| Adjacent Linked list is collection of linked lists, one for each vertex, that contain all the vertices adjacent to the list’s vertex. | True |
| string consist of letters, numbers, and special characters. | text string |
| Edges set E of vertex pairs. | True |
| Arrays is sequence of n items of the same data type that are stored contiguously in computer memory | True |
| It is a sequence of characters from an alphabet | String |
| Connected components is the maximum connected subgraph of a given graph. | 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. | finiteness |
| It refers to the process that a program must end finite number of steps. | finiteness |
| collection of points called vertices, some of which are connected by line segments called edges. | Graph |
| __________ is a sorting property that if it preserves the relative order of any two equal elements in its input. | stability |
| __________ is finding a given value, called a search key, in a given set. | searching |
| __________ is a collection of points called vertices, some of which are connected by line segments called edges. | graph |
| __________ string consist of letters, numbers, and special characters. | text |
| __________ is a sequence of characters from an alphabet | string |
| ______ refers to an algorithm is asserted when it is said that the algorithm is correct with respect to a specification. | correctness |
| GCD (345,12) | 3 |
| 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 an algorithm is asserted when it is said that the algorithm is correct with respect to a specification | Correctness |
| GCD (224,602) | 14 |
| Sorting ______ is a special piece of information used to guide sorting. | key |
| ________ refers to Rearrange the items of a given list in ascending or descending order. | sorting |
| __________ 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 |
| is a sorting property that does not require extra memory, except, possibly for a few memory units | in place |
| A sequence of computational steps that transform the input into the output. | algorithm |
| GCD (2344,1231) | 1 |
| __________ string consist of letters, numbers, and special characters. | text |
| GCD (24,60) | 12 |
Created by:
XiuElias26