CSE 205 Final Exam Preparation
Handbook: Full Coverage Test Bank
Questions, Solutions, and Revision Notes
2026/2027
Question 1
What best describes the exam format for CSE 205?
A. 60 essay questions in 2 hours
B. 40–50 questions in 100 minutes using a computer with Honorlock and webcam
C. 100 multiple-choice questions in 3 hours, paper-based
D. Open-book oral examination
Correct Answer: B. 40–50 questions in 100 minutes using a computer with
Honorlock and webcam
Rationale: The CSE 205 exam is administered electronically and typically includes 40
to 50 questions completed within a strict 100-minute time limit under online
proctoring using Honorlock and a webcam. This ensures academic integrity and
standardized testing conditions. The other options incorrectly describe either the
format, duration, or proctoring method.
Question 2
Which materials are permitted during the CSE 205 exam?
A. Smartphone and calculator
B. Two printed notes and laptop
C. One handwritten double-sided note sheet, blank paper, pen/pencil, and calculator
D. Textbook and internet access
Correct Answer: C. One handwritten double-sided note sheet, blank paper,
pen/pencil, and calculator
Rationale: Only limited approved materials are allowed to ensure fairness, including
one handwritten note sheet, blank scratch paper, writing tools, and a basic calculator.
Cell phones and internet access are strictly prohibited.
Question 3
What is a Java identifier?
,2026/2027
A. A reserved keyword
B. A memory address
C. A name used for variables, methods, or classes
D. A data type
Correct Answer: C. A name used for variables, methods, or classes
Rationale: A Java identifier is used to name programming elements such as variables,
methods, and classes. It must follow naming rules and cannot be a reserved keyword.
Question 4
Which of the following is NOT a Java primitive type?
A. int
B. boolean
C. String
D. double
Correct Answer: C. String
Rationale: String is a reference type in Java, not a primitive type. Primitive types
include int, boolean, char, double, float, long, short, and byte.
Question 5
What is the difference between value types and reference types?
A. Value types store memory addresses
B. Reference types store actual data
C. Value types store actual data, reference types store memory references
D. Both store only memory addresses
Correct Answer: C. Value types store actual data, reference types store memory
references
Rationale: Value types directly store data, while reference types store memory
locations pointing to data objects. This distinction affects how data is accessed and
modified.
Question 6
What is encapsulation in OOP?
A. Writing code without methods
B. Combining data and methods in a class with restricted access
,2026/2027
C. Copying code from another class
D. Converting objects into strings
Correct Answer: B. Combining data and methods in a class with restricted
access
Rationale: Encapsulation bundles data and methods within a class and restricts direct
access to protect data integrity and improve modularity.
Question 7
What is inheritance?
A. Creating multiple objects
B. Copying variables only
C. A class acquiring properties and behaviors from another class
D. Deleting objects automatically
Correct Answer: C. A class acquiring properties and behaviors from another
class
Rationale: Inheritance allows reuse of existing code by enabling a new class to extend
an existing class.
Question 8
What is polymorphism?
A. One method performing multiple tasks depending on object type
B. Creating multiple classes
C. Storing multiple variables
D. Deleting objects
Correct Answer: A. One method performing multiple tasks depending on object
type
Rationale: Polymorphism allows methods to behave differently based on the object,
commonly through method overriding and overloading.
Question 9
What is a stack?
A. FIFO structure
B. LIFO structure
C. Random access structure
D. Tree structure
, 2026/2027
Correct Answer: B. LIFO structure
Rationale: A stack follows Last In First Out (LIFO), meaning the last item added is
the first removed.
Question 10
What is a queue?
A. LIFO structure
B. FIFO structure
C. Circular buffer only
D. Graph structure
Correct Answer: B. FIFO structure
Rationale: A queue follows First In First Out (FIFO), meaning the first element added
is the first removed.
Question 11
What is a linked list?
A. Fixed-size array
B. Data stored in contiguous memory
C. Nodes connected by pointers
D. Sorted array
Correct Answer: C. Nodes connected by pointers
Rationale: A linked list consists of nodes connected using references, allowing
dynamic memory allocation and efficient insertion/deletion.
Question 12
What is a binary tree?
A. Each node has unlimited children
B. Each node has exactly two children
C. Each node has at most two children
D. Nodes are unconnected
Correct Answer: C. Each node has at most two children
Rationale: A binary tree allows each node to have zero, one, or two children.