Question

Question 5 (8 marks] We want to identify students who might need some help. These are defined as those students who have a course average between 40% and 60% prior to the exam. State an algorithm to list those students in any order. Do not create a data structure this is not dynamic)! You can use any of the algorithms discussed in class. The algorithm must run in O(n) time, where n is the total number of students in class.

Answer 1

Please find the algorithm below.

BEGIN:
INPUT : N:= NUMBER OF STUDENT IN THE CLASS
TAKE VARIABLE : ROLL_NUMBER[N];
TAKE VARIABLE : ARRAY[N] , COURSE_AVG[N],i=0;
FOOR LOOP: FOR i IN RANGE (0,N-1)
   IF (COURSE_AVG[i]>= 40 && COURSE_AVG[i]<= 60):
   ARRAY[i]=ROLL_NUMBER[i]
FOOR LOOP: FOR i IN RANGE (0,N-1)
PRINT ARRAY[i]
END;

Here , as the for loop will check for each student and the total number of student is n . Then for each studentit will take O(1) time . So , for n number of student the total time will be required : O(1)+O(1)+ .... n = O(n)