SUBJECTS
|
BROWSE
|
CAREER CENTER
|
POPULAR
|
JOIN
|
LOGIN
Business Skills
|
Soft Skills
|
Basic Literacy
|
Certifications
About
|
Help
|
Privacy
|
Terms
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 search in which children of a node are considered before siblings are considered
depth-first search
reference
stack
structure sharing
2. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
gedanken
branching factor
dereference
3. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
array
well-founded ordering xml
intractable
ontology
4. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
parent
backtrack
grammar
goal
5. 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
scope
intersection
reference type
immutable
6. In a tree - the union of a node's parent and the parent's ancestors
amortized Analysis
ancestors
search
stack space
7. First in first out: describes ordering of a queue
filter
structure sharing
fifo
type
8. 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
sort
binary search tree (bst)
stack frame
operator
9. A linked list in which each elements has both forward and backward pointers
node
doubly linked list
side-effect
LIFO
10. A contiguous block of memory containing elements of the same type - accessed by numeric index
data abstraction
array
DFS
general list
11. A case where a program calls itself
recursion
preorder
entinel
data type
12. Given two sets - the intersection is the set of elements that are members of both sets
fifo
stack frame
intersection
state
13. A process that removes unwanted elements from a collection
structure sharing
branching factor
filter
immutable
14. A description of operations on a data type that could have multiple possible implementations
shadow
design pattern
random access
abstract data type
15. In a tree search - to move back from the node currently being examined to its parent
depth
root
complex ADT
backtrack
16. An order of processing a tree in which the parent node is processed after its children
postorder
fair
filter
alias
17. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
general list
depth-first search
quadratic
stack
18. A case where tow data structures share some elements
quadratic
structure sharing
linked list
depth
19. A pointer to data
successor
tail recursive
garbage collection
reference
20. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
merge
simple data type
leaf
21. Composed of multiple sequential elements stored in contiguous bytes of memory
link
well-founded ordering xml
array
simple data type
22. A collection of values
garbage
association list
type
recursion
23. 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
divide and conquer
cons
circular queue
link
24. Given two sets -the union is the set of elements that are members of either set
circular queue
filter
structure sharing
union
25. A simple case that can be solved easily - without recursion
base case
entinel
side-effect
circularly linked list
26. To look through a data structure until a goal object is found
search
descendants
pointer
constructive
27. A pointer to the next element in a linked list
boxed number
link
depth-first search
successor
28. The process of collecting garbage for recycling
reference
search
gedanken
garbage collection
29. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
algorithm
big o
well-founded ordering xml
side-effect
30. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
algorithm
garbage collection
intractable
backtrack
31. Use of a function or method without knowing how it's accomplished
search
procedural abstraction
successor
runtime stack
32. A description of the state of a process such as a board game
state
queue
operator
linked list
33. Two variables that reference the same object
class
array
alias
preorder
34. To convert from a pointer to the data that is pointed to
dereference
object
taxonomy
boxed number
35. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
recursive case
descendants
ontology
branching factor
36. 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
linear O(n)
goal
quadratic
37. A condition of the input data where the data will be handled by call(s) to the same program
shadow
class
recursive case
depth
38. A pattern that describes a set of similar programs
design pattern
constructive
interior node
scope
39. An item (or description of items) being sough in a search
data type
class
preorder
goal
40. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
tail recursive
runtime stack
reference type
depth-first search
41. In object oriented programming - a description of a set of similar objects
ancestors
class
abstract data type
fair
42. First-child/next-sibling
grammar
taxonomy
parent
fair
43. To combine two ordered linear structures into one
ontology
merge
simple data type
pointer
44. A linked list in which the last element points back to the first element
grammar
circularly linked list
gedanken
abstract data type
45. The number of links between the root of a tree and the leaves
design pattern
depth
linear O(n)
circular queue
46. A node of a tree that has children
well-founded ordering xml
depth-first search
interior node
data type
47. Describes a data structure or device in which all accesses have the same cost - O(1)
abstract data type
procedural abstraction
random access
constructive
48. Describes a function that modifies its arguments
destructive
stack space
intersection
fair
49. A queue implemented within an array - where the first elements of the array logically follows the last elements
intractable
preorder
circular queue
recursive case
50. 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
immutable
sort
big o
quadratic