By milanPosted on
0%

Edexcel A Level Maths: Pure

1 / 25

1. Write down the value of 27 1/3

2 / 25

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

3 / 25

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

4 / 25

4. The following statement is valid. log(n!) = 𝑡ℎ𝑒𝑡𝑎 (n log n).

5 / 25

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

6 / 25

6. External entities in DFD are shown by:-

7 / 25

7. 1)

 

8 / 25

8. 25)

9 / 25

9. 24)

10 / 25

10. 23)

11 / 25

11. 22)

12 / 25

12. 21)

13 / 25

13. 20)

14 / 25

14. 19)

15 / 25

15. 18)

16 / 25

16. 17)

17 / 25

17. 16)

18 / 25

18. 15)

19 / 25

19. 14)

20 / 25

20. 13)

21 / 25

21. 12)

22 / 25

22. 11)

23 / 25

23. 10)

24 / 25

24. 9)

25 / 25

25. 8)

Your score is

0%

Leave a Reply

Your email address will not be published. Required fields are marked *