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. An order of processing a tree in which the parent node is processed in between its children
circular queue
inorder
complex data type
design pattern
2. 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
fair
inorder
boxed number
dereference
3. The process of collecting garbage for recycling
garbage collection
reference type
goal
interior node
4. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
well-founded ordering xml
backtrack
grammar
stack space
5. A linked list in which each elements has both forward and backward pointers
doubly linked list
stack
constructive
array
6. A given collection of values along with a collection of operations for use on those values
algorithm
data type
depth-first search
shadow
7. The number of links between the root of a tree and the leaves
depth
gedanken
LIFO
structure sharing
8. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
null dereference
circular queue
tail recursive
intractable
9. A case where tow data structures share some elements
boxed number
search
structure sharing
abstract data type
10. The area of program text over which a variable can be referenced
leaf
search
parent
scope
11. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
recursion
set difference
parent
child
12. 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
fifo
base case
general list
binary search tree (bst)
13. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
stack frame
LIFO
immutable
depth-first search
14. A problem that is so hard that it cannot be solved unless the problem is small
dictionary
base case
intractable
stack space
15. In a tree - a node that points to a given node
parent
general list
constructive
root
16. A pattern that describes a set of similar programs
design pattern
binary search tree (bst)
array
base case
17. Describes a function that modifies its arguments
data type
linear O(n)
destructive
type
18. A pointer to the next element in a linked list
array
side-effect
link
circular queue
19. Describes a data structure or device in which all accesses have the same cost - O(1)
constructive
array
random access
alias
20. 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
link
intractable
reference type
linked list
21. Composed of multiple sequential elements stored in contiguous bytes of memory
leaf
quadratic
binary search tree (bst)
array
22. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
parent
preorder
grammar
array
23. A tree node containing a contents value but with no children
goal
entinel
leaf
garbage collection
24. A variable containing the address of other data
inorder
postorder
complex data type
pointer
25. The top node of a tree - from which all other nodes can be reached
fifo
root
recursion
stack space
26. 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
general list
dereference
binary tree
filter
27. Two variables that reference the same object
well-founded ordering xml
general list
data type
alias
28. Given two sets -the union is the set of elements that are members of either set
union
reference type
queue
data abstraction
29. An elements of a linked list - tree - or graph - often represented by a data structure
parent
node
entinel
base case
30. The next element in a linked list
successor
depth-first search
big o
destructive
31. First in first out: describes ordering of a queue
leaf
goal
gedanken
fifo
32. An item (or description of items) being sough in a search
root
goal
interior node
state
33. Composed of individually named data fields
fair
successor
simple ADT
design pattern
34. Values are in the most basic form and cannot be decomposed into smaller parts
dereference
divide and conquer
set difference
simple data type
35. A linked list in which the last element points back to the first element
circularly linked list
dictionary
array
branching factor
36. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
LIFO
garbage collection
amortized Analysis
37. An extra record at the start or end of a data structure such as a linked list - to simplify processing
stack space
set difference
procedural abstraction
entinel
38. An order of processing a tree in which the parent node is processed after its children
postorder
link
side-effect
simple data type
39. The amount of space on the runtime stack required for execution of a program
stack space
quadratic
general list
doubly linked list
40. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
branching factor
algorithm
array
big o
41. A description of the state of a process such as a board game
linked list
state
leaf
null dereference
42. A queue implemented within an array - where the first elements of the array logically follows the last elements
boxed number
circular queue
depth-first search
abstract data type
43. Last in first out: describes the order of a stack
LIFO
entinel
destructive
garbage
44. 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
interior node
null dereference
class
branching factor
45. To look through a data structure until a goal object is found
search
complex ADT
side-effect
design pattern
46. A section of the runtime stack holding the values of all variables for one invocation
garbage
dictionary
cons
stack frame
47. A problem whose solution requires a linear amount of time or space if the problem is size n
data type
grammar
linear O(n)
data structure
48. Constructed of multiple components (simple or complex types)
data structure
tail recursive
complex data type
simple ADT
49. Use of a function or method without knowing how it's accomplished
operator
runtime stack
procedural abstraction
garbage collection
50. A runtime error that occurs when an operation such as method call is attempted on a null pointer
dereference
abstract data type
state
null dereference
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