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 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
link
dictionary
garbage collection
boxed number
2. The top node of a tree - from which all other nodes can be reached
root
garbage collection
complex data type
backtrack
3. A linked list in which each elements has both forward and backward pointers
alias
doubly linked list
linked list
complex ADT
4. Composed of a collection of data values; implemented with a data structure
fair
root
immutable
complex ADT
5. A runtime error that occurs when an operation such as method call is attempted on a null pointer
type
general list
abstract data type
null dereference
6. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
divide and conquer
linear O(n)
fifo
complex ADT
7. 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?"
circular queue
random access
amortized Analysis
simple ADT
8. To hide similar items with the same name
shadow
well-founded ordering xml
abstract data type
intractable
9. A node of a tree that has children
pointer
interior node
root
scope
10. A pointer to the next element in a linked list
stack frame
cons
union
link
11. To convert from a pointer to the data that is pointed to
structure sharing
dereference
link
dictionary
12. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
runtime stack
pointer
depth
queue
13. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
cons
reference type
depth-first search
14. All nodes below a give node in a tree
array
descendants
search
data type
15. Two variables that reference the same object
abstract data type
runtime stack
complex ADT
alias
16. A list of pairs - where each pair has a key and a value associated with the key
association list
postorder
merge
array
17. A simple case that can be solved easily - without recursion
linear O(n)
fair
base case
backtrack
18. Values are in the most basic form and cannot be decomposed into smaller parts
goal
simple data type
linked list
array
19. A process that removes unwanted elements from a collection
grammar
class
filter
branching factor
20. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
array
alias
goal
tail recursive
21. Describes a data structure or device in which all accesses have the same cost - O(1)
random access
ontology
doubly linked list
filter
22. The process of collecting garbage for recycling
boxed number
ontology
recursive case
garbage collection
23. A description of operations on a data type that could have multiple possible implementations
abstract data type
intractable
intersection
structure sharing
24. A case where a program calls itself
descendants
pointer
successor
recursion
25. Describes a function that modifies its arguments
array
grammar
recursive case
destructive
26. Depth first search
complex ADT
DFS
class
data type
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
tail recursive
big o
complex data type
merge
28. 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
garbage
algorithm
branching factor
abstract data type
29. Given two sets -the union is the set of elements that are members of either set
binary search tree (bst)
union
state
simple ADT
30. Use of a function or method without knowing how it's accomplished
procedural abstraction
fifo
node
inorder
31. Container for storing a collection of data in unique key/value pairs
intractable
stack
stack space
dictionary
32. An order of processing a tree in which the parent node is processed after its children
linear O(n)
postorder
sort
cons
33. A section of the runtime stack holding the values of all variables for one invocation
well-founded ordering xml
gedanken
stack frame
linked list
34. In a tree - a node that points to a given node
random access
well-founded ordering xml
parent
quadratic
35. 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
postorder
binary search tree (bst)
simple ADT
queue
36. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
intersection
object
intractable
immutable
37. An order of processing a tree in which the parent node is processed before its children
fifo
big o
preorder
backtrack
38. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
pointer
cons
garbage collection
sort
39. 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
object
filter
data abstraction
reference type
40. A search in which children of a node are considered before siblings are considered
depth-first search
merge
dictionary
side-effect
41. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
shadow
data abstraction
ontology
recursive case
42. A description of the state of a process such as a board game
state
backtrack
immutable
tail recursive
43. A collection of objects that are inserted and removed according to the LIFO principle
stack
type
shadow
array
44. In a tree search - to move back from the node currently being examined to its parent
scope
garbage collection
recursion
backtrack
45. The amount of space on the runtime stack required for execution of a program
array
stack space
runtime stack
immutable
46. A contiguous block of memory containing elements of the same type - accessed by numeric index
search
circularly linked list
stack
array
47. The number of links between the root of a tree and the leaves
depth
well-founded ordering xml
destructive
grammar
48. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
merge
grammar
gedanken
array
49. A problem whose solution requires a linear amount of time or space if the problem is size n
runtime stack
linear O(n)
root
base case
50. A case where tow data structures share some elements
structure sharing
data abstraction
runtime stack
simple data type
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