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 pointer to the next element in a linked list
LIFO
intersection
link
amortized Analysis
2. A pattern that describes a set of similar programs
quadratic
big o
design pattern
scope
3. First-child/next-sibling
general list
fair
object
base case
4. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
sort
structure sharing
side-effect
object
5. The next element in a linked list
intersection
leaf
successor
data structure
6. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
dereference
operator
tail recursive
entinel
7. Any container with linear ordering
general list
design pattern
tail recursive
data abstraction
8. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
set difference
fair
circularly linked list
preorder
9. A classification of objects into a tree structure that groups related objects
binary search tree (bst)
node
taxonomy
reference
10. The area of program text over which a variable can be referenced
node
scope
structure sharing
data structure
11. An order of processing a tree in which the parent node is processed before its children
inorder
preorder
DFS
merge
12. A node of a tree that has children
descendants
garbage collection
interior node
amortized Analysis
13. In object oriented programming - a description of a set of similar objects
complex data type
big o
class
data type
14. Describes a though experiment or view of an entity
ancestors
garbage
intersection
gedanken
15. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
binary tree
well-founded ordering xml
simple data type
parent
16. An extra record at the start or end of a data structure such as a linked list - to simplify processing
filter
entinel
descendants
child
17. The amount of space on the runtime stack required for execution of a program
pointer
object
stack space
linear O(n)
18. Values are in the most basic form and cannot be decomposed into smaller parts
simple ADT
simple data type
null dereference
pointer
19. 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?"
quadratic
amortized Analysis
general list
type
20. Given two sets - the intersection is the set of elements that are members of both sets
intersection
divide and conquer
class
recursive case
21. A description of operations on a data type that could have multiple possible implementations
sort
doubly linked list
gedanken
abstract data type
22. The number of links between the root of a tree and the leaves
depth
class
random access
link
23. A simple case that can be solved easily - without recursion
state
garbage
base case
dictionary
24. Depth first search
DFS
depth-first search
set difference
object
25. A collection of objects that are inserted and removed according to the LIFO principle
class
stack
linear O(n)
boxed number
26. To look through a data structure until a goal object is found
goal
data abstraction
search
DFS
27. Describes a function that modifies its arguments
destructive
intractable
base case
node
28. An order of processing a tree in which the parent node is processed in between its children
reference type
inorder
ontology
child
29. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
procedural abstraction
entinel
divide and conquer
general list
30. A sequence of records - where each record contains a link to the next one
intractable
linked list
object
postorder
31. To convert from a pointer to the data that is pointed to
backtrack
array
dereference
state
32. storage that is no longer pointed to by any variable and therefore can no longer be accessed
filter
garbage
immutable
alias
33. A description of the state of a process such as a board game
state
backtrack
type
garbage collection
34. 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
entinel
child
constructive
boxed number
35. A pointer to data
alias
cons
binary tree
reference
36. Composed of a collection of data values; implemented with a data structure
state
general list
reference
complex ADT
37. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
array
ontology
circularly linked list
garbage
38. Last in first out: describes the order of a stack
LIFO
search
leaf
doubly linked list
39. To hide similar items with the same name
ontology
shadow
divide and conquer
recursive case
40. A variable containing the address of other data
branching factor
queue
pointer
garbage
41. A given collection of values along with a collection of operations for use on those values
big o
interior node
type
data type
42. 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
dictionary
circular queue
alias
big o
43. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
general list
doubly linked list
design pattern
queue
44. 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
child
cons
scope
binary tree
45. The process of collecting garbage for recycling
simple ADT
filter
immutable
garbage collection
46. A linked list in which each elements has both forward and backward pointers
doubly linked list
binary tree
data abstraction
fifo
47. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
gedanken
array
algorithm
preorder
48. A case where a program calls itself
cons
recursion
queue
garbage collection
49. A linked list in which the last element points back to the first element
branching factor
garbage
circularly linked list
taxonomy
50. A contiguous block of memory containing elements of the same type - accessed by numeric index
reference type
array
fair
binary search tree (bst)