Answer the following question: (a) Write down the Merge sort algorithm. What is the time complexity of this algorithm? (b) How a graph can be…

Answer the following question:

(a) Write down the Merge sort algorithm. What is the time complexity of this algorithm?

(b) How a graph can be represented? Explain with example.

(c) What is TCP protocol? How does it work?

From the BPSC Assistant Programmer (CSE) 2019 – Written exam, question 1 of 8.

More from this paper