Computer Science 2112 Past Exam Paper PDF - Cornell University - Oct 5, 2021
Document Details
Cornell University
2021
Cornell University
Tags
Related
- Data Structures & Algorithms Lecture Notes 1 PDF
- Data Structures - Ellis Horowitz, Sartaj Sahni - Fundamentals - PDF
- Data Structures and Algorithms Study Guide (Sorsogon State University)
- CS301 Data Structures Past Paper PDF 2010
- Introduction to Java Programming and Data Structures (2019) by Y. Daniel Liang - PDF
- II-Sem Computer Science Syllabus PDF
Summary
This is a past exam paper for Computer Science 2112 at Cornell University, taken on October 5, 2021. The exam covers various topics in computer science, including data structures, algorithms and problem-solving.
Full Transcript
Preliminary Examination Computer Science 2112, Cornell University 5 October 2021 There are 6 problems on this exam. It is 11 pages long; make sure you have the whole exam. You will have 24 hours in which to work on the problems, measured from the...
Preliminary Examination Computer Science 2112, Cornell University 5 October 2021 There are 6 problems on this exam. It is 11 pages long; make sure you have the whole exam. You will have 24 hours in which to work on the problems, measured from the time that you download the exam from CMSX. We will compare download and submission times. You will likely find some problems easier than others, so we suggest reading through all the problems before beginning to work. The prelim is worth 102 points total. The point breakdown for the parts of each problem is printed with the problem. Some of the problems have several parts, so make sure you do all of them! Writing on and scanning this exam is an acceptable approach. You may also write your answers onto separate papers or into a separate file that you submit. Make sure your name and NetID are clearly marked on your submission. They should be on a cover page that is separate from your answers. If you are scanning your exam, try early to make sure that the file size is reasonable. Increasing contrast on scans is one way to reduce file size. This is an open-book examination but not open-Internet. You may use the recommended textbook, the course notes, and the course videos. You may not discuss the contents of the exam with other students in the class or with anyone else other than course staff. You may not provide a copy of the exam to others in the class, with or without your answers. Note that some students may receive different versions of the exam, and you are of course expected to submit answers to the version of the questions that you receive. Questions may be asked privately on Ed; if there are clarifications of general interest, we will put them in a pinned post on Ed. Do not ask questions about the exam publicly on Ed. Name and NetID CS 2112 Fall 2021 1/11 Preliminary Examination Problem Points Score Grader 1 12 2 37 3 13 4 20 5 10 6 10 Total 102 NetID only CS 2112 Fall 2021 2/11 Preliminary Examination 1. True/False Tournament [12 pts] (parts a–f) For each question answered wrong, you lose two points. Only one point is lost if a question is left blank. (a) The type Set is a subtype of Collection. (b) A null value takes up as much space in memory as a pointer. (c) The String class has at least one mutator. (d) The expression new boolean uses up about 122 kilobytes of memory. (e) The class Set has a method add(), but the method cannot be used on an expression of type Set