A non-pipelined instruction execution unit that operates at 1.6 GHz clock takes an average of 5 clock cycles to complete the execution of an instruction. To improve the performance, the system was pipelined with a goal of achieving an average throughput of one instruction per clock cycle. However, it could operate only at 1.2 GHz due to pipeline overheads. While executing a program in the pipelined design, $30 \%$ of instructions encountered a stall of 2 cycles due to pipeline hazards. The speed-up obtained by the pipelined design over the non-pipelined one for this program is $\_\_\_\_$ (rounded off to two decimal places)

Note: $1 \mathrm{G}=10^9$

The set T represents various traversals over binary tree. The set S represents the order of visiting nodes during a traversal.

$$ \begin{array}{ll}\,\,\,\,\, \text {  T } &\,\,\,\,\,\, \text { S } \\ \text { I: } \text { Inorder } & \text { L: left subtree, node, right subtree } \\ \text { II: } \text { Preorder } & \text { M: node, left subtree, right subtree } \\ \text { III: } \text { Postorder } & \text { N: left subtree, right subtree, node } \end{array} $$

Which one of the following is the correct match from $T$ to $S$ ?

The keys $5,28,19,15,26,33,12,17,10$ are inserted into a hash table using the hash function $h(k)=k \bmod 9$. The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain is $\_\_\_\_$ . (answer in integer)

Let $G$ be a weighted directed acyclic graph with $m$ edges and $n$ vertices. Given $G$ and a source vertex $s$ in $G$, which one of the following options gives the worst case time complexity of the fastest algorithm to find the lengths of shortest paths from $s$ to all vertices that are reachable from $s$ in $G$ ?