(a) How the quick sort is implemented? What is the complexity of quick sort? (b) Write down a program to find sum of diagonal elements of a two…
(a) How the quick sort is implemented? What is the complexity of quick sort?
(b) Write down a program to find sum of diagonal elements of a two dimensional matrix.
(c) What is a strongly connected graph?
From the BPSC Sub-Assistant Maintenance Engineer December 2021 – Written exam, question 3 of 8.
More from this paper
- Previous: (a) What is the difference between array and pointer? (b) What is function overloading and operator overloading. Give example. (c) Write…
- Next: (a) What do you mean by virtual memory? (b) What is normalization? Why is it needed? (c) What is a weak entity set? How the primary key is…
- All questions in BPSC Sub-Assistant Maintenance Engineer December 2021 – Written