SUBJECTS
|
BROWSE
|
CAREER CENTER
|
POPULAR
|
JOIN
|
LOGIN
Business Skills
|
Soft Skills
|
Basic Literacy
|
Certifications
About
|
Help
|
Privacy
|
Terms
|
Email
Search
Test your basic knowledge |
General Programming
Start Test
Study First
Subject
:
it-skills
Instructions:
Answer 50 questions in 15 minutes.
If you are not ready to take this test, you can
study here
.
Match each statement with the correct term.
Don't refresh. All questions and answers are randomly picked and ordered every time you load a test.
This is a study tool. The 3 wrong answers for each question are randomly chosen from answers to other questions. So, you might find at times the answers obvious, but you will see it re-enforces your understanding as you take the test each time.
1. Zero sum game theory problems can be solved by means of ____________ programming
linear
VAR
ReadLn
Replacement
2. The information that is given and which items are important in solving the problem.
Input
Output
Two complements
equal (=)
3. ______ causes an advance to a new input line from which subsequent values will be read
constraints
ReadLn
Logic
VAR
4. Statistical middle
CPU (Central Processing Unit)
nested
Operating system
median
5. The number of times a number goes into a divisor.
DIV
control structures
Replacement
tracepoint
6. ____________ programming is a deterministic approach to problem solving
Operating system
concatenation
linear
recursion
7. Type of control structure: IF-THEN-ELSE
selection
Replacement
subroutine
dual
8. The grammatical rules of the language.
Validation
Hexadecimal base
Syntax
end if
9. Each element in an array is identified by a number called a ____________ which designates position in the array
subscript
Iteration
Integer
equal (=)
10. The assignment statement is also a ____ statement?
Replacement
associative
Two complements
2
11. _________ error: The program performs a task but it is not the task that was desired
loop
Logic
interpreted
Iteration
12. In constant declarations to associate an identifier with a constant an sign is used
assignment
Reserved words
commutative
equal (=)
13. Allocate memory when needed and return memory when done: _________ _________
Iteration
dynamic allocation
associative
compiled
14. ____________ property: you can change the order of the numbers involved without changing the result
Reserved words
String Constants
recursion
commutative
15. Examples of _____ are: integer and real and true and false and read and readln and write and writeln.
Selection
Hexadecimal base
Sequential algorithm
Identifiers
16. for an "if" statement some languages require and "____________ _______" to close the selection group
counter
DIV
Repetition algorithm
end if
17. Outout and Input are _____
Files
Constants
semantics
mean
18. A fixed position within source code: _________
Binary scheme mean
label
end if
DIV
19. The information that is produced to solve the problem.
counter
Output
tracepoint
Replacement
20. 16 (0 - 1 - 2 - 3 - 4 - 5 - 6 - 7 - 8 - 9 - A(10) - B(11) - C(12) - D(13) - E(14) - F(15)
transitive
tracepoint
Hexadecimal base
Logic
21. The steps are performed in a strictly sequential manner - each step being executed exactly once.
Sequential algorithm
DIV
dividend
compiled
22. An effective method for solving a problem using a finite sequence of instructions.
Repetition algorithm
array
Algorithms
linear
23. dividend / divisor = _______________
Repetition algorithm
subroutine
quotient
subscript
24. Any number that does not have a decimal in it.
Integer
Input
Output
Selection algorithm
25. Statistical average
mean
Constants
recursion
oop
26. VAR and BEGIN and END are examples of _____ .
linear
Hexadecimal base
Reserved words
Logic
27. In a loop while construct the loop will be terminated upon the introduction of a ____________ ____________
mean
loop
assignment
false condition
28. ____________ is a measure of the amount of variation within the values of that variable taking account of all possible values and their probabilities or weightings (not just the extremes which give the range).
dynamic allocation
ReadLn
transitive
variance
29. A system in which negative numbers are represented by the two's complement of the absolute value.
Two complements
dividend
selection
oop
30. A variable that can hold a single true/false (1/0) value.
ReadLn
Input
Boolean
recursion
31. Any collection of data to be input to a program or output from a program.
Algorithms
ReadLn
program composition
File
32. dividend / _____________ = quotient
Reserved words
nested
MOD
divisor
33. ____________ / divisor = quotient
Octal base
CPU (Central Processing Unit)
File
dividend
34. The process of implementing in some programming language the variables (and structures) used to store the data and the algorithms for solving a problem.
Iteration
Octal base
Selection algorithm
Coding
35. Information is placed into a storage location by means of an ____________ statement
assignment
Selection
x
semantics
36. A _________ is a group of instructions within a computer program that performs a specific function.
parameter
program composition
false condition
subroutine
37. The person responsible for programming applications such as payroll or inventory or accounts receivable etc is the _________ programmer
applications
linear
Iteration
Repetition algorithm
38. ____________ property: says that if a = b and b = c then a = c.
transitive
slack
dividend
end if
39. Quantities whose values do not change during program execution.
loop
Constants
Integer
Repetition algorithm
40. One of a number of alternative actions is selected and executed.
Real numbers
Selection
subroutine
Selection algorithm
41. The place where the instructions and data are stored.
Coding
program composition
dividend
Memory unit
42. Item of information necessary for a program or subprogram to perform its task.
parameter
false condition
CPU (Central Processing Unit)
Logic
43. Using only the two binary digits (bits) 0 and 1 to represent information in a computer.
MOD
Two complements
DIV
Binary scheme mean
44. Part of the program that may be repeated
false condition
Reserved words
loop
Octal base
45. In Linear Programming ____________ variables are used to convert inequalities to equalities
slack
Real Constants
subscript
oop
46. Fixed number of similar data elements - each element can be retrieved through an index.
Constants
Iteration
array
slack
47. :=? is an ________. Here the varaible to be assigned a value must appear on the left of the assignment operator and a legal expression must appear on the right side.
tracepoint
File
selection
Assigment statement
48. Type of control structure: REPEAT-UNTIL
Iteration
array
slack
ReadLn
49. Statistics: square root of variance
linear
false condition
standard deviation
quotient
50. _________ is when a procedure or function calls itself
standard deviation
DIV
recursion
semantics