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 extra record at the start or end of a data structure such as a linked list - to simplify processing
grammar
structure sharing
entinel
inorder
2. The top node of a tree - from which all other nodes can be reached
root
procedural abstraction
random access
DFS
3. All nodes below a give node in a tree
runtime stack
descendants
doubly linked list
simple data type
4. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
gedanken
scope
class
queue
5. In a search tree - a program that changes a state into a child state e.g a move in a game
leaf
depth-first search
operator
class
6. A sequence of records - where each record contains a link to the next one
destructive
data abstraction
garbage
linked list
7. A problem that is so hard that it cannot be solved unless the problem is small
simple ADT
grammar
intractable
array
8. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
destructive
recursion
tail recursive
recursive case
9. Describes a though experiment or view of an entity
amortized Analysis
child
gedanken
link
10. The amount of space on the runtime stack required for execution of a program
abstract data type
random access
stack space
association 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
destructive
recursion
boxed number
circular queue
12. Constructed of multiple components (simple or complex types)
big o
complex data type
abstract data type
reference type
13. Describes a data structure or device in which all accesses have the same cost - O(1)
random access
goal
leaf
ontology
14. A tree node containing a contents value but with no children
boxed number
immutable
object
leaf
15. Use of a function or method without knowing how it's accomplished
ontology
cons
procedural abstraction
fifo
16. Any container with linear ordering
array
inorder
general list
fair
17. In object oriented programming - a description of a set of similar objects
depth
procedural abstraction
class
circularly linked list
18. Depth first search
DFS
ontology
merge
successor
19. A pointer to data
reference
linked list
structure sharing
random access
20. A collection of objects that are inserted and removed according to the LIFO principle
null dereference
well-founded ordering xml
stack
node
21. A condition of the input data where the data will be handled by call(s) to the same program
entinel
recursive case
depth
garbage
22. An item (or description of items) being sough in a search
pointer
goal
garbage collection
complex data type
23. 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
grammar
branching factor
linked list
stack space
24. An order of processing a tree in which the parent node is processed before its children
class
LIFO
cons
preorder
25. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
garbage collection
branching factor
stack frame
26. A collection of values
type
object
entinel
procedural abstraction
27. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
array
filter
side-effect
depth
28. Composed of multiple sequential elements stored in contiguous bytes of memory
branching factor
array
class
doubly linked list
29. Given two sets - the intersection is the set of elements that are members of both sets
intractable
goal
intersection
parent
30. The number of links between the root of a tree and the leaves
shadow
reference
divide and conquer
depth
31. In a tree search - to move back from the node currently being examined to its parent
cons
backtrack
immutable
procedural abstraction
32. In a tree - a node that points to a given node
parent
goal
complex data type
depth-first search
33. A search in which children of a node are considered before siblings are considered
successor
reference
simple ADT
depth-first search
34. A contiguous block of memory containing elements of the same type - accessed by numeric index
ancestors
simple data type
array
operator
35. Container for storing a collection of data in unique key/value pairs
state
dictionary
preorder
intersection
36. A variable containing the address of other data
search
pointer
big o
sort
37. Last in first out: describes the order of a stack
stack
sort
LIFO
parent
38. storage that is no longer pointed to by any variable and therefore can no longer be accessed
grammar
garbage
circular queue
operator
39. A case where tow data structures share some elements
constructive
linked list
structure sharing
gedanken
40. 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
leaf
cons
complex data type
alias
41. Two variables that reference the same object
grammar
data abstraction
tail recursive
alias
42. A node of a tree that has children
interior node
operator
child
recursion
43. 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
taxonomy
array
binary tree
shadow
44. The area of program text over which a variable can be referenced
null dereference
array
scope
child
45. To convert from a pointer to the data that is pointed to
base case
taxonomy
dereference
data type
46. A section of the runtime stack holding the values of all variables for one invocation
stack frame
general list
garbage collection
simple ADT
47. Describes a function that modifies its arguments
destructive
structure sharing
depth-first search
array
48. A case where a program calls itself
recursion
sort
node
DFS
49. To look through a data structure until a goal object is found
ontology
search
intersection
state
50. Separation of the properties of a data type from its implementation
random access
stack
depth
data abstraction