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
ALGO FA1 & 2
| Question | Answer |
|---|---|
| Muhammad ibn Musa al-Khwarizmi – 9th century mathematician | TRUE |
| Analysis of algorithms is the determination of the amount of time and space resources required to execute it. | TRUE |
| _________ is a sequence of unambiguous instructions for solving a problem. | algorithm |
| _________ thus a sequence of computational steps that transform the input into the output. | algorithm |
| " GCD (700,24)" | 4 |
| ______ 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 |
| A criterion where all operations to be performed must be sufficiently basic that they can be done exactly and in finite length. | effectiveness |
| " A sequence of computational steps that transform the input into the output." | algorithm |
| " GCD (24,60)" | 12 |
| "Adjacent Linked list is collection of linked lists, one for each vertex, that contain all the vertices adjacent to the list’s vertex." | TRUE |
| 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. | TRUE |
| " __________ searching for a given word/pattern in a text" | string matching |
| " Sorting ______ is a special piece of information used to guide sorting." | key |
| " A sorting property that if it preserves the relative order of any two equal elements in its input" | stability |
| " Finding a given value, called a search key, in a given set." | sorting |
| " Edges set E of vertex pairs." | TRUE |
| __________ is a collection of points called vertices, some of which are connected by line segments called edges. | graph |
| Model development is an __________ process. | iterative |
| Program testing is the process of executing a program with the intent of finding errors. | TRUE |
| GCD (345,12) | 3 |
| " There are how many steps involved in solving computational problems" | 9 |
| 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 |
| " It is a sequence of characters from an alphabet" | TRUE |
| " Connected components is the maximum connected subgraph of a given graph." | string |
| " Cycle simple path of a positive length that starts and ends a the same vertex." | TRUE |
| Queue uses FIFO / LILO approach. | TRUE |
| " __________ 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 |
| IT 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 |
| " A criterion where all operations to be performed must be sufficiently basic that they can be done exactly and in finite length" | effectiveness |
| __________ is finding a given value, called a search key, in a given set. | searching |
| " is a sorting property that does not require extra memory, except, possibly for a few memory units" | in place |
| " It refers to the correctness refers to the input-output behavior of the algorithm" | Functional |
| The presence of documentation helps keep track of all aspects of an application and it improves on the quality of a software product. | TRUE |
| " It refers to the process that a program must end finite number of steps." | Finiteness |
| GCD (2344:1231) | 1 |
| _________ 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 |
| " Ordered Tree is a rooted tree in which all the children of each vertex are ordered" | TRUE |
| "It refers to a sequence of unambiguous instructions for solving a problem " | Algorithm |
| "__________ is a sorting property that if it preserves the relative order of any two equal elements in its input. " | stability |
| "Cycle A simple path of a positive length that starts and ends a the same vertex. " | TRUE |
| "Arrays is sequence of n items of the same data type that are stored contiguously in computer memory " | TRUE |
| Vertices sets: a finite set V of items. | TRUE |
| Time efficiency or Time complexity indicates how fast a program runs | TRUE |
| Predict is events using Hypothesis | Predict ata |
| A statement that repeatedly executes until the controlling condition becomes false. | Iteration |
| __________ A statement that repeatedly executes until the controlling condition becomes false. | Iteration |
| Hypothesis must be falsifiable | TRUE |
| __________ uses repetition structure | Iteration |
| __________ A powerful technique that can be used in place of iterations. | recursion |
| A programming technique that makes the code smaller | recursion |
| __________ statement in a function calls itself repeatedly | recursion |
| Observe show features of the natural world | TRUE |
| A process where repeating until the hypothesis and observation agree | Validate |
| float, _int32 and unsigned long data type consume 4 bytes | TRUE |
| n2 is an example of that type of time complexity class | Quadratic |
| Space Complexity = Auxiliary Space + Input space | FALSE |
| When the input size measures the matrix dimension or total number of elements what is the basic operation | multiplication of two numbers |
| n log n, log n! is an example of that type of time complexity class | quasilinear |
| n log n, log n! is an example of that type of time complexity class Adding floating point numbers takes about how many nanoseconds to compute | 4.6 |
| 1.1n, 10n is an example of that type of time complexity class | exponential |
| A process in which a function calls itself directly or indirectly | Recursion |
| Validate means repeating until the hypothesis and observation agree | TRUE |
| __________ A process which breaks a task into smaller subtasks | recursion |
| Process that means must be falsifiable | Hypothesis |
| n! is an example of that type of time complexity class | factorial |
| Binary Search belongs in what class. | Logarithmic |
| What is the basic operation when solving searching for key in a list of n items | key comparison |
| Auxiliary Space is the extra space or the temporary space used by the algorithm during its execution. | TRUE |
| Instruction Space is the amount of memory used to save the compiled version of instructions. | TRUE |
| n3 is an example of that type of time complexity class | cubic |
| Finding the smallest or largest item in an unsorted array | Linear |
| Is a count denoting number of times of execution of a statement. | Frequency count |
| Finding the median value in a sorted array of numbers | Constant |
Created by:
crystallll