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 condition of the input data where the data will be handled by call(s) to the same program
shadow
root
recursive case
LIFO
2. To look through a data structure until a goal object is found
search
circularly linked list
backtrack
base case
3. A case where a program calls itself
ontology
stack frame
abstract data type
recursion
4. Describes a function that makes a new data structure but does not modify its arguments
base case
scope
constructive
search
5. In object oriented programming - a description of a set of similar objects
runtime stack
class
garbage collection
dictionary
6. Given two sets -the union is the set of elements that are members of either set
union
merge
depth
array
7. Describes a data structure or device in which all accesses have the same cost - O(1)
random access
data abstraction
structure sharing
root
8. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
ancestors
stack frame
sort
complex ADT
9. 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
operator
parent
design pattern
10. A section of the runtime stack holding the values of all variables for one invocation
stack frame
big o
type
circular queue
11. Values are in the most basic form and cannot be decomposed into smaller parts
filter
boxed number
root
simple data type
12. A classification of objects into a tree structure that groups related objects
taxonomy
tail recursive
well-founded ordering xml
root
13. The amount of space on the runtime stack required for execution of a program
stack space
preorder
array
child
14. Constructed of multiple components (simple or complex types)
general list
inorder
null dereference
complex data type
15. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
object
algorithm
null dereference
16. A simple case that can be solved easily - without recursion
alias
base case
reference
preorder
17. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
algorithm
parent
child
18. The top node of a tree - from which all other nodes can be reached
grammar
big o
root
divide and conquer
19. To hide similar items with the same name
array
random access
recursive case
shadow
20. A pointer to the next element in a linked list
binary search tree (bst)
cons
depth-first search
link
21. Composed of a collection of data values; implemented with a data structure
data abstraction
successor
intractable
complex ADT
22. 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
leaf
preorder
stack
boxed number
23. An order of processing a tree in which the parent node is processed after its children
ancestors
descendants
postorder
recursive case
24. Composed of individually named data fields
simple ADT
circularly linked list
entinel
set difference
25. 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
destructive
root
binary search tree (bst)
complex data type
26. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
quadratic
depth-first search
object
root
27. The next element in a linked list
binary tree
array
successor
garbage
28. A queue implemented within an array - where the first elements of the array logically follows the last elements
big o
DFS
dereference
circular queue
29. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
LIFO
garbage collection
data structure
doubly linked list
30. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
gedanken
parent
structure sharing
ontology
31. An order of processing a tree in which the parent node is processed in between its children
reference type
reference
inorder
cons
32. 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
binary tree
reference type
goal
boxed number
33. Separation of the properties of a data type from its implementation
dereference
divide and conquer
well-founded ordering xml
data abstraction
34. To combine two ordered linear structures into one
divide and conquer
linked list
merge
garbage collection
35. To convert from a pointer to the data that is pointed to
data type
dereference
root
class
36. An item (or description of items) being sough in a search
goal
tail recursive
garbage
class
37. A description of the state of a process such as a board game
state
fifo
design pattern
constructive
38. An elements of a linked list - tree - or graph - often represented by a data structure
shadow
fair
operator
node
39. First-child/next-sibling
data abstraction
gedanken
fair
random access
40. A data structure that can be identified at runtime as being a member of a class
alias
union
tail recursive
object
41. A list of pairs - where each pair has a key and a value associated with the key
association list
grammar
scope
intersection
42. In a search tree - a program that changes a state into a child state e.g a move in a game
linked list
depth
operator
link
43. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
simple data type
scope
intractable
well-founded ordering xml
44. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
side-effect
object
data structure
recursion
45. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
algorithm
simple ADT
general list
backtrack
46. Container for storing a collection of data in unique key/value pairs
dictionary
design pattern
doubly linked list
linked list
47. A variable containing the address of other data
data abstraction
pointer
doubly linked list
complex ADT
48. The process of collecting garbage for recycling
algorithm
entinel
dictionary
garbage collection
49. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
constructive
divide and conquer
stack frame
random access
50. Two variables that reference the same object
pointer
general list
alias
garbage collection
Sorry!:) No result found.
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