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. Composed of individually named data fields
simple ADT
pointer
data abstraction
garbage
2. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
leaf
ontology
procedural abstraction
reference
3. 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
boxed number
gedanken
stack frame
quadratic
4. Describes a function that makes a new data structure but does not modify its arguments
circular queue
constructive
amortized Analysis
complex data type
5. A classification of objects into a tree structure that groups related objects
design pattern
taxonomy
quadratic
alias
6. A queue implemented within an array - where the first elements of the array logically follows the last elements
circular queue
linked list
shadow
design pattern
7. To convert from a pointer to the data that is pointed to
dereference
successor
divide and conquer
binary tree
8. Separation of the properties of a data type from its implementation
data abstraction
divide and conquer
data structure
taxonomy
9. A description of the state of a process such as a board game
search
simple ADT
state
reference type
10. A search in which children of a node are considered before siblings are considered
linked list
depth-first search
cons
garbage
11. Any container with linear ordering
design pattern
general list
scope
runtime stack
12. A description of operations on a data type that could have multiple possible implementations
abstract data type
tail recursive
parent
linked list
13. Use of a function or method without knowing how it's accomplished
linear O(n)
procedural abstraction
base case
postorder
14. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
side-effect
set difference
array
cons
15. Two variables that reference the same object
doubly linked list
shadow
alias
destructive
16. A problem whose solution requires a linear amount of time or space if the problem is size n
divide and conquer
parent
linear O(n)
null dereference
17. Given two sets -the union is the set of elements that are members of either set
general list
union
alias
abstract data type
18. An item (or description of items) being sough in a search
divide and conquer
binary search tree (bst)
ancestors
goal
19. The number of links between the root of a tree and the leaves
array
taxonomy
stack space
depth
20. Describes a function that modifies its arguments
node
grammar
destructive
amortized Analysis
21. 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
complex data type
leaf
root
22. In object oriented programming - a description of a set of similar objects
class
structure sharing
design pattern
simple ADT
23. The amount of space on the runtime stack required for execution of a program
intractable
simple ADT
stack space
filter
24. To combine two ordered linear structures into one
data structure
fifo
merge
cons
25. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
leaf
linear O(n)
DFS
well-founded ordering xml
26. Describes a data structure or device in which all accesses have the same cost - O(1)
taxonomy
reference
random access
object
27. 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
garbage
recursion
cons
28. A variable containing the address of other data
dereference
pointer
immutable
amortized Analysis
29. A given collection of values along with a collection of operations for use on those values
data type
root
entinel
boxed number
30. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
reference type
abstract data type
side-effect
data structure
31. In a tree - the union of a node's parent and the parent's ancestors
fifo
ancestors
intersection
interior node
32. A pointer to the next element in a linked list
ontology
side-effect
link
merge
33. A section of the runtime stack holding the values of all variables for one invocation
root
state
stack
stack frame
34. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
sort
type
immutable
queue
35. All nodes below a give node in a tree
constructive
inorder
descendants
ancestors
36. A list of pairs - where each pair has a key and a value associated with the key
association list
dictionary
garbage collection
fair
37. Values are in the most basic form and cannot be decomposed into smaller parts
ontology
doubly linked list
simple data type
design pattern
38. Describes a though experiment or view of an entity
parent
preorder
gedanken
recursive case
39. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
binary search tree (bst)
taxonomy
cons
algorithm
40. A contiguous block of memory containing elements of the same type - accessed by numeric index
general list
array
divide and conquer
procedural abstraction
41. First in first out: describes ordering of a queue
null dereference
fifo
alias
amortized Analysis
42. First-child/next-sibling
alias
fair
preorder
immutable
43. A pattern that describes a set of similar programs
design pattern
fair
destructive
reference
44. A tree node containing a contents value but with no children
leaf
doubly linked list
state
inorder
45. A data structure that can be identified at runtime as being a member of a class
intersection
random access
object
abstract data type
46. Container for storing a collection of data in unique key/value pairs
dictionary
set difference
grammar
backtrack
47. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
set difference
stack
association list
reference type
48. An order of processing a tree in which the parent node is processed after its children
garbage collection
depth-first search
algorithm
postorder
49. A pointer to data
preorder
reference
object
stack space
50. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
intersection
random access
fifo
sort
Can you answer 50 questions in 15 minutes?
Let me suggest you:
Browse all subjects
Browse all tests
Most popular tests
Major Subjects
Tests & Exams
AP
CLEP
DSST
GRE
SAT
GMAT
Certifications
CISSP go to https://www.isc2.org/
PMP
ITIL
RHCE
MCTS
More...
IT Skills
Android Programming
Data Modeling
Objective C Programming
Basic Python Programming
Adobe Illustrator
More...
Business Skills
Advertising Techniques
Business Accounting Basics
Business Strategy
Human Resource Management
Marketing Basics
More...
Soft Skills
Body Language
People Skills
Public Speaking
Persuasion
Job Hunting And Resumes
More...
Vocabulary
GRE Vocab
SAT Vocab
TOEFL Essential Vocab
Basic English Words For All
Global Words You Should Know
Business English
More...
Languages
AP German Vocab
AP Latin Vocab
SAT Subject Test: French
Italian Survival
Norwegian Survival
More...
Engineering
Audio Engineering
Computer Science Engineering
Aerospace Engineering
Chemical Engineering
Structural Engineering
More...
Health Sciences
Basic Nursing Skills
Health Science Language Fundamentals
Veterinary Technology Medical Language
Cardiology
Clinical Surgery
More...
English
Grammar Fundamentals
Literary And Rhetorical Vocab
Elements Of Style Vocab
Introduction To English Major
Complete Advanced Sentences
Literature
Homonyms
More...
Math
Algebra Formulas
Basic Arithmetic: Measurements
Metric Conversions
Geometric Properties
Important Math Facts
Number Sense Vocab
Business Math
More...
Other Major Subjects
Science
Economics
History
Law
Performing-arts
Cooking
Logic & Reasoning
Trivia
Browse all subjects
Browse all tests
Most popular tests