Difference between revisions of "CS 500 Midterm"

From Computer Science
Jump to: navigation, search
(Midterm Exam, part 1)
(Midterm Exam, part 2)
 
(7 intermediate revisions by the same user not shown)
Line 1: Line 1:
 +
For [[CS 500]]
 +
 
This page contains information about the midterm exam for CS 500.  The topics for the midterm are - C programming, basic data structures (arrays, linked lists, hash tables, binary search trees).   
 
This page contains information about the midterm exam for CS 500.  The topics for the midterm are - C programming, basic data structures (arrays, linked lists, hash tables, binary search trees).   
  
 
=Midterm Exam, part 1=
 
=Midterm Exam, part 1=
Part 1 is in Canvas.  This will be timed and must be taken in one sittingYou will have 90 minutes to complete it.   
+
Part 1 is in Canvas.  You will have the chance to do retakes of q1, q2, q3, q5 again. There will be midterm versions of each of these, and you will only need to take the ones that you need to improve on.  There will be short answer questions that will be mandatory and graded manually.  These will be of the following types:
 +
* C code to solve problems similar to those we have done on the HWs or in class.  There may be some that you hand in on the server (and are expected to have compiling and running correctly)I will give questions that can be used to check off programming skills from the checklist of ones that are needed for the different grade levels.
 +
* Data structures - given a situation, choose the best data structure to use, explain your choice and the running time that will resultKnow the pros/cons of the data structures we have studied.
  
It is open notes, open internet, but you cannot talk to others about the questions (cannot talk to anyone - not others in the class, not the GAs, not random other people). This is the same as for Canvas quizzes we have had for the class.
+
This will be during our Wednesday test/quiz time, so March 29 from 11am-noon.  Assuming most people would be able to extend this for taking a test, I will leave the quiz open until 12:30pm.
  
Auto-graded parts that you will be able to practice ahead of time.
+
Those who are registered for the face to face course must take the exam in person.
* C quizzes - [https://indstate.instructure.com/courses/12565/quizzes/228115 C Operators and Expressions], [https://indstate.instructure.com/courses/12565/quizzes/228116 C Keywords and Data types]
 
* C
 
** Play computer - what are the values of variables after a chunk of code runs
 
** Fix errors - fix syntax errors, logical errors, memory leaks, buffer overflow [https://indstate.instructure.com/courses/12565/quizzes/230294 practice]
 
** Fill in the blank - what value or statement to put in to complete a piece of code
 
* Data structures - given a data structure and sequence of operations, what does it look like at the end. Something like this: [https://indstate.instructure.com/courses/12565/quizzes/230192 practice]
 
* Data structures - running times (worst-case, best-case, average-case) of data structure operations. Something like this: [https://indstate.instructure.com/courses/12565/quizzes/209470 practice]
 
  
Non-auto-graded parts
+
The test will be open notes and internet, but you are not allowed to use AIs and are not allowed to communicate with anyone during the test.
* C code for an operation for one of the data structures we have done in class (ArrayStack). It will be something similar to one of the operations we have done, but not exactly the same.
 
** ''Examples: determine if the arraystack is in sorted order, print out just the nodes with count at least some amount, append one arraystack onto another, merge two sorted arraystacks into a new arraystack (which will be in sorted order), reverse the arraystack.''  In general - looping through the arraystack and possibly making modifications.
 
* C code for a program to do some basic task (similar to the basic C programs we have done in class and on homework).
 
** ''Examples... Take input from stdin that is assumed to be in csv format, compute the average of the third column.  Take command-line arguments and determine if they were given in alphabetical order.  First command-line argument as a word, second is the name of a text file, determine if the word is in the file.''  In general - can read command-line arguments, stdin as words, stdin as lines, split into tokens, nested loops/ifs, structures, memory/pointers.
 
  
 
=Midterm Exam, part 2=
 
=Midterm Exam, part 2=
 
Part 2 is an interview. You will sign up for a 30 minute meeting slot with the instructor.  You will be asked the following.
 
Part 2 is an interview. You will sign up for a 30 minute meeting slot with the instructor.  You will be asked the following.
* Programs from HW assignments (up through h3) - may be asked to open one of your programs and explain how it works. Probably will pick one that you did get full points on, and one that you did not get full points on.
+
* Programs from HW assignments - may be asked to open one of your programs and explain how it works, and asked to make some modifications. The goal is to verify your understanding and to allow those who did not get full credit to demonstrate that they have the skill now.
* Program - may be asked to create a new program from scratch, something similar to HW assignments but different.  ''Example questions - coming soon.''
+
* Program - may be asked to create a new program from scratch, something similar to HW assignments but different.   
* Data structures - may be asked to explain some of the data structures operations - how it works, what the running time is.
+
* Data structures - may be asked to explain some of the data structures operations - how they work, what the running time is, pros/cons.
 +
 
 +
You should sign for a meeting slot with Dr. Kinne between March 24-31.  You can use this link to sign up for a slot: https://cs.indstate.edu/jkinne-meeting
 +
 
 +
Those in the face to face section should sign up for a face to face meeting.  You should bring your laptop; if you do not have one to bring let me know so I can make sure a lab computer is available to use.

Latest revision as of 14:41, 27 March 2023

For CS 500

This page contains information about the midterm exam for CS 500. The topics for the midterm are - C programming, basic data structures (arrays, linked lists, hash tables, binary search trees).

Midterm Exam, part 1

Part 1 is in Canvas. You will have the chance to do retakes of q1, q2, q3, q5 again. There will be midterm versions of each of these, and you will only need to take the ones that you need to improve on. There will be short answer questions that will be mandatory and graded manually. These will be of the following types:

  • C code to solve problems similar to those we have done on the HWs or in class. There may be some that you hand in on the server (and are expected to have compiling and running correctly). I will give questions that can be used to check off programming skills from the checklist of ones that are needed for the different grade levels.
  • Data structures - given a situation, choose the best data structure to use, explain your choice and the running time that will result. Know the pros/cons of the data structures we have studied.

This will be during our Wednesday test/quiz time, so March 29 from 11am-noon. Assuming most people would be able to extend this for taking a test, I will leave the quiz open until 12:30pm.

Those who are registered for the face to face course must take the exam in person.

The test will be open notes and internet, but you are not allowed to use AIs and are not allowed to communicate with anyone during the test.

Midterm Exam, part 2

Part 2 is an interview. You will sign up for a 30 minute meeting slot with the instructor. You will be asked the following.

  • Programs from HW assignments - may be asked to open one of your programs and explain how it works, and asked to make some modifications. The goal is to verify your understanding and to allow those who did not get full credit to demonstrate that they have the skill now.
  • Program - may be asked to create a new program from scratch, something similar to HW assignments but different.
  • Data structures - may be asked to explain some of the data structures operations - how they work, what the running time is, pros/cons.

You should sign for a meeting slot with Dr. Kinne between March 24-31. You can use this link to sign up for a slot: https://cs.indstate.edu/jkinne-meeting

Those in the face to face section should sign up for a face to face meeting. You should bring your laptop; if you do not have one to bring let me know so I can make sure a lab computer is available to use.