Use Dijkstra’s algorithm to find shortest paths from vertex C to others in the following graph:

What is “current distance of A“ after executing of the algorithm end?

Maximum number of nodes in

a binary tree with height k, where root is height 0, is

What data structure can be used to check if a syntax has balanced

paranthesis ?

Given

codeword set:

a = 11, b = 101, f = 100, e = 0

Encoded string “1110011000101” will be

decoded to _______