At a large university, 434 freshmen, 883 sophomores, and 43 juniors are enrolled in an introductory algorithms course. How many sections of this course need to be scheduled to accommodate all these students if each section contains 34 students?

it will take 40 sections the course to accommodate all the students

Step-by-step explanation:

Given that;

434 freshmen, 883 sophomores and 43 juniors are enrolled

total number of students enrolled = (434 + 883 + 43) = 1360

number of student in one section = 34

now

number of sections of an introductory algorithms course needed to be scheduled to accommodate all these students will be;

Total number of section = total number of students enrolled / number of student in one section

so we substitute

Total number of section = 1360 / 34

Total number of section = 40

Therefore it will take 40 sections the course to accommodate all the students

the discriminant is 64 + 4*1*12 = 112

this is prime.

step-by-step explanation: