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 contiguous block of memory containing elements of the same type - accessed by numeric index
array
entinel
goal
big o
2. 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
divide and conquer
recursion
big o
binary search tree (bst)
3. A search in which children of a node are considered before siblings are considered
depth-first search
LIFO
interior node
set difference
4. 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
random access
constructive
cons
data type
5. A node of a tree that has children
union
quadratic
general list
interior node
6. A stack containing a stack frame of variable value for each active invocation of procedure
complex data type
queue
runtime stack
cons
7. A linked list in which the last element points back to the first element
well-founded ordering xml
stack frame
circularly linked list
recursion
8. A pattern that describes a set of similar programs
backtrack
design pattern
stack frame
association list
9. An order of processing a tree in which the parent node is processed before its children
preorder
set difference
reference type
search
10. A case where a program calls itself
recursion
linear O(n)
data abstraction
link
11. To convert from a pointer to the data that is pointed to
dereference
linked list
sort
goal
12. In a tree - a node pointed to by a parent node
array
queue
parent
child
13. Composed of individually named data fields
simple ADT
intractable
operator
ancestors
14. Given two sets - the intersection is the set of elements that are members of both sets
intersection
successor
procedural abstraction
base case
15. A tree node containing a contents value but with no children
LIFO
algorithm
leaf
fifo
16. An extra record at the start or end of a data structure such as a linked list - to simplify processing
intractable
entinel
null dereference
procedural abstraction
17. A collection of values
parent
design pattern
type
complex ADT
18. Composed of multiple sequential elements stored in contiguous bytes of memory
circular queue
circularly linked list
intersection
array
19. In a search tree - a program that changes a state into a child state e.g a move in a game
constructive
set difference
tail recursive
operator
20. A section of the runtime stack holding the values of all variables for one invocation
cons
data structure
set difference
stack frame
21. The area of program text over which a variable can be referenced
data structure
scope
filter
simple ADT
22. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
circular queue
reference type
pointer
23. A description of the state of a process such as a board game
search
postorder
child
state
24. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
quadratic
ontology
fifo
union
25. The number of links between the root of a tree and the leaves
design pattern
DFS
recursion
depth
26. Describes a function that makes a new data structure but does not modify its arguments
postorder
grammar
constructive
stack
27. An elements of a linked list - tree - or graph - often represented by a data structure
boxed number
alias
node
doubly linked list
28. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
garbage collection
ontology
sort
descendants
29. Constructed of multiple components (simple or complex types)
general list
complex data type
big o
array
30. An order of processing a tree in which the parent node is processed after its children
depth
postorder
parent
fifo
31. 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
root
operator
set difference
binary tree
32. Describes a data structure or device in which all accesses have the same cost - O(1)
complex data type
class
backtrack
random access
33. A problem that is so hard that it cannot be solved unless the problem is small
amortized Analysis
dereference
random access
intractable
34. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
linear O(n)
divide and conquer
branching factor
goal
35. Separation of the properties of a data type from its implementation
array
type
garbage
data abstraction
36. A sequence of records - where each record contains a link to the next one
side-effect
linked list
linear O(n)
random access
37. A pointer to data
reference
successor
node
filter
38. Depth first search
intractable
state
DFS
circular queue
39. In a tree - a node that points to a given node
tail recursive
parent
big o
goal
40. The top node of a tree - from which all other nodes can be reached
root
grammar
stack frame
binary search tree (bst)
41. A queue implemented within an array - where the first elements of the array logically follows the last elements
fair
tail recursive
ancestors
circular queue
42. Container for storing a collection of data in unique key/value pairs
dictionary
goal
object
constructive
43. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
quadratic
base case
tail recursive
side-effect
44. An item (or description of items) being sough in a search
goal
base case
inorder
dictionary
45. A classification of objects into a tree structure that groups related objects
amortized Analysis
binary tree
taxonomy
ontology
46. A variable containing the address of other data
shadow
pointer
association list
tail recursive
47. A given collection of values along with a collection of operations for use on those values
circularly linked list
divide and conquer
data type
scope
48. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
amortized Analysis
data structure
garbage
algorithm
49. 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
operator
structure sharing
node
50. In object oriented programming - a description of a set of similar objects
class
stack space
garbage
stack