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. In object oriented programming - a description of a set of similar objects
class
set difference
ancestors
search
2. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
binary tree
general list
sort
recursion
3. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
root
quadratic
boxed number
amortized Analysis
4. A queue implemented within an array - where the first elements of the array logically follows the last elements
circular queue
array
gedanken
side-effect
5. The number of links between the root of a tree and the leaves
binary tree
array
depth
fair
6. Composed of multiple sequential elements stored in contiguous bytes of memory
array
null dereference
ontology
child
7. In a tree search - to move back from the node currently being examined to its parent
leaf
data abstraction
backtrack
recursion
8. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
interior node
tail recursive
entinel
amortized Analysis
9. A list of pairs - where each pair has a key and a value associated with the key
association list
scope
parent
cons
10. 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
fair
preorder
intractable
11. A given collection of values along with a collection of operations for use on those values
backtrack
shadow
data type
circular queue
12. A description of operations on a data type that could have multiple possible implementations
shadow
parent
abstract data type
simple data type
13. First-child/next-sibling
recursive case
fair
tail recursive
reference type
14. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
fair
well-founded ordering xml
filter
grammar
15. An order of processing a tree in which the parent node is processed in between its children
null dereference
structure sharing
inorder
taxonomy
16. Any container with linear ordering
preorder
LIFO
abstract data type
general list
17. 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?"
fair
association list
amortized Analysis
union
18. 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
depth-first search
immutable
structure sharing
19. To look through a data structure until a goal object is found
search
boxed number
alias
general list
20. In a tree - a node that points to a given node
inorder
preorder
depth-first search
parent
21. All nodes below a give node in a tree
descendants
parent
intersection
complex data type
22. A linked list in which each elements has both forward and backward pointers
child
doubly linked list
data type
class
23. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
goal
grammar
intersection
leaf
24. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
side-effect
circularly linked list
filter
linked list
25. An extra record at the start or end of a data structure such as a linked list - to simplify processing
simple ADT
fifo
tail recursive
entinel
26. storage that is no longer pointed to by any variable and therefore can no longer be accessed
general list
immutable
garbage
ontology
27. An order of processing a tree in which the parent node is processed after its children
stack
complex ADT
postorder
DFS
28. Separation of the properties of a data type from its implementation
intractable
binary search tree (bst)
data abstraction
branching factor
29. A process that removes unwanted elements from a collection
alias
well-founded ordering xml
gedanken
filter
30. A sequence of records - where each record contains a link to the next one
linked list
constructive
cons
alias
31. A runtime error that occurs when an operation such as method call is attempted on a null pointer
ontology
branching factor
simple data type
null dereference
32. Composed of individually named data fields
intersection
array
interior node
simple ADT
33. In a tree - a node pointed to by a parent node
child
taxonomy
array
structure sharing
34. A collection of objects that are inserted and removed according to the LIFO principle
stack
intractable
union
shadow
35. A simple case that can be solved easily - without recursion
depth-first search
base case
boxed number
recursive case
36. A case where a program calls itself
branching factor
recursion
depth
DFS
37. Use of a function or method without knowing how it's accomplished
scope
recursion
procedural abstraction
big o
38. Constructed of multiple components (simple or complex types)
successor
design pattern
complex data type
dictionary
39. The area of program text over which a variable can be referenced
branching factor
scope
data abstraction
operator
40. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
null dereference
constructive
fair
immutable
41. A description of the state of a process such as a board game
simple ADT
array
state
filter
42. A data structure that can be identified at runtime as being a member of a class
object
dictionary
interior node
parent
43. An elements of a linked list - tree - or graph - often represented by a data structure
type
depth
node
binary tree
44. First in first out: describes ordering of a queue
structure sharing
fifo
stack
union
45. A condition of the input data where the data will be handled by call(s) to the same program
destructive
recursive case
runtime stack
scope
46. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
preorder
destructive
queue
binary search tree (bst)
47. A search in which children of a node are considered before siblings are considered
depth
gedanken
depth-first search
doubly linked list
48. A classification of objects into a tree structure that groups related objects
taxonomy
structure sharing
shadow
simple ADT
49. A case where tow data structures share some elements
linear O(n)
abstract data type
structure sharing
filter
50. Two variables that reference the same object
ancestors
array
alias
linear O(n)
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