Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
Document preview thumbnail
Preview 3 out of 29 pages
Exam (elaborations)

CSE 205 FINAL EXAM 2026 REVISION NOTES AND STRUCTURED COMPUTER SCIENCE OVERVIEW GUIDE

Document preview thumbnail
Preview 3 out of 29 pages

CSE 205 FINAL EXAM 2026 REVISION NOTES AND STRUCTURED COMPUTER SCIENCE OVERVIEW GUIDE

Content preview

CSE 205 FINAL EXAM 2026 REVISION NOTES
AND STRUCTURED COMPUTER SCIENCE
OVERVIEW GUIDE

◉ A name defined in an outer scope is not available in all blocks
nested inside that scope. Answer: True


◉ Which keyword is used in Java to create an object?
none of these
create
build
make
new Answer: new


◉ Which object oriented element is best defined as "objects best
viewed as packages of responsibility"?
Data Hiding
Message Passing
Encapsulation
Polymorphism
Inheritance
none of these

,Composition Answer: Encapsulation


◉ We can more easily debug a program when the responsibilities
are well encapsulated. Answer: True


◉ A Queue is a First In First Out (FIFO) data structure. Answer: True


◉ The finally block of a try/catch structure will execute if no
exception occurs in the try block. Answer: True


◉ In a Binary Search Tree, all elements below a given a node have
values that are < that node's value. Answer: False


◉ Stacks can only be implemented as LinkedLists, while Queues can
only be implemented as ArrayLists. Answer: False


◉ In a Binary Search Tree, all elements to one side of a node are <
that node's value, and all elements to the other side are > that node's
value. Answer: True


◉ The finally block of a try/catch structure will execute if an
exception occurs in the try block. Answer: True


◉ Which of the following run-time complexity orders is best?

, O(log n) Logarithmic time
none of these
O(2^n) Exponential
O(n) Linear time Answer: none of these


◉ Which of the following would have a quadratic Big O run-time
complexity?
none of these
Bubble Sort an unsorted array
Insert a value into an ArrayList
Efficiently find the phone number in a phone book, given a person's
name
Determine if a binary number is even or odd Answer: Bubble sort


◉ Which of the following would have a quadratic Big O run-time
complexity?
Efficiently find the definition of a given word in a dictionary
Determine if a binary number is even or odd
none of these
Find the shortest route to visit n cities by airplane
Find the largest value in an unsorted list Answer: None of these

Document information

Uploaded on
April 14, 2026
Number of pages
29
Written in
2025/2026
Type
Exam (elaborations)
Contains
Questions & answers
£10.56

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
GradeGalaxy
4.4
(9)
Sold
142
Followers
4
Items
49121
Last sold
5 hours ago



Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their exams and reviewed by others who've used these revision notes.

Didn't get what you expected? Choose another document

No problem! You can straightaway pick a different document that better suits what you're after.

Pay as you like, start learning straight away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and smashed it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions