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. 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
base case
linked list
cons
2. The area of program text over which a variable can be referenced
scope
binary search tree (bst)
null dereference
tail recursive
3. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
node
immutable
dereference
side-effect
4. A process that removes unwanted elements from a collection
filter
gedanken
binary search tree (bst)
DFS
5. An elements of a linked list - tree - or graph - often represented by a data structure
merge
node
complex data type
data structure
6. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
design pattern
well-founded ordering xml
inorder
structure sharing
7. 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
alias
branching factor
complex ADT
data type
8. To hide similar items with the same name
boxed number
dereference
shadow
garbage collection
9. The top node of a tree - from which all other nodes can be reached
structure sharing
root
quadratic
circular queue
10. The amount of space on the runtime stack required for execution of a program
cons
stack space
abstract data type
backtrack
11. A case where tow data structures share some elements
dereference
binary tree
stack space
structure sharing
12. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
fair
algorithm
gedanken
13. A collection of values
simple data type
destructive
type
data type
14. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
complex data type
binary tree
simple data type
data structure
15. Values are in the most basic form and cannot be decomposed into smaller parts
leaf
goal
simple data type
big o
16. 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
set difference
stack space
well-founded ordering xml
17. In a tree search - to move back from the node currently being examined to its parent
doubly linked list
backtrack
sort
set difference
18. Composed of individually named data fields
divide and conquer
simple ADT
union
leaf
19. A collection of objects that are inserted and removed according to the LIFO principle
null dereference
leaf
stack
simple ADT
20. 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
procedural abstraction
DFS
dictionary
big o
21. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
divide and conquer
operator
fifo
complex ADT
22. A problem that is so hard that it cannot be solved unless the problem is small
intractable
pointer
side-effect
ontology
23. An extra record at the start or end of a data structure such as a linked list - to simplify processing
complex ADT
runtime stack
entinel
binary tree
24. Describes a function that modifies its arguments
destructive
reference
shadow
association list
25. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
dereference
depth
algorithm
intractable
26. A classification of objects into a tree structure that groups related objects
depth
branching factor
taxonomy
general list
27. A tree node containing a contents value but with no children
leaf
preorder
union
amortized Analysis
28. An order of processing a tree in which the parent node is processed before its children
dereference
entinel
preorder
linear O(n)
29. Composed of multiple sequential elements stored in contiguous bytes of memory
immutable
array
shadow
algorithm
30. Container for storing a collection of data in unique key/value pairs
big o
immutable
dictionary
dereference
31. A given collection of values along with a collection of operations for use on those values
parent
simple data type
data type
circularly linked list
32. 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
operator
circularly linked list
reference type
goal
33. A linked list in which the last element points back to the first element
dereference
ontology
circularly linked list
abstract data type
34. Given two sets - the intersection is the set of elements that are members of both sets
data abstraction
inorder
linked list
intersection
35. Any container with linear ordering
general list
parent
complex ADT
merge
36. A sequence of records - where each record contains a link to the next one
LIFO
queue
linked list
data type
37. Describes a function that makes a new data structure but does not modify its arguments
general list
inorder
constructive
leaf
38. Given two sets -the union is the set of elements that are members of either set
leaf
abstract data type
union
stack frame
39. A description of the state of a process such as a board game
state
circularly linked list
recursion
cons
40. A stack containing a stack frame of variable value for each active invocation of procedure
intersection
runtime stack
association list
set difference
41. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
ancestors
complex data type
depth
quadratic
42. A section of the runtime stack holding the values of all variables for one invocation
pointer
stack frame
circularly linked list
divide and conquer
43. An order of processing a tree in which the parent node is processed in between its children
big o
design pattern
inorder
immutable
44. The number of links between the root of a tree and the leaves
successor
gedanken
backtrack
depth
45. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
dereference
grammar
filter
array
46. In a search tree - a program that changes a state into a child state e.g a move in a game
state
tail recursive
base case
operator
47. Last in first out: describes the order of a stack
quadratic
inorder
LIFO
leaf
48. The process of collecting garbage for recycling
structure sharing
garbage collection
garbage
data type
49. A data structure that can be identified at runtime as being a member of a class
parent
object
doubly linked list
stack space
50. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
dereference
fair
linked list