hemavardhang/MohlerASAG huggingface dataset:
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: compilation error
Grade: 1 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: compilation error.
Grade: 1 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: Using an index outside the bounds of the array generates a run-time error.
Grade: 5 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: run-time error
Grade: 5 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: Its a run-time error.
Grade: 5 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: run time error
Grade: 5 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: Run-time error.
Grade: 5 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: This is a run-time error. The program will compile AND execute, so these errors can be difficult to debug.
Grade: 5 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: this is a run-time error or execution-time error.
Grade: 5 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: Run-time.
Grade: 5 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: run time
Grade: 5 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: Generates a compilation error. The compiler will complain that the variable you are referring to was never declared.
Grade: 1 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: run-time
Grade: 5 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: runtime error.
Grade: 5 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: Compilation error.
Grade: 1 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: not answered
Grade: 0 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: It will NOT cause a compilation error. It will either give a run-time error, or will give the value at that actual location in memory, causing a logic error.
Grade: 5 out of 5
Question: Using an index outside the bounds of the array generates an error. Is this a compilation error or a run-time error?
Instructor answer: Run-time error.
Student answer: it is a run-time error
Grade: 5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: usually it is by rows then followed by the column, but it is up to the programmer to determine how values are stored in bi-dimensional arrays.
Grade: 2.5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: by rows.
Grade: 5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: Multi-dimensional arrays are stored in memory by rows.
Grade: 5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: A bi-dimensional/two-dimensional array is stored in a row-column matrix.  Where the first index indicates the row and the second indicates the column.  This means that when array elements are accessed in the order in which they are actually stored in memory, the right index changes faster than the left.
Grade: 4.5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: They are stored in memory in rows.
Grade: 5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: rows
Grade: 5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: By rows.
Grade: 5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: by rows
Grade: 5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: m-by-n. by row-column.
Grade: 4 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: bi-dimensional arrays are stored by rows
Grade: 5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: By column.
Grade: 1 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: columns
Grade: 1 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: By rows
Grade: 5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: by-dimensional arrays are stored by row
Grade: 5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: x by y is row by column.<br>So x is rows, and y is columns.<br>Since the length of the row is not needed when passing the array to the function, this leads me to believe that bi-dimensional arrays are stored by rows at a time.
Grade: 5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: Both, they are stored in seperate sections.
Grade: 2.5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: by rows, then columns.
Grade: 4.5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: Rows
Grade: 5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: by rows of rows
Grade: 5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: stored by rows
Grade: 5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: by row and column
Grade: 2.5 out of 5
Question: How are bi-dimensional arrays stored in memory, by rows or by columns?
Instructor answer: By rows.
Student answer: No answer
Grade: 1 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: List based is preferred because it is not constrained to a fix size.  The down fall is that it takes up more memory because each node has at least two parts, the item and the pointer.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: List based is preferred because the stack you create is not limited in size and can increase or decrease in size as needed.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: Array-based prevents the push operation  from adding an item to the stack if the stack's size limit, which is the size of the array, has been reached.  List-base much simpler to write and does not have a fixed size.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: Array based because they are faster, easier to keep track of and less complexity in code.
Grade: 2.5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list-based because it does not use a fixed size like an array would.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: usually linked list because it doesn't have a fixed size. But if you know or want to set a max size array is better.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: List-based.  Allows more flexablity with size of the stack.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: Linked lists are preferred for implementing stacks because they are not limited to a set number of elements.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: The list-based implementation is preferred since the big O(1) is very efficient.
Grade: 3 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: Linked list implementation is preferred. That way, the list can be moved along without iteration.
Grade: 3 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list because it its size is not determined
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: Linked list because it takes up less memory and is scalable
Grade: 3 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: List-based, as the list can be grown dynamically, and as the head node is easily accessible.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list based because the nodes are easier to work with and can be traversed easier
Grade: 3 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list based, because of the lower processing overhead and nearly unlimited space, due to linked list design.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list-based<br>It can grow and shrink dynamically, unlike the fixed size array.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list based because arrays can become full, lists can grow/shrink as needed
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: List-bases implentation is preferred. One of the main reasons is because of that the list has no fixed size.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: Array is preferred.  Linked list implementation requires extra space to store pointers.  Space is allocated dynamically in the list-based which takes more time.
Grade: 2.5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: link list is preferred because it makes pushing elements easier because there is no limit other than memory to the number of elements
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: List-based implementation is much easier to implement, and allows the stack to scale as necessary. It is therefore the preferred implementation.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: Array based implementation requires less memory than a list based.<br>inceasing the size of a  resizeable array can waste storage and time
Grade: 3.5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: in an array based stack you would need to pre-determine a size, where in a list you can increase or decrease the size however you want.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: A list-based implementation is preferred because the list is more<br> flexible than a array.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: i would think a list based would be better because you can change the pointers of the nodes to add or remove things from your stack
Grade: 4 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list based, because it is much more flexible, easier to use, and doesnt need to have a max size defined when it is made.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: array based list is preferred because it can hold any size as long as u specify it.
Grade: 1 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: List based.  Because it is on the run time order of N, also it does not have a limited size like an array does
Grade: 4.5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: linked list based. because it doesn't store the items linearly in memory but instead as individual blocks.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: List based is preferred because there are no size restrictions.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: A list-based implementation would be preferred. The array is slightly more complicated, where you would need to keep track of both front and rear.
Grade: 3.5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: List-based. Array-based queues have a way to complicate things to an extent.
Grade: 3.5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: List-based. Less code, and no size limitation/declaration... which means it is also more efficient and versatile.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list based is prefered because it doesn't have a set size and insertion and deletion can be done very quickly of you keep pointers to first element and last.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: List based is preferred because there are space issues with array based due to rightward drift.  The fix for rightward drift requires constant shifting of the queue data.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: Similar to stacks, linked lists are preferable for queues because the size can be adjusted.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: array-based is preferred because all you have to keep track of is the array itself and the count.
Grade: 1.5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list because its size is not defined
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: List-based, because when you enqueue (or dequeue depending upon your implementation) you would need to shift all elements to another space with an array, causing a horrid time complexity for large data sets, where as you can just modify the pointers in a list for a constant time complexity
Grade: 4.5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: queue's are best with lists, especially if the tail is kept track of, as the list can be dynamically grown without losing track of the head or tail.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list based, its much simpler and the run time is better
Grade: 4 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list based, because of the lessened memory usage initially, and the increased limits on how large the que can become.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: List-based because it's not fixed size.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list, its dynamic and no size needs to be declared
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list bases implementatoin is best because you use pointers to keep track of the front and back pointers. Easier to maintain, but uses more memory
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list based.  It can dynamically grow and has fewer restrictions.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list based is preferred because memory allocation is not an issue
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: List based solutions are preferred, because they allow for queues of any size.
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: I think array based is batter, because of fixed size, but on other had list base is more flaxible. You do not have to worry about the size
Grade: 4 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list based because you dont need to shift the elements like you do in array based queues
Grade: 4 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: List-based because memory isn't constricted.<br>
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list based because the array based has to have a fixed size, it cannot be added to or removed from as easily
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list-based array is easier and more scalable
Grade: 5 out of 5
Question: Which implementation (array-based vs. list-based) is preferred for a queue, and why?
Instructor answer: Link-based, because they are dynamic (no size constraints)
Student answer: list based becuase an arrary based has to have an arrary size and needs to be pre-defined and can't be changed dynamically.
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: A stack, some printing jobs might have a higher priority than others and they can be easily inserted at the front of the list or anywhere between.
Grade: 1.5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: a queue otherwise some things would never be printed.
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: A queue is more appropriate for scheduling printing jobs because queues have first in first out behavior.
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: Queue, its better to be FIFO than LIFO(stack).
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: Queue of course!
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: Queue, the person who wanted to print first should be first served.
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: queue because it guarantees that job are executed in the order they come in.
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: queue
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: Queues would be preferable to stacks for use as scheduling print jobs because it would print jobs in the order that they were sent to the printer.
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: a queue.
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: a queue
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: Queue's are more appropriate, as printers are usually first come, first serve.
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: queue, because of the first in first out principles, and if it was a stack it would be last in last out,  because it could possibly not let the first item that was added get removed in a timely manner.
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: Queue<br>
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: A Queue data structure is more appropriate for scheduling printing jobs at a printer. The first job sent to the printer is the first job printed.
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: a queue.  It wouldn't be unfair for the first job to finish last.
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: a queue, because it takes the job that has waited the longest
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: A queue is more appropriate, because the clients which have waited the longest should be the first served.
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: Queue
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: i would say that a queue is better because the first thing you try to print should be the first one to come out of the printer  (FIFO)
Grade: 5 out of 5
Question: What data structure is more appropriate for scheduling printing jobs at a printer, a stack or a queue?
Instructor answer: queue
Student answer: a queue, because you want the jobs to execute in the order that they are received
Grade: 5 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: log(log n), 2^(log n), n^2, n^3, n!
Grade: 5 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: log(log n), n^2, n^3, 2^(log n), n!
Grade: 4 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: log(logn) 2^(log n) n^2 n^3 n!
Grade: 5 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: log(log n) , 2^(log n) , n^2 , n^3, n!
Grade: 5 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: log(log(n)), n^2, n^3, 2^log(n), n!
Grade: 4.125 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: log(logn)<br>2^(logn)<br>n!<br>n^3<br>n^2
Grade: 2 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: log(log n); 2^(log n); n!; n^2; n^3;
Grade: 3.75 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: this goes from largest to smallest: n!, n^3, n^2, 2^(log n), log(log n)
Grade: 5 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: log(log n); 2^(log n); n^2; n^3; n!
Grade: 5 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: 2^(log n), log(log n), n!, n^2, n^3
Grade: 1.75 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: log(log n); n!; n^2;n^3;n^(log n)
Grade: 2.25 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: From least to greatest:  log(log n), 2^(log n), n^2, n^3, n!
Grade: 5 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: log(log n)<br>2^(log n), is just n<br>n^2<br>n^3<br>n!
Grade: 5 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: 2^(log n)<br>log(log n)<br>n^2<br>n^3<br>n!
Grade: 4 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: from lowest to longest.<br>log(log n); 2^(log n); n!;  n^2;  n^3;
Grade: 3.625 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: log(log(n))<br>2^log(n)<br>n^2<br>n^3<br>n!
Grade: 5 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: 2^(log n), n^3, n^2,  log(log n), n!
Grade: 2 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: linear, logarithmic, exponential, linear, linear
Grade: 1.5 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: quickest at top, slowest at bottom<br>log(log n)<br>n^2<br>n^3<br>2^(log n)<br>n!
Grade: 4 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: longest to shortest:<br>n^3; n!; n^2; 2^(log n); log(log n)
Grade: 3 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: 2^(log n)<br>n^2<br>^3<br>log(long n)<br>n!
Grade: 3.25 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: from lowest to highest<br>1- long(long n)<br>2- 2^log(n)<br>3- n^2<br>4- N^3<br>5- n!
Grade: 5 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: log(log n); n^2; n^3; n!; 2^(log n)
Grade: 4.125 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: n^2; n!; n^3; 2^(log n); log(log n)
Grade: 2.25 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: worst to best: n!, n^3, n^2, 2^(log n), log(log n)
Grade: 5 out of 5
Question: Order the following functions by their running time: n^2; log(log n) ; 2^(log n) ; n! ; n^3.
Instructor answer: log(log n);  2^(log n) ; n^2 ; n^3; n!
Student answer: log(long n),  2^(log n); n^2, n^3;
Grade: 4.75 out of 5