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 function whose value either does not involve a recursive call - or is exactly the value of a recursive call
destructive
tail recursive
amortized Analysis
queue
2. The top node of a tree - from which all other nodes can be reached
root
backtrack
gedanken
circular queue
3. Depth first search
intersection
DFS
dereference
class
4. An order of processing a tree in which the parent node is processed before its children
dereference
preorder
abstract data type
null dereference
5. The amount of space on the runtime stack required for execution of a program
intersection
stack space
boxed number
depth
6. A section of the runtime stack holding the values of all variables for one invocation
stack frame
well-founded ordering xml
branching factor
depth-first search
7. 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
garbage collection
set difference
binary tree
DFS
8. A linked list in which each elements has both forward and backward pointers
garbage collection
root
search
doubly linked list
9. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
base case
divide and conquer
binary search tree (bst)
10. In a tree - a node that points to a given node
goal
random access
link
parent
11. A simple case that can be solved easily - without recursion
base case
design pattern
random access
data type
12. Two variables that reference the same object
divide and conquer
parent
alias
ancestors
13. A data structure that can be identified at runtime as being a member of a class
object
reference type
abstract data type
ontology
14. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
stack space
sort
immutable
base case
15. In a tree search - to move back from the node currently being examined to its parent
backtrack
doubly linked list
gedanken
set difference
16. Describes a function that modifies its arguments
dereference
destructive
data type
quadratic
17. The area of program text over which a variable can be referenced
ancestors
dictionary
constructive
scope
18. A description of operations on a data type that could have multiple possible implementations
binary tree
big o
abstract data type
constructive
19. The process of collecting garbage for recycling
garbage collection
state
descendants
quadratic
20. An order of processing a tree in which the parent node is processed after its children
reference type
postorder
reference
amortized Analysis
21. A variable containing the address of other data
array
node
reference
pointer
22. The number of links between the root of a tree and the leaves
divide and conquer
gedanken
random access
depth
23. Given two sets -the union is the set of elements that are members of either set
ancestors
structure sharing
successor
union
24. A pointer to the next element in a linked list
random access
link
runtime stack
reference type
25. A contiguous block of memory containing elements of the same type - accessed by numeric index
interior node
grammar
intersection
array
26. A description of the state of a process such as a board game
doubly linked list
data structure
state
boxed number
27. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
branching factor
grammar
inorder
shadow
28. Last in first out: describes the order of a stack
descendants
LIFO
algorithm
gedanken
29. A pattern that describes a set of similar programs
link
design pattern
amortized Analysis
abstract data type
30. Any container with linear ordering
DFS
general list
successor
alias
31. To hide similar items with the same name
amortized Analysis
merge
shadow
backtrack
32. A given collection of values along with a collection of operations for use on those values
intersection
merge
data type
reference
33. Given two sets - the intersection is the set of elements that are members of both sets
intersection
leaf
entinel
random access
34. A sequence of records - where each record contains a link to the next one
entinel
linked list
backtrack
sort
35. Separation of the properties of a data type from its implementation
binary search tree (bst)
structure sharing
data abstraction
binary tree
36. In a search tree - a program that changes a state into a child state e.g a move in a game
operator
runtime stack
complex data type
design pattern
37. A case where tow data structures share some elements
null dereference
quadratic
structure sharing
simple ADT
38. A linked list in which the last element points back to the first element
circularly linked list
backtrack
object
immutable
39. An item (or description of items) being sough in a search
queue
reference type
operator
goal
40. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
circularly linked list
backtrack
well-founded ordering xml
design pattern
41. Use of a function or method without knowing how it's accomplished
child
algorithm
procedural abstraction
linked list
42. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
linear O(n)
postorder
sort
type
43. An elements of a linked list - tree - or graph - often represented by a data structure
node
boxed number
pointer
stack space
44. A pointer to data
reference
merge
fifo
constructive
45. A queue implemented within an array - where the first elements of the array logically follows the last elements
destructive
parent
inorder
circular queue
46. Describes a function that makes a new data structure but does not modify its arguments
design pattern
taxonomy
ancestors
constructive
47. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
complex data type
random access
quadratic
inorder
48. A stack containing a stack frame of variable value for each active invocation of procedure
depth-first search
runtime stack
successor
random access
49. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
class
intersection
divide and conquer
fair
50. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
class
ontology
DFS
preorder
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