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. In a search tree - a program that changes a state into a child state e.g a move in a game
grammar
operator
set difference
divide and conquer
2. A pattern that describes a set of similar programs
root
depth-first search
destructive
design pattern
3. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
base case
parent
data structure
root
4. 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?"
garbage
garbage collection
procedural abstraction
amortized Analysis
5. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
descendants
divide and conquer
simple data type
DFS
6. A description of the state of a process such as a board game
stack
node
state
base case
7. 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
linked list
class
reference type
recursive case
8. The next element in a linked list
successor
sort
general list
constructive
9. A pointer to the next element in a linked list
circular queue
intersection
parent
link
10. A contiguous block of memory containing elements of the same type - accessed by numeric index
boxed number
array
well-founded ordering xml
immutable
11. To combine two ordered linear structures into one
random access
merge
simple ADT
binary search tree (bst)
12. A tree node containing a contents value but with no children
linked list
leaf
ancestors
data structure
13. An extra record at the start or end of a data structure such as a linked list - to simplify processing
destructive
quadratic
filter
entinel
14. Describes a data structure or device in which all accesses have the same cost - O(1)
random access
taxonomy
backtrack
stack
15. The area of program text over which a variable can be referenced
scope
linked list
DFS
set difference
16. In a tree search - to move back from the node currently being examined to its parent
divide and conquer
backtrack
side-effect
well-founded ordering xml
17. An elements of a linked list - tree - or graph - often represented by a data structure
circular queue
postorder
node
LIFO
18. Any container with linear ordering
child
general list
entinel
stack frame
19. A node of a tree that has children
interior node
association list
set difference
linear O(n)
20. 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
circular queue
fifo
algorithm
binary tree
21. In a tree - a node that points to a given node
base case
random access
parent
stack space
22. The process of collecting garbage for recycling
garbage collection
side-effect
sort
circularly linked list
23. To look through a data structure until a goal object is found
search
depth
interior node
root
24. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
ancestors
runtime stack
preorder
set difference
25. A description of operations on a data type that could have multiple possible implementations
recursive case
object
destructive
abstract data type
26. Depth first search
pointer
big o
recursive case
DFS
27. Composed of individually named data fields
design pattern
simple ADT
descendants
reference type
28. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
gedanken
descendants
quadratic
merge
29. Composed of multiple sequential elements stored in contiguous bytes of memory
ancestors
base case
array
simple ADT
30. storage that is no longer pointed to by any variable and therefore can no longer be accessed
grammar
filter
dereference
garbage
31. Describes a function that makes a new data structure but does not modify its arguments
reference
quadratic
constructive
doubly linked list
32. 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)
simple data type
abstract data type
linked list
33. A queue implemented within an array - where the first elements of the array logically follows the last elements
descendants
grammar
simple data type
circular queue
34. A case where tow data structures share some elements
depth
set difference
reference type
structure sharing
35. First in first out: describes ordering of a queue
random access
fifo
side-effect
shadow
36. An order of processing a tree in which the parent node is processed before its children
preorder
postorder
circularly linked list
set difference
37. A problem whose solution requires a linear amount of time or space if the problem is size n
binary tree
entinel
linear O(n)
goal
38. 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
entinel
grammar
branching factor
intersection
39. An item (or description of items) being sough in a search
linked list
circularly linked list
well-founded ordering xml
goal
40. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
garbage collection
circularly linked list
ontology
queue
41. To hide similar items with the same name
divide and conquer
fifo
shadow
descendants
42. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
parent
well-founded ordering xml
structure sharing
algorithm
43. A collection of objects that are inserted and removed according to the LIFO principle
fifo
stack
goal
preorder
44. 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
random access
backtrack
big o
stack
45. A process that removes unwanted elements from a collection
runtime stack
null dereference
filter
algorithm
46. All nodes below a give node in a tree
successor
descendants
procedural abstraction
design pattern
47. 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
depth-first search
cons
data type
postorder
48. A variable containing the address of other data
tail recursive
recursion
complex data type
pointer
49. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
recursion
reference type
queue
quadratic
50. To convert from a pointer to the data that is pointed to
merge
dereference
depth-first search
array