1998 S-Q Student Questionnaire
Local (Harvard FAS) login name:
Local telephone number (optional):
What is your goal in this course?
Are there any algorithms or topics that you are
particularly interested in?
What other computer science courses have you taken?
(list by title or subject, not number)
Status: Part-time Full-time
Credit: Graduate Undergraduate
- On a scale from 0 to 5, with 5 being extremely
familiar and 0 being completely unfamiliar, how
familiar are you with each of the following?
_____ C pointers _____ Using UNIX
_____ Recursion _____ Structures and typedef
_____ Dynamic memory allocation _____ malloc and free
_____ The stdio library _____ File I/O
_____ Proof by induction _____ Elementary probability
- Please circle the data structures that you are already familiar
with (if any):
Linked lists Stacks Queues Binary trees
Hash tables B-Trees Heaps Graphs
- Please circle the algorithms that you are already
familiar with (if any):
Linear Search Binary Search Merge Sort Quick Sort
Selection Sort Radix Sort Bucket Sort Tree Balancing
Inorder Traversal Monte Carlo
Depth-First Search Breadth-First Search