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 linked list in which each elements has both forward and backward pointers
circularly linked list
root
depth
doubly linked list
2. Two variables that reference the same object
alias
merge
postorder
abstract data type
3. The top node of a tree - from which all other nodes can be reached
ancestors
tail recursive
scope
root
4. 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
abstract data type
stack space
cons
linear O(n)
5. An order of processing a tree in which the parent node is processed before its children
dictionary
shadow
preorder
merge
6. In a search tree - a program that changes a state into a child state e.g a move in a game
operator
circular queue
divide and conquer
null dereference
7. A variable containing the address of other data
null dereference
circularly linked list
leaf
pointer
8. Constructed of multiple components (simple or complex types)
runtime stack
fair
merge
complex data type
9. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
structure sharing
well-founded ordering xml
preorder
grammar
10. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
cons
grammar
algorithm
garbage collection
11. A search in which children of a node are considered before siblings are considered
depth-first search
circular queue
shadow
intractable
12. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
binary search tree (bst)
union
ontology
tail recursive
13. An order of processing a tree in which the parent node is processed after its children
taxonomy
design pattern
base case
postorder
14. To convert from a pointer to the data that is pointed to
fair
dereference
child
structure sharing
15. Container for storing a collection of data in unique key/value pairs
backtrack
gedanken
circularly linked list
dictionary
16. Values are in the most basic form and cannot be decomposed into smaller parts
simple data type
intractable
shadow
divide and conquer
17. All nodes below a give node in a tree
array
algorithm
descendants
queue
18. 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
big o
ontology
postorder
19. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
well-founded ordering xml
tail recursive
destructive
reference type
20. In a tree - a node pointed to by a parent node
recursion
pointer
child
linked list
21. 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
abstract data type
complex ADT
divide and conquer
22. A description of operations on a data type that could have multiple possible implementations
complex ADT
immutable
abstract data type
entinel
23. Last in first out: describes the order of a stack
node
ancestors
type
LIFO
24. An item (or description of items) being sough in a search
goal
parent
fifo
depth
25. Describes a data structure or device in which all accesses have the same cost - O(1)
random access
dereference
destructive
queue
26. A given collection of values along with a collection of operations for use on those values
data type
node
pointer
cons
27. A process that removes unwanted elements from a collection
filter
scope
side-effect
reference type
28. A pointer to data
reference
data type
destructive
sort
29. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
data type
immutable
search
set difference
30. An order of processing a tree in which the parent node is processed in between its children
side-effect
procedural abstraction
depth
inorder
31. A linked list in which the last element points back to the first element
binary search tree (bst)
postorder
circularly linked list
root
32. storage that is no longer pointed to by any variable and therefore can no longer be accessed
base case
garbage
shadow
interior node
33. An extra record at the start or end of a data structure such as a linked list - to simplify processing
DFS
entinel
array
doubly linked list
34. A runtime error that occurs when an operation such as method call is attempted on a null pointer
preorder
goal
algorithm
null dereference
35. A data structure that can be identified at runtime as being a member of a class
type
recursive case
object
design pattern
36. 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
union
dereference
queue
binary search tree (bst)
37. A classification of objects into a tree structure that groups related objects
leaf
taxonomy
child
intersection
38. To look through a data structure until a goal object is found
child
depth
postorder
search
39. A pattern that describes a set of similar programs
design pattern
object
ontology
child
40. A contiguous block of memory containing elements of the same type - accessed by numeric index
node
array
fifo
taxonomy
41. The area of program text over which a variable can be referenced
scope
linear O(n)
cons
well-founded ordering xml
42. Any container with linear ordering
tail recursive
data type
structure sharing
general list
43. In a tree search - to move back from the node currently being examined to its parent
design pattern
big o
backtrack
leaf
44. 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
set difference
postorder
45. A collection of objects that are inserted and removed according to the LIFO principle
goal
DFS
object
stack
46. A problem whose solution requires a linear amount of time or space if the problem is size n
backtrack
linear O(n)
type
shadow
47. Composed of multiple sequential elements stored in contiguous bytes of memory
fair
quadratic
structure sharing
array
48. First in first out: describes ordering of a queue
fifo
general list
entinel
taxonomy
49. A case where a program calls itself
circularly linked list
depth
recursion
shadow
50. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
cons
algorithm
ontology