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. One program structure within another - such as a conditional statement inside a branch of another conditional statement.
recursive call
stack diagram
nesting
script
2. A reference to a list node can be treated as a single object or as the first in a list of nodes.
fundamental ambiguity theorem
wrapping code in a function
semantic error
counter
3. Code that satisfies the syntactic and semantic requirements of an interface.
development plan
path
implementation
problem solving
4. Information in a program that is meant for other programmers (or anyone reading the source code) and has no effect on the execution of the program.
exception
comment
increment
file system
5. A programming construct that waits for events and processes them.
event loop
parent class
nested list
recursive call
6. A name given to a variable.
variable name
semantic error
header
traverse
7. A class definition that implements an ADT with method definitions that are invocations of other methods - sometimes with simple transformations. It does no significant work but it improves or standardizes the interface seen by the client.
iteration
data type
veneer
invariant
8. An item of data contained in a node.
cargo
rules of precedence
abstract data type (ADT)
leaf
9. Calling one function from within the body of another or using the return value of one function as an argument to the call of another.
debugging
FIFO(First In First Out)
test-driven development (TDD)
composition (of functions)
10. A number or string (or other things to be named later) that can be stored in a variable or computed in an expression.
standard library
Queue
value
planned development
11. A statement that executes a function. It consists of the name of the function followed by a list of arguments enclosed in parentheses.
function call
interpret
value
queueing policy
12. A statement that creates a new function specifying its name and parameters and the statements it executes.
type conversion
function definition
traceback
increment
13. A logical error which stops a program from performing.
interface
key-value pair
run time error
file
14. A program that translates higher level programming languages into basic instructions the CPU can understand.
trace
recursive call
byte code
compiler
15. An organization of data for the purpose of making it easier to use.
compiler
object
path
data structure
16. The output of the compiler after it translates the program.
object code
side effect
import statement
FIFO(First In First Out)
17. Part of a program that can never be executed - often because it appears after a return statement.
dead code
whitespace
tuple
optional parameter
18. A way of writing mathematical expressions with the operators after the operands.
header
bug
key-value pair
postfix
19. a sequence of instructions that specifies to a computer actions and computations to be performed.
abstraction
program
object
header
20. The boolean expression in a conditional statement that determines which branch is executed.
object
binary operator
queueing policy
condition
21. An error that occurs at runtime.
exception
data type
debugging
tuple
22. To represent one set of values using another set of values by constructing a mapping between them.
increment
algorithm
encode
keyword
23. A style of programming in which data and the operations that manipulate it are organized into classes and methods.
inorder
compound data type
object-oriented programming
prefix notation
24. A language that provides features - such as user-defined classes and inheritance - that facilitate object-oriented programming.
algorithm
expression
function
object-oriented language
25. An integer variable or value that indicates an element of a list.
index
volatile memory
functional programming style
boolean expression
26. To iterate through the elements of a set performing a similar operation on each.
traverse
argv (argument vector)
namespace
linked list
27. The second part of a compound statement. The body consists of a sequence of statements all indented the same amount from the beginning of the header.
cursor
body
loop variable
postfix
28. A graphical representation of a stack of functions and their variables and the values to which they refer.
embedded reference
stack diagram
chained conditional
clone
29. A branch of the conditional statement in a recursive function that does not result in a recursive call.
base case
tab
function definition
compile
30. A variable in the sys module which stores a list of command line arguments passed to a program at run time.
namespace
traceback
inheritance
argv (argument vector)
31. A box in a stack diagram that represents a function call. It contains the local variables and parameters of the function.
frame
functional programming style
scaffolding
siblings
32. 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.
interface
frame
unit testing
test-driven development (TDD)
33. A definition which defines something in terms of itself. It often provides an elegant way to express complex data structures.
interface
modifier
recursive definition
side effect
34. A variable used to count something - usually initialized to zero and incremented in the body of a loop.
constant
counter
composition
linked list
35. An implementation of a queue using a linked list.
key
evaluate
chained conditional
linked queue
36. A set of instructions for solving a class of problems by a mechanical and unintelligent process.
default value
root
algorithm
preorder
37. Nodes that share a common parent.
parent
docstring
file
siblings
38. A recursive call that occurs as the last statement (at the tail) of a function definition.
tail recursion
unit testing
accumulator
dot product
39. An expression in parentheses that acts as a single operand in a larger expression.
multiple assignment
subexpression
source code
tuple
40. An operation defined in linear algebra that multiplies each of the coordinates of a Point by a numeric value.
boolean expression
scalar multiplication
constant
queueing policy
41. An element of a list - usually implemented as an object that contains a reference to another object of the same type.
base case
dot product
file
node
42. A way of writing a mathematical expression with each operator appearing before its operands.
file
hint
slice
prefix notation
43. A data type which can be modified.
data type
mutable data type
client
subexpression
44. The statements inside a loop.
body
flow of execution
implementation
boolean expression
45. Memory which requires an electrical current to maintain state. Information stored is lost when the computer is turned off.
delimiter
Queue
volatile memory
development plan
46. A special symbol that represents a simple computation like addition or multiplication or string concatenation.
encapsulate
list
algorithm
operator
47. One of the basic elements of the syntactic structure of a program - analogous to a word in a natural language.
delimiter
token
implementation
file
48. One of the pairs of items in a dictionary. Values are looked up in a dictionary by key.
Priority Queue
integer division
side effect
key-value pair
49. A variable or value used to select a member of an ordered set - such as a character from a string.
variable name
index
tail recursion
child
50. The statement in a recursive function with is a call to itself.
runtime error
immutable
executable
recursive call