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. Composed of a collection of data values; implemented with a data structure
complex ADT
depth-first search
postorder
array
2. Given two sets - the intersection is the set of elements that are members of both sets
parent
recursive case
doubly linked list
intersection
3. An order of processing a tree in which the parent node is processed in between its children
array
set difference
inorder
linear O(n)
4. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
data type
data abstraction
depth-first search
algorithm
5. Constructed of multiple components (simple or complex types)
complex data type
goal
DFS
array
6. 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
ontology
divide and conquer
dictionary
7. In a tree search - to move back from the node currently being examined to its parent
ancestors
class
data type
backtrack
8. Depth first search
simple ADT
reference
DFS
data structure
9. Any container with linear ordering
garbage
general list
gedanken
parent
10. A description of operations on a data type that could have multiple possible implementations
circularly linked list
data abstraction
abstract data type
dictionary
11. Values are in the most basic form and cannot be decomposed into smaller parts
recursive case
ancestors
simple data type
garbage collection
12. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
inorder
goal
well-founded ordering xml
set difference
13. A runtime error that occurs when an operation such as method call is attempted on a null pointer
intersection
null dereference
abstract data type
reference
14. A case where a program calls itself
constructive
null dereference
recursion
side-effect
15. An elements of a linked list - tree - or graph - often represented by a data structure
quadratic
linked list
type
node
16. 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
algorithm
alias
doubly linked list
17. A linked list in which the last element points back to the first element
state
backtrack
amortized Analysis
circularly linked list
18. The process of collecting garbage for recycling
array
complex ADT
garbage collection
side-effect
19. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure
abstract data type
dictionary
ontology
cons
20. In object oriented programming - a description of a set of similar objects
destructive
base case
class
simple data type
21. 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
recursive case
complex ADT
node
22. A node of a tree that has children
alias
link
interior node
cons
23. A variable containing the address of other data
pointer
stack space
object
state
24. 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?"
design pattern
queue
destructive
amortized Analysis
25. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
random access
taxonomy
dereference
26. In a tree - the union of a node's parent and the parent's ancestors
descendants
ancestors
depth-first search
depth
27. Describes a data structure or device in which all accesses have the same cost - O(1)
union
random access
tail recursive
dereference
28. Last in first out: describes the order of a stack
circular queue
linear O(n)
LIFO
leaf
29. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
linked list
dictionary
alias
immutable
30. In a tree - a node that points to a given node
stack space
parent
depth-first search
immutable
31. A data structure that can be identified at runtime as being a member of a class
object
base case
grammar
intractable
32. The amount of space on the runtime stack required for execution of a program
stack space
root
union
circular queue
33. Container for storing a collection of data in unique key/value pairs
set difference
big o
dictionary
recursive case
34. A section of the runtime stack holding the values of all variables for one invocation
set difference
grammar
association list
stack frame
35. To convert from a pointer to the data that is pointed to
dereference
well-founded ordering xml
goal
structure sharing
36. Composed of multiple sequential elements stored in contiguous bytes of memory
data type
branching factor
union
array
37. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
queue
descendants
linked list
successor
38. A collection of objects that are inserted and removed according to the LIFO principle
stack
recursive case
successor
preorder
39. A sequence of records - where each record contains a link to the next one
search
binary tree
linked list
amortized Analysis
40. In a search tree - a program that changes a state into a child state e.g a move in a game
algorithm
operator
DFS
alias
41. To combine two ordered linear structures into one
destructive
class
merge
linear O(n)
42. To look through a data structure until a goal object is found
grammar
type
search
taxonomy
43. Separation of the properties of a data type from its implementation
doubly linked list
abstract data type
data structure
data abstraction
44. A search in which children of a node are considered before siblings are considered
destructive
association list
depth-first search
structure sharing
45. 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
binary search tree (bst)
type
operator
sort
46. Given two sets -the union is the set of elements that are members of either set
grammar
LIFO
divide and conquer
union
47. A linked list in which each elements has both forward and backward pointers
doubly linked list
postorder
stack
circular queue
48. A list of pairs - where each pair has a key and a value associated with the key
queue
association list
sort
state
49. A queue implemented within an array - where the first elements of the array logically follows the last elements
base case
circular queue
queue
stack space
50. An extra record at the start or end of a data structure such as a linked list - to simplify processing
sort
search
DFS
entinel
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