UGRD-ITE6202B Data Structure and
Algorithms
1. Home
2. My courses
3. UGRD-ITE6202B-2233T
4. FINAL EXAMINATION
5. FINAL EXAMINATION
Started on Thursday, 17 August 2023, 10:46 AM
State Finished
Completed on Thursday, 17 August 2023, 11:31 AM
Time taken 45 mins 16 secs
Marks 50.00/50.00
Grade 100.00 out of 100.00
Question 1
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is a node-based binary tree structure which has the left and right subtree.
none of the above
binary search tree
binary search
binary tree
Feedback
Your answer is correct.
Question 2
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It contains only nodes with keys lesser than the node’s key.
right subtree
none of the above
node tree
left subtree
Feedback
Your answer is correct.
Question 3
Correct
Mark 1.00 out of 1.00
Flag question
Question text
Every node other than the leaf nodes has 2 child nodes.
Complete binary tree
binary tree
perfect binary tree
full binary tree
Feedback
Your answer is correct.
Question 4
Correct
Mark 1.00 out of 1.00
Flag question
Question text
All levels are filled except possibly the last one.
complete binary tree
perfect binary tree
none of the above
full binary tree
Feedback
Your answer is correct.
Question 5
Correct
Mark 1.00 out of 1.00
Flag question
Question text
All nodes have two children and all levels are at the same level.
perfect binary tree
full binary tree
complete binary tree
Feedback
Your answer is correct.
Question 6
Correct
Mark 1.00 out of 1.00
Flag question
Question text
Trees are used to represent hierarchy.
Select one:
True
False
Question 7
Correct
Mark 1.00 out of 1.00
Flag question
Question text
Hashmap is synchronized.
Select one:
True
False
Question 8
Correct
Mark 1.00 out of 1.00
Flag question
Question text
Hash tables are synchronized.
Select one:
True
False
Question 9
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is the transformation of the string characters into a usually shorter fixed-length value that
represents the original string.
hashing
string
string manipulation
concatenation
Feedback
Your answer is correct.
Question 10
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is used to compare changes over the same period of time for more than one group.
line graph
bar graph
pie chart
graph
Feedback
Your answer is correct.
Question 11
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is best to use when you are trying to compare parts of a whole.
bar graph
graph
line graph
pie chart
Feedback
Your answer is correct.
Question 12
Correct
Mark 1.00 out of 1.00
Flag question
Question text
Are used to compare things between different groups or to track changes over time.
graph
bar graphs
pie chart
line graph
Feedback
Your answer is correct.
Question 13
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is a type of diagram that organizes and represents a set of numerical or qualitative data.
graph
none of the above
chart
data chart
Feedback
Your answer is correct.
Question 14
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is a mathematical representation of a network.
graph
data chart
none of the above
chart
Feedback
Your answer is correct.
Question 15
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is an algorithm that finds the shortest path between nodes in a graph.
Dijkstra’s algorithm
none of the above
Shortest nodes
Shortest path
Feedback
Your answer is correct.
Question 16
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It can be used to determine the shortest path from one node in a graph to every other
node.
Dijkstra’s algorithm
none of the above
shortest path
depth-first traversal
Feedback
Your answer is correct.
Question 17
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is also known as ordered binary trees.
tree structure
binary tree
none of the above
binary search tree
Feedback
Your answer is correct.
Question 18
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It contains only nodes with keys greater than the node’s key.
subtree
the left subtree
the right subtree
none of the above
Feedback
Your answer is correct.
Question 19
Correct
Mark 1.00 out of 1.00
Remove flag
Question text
It is a hash function that computes an index into an array.
hash code
hash
hash function
none of the above
Feedback
Your answer is correct.
Question 20
Correct
Mark 1.00 out of 1.00
Flag question
Question text
Hash tables should avoid collision.
Select one:
True
False
Question 21
Correct
Mark 1.00 out of 1.00
Flag question
Question text
These are a software artifacts that allows data to be stored, organized and accessed.
algorithm
software
Data structures
database
Feedback
Your answer is correct.
Question 22
Correct
Mark 1.00 out of 1.00
Flag question
Question text
A data structure requires a large amount of space for each data item stores and a large
amount of time to perform a single operation and a certain amount of programming effort.
Select one:
True
False
Question 23
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is a mathematical model for a certain class of data structure that has similar behavior.
none of the above
abstract data
abstract
abstract data type
Feedback
Your answer is correct.
Question 24
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is a collection of nodes wherein every node contains the address of the next node.
stack
linked list
None of the above
array
Feedback
Your answer is correct.
Question 25
Correct
Mark 1.00 out of 1.00
Flag question
Question text
In building a linked list, it needs three pointers to build: one to point to the first node in the
list, one to point to the last node and one to create the new one.
Select one:
True
False
Question 26
Correct
Mark 1.00 out of 1.00
Flag question
Question text
Linked list contains the null value before inserting a node.
Select one:
True
False
Question 27
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is a linear data structure that can be accessed, stored and removed at one end.
None of the above
linked list
stack
queue
Feedback
Your answer is correct.
Question 28
Correct
Mark 1.00 out of 1.00
Flag question
Question text
A stack is called LIFO structure. Last in/first out.
Select one:
True
False
Question 29
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is a list-like structure in which elements are removed from only one end.
queue
linked list
stack
None of the above
Feedback
Your answer is correct.
Question 30
Correct
Mark 1.00 out of 1.00
Remove flag
Question text
It is a collection of values.
abstract data type
variable
data type
type
Feedback
Your answer is correct.
Question 31
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is a piece of information whose values are drawn from a type.
data structures
data
data item
data element
Feedback
Your answer is correct.
Question 32
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is a stack operation that inserts a data item onto the structure.
pop
input
peek
push
Feedback
Your answer is correct.
Question 33
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is a stack operation that removes an item on top of the stack.
remove top
pop
delete
remove
Feedback
Your answer is correct.
Question 34
Correct
Mark 1.00 out of 1.00
Flag question
Question text
This defines the logical form of the data type.
data type
ADT
abstract
data structures
Feedback
Your answer is correct.
Question 35
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is a type together with the collection of operations to manipulate the type.
data type
operations
None of the above
type of data
Feedback
Your answer is correct.
Question 36
Correct
Mark 1.00 out of 1.00
Remove flag
Question text
It is a physical data structure.
Memory
Array
Linked list
Array list
Feedback
Your answer is correct.
Question 37
Correct
Mark 1.00 out of 1.00
Remove flag
Question text
It is a list of items.
nodes
linked list
array list
array
Feedback
Your answer is correct.
Question 38
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It contains an element field to store an element value, and a next field to store a pointer to
the next node on the list.
Objects
Data
Link class
Data element
Feedback
Your answer is correct.
Question 39
Correct
Mark 1.00 out of 1.00
Remove flag
Question text
This linked list operation determines whether a particular item is in the list.
Find
Traversing
None of the above
Search
Feedback
Your answer is correct.
Question 40
Correct
Mark 1.00 out of 1.00
Remove flag
Question text
A type of linked list that arranges elements according to some criteria.
sorted lists
sorted elements
unsorted lists
sorting
Feedback
Your answer is correct.
Question 41
Correct
Mark 1.00 out of 1.00
Flag question
Question text
This type of linked list whose elements are in no particular order.
inorder
post order
unsorted order
unsorted list
Feedback
Your answer is correct.
Question 42
Correct
Mark 1.00 out of 1.00
Flag question
Question text
This stack operation clears the stack.
clear
clear ()
clear operation()
clear operation
Feedback
Your answer is correct.
Question 43
Correct
Mark 1.00 out of 1.00
Flag question
Question text
This stack operation checks if the stack is empty.
Empty()
isEmpty ()
isEmpty
Empty
Feedback
Your answer is correct.
Question 44
Correct
Mark 1.00 out of 1.00
Remove flag
Question text
It puts an element on the top of the stack.
push()
push(el)
None of the above
push
Feedback
Your answer is correct.
Question 45
Correct
Mark 1.00 out of 1.00
Remove flag
Question text
It takes the topmost element from the stack.
pop
pop stack
None of the above
pop()
Feedback
Your answer is correct.
Question 46
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It provides a natural organization for data.
A.)
B.)
C.)
D.)
ANSWER: A
Trees
None of the above
Binary tree
Binary search tree
Feedback
Your answer is correct.
Question 47
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is an abstract data type that stores elements hierarchically.
tree structure
Binary search tree
tree
Binary tree
Feedback
Your answer is correct.
Question 48
Correct
Mark 1.00 out of 1.00
Flag question
Question text
It is a pair of nodes.
edge
nodes
edge of tree
path
Feedback
Your answer is correct.
Question 49
Correct
Mark 1.00 out of 1.00
Flag question
Question text
A tree is either empty or consists of nodes.
Select one:
True
False
Question 50
Correct
Mark 1.00 out of 1.00
Flag question
Question text
A linear ordering of a tree.
Ordered trees
None of the above
linear order
Children node
Feedback
Your answer is correct.
