Download algorithm

CS0007 - FA1
1.OS must have the capability to load a program into memory and execute that program.
true
2In program execution, the OS must have the capability to load a program into ________ and execute that program.
memory
3Operating system ______ and coordinates the use of the hardware among the various application programs for the
various users.
Checks
4Users are the one who utilize a computer or network service trying to solve different problems.
True
5User can use computer even without an operating system.
False
6 is a program that acts as an interface or intermediary between the computer user and computer hardware
Operating system
7Operating system is what type of software?
System
8Kernel acts like bridge between application and computer hardware.
False
9Which is not an example of application software?
Windows 10
10Time-sharing is also known as multitasking.
True
11A software-generated interrupt caused either by an error or a user request is called
Trap
12Operating systems made available in source-code format which has copyleft is called
Open source OS
13The main memory is central to the operation of a modern computer system.
False
14Hardware interrupt is a signal created and sent to the CPU that is caused by some action taken by a software.
False
15Refers to computing on handheld smartphones and tablet computers.
Mobile computing
16Private cloud runs by a company for that company’s own use.
True
17In computer system organization, the I/O devices and the CPU both execute one at a time.
False
18Platform as a service(PaaS) provides software stack ready for application use via the Internet.
True
19The device controllers use a/n ________ to inform the CPU that I/O operation is completed.
Interrupt
20A type of multiprocessing in which each processor performs all tasks within the operating system. All processors
are peers and no boss-worker relationship.
Symmetric
21 Analysis of algorithms is the determination of the amount of time and space resources required to execute it.
True
22 ______ refers to an algorithm is asserted when it is said that the algorithm is correct with respect to a
specification.
Note: Write your answer in lowercase format.
Example: computer
Correctness
23 It refers to the process that a program must end finite number of steps.
Note: Write your answer in lowercase format.
Example: computer
Finiteness
24 Program testing is the process of executing a program with the intent of finding errors. True
25 Model development is an __________ process. Iterative
26 _________ 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.
Note: Write your answer in lowercase format.
Example: computer
algorithm
27 A sequence of computational steps that transform the input into the output. Algorithm
28 There are how many elements of a problem statement 3
29 _________ is a sequence of unambiguous instructions for solving a problem.
Note: Write your answer in lowercase format.
Example: computer algorithm
30 Muhammad ibn Musa al-Khwarizmi – 9th century mathematician True
31 Sorting ______ is a special piece of information used to guide sorting. key
32 Connected components is the maximum connected subgraph of a given graph. True
33 __________ string consist of letters, numbers, and special characters. text string/s
34 Arrays is sequence of n items of the same data type that are stored contiguously in computer memory True
35 Stack uses LIFO / FILO approach.True
36 Refers to rearrange the items of a given list in ascending or descending order.Sorting
37 is a sorting property that does not require extra memory, except, possibly for a few memory units In place
38 ________ refers to Rearrange the items of a given list in ascending or descending order.
Note: Write your answer in lowercase format.
Example: computer sorting
39__________ correctness refers to the input-output behavior of the algorithm. functional
40 A criterion where all operations to be performed must be sufficiently basic that they can be done exactly and in
finite length. Effectiveness
41. __________ is finding a given value, called a search key, in a given set. Searching
42 searching for a given word/pattern in a text string matching
43. Adjacent Linked list is collection of linked lists, one for each vertex, that contain all the vertices adjacent to the
list’s vertex. True
44 __________ is a collection of points called vertices, some of which are connected by line segments called edges.
Graph
45 Ordered Tree is a rooted tree in which all the children of each vertex are ordered
TRUE
46 IT refers to an algorithm is asserted when it is said that the algorithm is correct with respect to a specification
Correctness
47. Connected components is the maximum connected subgraph of a given graph. TRUE
48. . __________ is a sequence of characters from an alphabet string.
49. A sorting property that if it preserves the relative order of any two equal elements in its input. Stability
50. Vertices sets: a finite set V of items. True
51. There are how many steps involved in solving computational problems. 9
finiteness: The algorithm must always terminate after a finite number of steps.
definiteness: Each step must be precisely defined; the actions to be carried out must be rigorously and
unambiguously specified for each case.
input: An algorithm has zero or more inputs, taken from a specified set of objects.
output: An algorithm has one or more outputs, which have a specified relation to the inputs.
effectiveness: All operations to be performed must be sufficiently basic that they can be done exactly
and in finite length.
FA2
A statement that repeatedly executes until the controlling condition. ITERATION
Predict is events using the hypothesis. TRUE
A process in which a function calls itself directly or indirectly. RECURSION
Time efficiency or time complexity indicates how fast an algorithm runs. TRUE
A powerful technique that can be used in place of iterations. RECURSION
Hypothesis must be falsifiable. TRUE
Validate means repeating until the hypothesis and observation agree. TRUE
A statement that repeatedly executes until the controlling condition becomes. ITERATION
Process that means must be falsifiable. HYPOTHESIS
n log n, log n! is an example of that type of time complexity class. QUASILINEAR
n! is an example of that type of time complexity class. FACTORIAL
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
Data Space is the amount of space used by the variables and constants TRUE
uses repetition structure ITERATION
Predict is events using the hypothesis PREDICT
Auxiliary Space is the extra space or the temporary space used by the algorithm during its execution.
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
Instruction Space is the amount of memory used to save the compiled version of instructions. TRUE
Binary Search belongs in what class. LOGARITHMIC
Is a count denoting number of times of execution of a statement FREQUENCY COUNT
float, _int32 and unsigned long data type consume 4 bytes TRUE
When the input size measures the matrix dimension or total number of elements what is the basic
operation. MULTIPLICATION OF TWO NUMBERS
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
Experiments must be reproducible. TRUE
Constant is the space taken by instruction, variable and identifiers. TRUE
Verify means the predictions by making further observations. TRUE
RECURSION programming technique that terminates when a base case is recognized.
A programming technique that makes the code smaller. RECURSION
A process which breaks a task into a smaller subtasks. RECURSION
There are how many scientific method use on performance and comparing algorithms. 5
Process where it terminates when the loop condition fails. ITERATION
This algorithmic check for the efficiency looking at the max input of n. WORST
n^2 is an example of that type of time complexity class. QUADRATIC
Computing sine values take about how many nanoseconds. 13.5 (Wrong based on module, but correct
in quiz)
Space Complexity = Auxiliary Space + Input Space. TRUE
Adding integer takes how many nanoseconds to compute. 2.1