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 description of operations on a data type that could have multiple possible implementations
abstract data type
data type
stack space
recursion
2. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
ancestors
depth-first search
algorithm
alias
3. A queue implemented within an array - where the first elements of the array logically follows the last elements
circular queue
interior node
gedanken
array
4. A list of pairs - where each pair has a key and a value associated with the key
association list
random access
ancestors
depth
5. All nodes below a give node in a tree
descendants
fifo
linked list
structure sharing
6. A pointer to data
class
reference
merge
data abstraction
7. A description of the state of a process such as a board game
recursive case
operator
leaf
state
8. A given collection of values along with a collection of operations for use on those values
abstract data type
inorder
sort
data type
9. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
binary tree
data structure
simple ADT
recursive case
10. 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
binary search tree (bst)
intersection
backtrack
recursive case
11. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
grammar
descendants
tail recursive
side-effect
12. Composed of multiple sequential elements stored in contiguous bytes of memory
circularly linked list
array
pointer
fair
13. To convert from a pointer to the data that is pointed to
circular queue
dereference
garbage collection
immutable
14. A condition of the input data where the data will be handled by call(s) to the same program
algorithm
well-founded ordering xml
parent
recursive case
15. A pointer to the next element in a linked list
link
sort
amortized Analysis
leaf
16. An elements of a linked list - tree - or graph - often represented by a data structure
node
backtrack
link
queue
17. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
tail recursive
immutable
procedural abstraction
pointer
18. 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
side-effect
big o
stack frame
LIFO
19. Given two sets - the intersection is the set of elements that are members of both sets
taxonomy
backtrack
simple ADT
intersection
20. A tree node containing a contents value but with no children
tail recursive
leaf
random access
object
21. 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
cons
garbage
entinel
tail recursive
22. Describes a though experiment or view of an entity
data type
complex ADT
gedanken
intersection
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
LIFO
big o
null dereference
branching factor
24. Composed of a collection of data values; implemented with a data structure
stack frame
complex ADT
abstract data type
ancestors
25. An order of processing a tree in which the parent node is processed in between its children
preorder
inorder
intersection
branching factor
26. A node of a tree that has children
sort
fifo
stack
interior node
27. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
recursion
link
alias
28. An extra record at the start or end of a data structure such as a linked list - to simplify processing
immutable
garbage collection
link
entinel
29. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
object
random access
complex data type
well-founded ordering xml
30. Describes a function that modifies its arguments
destructive
array
abstract data type
operator
31. Depth first search
boxed number
null dereference
DFS
goal
32. In object oriented programming - a description of a set of similar objects
intersection
procedural abstraction
class
pointer
33. A data structure that can be identified at runtime as being a member of a class
union
backtrack
depth-first search
object
34. A section of the runtime stack holding the values of all variables for one invocation
stack frame
complex ADT
child
sort
35. A linked list in which each elements has both forward and backward pointers
grammar
amortized Analysis
doubly linked list
simple data type
36. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
node
LIFO
ontology
data abstraction
37. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
cons
recursion
branching factor
queue
38. In a tree - the union of a node's parent and the parent's ancestors
type
operator
ancestors
destructive
39. A variable containing the address of other data
simple ADT
pointer
immutable
complex ADT
40. 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
branching factor
successor
ontology
binary tree
41. Composed of individually named data fields
side-effect
simple ADT
destructive
immutable
42. To combine two ordered linear structures into one
circularly linked list
merge
ontology
dictionary
43. Values are in the most basic form and cannot be decomposed into smaller parts
big o
recursion
simple data type
structure sharing
44. Describes a function that makes a new data structure but does not modify its arguments
filter
runtime stack
constructive
state
45. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
stack
interior node
grammar
array
46. 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?"
union
null dereference
amortized Analysis
well-founded ordering xml
47. A collection of objects that are inserted and removed according to the LIFO principle
postorder
data abstraction
taxonomy
stack
48. A pattern that describes a set of similar programs
garbage collection
general list
design pattern
simple ADT
49. A problem that is so hard that it cannot be solved unless the problem is small
ontology
dictionary
intractable
circular queue
50. The area of program text over which a variable can be referenced
type
quadratic
destructive
scope