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. A _________ is an intentional stopping or pausing place in a program - put in place for debugging purposes.
end if
breakpoint
x
standard deviation
2. Type of error: A violation of rules made by the programmer
selection
median
Two complements
syntax
3. Each element in an array is identified by a number called a ____________ which designates position in the array
2
Syntax
subscript
linear
4. The process of implementing in some programming language the variables (and structures) used to store the data and the algorithms for solving a problem.
Operating system
control structures
Integer
Coding
5. Using only the two binary digits (bits) 0 and 1 to represent information in a computer.
false condition
median
algorithm
Binary scheme mean
6. It fetches the instructions from the memory and decodes them and and directs the system to execute the operations indicated by the instructions.
Identifiers
Control unit
transitive
subroutine
7. The place where the instructions and data are stored.
Memory unit
divisor
Files
applications
8. base value of a binary number system?
Binary scheme mean
2
Selection
concatenation
9. The person responsible for programming applications such as payroll or inventory or accounts receivable etc is the _________ programmer
applications
quotient
control structures
concatenation
10. _________ is when a procedure or function calls itself
recursion
Iteration
Assigment statement
Sequential algorithm
11. Type of control structure: CASE
Syntax
oop
Hexadecimal base
Selection
12. It is used to predicts the circuit's lifetime.
Control unit
recursion
logic
Time to failure
13. The information that is produced to solve the problem.
Output
commutative
semantics
subscript
14. It is concern with checking that the algorithms and the program meet the problem's specification.
subscript
Iteration
Validation
I
15. :=? 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.
Input
Assigment statement
variance
DIV
16. Type _____ Error: False Negative
quotient
mean
Repetition algorithm
II
17. A variable that can hold a single true/false (1/0) value.
nested
Logic
selection
Boolean
18. Type of control structure: WHILE-DO
I
Iteration
parameter
Coding
19. An effective method for solving a problem using a finite sequence of instructions.
commutative
II
Algorithms
Logic
20. 8 (0 - 1 - 2 - 3 - 4 - 5 - 6 - 7)
control structures
Octal base
tracepoint
MOD
21. The address of a memory location
constraints
pointer
CPU (Central Processing Unit)
recursion
22. A system in which negative numbers are represented by the two's complement of the absolute value.
Two complements
File
subscript
DIV
23. Examples of _____ are: integer and real and true and false and read and readln and write and writeln.
DIV
interpreted
Logic
Identifiers
24. VAR and BEGIN and END are examples of _____ .
Reserved words
Boolean
II
syntax
25. _________ error: The program performs a task but it is not the task that was desired
Logic
Iteration
II
interpreted
26. One of a number of alternative actions is selected and executed.
Selection algorithm
linear
Output
CPU (Central Processing Unit)
27. Part of the program that may be repeated
loop
File
associative
subscript
28. The remainder in a division.
linear
counter
MOD
Integer
29. In Linear Programming ____________ variables are used to convert inequalities to equalities
DIV
Iteration
Memory unit
slack
30. A ____________ procedure is one in which a statement or set of statements are embedded within other statements
nested
Iteration
Iteration
concatenation
31. ____________ 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).
variance
label
DIV
Memory unit
32. Quantities whose values do not change during program execution.
assignment
Constants
Selection algorithm
Iteration
33. Allocate memory when needed and return memory when done: _________ _________
dynamic allocation
label
Binary scheme mean
tracepoint
34. ____________ / divisor = quotient
label
Replacement
syntax
dividend
35. ____________ programming is a deterministic approach to problem solving
CPU (Central Processing Unit)
2
linear
syntax
36. A _________ is a new way to use breakpoints. It is a breakpoint with a custom action associated with it. When hit it causes the debugger to perform the specified action instead of (or in addition to) breaking program execution.
breakpoint
Repetition algorithm
selection
tracepoint
37. A reserved word for variable.
VAR
logic
quotient
linear
38. Any collection of data to be input to a program or output from a program.
divisor
String Constants
Hexadecimal base
File
39. The number of times a number goes into a divisor.
Operating system
Control unit
DIV
Boolean
40. A variable which will keep track of the number of occurrences of a certain transaction
I
commutative
interpreted
counter
41. In constant declarations to associate an identifier with a constant an sign is used
counter
parameter
equal (=)
divisor
42. A string _________ is the operation of joining two character strings end to end.
concatenation
selection
assignment
quotient
43. Fixed number of similar data elements - each element can be retrieved through an index.
Iteration
array
Operating system
Assigment statement
44. dividend / divisor = _______________
Validation
Hexadecimal base
quotient
Identifiers
45. In a loop while construct the loop will be terminated upon the introduction of a ____________ ____________
File
false condition
Integer
Sequential algorithm
46. The grammatical rules of the language.
I
false condition
Syntax
algorithm
47. ____________ property: says that if a = b and b = c then a = c.
Output
transitive
Operating system
recursion
48. The information that is given and which items are important in solving the problem.
String Constants
Real numbers
Input
Time to failure
49. ______ must be enclosed within single quotes.
Iteration
String Constants
ReadLn
applications
50. A formula developed to solve a problem
Assigment statement
compiled
algorithm
false condition