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 condition of the input data where the data will be handled by call(s) to the same program
merge
goal
complex data type
recursive case
2. A search in which children of a node are considered before siblings are considered
fair
dictionary
stack space
depth-first search
3. An order of processing a tree in which the parent node is processed after its children
queue
recursive case
general list
postorder
4. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
ancestors
set difference
reference
stack space
5. A given collection of values along with a collection of operations for use on those values
branching factor
recursion
scope
data type
6. Values are in the most basic form and cannot be decomposed into smaller parts
simple data type
fair
alias
filter
7. A node of a tree that has children
merge
dereference
interior node
simple data type
8. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
postorder
immutable
tail recursive
search
9. A collection of values
child
taxonomy
goal
type
10. A tree node containing a contents value but with no children
successor
simple data type
leaf
reference
11. A linked list in which the last element points back to the first element
DFS
circular queue
circularly linked list
complex ADT
12. 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
data abstraction
ancestors
sort
branching factor
13. Composed of individually named data fields
doubly linked list
simple ADT
complex ADT
immutable
14. Constructed of multiple components (simple or complex types)
complex ADT
complex data type
array
filter
15. Describes a function that modifies its arguments
link
type
destructive
null dereference
16. A case where a program calls itself
recursion
fifo
abstract data type
class
17. Depth first search
parent
DFS
reference type
doubly linked list
18. In a tree - the union of a node's parent and the parent's ancestors
ancestors
stack frame
type
association list
19. Given two sets - the intersection is the set of elements that are members of both sets
big o
reference type
intersection
constructive
20. All nodes below a give node in a tree
immutable
reference type
sort
descendants
21. A queue implemented within an array - where the first elements of the array logically follows the last elements
fifo
merge
tail recursive
circular queue
22. A linked list in which each elements has both forward and backward pointers
doubly linked list
entinel
depth-first search
depth
23. A list of pairs - where each pair has a key and a value associated with the key
entinel
pointer
association list
postorder
24. Use of a function or method without knowing how it's accomplished
complex data type
procedural abstraction
general list
algorithm
25. First-child/next-sibling
fair
grammar
reference type
class
26. Given two sets -the union is the set of elements that are members of either set
depth
union
amortized Analysis
algorithm
27. A description of the state of a process such as a board game
interior node
state
reference
leaf
28. A pattern that describes a set of similar programs
constructive
destructive
design pattern
stack space
29. 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
array
garbage
branching factor
cons
30. 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
node
LIFO
gedanken
31. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
entinel
recursion
scope
32. To combine two ordered linear structures into one
backtrack
merge
successor
set difference
33. Any container with linear ordering
general list
queue
stack frame
structure sharing
34. The area of program text over which a variable can be referenced
scope
array
child
DFS
35. A problem whose solution requires a linear amount of time or space if the problem is size n
divide and conquer
parent
linear O(n)
state
36. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
sort
preorder
divide and conquer
complex ADT
37. An item (or description of items) being sough in a search
array
merge
divide and conquer
goal
38. An extra record at the start or end of a data structure such as a linked list - to simplify processing
runtime stack
alias
entinel
scope
39. A runtime error that occurs when an operation such as method call is attempted on a null pointer
random access
array
null dereference
taxonomy
40. Separation of the properties of a data type from its implementation
operator
data abstraction
garbage
union
41. The next element in a linked list
base case
link
successor
gedanken
42. A pointer to the next element in a linked list
depth
link
entinel
divide and conquer
43. storage that is no longer pointed to by any variable and therefore can no longer be accessed
preorder
algorithm
garbage
fair
44. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
grammar
simple data type
divide and conquer
postorder
45. To look through a data structure until a goal object is found
grammar
link
dictionary
search
46. In a tree - a node that points to a given node
data structure
parent
node
constructive
47. A data structure that can be identified at runtime as being a member of a class
preorder
object
dictionary
divide and conquer
48. The top node of a tree - from which all other nodes can be reached
ontology
circularly linked list
root
reference
49. Composed of multiple sequential elements stored in contiguous bytes of memory
fifo
DFS
data type
array
50. A contiguous block of memory containing elements of the same type - accessed by numeric index
amortized Analysis
reference type
array
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