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. 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
simple ADT
big o
interior node
object
2. A stack containing a stack frame of variable value for each active invocation of procedure
runtime stack
doubly linked list
shadow
root
3. A condition of the input data where the data will be handled by call(s) to the same program
descendants
interior node
recursive case
binary tree
4. A linked list in which each elements has both forward and backward pointers
doubly linked list
abstract data type
sort
cons
5. A runtime error that occurs when an operation such as method call is attempted on a null pointer
entinel
data abstraction
null dereference
type
6. In a search tree - a program that changes a state into a child state e.g a move in a game
fair
operator
big o
search
7. A sequence of records - where each record contains a link to the next one
circularly linked list
stack frame
linked list
doubly linked list
8. A simple case that can be solved easily - without recursion
base case
intersection
big o
complex ADT
9. Depth first search
state
simple data type
DFS
procedural abstraction
10. A node of a tree that has children
operator
algorithm
interior node
big o
11. A collection of objects that are inserted and removed according to the LIFO principle
depth-first search
garbage collection
general list
stack
12. Composed of multiple sequential elements stored in contiguous bytes of memory
array
simple ADT
structure sharing
random access
13. In object oriented programming - a description of a set of similar objects
garbage
sort
grammar
class
14. A queue implemented within an array - where the first elements of the array logically follows the last elements
circular queue
reference
intractable
abstract data type
15. All nodes below a give node in a tree
inorder
array
tail recursive
descendants
16. Separation of the properties of a data type from its implementation
successor
data abstraction
ancestors
linear O(n)
17. An order of processing a tree in which the parent node is processed after its children
taxonomy
postorder
operator
base case
18. A list of pairs - where each pair has a key and a value associated with the key
goal
association list
recursion
child
19. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
data type
side-effect
circularly linked list
goal
20. A given collection of values along with a collection of operations for use on those values
sort
object
data type
grammar
21. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
tail recursive
design pattern
descendants
postorder
22. Given two sets - the intersection is the set of elements that are members of both sets
procedural abstraction
scope
intersection
data abstraction
23. A section of the runtime stack holding the values of all variables for one invocation
preorder
fifo
leaf
stack frame
24. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
doubly linked list
big o
data structure
procedural abstraction
25. A pointer to the next element in a linked list
association list
depth
dictionary
link
26. Two variables that reference the same object
goal
linear O(n)
garbage collection
alias
27. To hide similar items with the same name
shadow
depth-first search
tail recursive
circular queue
28. A problem that is so hard that it cannot be solved unless the problem is small
abstract data type
entinel
gedanken
intractable
29. A tree node containing a contents value but with no children
data type
stack space
linear O(n)
leaf
30. A process that removes unwanted elements from a collection
filter
ontology
descendants
garbage collection
31. Values are in the most basic form and cannot be decomposed into smaller parts
goal
data type
depth
simple data type
32. In a tree - the union of a node's parent and the parent's ancestors
ancestors
interior node
boxed number
merge
33. 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
branching factor
well-founded ordering xml
recursive case
successor
34. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
constructive
complex ADT
inorder
sort
35. Describes a data structure or device in which all accesses have the same cost - O(1)
gedanken
link
random access
interior node
36. To combine two ordered linear structures into one
state
runtime stack
merge
association list
37. In a tree search - to move back from the node currently being examined to its parent
structure sharing
backtrack
LIFO
successor
38. Any container with linear ordering
entinel
general list
stack space
ontology
39. The area of program text over which a variable can be referenced
garbage collection
scope
postorder
dereference
40. A variable containing the address of other data
entinel
random access
pointer
data type
41. A case where a program calls itself
random access
recursive case
recursion
circular queue
42. A linked list in which the last element points back to the first element
well-founded ordering xml
depth
circularly linked list
pointer
43. Describes a though experiment or view of an entity
filter
gedanken
linear O(n)
LIFO
44. Container for storing a collection of data in unique key/value pairs
procedural abstraction
dictionary
shadow
ancestors
45. A description of the state of a process such as a board game
random access
state
simple data type
recursion
46. Composed of individually named data fields
simple ADT
search
complex ADT
well-founded ordering xml
47. 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
ancestors
boxed number
grammar
reference type
48. A case where tow data structures share some elements
descendants
stack space
abstract data type
structure sharing
49. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
dereference
circular queue
stack space
50. An elements of a linked list - tree - or graph - often represented by a data structure
taxonomy
tail recursive
leaf
node