Upload folder using huggingface_hub

data.csv

@@ -0,0 +1,24 @@
+input,output
+Kindly compute the value of log₂16,4
+Kindly compute the value of log₂32,5
+Kindly compute the value of log₂1,0
+Kindly compute the value of log₂128,7
+Kindly compute the value of log₂64,6
+Linear search has a better run time than Binary search,False
+Binary search has a run time of O(log n),True
+O(n) represent logarithmic time,False
+Match Big-O notation with its meaning: O(n),linear time
+Match Big-O notation with its meaning: O(1),constant time
+Match Big-O notation with its meaning: O(log n),logarithmic time
+Match Big-O notation with its meaning: O(n log n),loglinear time
+Match Big-O notation with its meaning: O(C),exponential time
+Match Big-O notation with its meaning: O(n),polynomial time
+The runtime for the assignment statement below is O(n): int x = 404;,False
+The run time for conditionals is,O(1)
+The run time for the loop below is O(n): for(int i = 0; i < n; i++) { // do something },O(n)
+The run time for the program below is____ [grader function],O(1)
+The run time for the program below is____ [forwardBack function],O(n)
+"In the field of Algorithm Analysis, we only care about the best case run time",False
+The nested loop below runs in O(n²) time: for(int i = 0; i < n; i++) for(int j = 0; j < n; j++),True
+This course - CMPS2131 has a final exam.,True
+Algorithm Analysis _____ + data structures = programs,algorithms