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. An item (or description of items) being sough in a search
simple ADT
random access
goal
garbage collection
2. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
random access
immutable
binary tree
divide and conquer
3. A stack containing a stack frame of variable value for each active invocation of procedure
circularly linked list
well-founded ordering xml
preorder
runtime stack
4. In a tree - a node pointed to by a parent node
backtrack
child
reference
stack
5. A search in which children of a node are considered before siblings are considered
intractable
depth-first search
shadow
runtime stack
6. A data structure that can be identified at runtime as being a member of a class
dictionary
operator
backtrack
object
7. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
preorder
data structure
linear O(n)
LIFO
8. A simple case that can be solved easily - without recursion
descendants
base case
quadratic
node
9. A process that removes unwanted elements from a collection
filter
object
data type
design pattern
10. In a tree search - to move back from the node currently being examined to its parent
successor
backtrack
binary tree
immutable
11. Two variables that reference the same object
data type
alias
DFS
base case
12. Given two sets -the union is the set of elements that are members of either set
divide and conquer
type
sort
union
13. A linked list in which the last element points back to the first element
circularly linked list
type
big o
data type
14. A linked list in which each elements has both forward and backward pointers
parent
doubly linked list
well-founded ordering xml
linked list
15. 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
base case
descendants
random access
boxed number
16. A description of the state of a process such as a board game
state
postorder
design pattern
stack space
17. A description of operations on a data type that could have multiple possible implementations
garbage
abstract data type
goal
linear O(n)
18. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
well-founded ordering xml
circularly linked list
postorder
child
19. The process of collecting garbage for recycling
data structure
garbage collection
complex data type
filter
20. A pointer to the next element in a linked list
link
procedural abstraction
big o
linked list
21. 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
cons
branching factor
circular queue
random access
22. Constructed of multiple components (simple or complex types)
fair
reference
divide and conquer
complex data type
23. To combine two ordered linear structures into one
recursion
merge
null dereference
gedanken
24. 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
divide and conquer
doubly linked list
data structure
25. 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
stack frame
merge
descendants
26. Separation of the properties of a data type from its implementation
stack
type
merge
data abstraction
27. Composed of multiple sequential elements stored in contiguous bytes of memory
grammar
stack
array
alias
28. A case where tow data structures share some elements
preorder
structure sharing
intersection
shadow
29. The area of program text over which a variable can be referenced
recursion
boxed number
scope
side-effect
30. The next element in a linked list
inorder
abstract data type
binary search tree (bst)
successor
31. 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
cons
well-founded ordering xml
goal
data structure
32. A section of the runtime stack holding the values of all variables for one invocation
shadow
stack frame
data structure
complex ADT
33. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
array
interior node
immutable
scope
34. Describes a function that makes a new data structure but does not modify its arguments
union
constructive
doubly linked list
quadratic
35. First-child/next-sibling
fair
side-effect
recursion
binary search tree (bst)
36. Last in first out: describes the order of a stack
LIFO
parent
postorder
sort
37. A list of pairs - where each pair has a key and a value associated with the key
merge
gedanken
backtrack
association list
38. Depth first search
DFS
general list
scope
cons
39. An order of processing a tree in which the parent node is processed after its children
scope
postorder
pointer
preorder
40. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
queue
operator
alias
41. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
constructive
tail recursive
big o
sort
42. A condition of the input data where the data will be handled by call(s) to the same program
fifo
recursive case
destructive
procedural abstraction
43. A given collection of values along with a collection of operations for use on those values
leaf
data type
parent
complex ADT
44. A pattern that describes a set of similar programs
successor
class
procedural abstraction
design pattern
45. To hide similar items with the same name
shadow
design pattern
array
fifo
46. In a search tree - a program that changes a state into a child state e.g a move in a game
operator
algorithm
garbage
data abstraction
47. 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
scope
binary search tree (bst)
destructive
depth
48. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
amortized Analysis
queue
goal
parent
49. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
cons
successor
algorithm
tail recursive
50. A classification of objects into a tree structure that groups related objects
taxonomy
garbage
dictionary
root
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