What This Document Is
This document contains practice questions and worked solutions for Midterm 2 in NYU’s Introduction to Computer Science (CSCIUA101) course. It focuses on core programming concepts covered in the second part of the course, including algorithms applied to arrays, the fundamentals of classes and objects, and working with the String and Stack classes.
Why This Document Matters
This practice material is designed for students enrolled in CSCIUA101 who are preparing for their Midterm 2 exam. It provides an opportunity to test understanding of key concepts and problem-solving skills *before* the official assessment. Successfully working through these questions can help identify areas needing further review. It’s most useful when used in conjunction with lecture notes, textbook readings, and other course materials.
Common Limitations or Challenges
This document is a *practice* resource, not a comprehensive review of all possible exam topics. It represents a sample of the types of questions that might appear on the midterm, but does not guarantee coverage of every concept. Students should not rely solely on these questions for exam preparation.
What This Document Provides
The full document includes:
* Five practice questions covering array manipulation (merging sorted arrays, summing every other element), program output analysis, and methods for checking array sorting and searching.
* Complete, step-by-step solutions for each practice question.
* Java code examples demonstrating the implementation of the requested methods.
This preview *does not* include the full solutions or detailed explanations for each question. It is intended to give you a sense of the topics covered and the format of the practice material.
