CN5005 – Data Structure and Algorithms

FIND A SOLUTION AT Academic Writers Bay

1
School of Architecture, Computing and Engineering
CN5005 – Data Structure and Algorithms
Labs Week 4 (Algorithm analysis and Sorting Algorithms)
Module Leader: Rawad Hammad
Total Marks: 5 Marks
Deadline: Friday 23/10/2020 17:00 Via Moodle
1. Algorithms Analysis and Big O Notation
Question: True or False?
(a) 3 n^2 + 10 n log n = O (n log n)
(d) n log n + n/2 = O(n)
(1 Marks)
(1 Marks)
2. Calculate the runtime complexity of the below functions in the Big-O
format:
(a) For (i=2; i<=n; i=i++) (1 Marks)
For (j=4; j<n; j=j++)
System.out.println(…);
(b)

READ ALSO...   CHCCSM005 Develop, facilitate and review
Order from Academic Writers Bay
Best Custom Essay Writing Services

QUALITY: 100% ORIGINAL PAPERNO PLAGIARISM – CUSTOM PAPER