If a graph is sparse which representation will you use and why?
Question
BodMas
Describe two principal methods for representing graphs for computer algorithms
Question
BodMas
Draw the directed graph that is represented by the following:
Question
BodMas
Vertices: 1, 2, 3, 4, 5, 6, 7
Edges: (1, 2), (1, 4), (2, 3), (2, 4), (3, 7), (4, 7), (4, 6), (5, 6), (5, 7), (6, 7)
Distinguish between a graph and a tree
Question
BodMas
Describe how you use the following data structures in your data science project
Question
BodMas
i. List
ii. Tuple
iii. Dictionary
iv. Matrix
As the lead developer of a system you have recommended a stack to be used to address various expressions.
Question
BodMas
i. Explain how the stack can be used to determine if an infix expression is correctly parenthesized.
ii. Describe how a stack can be used to solve postfix expressions
As a data science student, you are required to prepare a lecture on trees. As part of the work you lecture you are expected to;
Question
BodMas
i. Define a binary tree
ii. Distinguish between a binary search tree and a binary tree
iii. Demonstrate the diagrammatic representation of a binary search tree using the values in the given order: 7, 10, 5, 12, 1, 3, 9.
iv. Explain the ...
As a data scientist, you have decided to implement some data structure using a linked list.
Question
BodMas
i. What is the function of the variable head when used with a linked list? What is the data type of the head variable?
ii. Assuming you are dealing with a linked list that contains nodes with data items of type ...
Given two scenarios: the first in which a problem solution involves a dynamic list (i.e. list in which there are a lot of deletions and insertions) and the second in which a problem involves many accesses to the interior values of a list. State with reasons which data structure will be suitable for each of the two scenarios?
Question
BodMas
Suppose we begin with an empty stack, and perform the following operations: push 7, push 2, push 9, push 6, pop, pop, peek, push 1, push 3, peek, push 8, pop, peek, pop, pop, push 5, push 4, pop, pop, pop, push 8. What is contained on the stack when we are done? Write out the contents from top to bottom.
Question
BodMas