id
stringlengths 11
11
| question
stringclasses 79
values | instructor_answer
stringclasses 80
values | student_answer
stringlengths 1
959
| score_grader_1
float32 0
10
| score_grader_2
float32 0
10
| score_avg
float32 0
5
|
|---|---|---|---|---|---|---|
E12.Q04.A23
|
Briefly, how does selection sort work?
|
It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
|
it selects the smallest element in a list and switches it with the element in its correct position, then it selects the next smallest and does the same...
| 8.5
| 10
| 4.5
|
E12.Q04.A24
|
Briefly, how does selection sort work?
|
It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
|
It starts at the first element and replaces it with the smallest element found to the right. It then repeats with the next element in the list.
| 8.5
| 10
| 4.5
|
E12.Q04.A25
|
Briefly, how does selection sort work?
|
It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
|
selection sort is when you pick a data member and put it in a new array, then you pick another data member and put it in order with the new array, then pick another and insert it in the correct place in the new array, etc etc
| 10
| 2
| 3
|
E12.Q04.A26
|
Briefly, how does selection sort work?
|
It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
|
it searches through the entire data set for the best element to go in the current position, then it moves up a position and searches through the remainder of the set for the best element for the new position.
| 6
| 10
| 4
|
E12.Q04.A27
|
Briefly, how does selection sort work?
|
It selects the minimum from an array and places it on the first position, then it selects the minimum from the rest of the array and places it on the second position, and so forth.
|
selection sort iterates through the array one element @ a time searching for the right and replacing current value with it.
| 6
| 10
| 4
|
E12.Q05.A00
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
A link list can grow to a infinite size as a array has a fixes size.
| 10
| 10
| 5
|
E12.Q05.A01
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
The advantage of linked lists is that they are not limited in size like arrays.
| 10
| 10
| 5
|
E12.Q05.A02
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
link lists dont have a fixed size
| 10
| 10
| 5
|
E12.Q05.A03
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
Linked Lists can be of variable size, where arrays have fixed size.
| 10
| 10
| 5
|
E12.Q05.A04
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
Linked lists do not have a definite size. They can be as big or as small as needed, and they don't have to allocate extra memory for elements you don't need. Arrays size must be defined.
| 10
| 10
| 5
|
E12.Q05.A05
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
a linked list has a dynamic size , but an array only has a fixed size and takes allot of extra operations to increase its size.
| 10
| 10
| 5
|
E12.Q05.A06
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
You do not have to predetermine your list size as you do with arrays.<br>Linked list have the ability to be as large as you want them adding memory as needed.
| 10
| 10
| 5
|
E12.Q05.A07
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
The main advantage to a linked list is that it can have it's size adjusted during runtime.
| 10
| 10
| 5
|
E12.Q05.A08
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
Linked lists are able to grow in size. So elements can be added to the list.
| 10
| 10
| 5
|
E12.Q05.A09
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
Linked lists are not confined to a specific size, and can have elements added and removed far easier. They are also easier to traverse.
| 10
| 9
| 5
|
E12.Q05.A10
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
There is no predetermined length
| 10
| 10
| 5
|
E12.Q05.A11
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
Inserts into a linked list are far cheaper than an insert into an array. With an array, all items after the one being inserted must me shifted, with a linked list, only the pointers are replaced.
| 10
| 8
| 4.5
|
E12.Q05.A12
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
Linked lists may be dynamically grown.
| 10
| 10
| 5
|
E12.Q05.A13
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
Linked lists are very dynamic in that they can change and be added/subtracted to very easily because they are not linear in memory.<br> Arrays are pre-specified in size to be cast over a certain amount of disk space. This makes insertion into Arrays difficult because all elements must be shifted, and if you reach the end of the array, you are done even if you have more data to input. Linked Lists do not run into these problems.
| 10
| 10
| 5
|
E12.Q05.A14
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
linked lists have an indefinite size, whereas arrays are a specific size.
| 10
| 10
| 5
|
E12.Q05.A15
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
Linked lists have no predefined length, and thus you can have virtually unlimited items in that list.
| 10
| 10
| 5
|
E12.Q05.A16
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
They grow dynamically, unlike the fixed size array
| 10
| 10
| 5
|
E12.Q05.A17
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
you can add as many nodes as you like without having to specify a list size, if an array gets too big you have to copy its entire contents to another larger array to get more room
| 10
| 10
| 5
|
E12.Q05.A18
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
Linkded list does not have a fixed size. Arrays have a fixed size.
| 10
| 10
| 5
|
E12.Q05.A19
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
Linked lists have a dynamic size, where as arrays have a static size.
| 10
| 10
| 5
|
E12.Q05.A20
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
linked lists do not have a memory constraint other than total memory
| 10
| 10
| 5
|
E12.Q05.A21
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
The primary advantage of linked lists over arrays is their ability to become larger or smaller as data is added and removed from the list, whereas arrays may waste memory for small data sets, and run out of space for large data sets.
| 10
| 10
| 5
|
E12.Q05.A22
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
Array have fixed size, in Link List are flexible for adding or deleting an element.
| 10
| 10
| 5
|
E12.Q05.A23
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
they are resizeable
| 10
| 10
| 5
|
E12.Q05.A24
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
Linked lists can be dynamically allocated and their size can change as needed.
| 10
| 10
| 5
|
E12.Q05.A25
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
linked lists do not have to have a specified size, they are easier to add to and remove from
| 10
| 10
| 5
|
E12.Q05.A26
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
they dont have a fixed size, no shiftnig needs to be done for insertion/deletion.
| 10
| 10
| 5
|
E12.Q05.A27
|
What is the advantage of linked lists over arrays?
|
Linked lists are dynamic structures, which allow for a variable number of elements to be stored.
|
linked list many be dynamically grown. It has not limit<br><br>
| 10
| 10
| 5
|
E12.Q06.A00
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
A data structure in C++ where the the first element in the queue is the first element taken out of the queue.
| 10
| 10
| 5
|
E12.Q06.A01
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
A queue is an abstract data type that performs operations on both ends of the list and exhibits first-in first-out behavior.
| 10
| 10
| 5
|
E12.Q06.A02
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
First in first out.
| 10
| 8
| 4.5
|
E12.Q06.A03
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
A queue is an abstract data type that involves putting an element at the back of the list. Queues use the FIFO, first in first out, idea where the first element in the list is the first that comes out.
| 10
| 10
| 5
|
E12.Q06.A04
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
A data structure that implements first in, first out. The element that has been there the longest is the first to get served.
| 10
| 10
| 5
|
E12.Q06.A05
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
a data structure that inserts elements at the end of it and removes elements from the front.
| 10
| 10
| 5
|
E12.Q06.A06
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
A queue is a collection of elements with the characteristics of first in first out (FIFO). The first item in is the first item out. All additional items are added to the end of the list.
| 10
| 10
| 5
|
E12.Q06.A07
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
A queue is a data structure that inserts data into a FIFO configuration, that is, data input to the structure is always at it's end, and data taken is always from the beginning.
| 10
| 10
| 5
|
E12.Q06.A08
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
It is a particular set of entities that are put in to a certain order by the enqueue and the dequeue functions.
| 10
| 3
| 3.5
|
E12.Q06.A09
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
A queue is a data type that operates under a FILO (First In Last Out) method. This means that the first element inserted into the queue is the first element removed.
| 5
| 10
| 4
|
E12.Q06.A10
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
like a linked list except it is first in last out
| 10
| 0
| 2.5
|
E12.Q06.A11
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
A queue is like a stack except it follows FIFO (First in first out) .
| 10
| 10
| 5
|
E12.Q06.A12
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
A queue is a data structure where the first node in is the first node out.
| 10
| 10
| 5
|
E12.Q06.A13
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
A queue is a First in First out data structure much like a line for a movie theatre. The first object in line is the first object to be handled or enacted upon.
| 10
| 10
| 5
|
E12.Q06.A14
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
its a lot like a stack, except that the first item put into the list is the first item to be taken from the list.
| 10
| 10
| 5
|
E12.Q06.A15
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
a first in first out list of items, like if you put 5, 4, 3, 2, and 1 in the queue it will when you dequeue items remove the items in the same order as put in, so thus it will put out, 5, 4, 3, 2, and 1 in that exact order.
| 10
| 10
| 5
|
E12.Q06.A16
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
A linked list with a First In, Out structure<br>dequeue at the head of the list<br>enqueue at the end of the list
| 10
| 10
| 5
|
E12.Q06.A17
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
a list of objects that follow the rule first in first out, essentially a linked list that goes in order of the first object in the list is the first to be taken off.
| 10
| 10
| 5
|
E12.Q06.A18
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
A queue is an abstract data type that is based off of the priniple of first in first out. FIFO. The first item inserted into the list will the first item taken out.
| 10
| 10
| 5
|
E12.Q06.A19
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
It is a "first in first out" data structure. It can be implemented with either a linked list or an array.
| 10
| 10
| 5
|
E12.Q06.A20
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
an ordered list that performs task in the order of first in first out. adding items to the queue places items behind the rest of them. taking items off the queue takes the one that has waited the longest.
| 10
| 10
| 5
|
E12.Q06.A21
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
A queue is a linear, first-in first-out data structure. Data must be accessed in the same order it was put into the queue, so only the oldest item in the queue is accessible at any time. Main functions defined are enqueue and dequeue.
| 10
| 10
| 5
|
E12.Q06.A22
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
Queue is a buffer, it follows the rule of First In and First out. Queue is very useful in computer science for scheduleing .
| 10
| 10
| 5
|
E12.Q06.A23
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
a queue is a set of elements where the first element inserted is the first element to be removed
| 10
| 10
| 5
|
E12.Q06.A24
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
Is a list of items where the the user only has access to the first element and each new element is added at the end.
| 10
| 10
| 5
|
E12.Q06.A25
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
a queue is a list of data that follows the fifo principle, an example of this would be when you get into a line at a movie theater...the first one there gets to buy a ticket first
| 10
| 10
| 5
|
E12.Q06.A26
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
A queue is a data structure that holds a set of objects, which has a FIFO (first in first out) priority.
| 10
| 10
| 5
|
E12.Q06.A27
|
What is a queue?
|
A data structure that stores elements following the first in first out principle. The main operations in a queue are enqueue and dequeue.
|
like a linked list expect first in last out
| 5
| 0
| 1.5
|
E12.Q07.A00
|
What are the main operations associated with a stack?
|
push and pop
|
push and pop
| 10
| 10
| 5
|
E12.Q07.A01
|
What are the main operations associated with a stack?
|
push and pop
|
Pop, which removes the head, or least recently inserted node from the stack. Push, which inserts a new node at the head of the stack.
| 10
| 10
| 5
|
E12.Q07.A02
|
What are the main operations associated with a stack?
|
push and pop
|
Push and pop
| 10
| 10
| 5
|
E12.Q07.A03
|
What are the main operations associated with a stack?
|
push and pop
|
The Push function and the Pop function.
| 10
| 10
| 5
|
E12.Q07.A04
|
What are the main operations associated with a stack?
|
push and pop
|
push and pop
| 10
| 10
| 5
|
E12.Q07.A05
|
What are the main operations associated with a stack?
|
push and pop
|
push - puts an element on the stack<br>pop- takes an element off the stack
| 10
| 10
| 5
|
E12.Q07.A06
|
What are the main operations associated with a stack?
|
push and pop
|
Push and pop.
| 10
| 10
| 5
|
E12.Q07.A07
|
What are the main operations associated with a stack?
|
push and pop
|
Push and Pop
| 10
| 10
| 5
|
E12.Q07.A08
|
What are the main operations associated with a stack?
|
push and pop
|
push and pop.
| 10
| 10
| 5
|
E12.Q07.A09
|
What are the main operations associated with a stack?
|
push and pop
|
Push and Pop. Push adds an element to the stack, while Pop removes the top element from a stack.
| 10
| 10
| 5
|
E12.Q07.A10
|
What are the main operations associated with a stack?
|
push and pop
|
pop and push
| 10
| 10
| 5
|
E12.Q07.A11
|
What are the main operations associated with a stack?
|
push and pop
|
push,pop,search,isEmpty
| 10
| 8
| 4.5
|
E12.Q07.A12
|
What are the main operations associated with a stack?
|
push and pop
|
push and pop
| 10
| 10
| 5
|
E12.Q07.A13
|
What are the main operations associated with a stack?
|
push and pop
|
Push, Pop, isEmpty, isFull<br><br>Maybe List to show all elements or an operation to count how many elements in the stack.
| 10
| 9
| 5
|
E12.Q07.A14
|
What are the main operations associated with a stack?
|
push and pop
|
pop, push
| 10
| 10
| 5
|
E12.Q07.A15
|
What are the main operations associated with a stack?
|
push and pop
|
isempty, push and pop, along with usually,
| 10
| 10
| 5
|
E12.Q07.A16
|
What are the main operations associated with a stack?
|
push and pop
|
push and pop
| 10
| 10
| 5
|
E12.Q07.A17
|
What are the main operations associated with a stack?
|
push and pop
|
push and pop. push puts objects into the stack and pop takes them out following the first in last out rule.
| 10
| 10
| 5
|
E12.Q07.A18
|
What are the main operations associated with a stack?
|
push and pop
|
The main operations in a stack are push and pop. Push adds an item to the top of the stack, pop removes the top item from the stack.
| 10
| 10
| 5
|
E12.Q07.A19
|
What are the main operations associated with a stack?
|
push and pop
|
push and pop
| 10
| 10
| 5
|
E12.Q07.A20
|
What are the main operations associated with a stack?
|
push and pop
|
push, which adds an item to the top of the stack, and<br>pop, which takes the first item off the top to the stack
| 10
| 10
| 5
|
E12.Q07.A21
|
What are the main operations associated with a stack?
|
push and pop
|
the main functions defined for a stack are push, which puts an element on the top of the stack, and pop, which removes an item from the top.
| 10
| 10
| 5
|
E12.Q07.A22
|
What are the main operations associated with a stack?
|
push and pop
|
Push()<br>Pop()<br>Full()<br>IsEmpty()
| 10
| 9
| 5
|
E12.Q07.A23
|
What are the main operations associated with a stack?
|
push and pop
|
pop and push<br>to remove an element and to insert an element
| 10
| 10
| 5
|
E12.Q07.A24
|
What are the main operations associated with a stack?
|
push and pop
|
Push, Pop
| 10
| 10
| 5
|
E12.Q07.A25
|
What are the main operations associated with a stack?
|
push and pop
|
push and pop
| 10
| 10
| 5
|
E12.Q07.A26
|
What are the main operations associated with a stack?
|
push and pop
|
push - Add an element to the top of the stack<br>pop - remove the top element from the stack
| 10
| 10
| 5
|
E12.Q07.A27
|
What are the main operations associated with a stack?
|
push and pop
|
push and pop
| 10
| 10
| 5
|
E12.Q08.A00
|
What is the Euler tour traversal of a tree?
|
A walk around the tree, starting with the root, where each node is seen three times: from the left, from below, from the right.
|
When you traverse a tree of any size you will visit each node three times. Its on the order of 3n or O(n) running time.
| 6
| 10
| 4
|
E12.Q08.A01
|
What is the Euler tour traversal of a tree?
|
A walk around the tree, starting with the root, where each node is seen three times: from the left, from below, from the right.
|
The Euler tour traversal of a tree begins at the root and visits each node in the tree from the left, then bottom, then right sides.
| 10
| 10
| 5
|
E12.Q08.A02
|
What is the Euler tour traversal of a tree?
|
A walk around the tree, starting with the root, where each node is seen three times: from the left, from below, from the right.
|
Where you visit the in order according to its data value.
| 6
| 5
| 3
|
E12.Q08.A03
|
What is the Euler tour traversal of a tree?
|
A walk around the tree, starting with the root, where each node is seen three times: from the left, from below, from the right.
|
It is a tree that shows how it functions. It contains parents, children, siblings, ancestors and descendents. The use of tree type algorithm is also an alternative sorting algorithm.
| 7.5
| 0
| 2
|
E12.Q08.A04
|
What is the Euler tour traversal of a tree?
|
A walk around the tree, starting with the root, where each node is seen three times: from the left, from below, from the right.
|
Start from the root, circle around the _whole_ "tree", naming each node as you see it.
| 8.5
| 10
| 4.5
|
E12.Q08.A05
|
What is the Euler tour traversal of a tree?
|
A walk around the tree, starting with the root, where each node is seen three times: from the left, from below, from the right.
|
it is where you visit the parent then you vistit the children
| 6
| 0
| 1.5
|
E12.Q08.A06
|
What is the Euler tour traversal of a tree?
|
A walk around the tree, starting with the root, where each node is seen three times: from the left, from below, from the right.
|
To start from the root , traveling left and visiting ever child along the way till you return to the root from the right.
| 8.5
| 8
| 4
|
E12.Q08.A07
|
What is the Euler tour traversal of a tree?
|
A walk around the tree, starting with the root, where each node is seen three times: from the left, from below, from the right.
|
Traversing a tree down to it's terminal child and then all of it's siblings, then it traverses up the terminal child's parent and all of it's siblings (repeating the first step if those siblings have children) until the root node has been visited.
| 8.5
| 8
| 4
|
E12.Q08.A08
|
What is the Euler tour traversal of a tree?
|
A walk around the tree, starting with the root, where each node is seen three times: from the left, from below, from the right.
|
The Euler tour traversal of a tree the function that iteratively keeps track of the pointer on each node.
| 7.5
| 3
| 3
|
E12.Q08.A09
|
What is the Euler tour traversal of a tree?
|
A walk around the tree, starting with the root, where each node is seen three times: from the left, from below, from the right.
|
You travel the outside edge of the tree, clockwise, while naming each node.
| 6
| 9
| 4
|
E12.Q08.A10
|
What is the Euler tour traversal of a tree?
|
A walk around the tree, starting with the root, where each node is seen three times: from the left, from below, from the right.
|
children to root
| 7.5
| 0
| 2
|
Subsets and Splits
Score summary per assignment-question pair
Provides a comprehensive summary of scoring metrics for different question IDs across both open-ended and close-ended responses, highlighting variations and averages.
Number of student answers per assignment-question pair
Counts the number of student answers for each question ID across both open-ended and close-ended datasets, providing insight into question popularity.