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 tree node containing a contents value but with no children
leaf
shadow
inorder
procedural abstraction
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
big o
class
complex ADT
random access
3. 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
data structure
stack frame
complex ADT
branching factor
4. An order of processing a tree in which the parent node is processed in between its children
complex data type
linked list
inorder
stack frame
5. A pointer to data
reference
stack
fair
random access
6. Describes a function that makes a new data structure but does not modify its arguments
inorder
simple ADT
side-effect
constructive
7. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
queue
class
LIFO
destructive
8. 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
parent
link
reference type
depth
9. To look through a data structure until a goal object is found
stack frame
structure sharing
search
doubly linked list
10. Describes a though experiment or view of an entity
gedanken
amortized Analysis
grammar
circular queue
11. In a tree - a node that points to a given node
ontology
parent
side-effect
alias
12. An elements of a linked list - tree - or graph - often represented by a data structure
node
stack frame
procedural abstraction
alias
13. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
design pattern
quadratic
complex data type
doubly linked list
14. A problem whose solution requires a linear amount of time or space if the problem is size n
dereference
set difference
linear O(n)
postorder
15. A description of the state of a process such as a board game
state
doubly linked list
link
interior node
16. An order of processing a tree in which the parent node is processed after its children
scope
amortized Analysis
complex ADT
postorder
17. 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
node
binary search tree (bst)
structure sharing
side-effect
18. A contiguous block of memory containing elements of the same type - accessed by numeric index
array
general list
complex ADT
design pattern
19. Given two sets - the intersection is the set of elements that are members of both sets
data type
dictionary
intersection
depth-first search
20. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
type
set difference
complex ADT
data structure
21. First in first out: describes ordering of a queue
fifo
intractable
big o
branching factor
22. Use of a function or method without knowing how it's accomplished
branching factor
procedural abstraction
abstract data type
fair
23. 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
type
binary tree
scope
inorder
24. A sequence of records - where each record contains a link to the next one
linked list
interior node
array
intersection
25. In a search tree - a program that changes a state into a child state e.g a move in a game
link
immutable
stack space
operator
26. A list of pairs - where each pair has a key and a value associated with the key
intractable
ontology
association list
well-founded ordering xml
27. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
algorithm
ontology
set difference
link
28. To combine two ordered linear structures into one
destructive
merge
descendants
recursive case
29. A node of a tree that has children
intractable
interior node
queue
big o
30. An order of processing a tree in which the parent node is processed before its children
preorder
operator
big o
filter
31. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
pointer
recursive case
data structure
abstract data type
32. Container for storing a collection of data in unique key/value pairs
design pattern
successor
dictionary
scope
33. A linked list in which each elements has both forward and backward pointers
side-effect
garbage
scope
doubly linked list
34. A case where a program calls itself
garbage collection
recursion
big o
fair
35. Values are in the most basic form and cannot be decomposed into smaller parts
alias
design pattern
simple data type
parent
36. Separation of the properties of a data type from its implementation
abstract data type
procedural abstraction
general list
data abstraction
37. A simple case that can be solved easily - without recursion
entinel
base case
stack frame
algorithm
38. Last in first out: describes the order of a stack
boxed number
LIFO
entinel
complex data type
39. A process that removes unwanted elements from a collection
filter
pointer
object
circular queue
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
successor
cons
tail recursive
design pattern
41. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
root
grammar
constructive
algorithm
42. A stack containing a stack frame of variable value for each active invocation of procedure
link
branching factor
runtime stack
backtrack
43. To convert from a pointer to the data that is pointed to
dereference
circularly linked list
grammar
pointer
44. A section of the runtime stack holding the values of all variables for one invocation
procedural abstraction
merge
stack frame
data type
45. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
link
cons
grammar
runtime stack
46. Depth first search
operator
data type
DFS
array
47. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
binary tree
array
divide and conquer
well-founded ordering xml
48. A pointer to the next element in a linked list
postorder
link
filter
root
49. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"
interior node
cons
amortized Analysis
ancestors
50. Constructed of multiple components (simple or complex types)
null dereference
complex data type
circular queue
node