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 description of operations on a data type that could have multiple possible implementations
filter
abstract data type
garbage
divide and conquer
2. A simple case that can be solved easily - without recursion
recursive case
data type
garbage
base case
3. An order of processing a tree in which the parent node is processed before its children
general list
parent
preorder
intractable
4. An order of processing a tree in which the parent node is processed after its children
parent
postorder
reference type
constructive
5. In object oriented programming - a description of a set of similar objects
root
class
set difference
depth-first search
6. A node of a tree that has children
entinel
interior node
linear O(n)
garbage
7. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
ontology
depth-first search
array
8. In a tree search - to move back from the node currently being examined to its parent
backtrack
immutable
depth
class
9. A process that removes unwanted elements from a collection
filter
doubly linked list
null dereference
data type
10. 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
scope
runtime stack
boxed number
inorder
11. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
algorithm
stack frame
type
filter
12. 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?"
amortized Analysis
array
side-effect
procedural abstraction
13. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
side-effect
preorder
taxonomy
general list
14. A sequence of records - where each record contains a link to the next one
constructive
linked list
root
data type
15. The number of links between the root of a tree and the leaves
depth
shadow
abstract data type
intersection
16. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
quadratic
simple ADT
binary search tree (bst)
backtrack
17. Describes a function that makes a new data structure but does not modify its arguments
simple ADT
scope
entinel
constructive
18. In a search tree - a program that changes a state into a child state e.g a move in a game
ontology
operator
big o
association list
19. 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
general list
root
binary search tree (bst)
circular queue
20. To look through a data structure until a goal object is found
descendants
search
entinel
backtrack
21. Values are in the most basic form and cannot be decomposed into smaller parts
simple data type
search
entinel
inorder
22. A section of the runtime stack holding the values of all variables for one invocation
simple data type
stack
depth
stack frame
23. The top node of a tree - from which all other nodes can be reached
set difference
root
intractable
leaf
24. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
type
node
sort
25. A queue implemented within an array - where the first elements of the array logically follows the last elements
garbage
descendants
type
circular queue
26. A contiguous block of memory containing elements of the same type - accessed by numeric index
dereference
ancestors
array
taxonomy
27. 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
big o
union
reference type
random access
28. A pointer to the next element in a linked list
fair
link
parent
abstract data type
29. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
set difference
branching factor
backtrack
recursion
30. 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
circularly linked list
binary tree
search
procedural abstraction
31. 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
reference type
big o
tail recursive
operator
32. Two variables that reference the same object
alias
array
association list
runtime stack
33. A linked list in which the last element points back to the first element
depth
branching factor
circularly linked list
alias
34. The area of program text over which a variable can be referenced
filter
well-founded ordering xml
immutable
scope
35. Composed of multiple sequential elements stored in contiguous bytes of memory
big o
runtime stack
goal
array
36. To combine two ordered linear structures into one
runtime stack
state
merge
DFS
37. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
well-founded ordering xml
class
stack frame
ontology
38. Given two sets - the intersection is the set of elements that are members of both sets
linked list
intersection
algorithm
node
39. A case where tow data structures share some elements
algorithm
structure sharing
recursive case
depth
40. Describes a though experiment or view of an entity
child
state
gedanken
algorithm
41. Describes a function that modifies its arguments
amortized Analysis
null dereference
array
destructive
42. In a tree - a node that points to a given node
random access
taxonomy
entinel
parent
43. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
divide and conquer
grammar
dictionary
procedural abstraction
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
leaf
branching factor
node
binary search tree (bst)
45. All nodes below a give node in a tree
depth-first search
complex ADT
descendants
fifo
46. First-child/next-sibling
root
stack space
general list
fair
47. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
complex data type
tail recursive
ontology
fair
48. Use of a function or method without knowing how it's accomplished
procedural abstraction
linked list
cons
scope
49. The next element in a linked list
taxonomy
successor
DFS
garbage collection
50. A stack containing a stack frame of variable value for each active invocation of procedure
linear O(n)
recursion
parent
runtime stack
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