Pseudo Code Flashcards
1
Q
Karatsuba’s Algorithm
A
2
Q
Dijkstra’s Algorithm
A
3
Q
DFS Recursive
A
4
Q
DFS - Stack implementation
A
5
Q
What is the pseudo code for the DFS algorithm which determines if G is a DAG (directed acyclic graph)
A
6
Q
Write the pseudo code for a linearisation algorithm which runs in time O(m+n)
A
7
Q
Write the algorithm which finds a
SCC (Strongly Connectied Component) in a graph G
A
8
Q
Write the pseudo code for Prim’s algorithm
A
9
Q
What is the pseudo code for Kruskal’s algorithm?
A
10
Q
Pseudo code for fractional knapsack (greedy) algorithm:
A
11
Q
Pseudo Code for Interval Selection (Activities) Problem:
A
12
Q
Pseudo code for Bellman-Ford Algorithm
A
13
Q
Describe the pseudo code for solving the all-pair shortest path problem
(Floyd-Warshall Algorithm)
A
