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 process that removes unwanted elements from a collection
null dereference
boxed number
filter
amortized Analysis
2. In a search tree - a program that changes a state into a child state e.g a move in a game
operator
general list
scope
ancestors
3. 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
grammar
big o
successor
data type
4. An order of processing a tree in which the parent node is processed after its children
constructive
data structure
postorder
branching factor
5. 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
DFS
LIFO
complex data type
6. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
random access
interior node
divide and conquer
node
7. First-child/next-sibling
operator
ontology
fair
leaf
8. A pattern that describes a set of similar programs
design pattern
linear O(n)
destructive
state
9. First in first out: describes ordering of a queue
interior node
tail recursive
fifo
set difference
10. To look through a data structure until a goal object is found
root
runtime stack
merge
search
11. To combine two ordered linear structures into one
ontology
circularly linked list
descendants
merge
12. A search in which children of a node are considered before siblings are considered
circular queue
root
doubly linked list
depth-first search
13. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
parent
DFS
data type
queue
14. In a tree - a node pointed to by a parent node
child
state
gedanken
interior node
15. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
entinel
algorithm
well-founded ordering xml
branching factor
16. Constructed of multiple components (simple or complex types)
fifo
complex data type
taxonomy
procedural abstraction
17. A case where a program calls itself
linked list
recursion
binary tree
cons
18. Values are in the most basic form and cannot be decomposed into smaller parts
design pattern
simple data type
association list
DFS
19. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
preorder
side-effect
null dereference
grammar
20. 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
queue
binary search tree (bst)
leaf
simple data type
21. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
side-effect
garbage collection
backtrack
22. Any container with linear ordering
general list
preorder
intersection
recursive case
23. A pointer to the next element in a linked list
merge
complex ADT
link
state
24. 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
descendants
recursive case
complex ADT
25. A node of a tree that has children
root
interior node
array
immutable
26. Describes a function that modifies its arguments
merge
ancestors
reference
destructive
27. The process of collecting garbage for recycling
design pattern
boxed number
garbage collection
postorder
28. Two variables that reference the same object
general list
queue
alias
random access
29. A simple case that can be solved easily - without recursion
base case
gedanken
depth-first search
divide and conquer
30. An elements of a linked list - tree - or graph - often represented by a data structure
leaf
general list
successor
node
31. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
data type
data abstraction
state
sort
32. 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
merge
binary tree
data structure
intractable
33. An order of processing a tree in which the parent node is processed in between its children
reference type
association list
inorder
grammar
34. A problem that is so hard that it cannot be solved unless the problem is small
array
scope
intractable
complex data type
35. Given two sets - the intersection is the set of elements that are members of both sets
intersection
entinel
queue
child
36. Describes a though experiment or view of an entity
ancestors
class
gedanken
linked list
37. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
recursion
backtrack
data structure
simple ADT
38. All nodes below a give node in a tree
ontology
descendants
quadratic
interior node
39. A collection of objects that are inserted and removed according to the LIFO principle
gedanken
fifo
stack
doubly linked list
40. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
intersection
well-founded ordering xml
merge
quadratic
41. A section of the runtime stack holding the values of all variables for one invocation
stack frame
LIFO
cons
child
42. Separation of the properties of a data type from its implementation
data abstraction
root
filter
null dereference
43. A list of pairs - where each pair has a key and a value associated with the key
data type
goal
association list
ancestors
44. To hide similar items with the same name
shadow
null dereference
child
node
45. A condition of the input data where the data will be handled by call(s) to the same program
ontology
recursive case
side-effect
state
46. A linked list in which the last element points back to the first element
circularly linked list
intersection
side-effect
gedanken
47. The number of links between the root of a tree and the leaves
data type
depth
cons
abstract data type
48. 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
well-founded ordering xml
procedural abstraction
complex data type
cons
49. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
fair
scope
set difference
well-founded ordering xml
50. In a tree - a node that points to a given node
parent
entinel
DFS
constructive