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. The amount of space on the runtime stack required for execution of a program
stack space
set difference
gedanken
constructive
2. A contiguous block of memory containing elements of the same type - accessed by numeric index
branching factor
taxonomy
array
grammar
3. A tree node containing a contents value but with no children
leaf
successor
union
stack frame
4. 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
linked list
array
dictionary
big o
5. Composed of a collection of data values; implemented with a data structure
complex ADT
base case
ontology
entinel
6. A list of pairs - where each pair has a key and a value associated with the key
class
side-effect
divide and conquer
association list
7. 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
garbage collection
design pattern
base case
cons
8. A description of operations on a data type that could have multiple possible implementations
ancestors
divide and conquer
abstract data type
array
9. A variable containing the address of other data
pointer
random access
general list
backtrack
10. Describes a function that makes a new data structure but does not modify its arguments
tail recursive
destructive
constructive
quadratic
11. A case where tow data structures share some elements
boxed number
operator
structure sharing
doubly linked list
12. The next element in a linked list
fair
node
big o
successor
13. In a search tree - a program that changes a state into a child state e.g a move in a game
recursive case
alias
node
operator
14. In a tree - a node that points to a given node
parent
simple ADT
object
leaf
15. Two variables that reference the same object
alias
ontology
preorder
fifo
16. A problem that is so hard that it cannot be solved unless the problem is small
intractable
taxonomy
alias
scope
17. In a tree search - to move back from the node currently being examined to its parent
merge
backtrack
grammar
intersection
18. Composed of multiple sequential elements stored in contiguous bytes of memory
descendants
array
fifo
dictionary
19. A pointer to data
reference
garbage collection
operator
leaf
20. A given collection of values along with a collection of operations for use on those values
algorithm
node
data type
cons
21. A process that removes unwanted elements from a collection
filter
queue
dereference
constructive
22. A simple case that can be solved easily - without recursion
linked list
ancestors
base case
stack frame
23. A classification of objects into a tree structure that groups related objects
depth-first search
runtime stack
taxonomy
inorder
24. A collection of objects that are inserted and removed according to the LIFO principle
stack
pointer
runtime stack
child
25. Depth first search
shadow
search
DFS
leaf
26. To combine two ordered linear structures into one
parent
merge
boxed number
descendants
27. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents
ontology
parent
big o
binary search tree (bst)
28. Constructed of multiple components (simple or complex types)
link
data type
complex data type
boxed number
29. An item (or description of items) being sough in a search
goal
dictionary
dereference
set difference
30. A problem whose solution requires a linear amount of time or space if the problem is size n
inorder
linear O(n)
sort
ancestors
31. Describes a data structure or device in which all accesses have the same cost - O(1)
big o
random access
general list
inorder
32. The area of program text over which a variable can be referenced
LIFO
scope
grammar
reference
33. Values are in the most basic form and cannot be decomposed into smaller parts
runtime stack
union
simple data type
abstract data type
34. A description of the state of a process such as a board game
state
class
design pattern
set difference
35. 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
intractable
reference type
root
grammar
36. 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
recursive case
branching factor
array
runtime stack
37. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
depth-first search
data structure
depth
big o
38. A data structure that can be identified at runtime as being a member of a class
binary search tree (bst)
random access
object
structure sharing
39. Last in first out: describes the order of a stack
doubly linked list
recursion
LIFO
union
40. A section of the runtime stack holding the values of all variables for one invocation
stack space
null dereference
stack frame
successor
41. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
state
well-founded ordering xml
stack space
recursion
42. The process of collecting garbage for recycling
pointer
complex ADT
DFS
garbage collection
43. Any container with linear ordering
general list
sort
ontology
side-effect
44. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
design pattern
object
reference
45. Describes a though experiment or view of an entity
linked list
gedanken
structure sharing
union
46. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
preorder
algorithm
taxonomy
depth
47. A pattern that describes a set of similar programs
data abstraction
design pattern
reference
backtrack
48. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
boxed number
type
tail recursive
dictionary
49. All nodes below a give node in a tree
class
descendants
immutable
base case
50. A case where a program calls itself
well-founded ordering xml
depth
boxed number
recursion