SUBJECTS
|
BROWSE
|
CAREER CENTER
|
POPULAR
|
JOIN
|
LOGIN
Business Skills
|
Soft Skills
|
Basic Literacy
|
Certifications
About
|
Help
|
Privacy
|
Terms
|
Email
Search
Test your basic knowledge |
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 numerical value that does not change during the execution of a program.
incremental development
frame
compound data type
constant
2. A variable used as part of the terminating condition of a loop.
mutable data type
loop variable
syntax
parse
3. A programming language that is designed to be easy for humans to read and write.
test-driven development (TDD)
tab
high-level language
index
4. An ADT that defines the operations one might perform on a priority queue.
portability
nested loop
Priority Queue
method
5. A number or string (or other things to be named later) that can be stored in a variable or computed in an expression.
algorithm
value
debugging
object
6. A data structure that implements a collection using a sequence of linked nodes.
linked list
delimiter
iteration
portability
7. Generalization by reducing the information content of a concept.
raise
expression
fundamental ambiguity theorem
abstraction
8. The set of nodes equidistant from the root.
base case
level
newline
docstring
9. A data type in which the values are made up of components or elements that are themselves values.
class
compound data type
executable
file system
10. A syntactic construct which enables lists to be generated from other lists using a syntax analogous to the mathematical set-builder notation.
value
key-value pair
list comprehension
tab
11. To simplify an expression by performing the operations in order to yield a single value.
local variable
wrapping code in a function
side effect
evaluate
12. A function that does not modify any of the objects it receives as parameters. Most pure functions are fruitful.
pure function
hint
linked list
natural language
13. A special symbol that represents a simple computation like addition or multiplication or string concatenation.
node
operator
compile
debugging
14. A way of writing mathematical expressions with the operators after the operands.
Queue
postfix
function call
variable
15. a sequence of instructions that specifies to a computer actions and computations to be performed.
type conversion
formal language
composition (of functions)
program
16. A software development practice which arrives at a desired feature through a series of small but iterative steps motivated by automated tests which are written first that express increasing refinements of the desired feature.
nested loop
infix
method
test-driven development (TDD)
17. A syntactic container providing a context for names so that the same name can reside in different namespaces without ambiguity.
namespace
integer division
argv (argument vector)
modifier
18. To prevent an exception from terminating a program using the try and except statements.
handle an exception
dictionary
tuple assignment
local variable
19. Code that satisfies the syntactic and semantic requirements of an interface.
implementation
functional programming style
function composition
incremental development
20. A program (or the person who wrote it) that uses an ADT.
index
client
fundamental ambiguity theorem
recursive definition
21. Making more than one assignment to the same variable during the execution of a program.
multiple assignment
semantics
algorithm
postfix
22. The output of the compiler after it translates the program.
interpret
stack diagram
object code
aliases
23. A queueing policy in which each member has a priority determined by external factors. The member with the highest priority is the first to be removed.
precondition
parse
initialization method
priority queue
24. A variable used to store an intermediate value in a complex calculation.
temporary variable
stack diagram
compile
escape sequence
25. The statements inside a loop.
function
tuple assignment
trichotomy
body
26. A statement that creates a new function specifying its name and parameters and the statements it executes.
instantiate
initialization (of a variable)
branch
function definition
27. A set of instructions for solving a class of problems by a mechanical and unintelligent process.
portability
sequence
algorithm
composition (of functions)
28. A variable that is defined inside a class definition but outside any method. These are accessible from any method in the class and are shared by all instances of the class.
pure function
class attribute
semantic error
parent class
29. An automatic procedure used to validate that individual units of code are working properly.
unit testing
comment
data structure
subexpression
30. To join two strings end-to-end.
linear time
concatenate
newline
linked list
31. Code that is used during program development but is not part of the final version.
comment
development plan
directory
scaffolding
32. To examine a program and analyze the syntactic structure.
infix
parse
compound statement
child
33. A queueing policy in which the first member to arrive is the first to be removed.
test-driven development (TDD)
recursive definition
delimiter
FIFO(First In First Out)
34. A process for developing a program.
abstraction
development plan
problem solving
raise
35. An error in a program that makes it do something other than what the programmer intended.
semantic error
variable name
natural language
provider
36. The process of adding a function header and parameters to a sequence of program statements. This process is very useful whenever the program statements in question are going to be used multiple times.
interpret
boolean function
wrapping code in a function
encode
37. A function that can operate on more than one type. If all the operations in a function can be applied to a type then the function can be applied to a type.
boolean value
polymorphic
event
queue
38. The process of formulating a problem and finding a solution and expressing the solution.
problem solving
subexpression
compiler
clone
39. A bottom-most node in a tree with no children.
leaf
counter
generic data structure
key
40. The value provided as the result of a function call.
return value
raise
compiler
list traversal
41. An error in a program.
level
bug
escape sequence
object
42. The code (or the person who wrote it) that implements an ADT.
non-volatile memory
class attribute
provider
compiler
43. A way of writing mathematical expressions with the operators between the operands.
state diagram
infix
script
counter
44. A combination of variables and operators and values that represents a single result value.
trichotomy
index
expression
queue
45. To execute a program in a high-level language by translating it one line at a time.
debugging
interpret
trichotomy
scaffolding
46. A character that is used to separate tokens such as punctuation in a natural language.
delimiter
constant time
element
precondition
47. A value passed to a program along with the program's invocation at the command prompt of a command line interface (CLI).
command line argument
boolean expression
invariant
scalar multiplication
48. The rules that determine which member of a queue is removed next.
compound data type
exception
queueing policy
volatile memory
49. An operator that takes two operands.
binary operator
file system
infix
function definition
50. An operator denoted with a percent sign ( %) - that works on integers and yields the remainder when one number is divided by another.
loop
child
local variable
modulus operator