Difference between revisions of "CS 500 Midterm"
(Created page with "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, bi...") |
(→Midterm Exam, part 1) |
||
| Line 7: | Line 7: | ||
* C quizzes - C Operators and Expressions, C Keywords and Data types. | * C quizzes - C Operators and Expressions, C Keywords and Data types. | ||
* C code chunk - what is the output of a given C code chunk. | * C code chunk - what is the output of a given C code chunk. | ||
| − | * Data structures - given a data structure and sequence of operations, what does it look like. | + | * Data structures - given a data structure and sequence of operations, what does it look like at the end. |
* Data structures - running times (worst-case, best-case, average-case) of data structure operations. | * Data structures - running times (worst-case, best-case, average-case) of data structure operations. | ||
Non-auto-graded parts, I will give at least one sample question of each type. | Non-auto-graded parts, I will give at least one sample question of each type. | ||
| − | * | + | * 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. |
| + | * C code for a program to do some basic task (similar to the basic C programs we have done in class and on homework). | ||
=Midterm Exam, part 2= | =Midterm Exam, part 2= | ||
Revision as of 13:01, 20 October 2022
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. This will be timed and must be taken in one sitting. You will have 90 minutes to complete it.
Auto-graded parts that you will be able to practice ahead of time.
- C quizzes - C Operators and Expressions, C Keywords and Data types.
- C code chunk - what is the output of a given C code chunk.
- Data structures - given a data structure and sequence of operations, what does it look like at the end.
- Data structures - running times (worst-case, best-case, average-case) of data structure operations.
Non-auto-graded parts, I will give at least one sample question of each type.
- 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.
- C code for a program to do some basic task (similar to the basic C programs we have done in class and on homework).
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.
- 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.
