1. Write down the value of 27 ^1/3

2. Which of the following is not O(n2)?

3. Which of the following is not true about comparison-based sorting algorithms?

4. The following statement is valid. log(n!) = $theta$(n log n).

5. What is the time complexity of Floyd–Warshall algorithm to calculate all pair shortest path in a graph with n vertices?

6. External entities in DFD are shown by:-

7. 1)

8. 25)

9. 24)

10. 23)

11. 22)

12. 21)

13. 20)

14. 19)

15. 18)

16. 17)

17. 16)

18. 15)

19. 14)

20. 13)

21. 12)

22. 11)

23. 10)

24. 9)

25. 8)