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 multiple sequential elements stored in contiguous bytes of memory
simple ADT
node
array
data abstraction
2. 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
intersection
fifo
reference type
cons
3. Use of a function or method without knowing how it's accomplished
recursion
procedural abstraction
goal
dictionary
4. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
stack space
grammar
null dereference
set difference
5. To hide similar items with the same name
circular queue
DFS
taxonomy
shadow
6. Values are in the most basic form and cannot be decomposed into smaller parts
quadratic
association list
descendants
simple data type
7. A case where a program calls itself
side-effect
recursion
big o
quadratic
8. A description of operations on a data type that could have multiple possible implementations
general list
simple ADT
amortized Analysis
abstract data type
9. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
grammar
intersection
object
array
10. A case where tow data structures share some elements
successor
DFS
simple ADT
structure sharing
11. An order of processing a tree in which the parent node is processed before its children
successor
preorder
tail recursive
intractable
12. A problem whose solution requires a linear amount of time or space if the problem is size n
linear O(n)
type
design pattern
association list
13. The process of collecting garbage for recycling
garbage
object
garbage collection
fifo
14. A simple case that can be solved easily - without recursion
abstract data type
base case
procedural abstraction
side-effect
15. The amount of space on the runtime stack required for execution of a program
quadratic
boxed number
binary tree
stack space
16. A node of a tree that has children
interior node
structure sharing
base case
cons
17. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
design pattern
tail recursive
leaf
quadratic
18. A process that removes unwanted elements from a collection
descendants
complex data type
complex ADT
filter
19. An item (or description of items) being sough in a search
design pattern
goal
state
stack
20. Last in first out: describes the order of a stack
circularly linked list
LIFO
sort
queue
21. Given two sets -the union is the set of elements that are members of either set
inorder
union
grammar
reference
22. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
circular queue
tail recursive
grammar
design pattern
23. A sequence of records - where each record contains a link to the next one
successor
complex data type
well-founded ordering xml
linked list
24. A data structure that can be identified at runtime as being a member of a class
object
intersection
goal
merge
25. A description of the state of a process such as a board game
root
design pattern
inorder
state
26. A queue implemented within an array - where the first elements of the array logically follows the last elements
circular queue
big o
preorder
merge
27. First in first out: describes ordering of a queue
destructive
abstract data type
backtrack
fifo
28. 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
binary tree
filter
array
algorithm
29. Two variables that reference the same object
cons
state
destructive
alias
30. A linked list in which each elements has both forward and backward pointers
node
root
doubly linked list
alias
31. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
well-founded ordering xml
stack space
dictionary
reference type
32. A given collection of values along with a collection of operations for use on those values
data type
amortized Analysis
preorder
recursive case
33. To look through a data structure until a goal object is found
taxonomy
structure sharing
search
design pattern
34. A pointer to data
reference
filter
boxed number
linear O(n)
35. The next element in a linked list
successor
postorder
branching factor
big o
36. A search in which children of a node are considered before siblings are considered
ancestors
set difference
design pattern
depth-first search
37. A collection of objects that are inserted and removed according to the LIFO principle
well-founded ordering xml
stack
complex data type
amortized Analysis
38. Describes a though experiment or view of an entity
branching factor
design pattern
fifo
gedanken
39. A problem that is so hard that it cannot be solved unless the problem is small
ontology
intractable
interior node
immutable
40. Describes a function that modifies its arguments
garbage
destructive
depth-first search
complex data type
41. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
design pattern
reference type
immutable
42. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
algorithm
ontology
stack
complex ADT
43. A tree node containing a contents value but with no children
quadratic
type
immutable
leaf
44. Describes a function that makes a new data structure but does not modify its arguments
garbage collection
quadratic
LIFO
constructive
45. 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
root
depth-first search
big o
base case
46. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
union
procedural abstraction
array
47. To combine two ordered linear structures into one
backtrack
reference
merge
destructive
48. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
queue
algorithm
immutable
shadow
49. To convert from a pointer to the data that is pointed to
amortized Analysis
sort
dereference
entinel
50. In a tree - a node that points to a given node
linear O(n)
postorder
parent
shadow