This document outlines a mid-session test for an Algorithms Analysis and Design course. It provides instructions for two sets of students with even and odd IDs, each set receiving different questions to answer in 45 minutes. Set A for even IDs contains 3 questions asking students to define algorithms and efficiency kinds, explain time complexity types, and define big O and big Omega notations. Set A for odd IDs contains 3 parallel questions about defining theta notation, explaining important problem types, and worse case and average case analyses.
This document outlines a mid-session test for an Algorithms Analysis and Design course. It provides instructions for two sets of students with even and odd IDs, each set receiving different questions to answer in 45 minutes. Set A for even IDs contains 3 questions asking students to define algorithms and efficiency kinds, explain time complexity types, and define big O and big Omega notations. Set A for odd IDs contains 3 parallel questions about defining theta notation, explaining important problem types, and worse case and average case analyses.
This document outlines a mid-session test for an Algorithms Analysis and Design course. It provides instructions for two sets of students with even and odd IDs, each set receiving different questions to answer in 45 minutes. Set A for even IDs contains 3 questions asking students to define algorithms and efficiency kinds, explain time complexity types, and define big O and big Omega notations. Set A for odd IDs contains 3 parallel questions about defining theta notation, explaining important problem types, and worse case and average case analyses.