SUBJECTS
|
BROWSE
|
CAREER CENTER
|
POPULAR
|
JOIN
|
LOGIN
Business Skills
|
Soft Skills
|
Basic Literacy
|
Certifications
About
|
Help
|
Privacy
|
Terms
|
Email
Search
Test your basic knowledge |
Data Structures
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. In object oriented programming - a description of a set of similar objects
immutable
class
constructive
association list
2. A linked list in which the last element points back to the first element
scope
gedanken
link
circularly linked list
3. First-child/next-sibling
base case
fair
successor
stack space
4. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
simple ADT
grammar
array
class
5. An order of processing a tree in which the parent node is processed before its children
array
preorder
amortized Analysis
abstract data type
6. A section of the runtime stack holding the values of all variables for one invocation
linked list
stack frame
array
divide and conquer
7. Describes a data structure or device in which all accesses have the same cost - O(1)
runtime stack
interior node
random access
side-effect
8. To combine two ordered linear structures into one
reference type
merge
alias
DFS
9. In a tree search - to move back from the node currently being examined to its parent
backtrack
well-founded ordering xml
grammar
entinel
10. Any container with linear ordering
general list
reference type
filter
grammar
11. A classification of objects into a tree structure that groups related objects
linear O(n)
taxonomy
set difference
fifo
12. All nodes below a give node in a tree
binary search tree (bst)
descendants
design pattern
entinel
13. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
algorithm
linked list
boxed number
interior node
14. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
linear O(n)
runtime stack
design pattern
set difference
15. To hide similar items with the same name
shadow
taxonomy
state
constructive
16. Container for storing a collection of data in unique key/value pairs
child
dictionary
ancestors
class
17. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
base case
side-effect
complex ADT
stack space
18. Describes a though experiment or view of an entity
recursive case
destructive
gedanken
DFS
19. Use of a function or method without knowing how it's accomplished
operator
algorithm
data type
procedural abstraction
20. Composed of individually named data fields
queue
grammar
simple ADT
sort
21. To look through a data structure until a goal object is found
postorder
design pattern
node
search
22. Constructed of multiple components (simple or complex types)
stack frame
scope
complex data type
dereference
23. A number that is defined as an object so that it has a runtime type and methods that can be used - e.g. Integer in Java
reference
descendants
boxed number
recursive case
24. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
scope
data structure
reference type
quadratic
25. A case where a program calls itself
array
recursion
state
recursive case
26. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
ontology
tail recursive
reference type
operator
27. The amount of space on the runtime stack required for execution of a program
sort
stack space
state
design pattern
28. A collection of objects that are inserted and removed according to the LIFO principle
garbage
array
set difference
stack
29. The area of program text over which a variable can be referenced
algorithm
scope
inorder
data structure
30. To convert from a pointer to the data that is pointed to
immutable
successor
descendants
dereference
31. A collection of values
object
data type
interior node
type
32. Depth first search
DFS
simple ADT
filter
LIFO
33. A stack containing a stack frame of variable value for each active invocation of procedure
LIFO
descendants
runtime stack
well-founded ordering xml
34. A pointer to data
class
complex data type
reference
fifo
35. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure
data structure
ancestors
cons
circular queue
36. An elements of a linked list - tree - or graph - often represented by a data structure
array
well-founded ordering xml
node
shadow
37. A condition of the input data where the data will be handled by call(s) to the same program
recursive case
complex ADT
complex data type
circular queue
38. An order of processing a tree in which the parent node is processed after its children
successor
reference
postorder
algorithm
39. In a tree - a node that points to a given node
data abstraction
parent
amortized Analysis
stack frame
40. Separation of the properties of a data type from its implementation
entinel
array
data abstraction
preorder
41. A problem that is so hard that it cannot be solved unless the problem is small
intractable
merge
array
abstract data type
42. A node of a tree that has children
interior node
node
runtime stack
descendants
43. In a search tree - a program that changes a state into a child state e.g a move in a game
scope
fair
descendants
operator
44. In a tree - a node pointed to by a parent node
procedural abstraction
tail recursive
child
class
45. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types
reference type
taxonomy
garbage collection
depth
46. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
branching factor
boxed number
divide and conquer
depth-first search
47. In a search tree - the number of children of a given node. often - the branching factors of individual nodes will vary - so an average value may be used
array
stack frame
recursive case
branching factor
48. A queue implemented within an array - where the first elements of the array logically follows the last elements
general list
circular queue
divide and conquer
dereference
49. A description of the state of a process such as a board game
inorder
state
link
complex data type
50. A list of pairs - where each pair has a key and a value associated with the key
complex ADT
search
operator
association list