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. A pointer to the next element in a linked list
link
null dereference
alias
fair
2. Values are in the most basic form and cannot be decomposed into smaller parts
simple data type
complex ADT
goal
immutable
3. Two variables that reference the same object
merge
alias
shadow
doubly linked list
4. Composed of a collection of data values; implemented with a data structure
runtime stack
class
recursive case
complex ADT
5. In a tree - a node that points to a given node
parent
association list
fair
runtime stack
6. A classification of objects into a tree structure that groups related objects
taxonomy
divide and conquer
stack frame
cons
7. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
tail recursive
garbage
immutable
8. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
structure sharing
algorithm
DFS
inorder
9. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
fifo
null dereference
base case
10. A stack containing a stack frame of variable value for each active invocation of procedure
array
taxonomy
runtime stack
general list
11. 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
boxed number
side-effect
binary search tree (bst)
well-founded ordering xml
12. The area of program text over which a variable can be referenced
object
intersection
data type
scope
13. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
ancestors
ontology
constructive
garbage collection
14. To hide similar items with the same name
constructive
dictionary
shadow
base case
15. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
destructive
goal
entinel
set difference
16. A simple case that can be solved easily - without recursion
alias
base case
complex data type
cons
17. A pattern that describes a set of similar programs
runtime stack
descendants
design pattern
destructive
18. In a tree - the union of a node's parent and the parent's ancestors
postorder
reference
merge
ancestors
19. First in first out: describes ordering of a queue
linked list
grammar
fifo
base case
20. A pointer to data
parent
reference
general list
algorithm
21. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
constructive
grammar
association list
immutable
22. The process of collecting garbage for recycling
complex ADT
garbage collection
shadow
depth-first search
23. A data structure that can be identified at runtime as being a member of a class
object
circularly linked list
dictionary
design pattern
24. To look through a data structure until a goal object is found
taxonomy
link
big o
search
25. A case where tow data structures share some elements
structure sharing
reference
data type
quadratic
26. A variable containing the address of other data
pointer
recursion
tail recursive
depth
27. The amount of space on the runtime stack required for execution of a program
stack space
grammar
taxonomy
filter
28. 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
complex ADT
leaf
divide and conquer
cons
29. An abstracted function that describes the amount of computer time or memory space required by an algorithm - as a function of problem size. for problems larger than a certain size - the actual time or space required will be less than the Big O multip
binary search tree (bst)
big o
link
taxonomy
30. Describes a function that modifies its arguments
class
destructive
stack frame
inorder
31. Constructed of multiple components (simple or complex types)
child
complex data type
recursion
depth
32. Describes a data structure or device in which all accesses have the same cost - O(1)
ontology
random access
LIFO
stack space
33. A node of a tree that has children
interior node
random access
divide and conquer
operator
34. A process that removes unwanted elements from a collection
destructive
fair
simple data type
filter
35. Composed of multiple sequential elements stored in contiguous bytes of memory
linear O(n)
interior node
array
stack
36. Use of a function or method without knowing how it's accomplished
procedural abstraction
reference type
object
recursion
37. A section of the runtime stack holding the values of all variables for one invocation
filter
grammar
garbage collection
stack frame
38. A queue implemented within an array - where the first elements of the array logically follows the last elements
circular queue
linear O(n)
recursive case
grammar
39. In a search tree - a program that changes a state into a child state e.g a move in a game
backtrack
stack frame
operator
amortized Analysis
40. Given two sets -the union is the set of elements that are members of either set
simple data type
union
depth-first search
stack
41. A list of pairs - where each pair has a key and a value associated with the key
association list
depth-first search
data structure
binary tree
42. A collection of objects that are inserted and removed according to the LIFO principle
pointer
stack
cons
preorder
43. A search in which children of a node are considered before siblings are considered
procedural abstraction
leaf
taxonomy
depth-first search
44. In a tree search - to move back from the node currently being examined to its parent
backtrack
linear O(n)
entinel
constructive
45. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
entinel
array
data structure
root
46. A linked list in which each elements has both forward and backward pointers
set difference
doubly linked list
successor
reference
47. Last in first out: describes the order of a stack
set difference
LIFO
intractable
well-founded ordering xml
48. A data structure that implements a complete binary tree within an array - such that every parent node has a value that is less than the value of either of its children
object
association list
binary tree
queue
49. First-child/next-sibling
reference
ontology
fair
gedanken
50. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
class
filter
sort
dereference