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. Values are in the most basic form and cannot be decomposed into smaller parts
complex ADT
circularly linked list
simple data type
fair
2. A description of operations on a data type that could have multiple possible implementations
taxonomy
complex data type
shadow
abstract data type
3. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
random access
stack space
queue
complex data type
4. A description of the state of a process such as a board game
big o
procedural abstraction
state
side-effect
5. To look through a data structure until a goal object is found
search
ontology
scope
big o
6. Describes a function that modifies its arguments
circular queue
search
destructive
quadratic
7. A pointer to data
complex data type
reference
depth-first search
simple data type
8. 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
reference type
search
goal
descendants
9. Describes a function that makes a new data structure but does not modify its arguments
recursion
data structure
abstract data type
constructive
10. The number of links between the root of a tree and the leaves
intractable
simple ADT
amortized Analysis
depth
11. 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
linked list
object
runtime stack
12. A sequence of records - where each record contains a link to the next one
linked list
backtrack
root
data abstraction
13. A problem whose solution requires a linear amount of time or space if the problem is size n
class
branching factor
inorder
linear O(n)
14. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
divide and conquer
intractable
algorithm
cons
15. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
constructive
immutable
data abstraction
descendants
16. Given two sets - the intersection is the set of elements that are members of both sets
recursion
intersection
set difference
boxed number
17. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
reference
tail recursive
doubly linked list
ontology
18. A variable containing the address of other data
abstract data type
sort
pointer
reference
19. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
grammar
ontology
taxonomy
leaf
20. A classification of objects into a tree structure that groups related objects
data structure
tail recursive
taxonomy
complex ADT
21. A process that removes unwanted elements from a collection
side-effect
intractable
filter
ontology
22. A tree node containing a contents value but with no children
search
boxed number
successor
leaf
23. A case where tow data structures share some elements
class
structure sharing
queue
successor
24. An elements of a linked list - tree - or graph - often represented by a data structure
node
complex ADT
random access
garbage
25. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
taxonomy
postorder
set difference
scope
26. An order of processing a tree in which the parent node is processed after its children
reference
array
scope
postorder
27. Constructed of multiple components (simple or complex types)
leaf
complex data type
fair
dereference
28. In a tree - a node that points to a given node
parent
data abstraction
simple ADT
complex data type
29. An extra record at the start or end of a data structure such as a linked list - to simplify processing
binary search tree (bst)
entinel
backtrack
search
30. Last in first out: describes the order of a stack
search
null dereference
class
LIFO
31. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
side-effect
well-founded ordering xml
data abstraction
successor
32. A contiguous block of memory containing elements of the same type - accessed by numeric index
pointer
array
data structure
backtrack
33. The top node of a tree - from which all other nodes can be reached
association list
root
simple ADT
data structure
34. The amount of space on the runtime stack required for execution of a program
descendants
doubly linked list
stack space
well-founded ordering xml
35. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
postorder
depth
sort
tail recursive
36. The process of collecting garbage for recycling
binary tree
garbage collection
state
pointer
37. In a search tree - a program that changes a state into a child state e.g a move in a game
constructive
operator
link
recursive case
38. All nodes below a give node in a tree
union
complex data type
alias
descendants
39. To convert from a pointer to the data that is pointed to
dereference
shadow
runtime stack
leaf
40. A linked list in which the last element points back to the first element
circularly linked list
union
filter
postorder
41. An order of processing a tree in which the parent node is processed in between its children
node
depth-first search
inorder
ancestors
42. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
reference
quadratic
child
search
43. 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
DFS
goal
binary tree
general list
44. A condition of the input data where the data will be handled by call(s) to the same program
pointer
scope
depth-first search
recursive case
45. 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
side-effect
type
data abstraction
46. In a tree search - to move back from the node currently being examined to its parent
linked list
backtrack
null dereference
state
47. Separation of the properties of a data type from its implementation
data abstraction
DFS
data type
set difference
48. A data structure that can be identified at runtime as being a member of a class
structure sharing
reference type
object
preorder
49. To hide similar items with the same name
shadow
intractable
DFS
class
50. A pattern that describes a set of similar programs
structure sharing
design pattern
reference
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