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 4 out of 33 pages
Exam (elaborations)

CS 235 FINAL EXAM QUESTIONS WITH COMPLETE ANSWERS

Document preview thumbnail
Preview 4 out of 33 pages

CS 235 FINAL EXAM QUESTIONS WITH COMPLETE ANSWERS

Content preview

Pick the best statement


Give this one a try later!


A full binary tree need not be complete and a complete binary tree need
not be full.




A queue differs from a stack in __________.

,Give this one a try later!


only one operation




Which of the following stack configurations are correct in terms of precedence? Let
the far left be the bottom of the stack, and the right be the top.


Give this one a try later!


+%




A private data member is visible __________________


Give this one a try later!


in the class in which it is declared




Which of the following would not be a good application for a binary tree?


Give this one a try later!


A family tree.




What things are necessary in a recursive function?


Give this one a try later!

, A base case and a recursive call.




Which of the following is NOT a disadvantage of a singly linked list compared to a
doubly linked list?


Give this one a try later!


Nodes in a singly linked list contain more data that nodes in a doubly linked
list.




What is the difference between const and the preprocessor directive #define?


Give this one a try later!


As a general rule you should give the compiler preference to the
preprocessor.




What best describes Namespaces?


Give this one a try later!


A. The entire C++ standard library is contained in the namespace std.
B. Namespaces are used to organize code into logical groups and to
prevent name collisions.
C. All names introduced by declarations within a namespace-body become
members of the current namespace identifier.
D. All of the above are true. (CORRECT)

, What is true of C++ pointer variables?


Give this one a try later!


Array pointers enable us to conveniently process groups of data such as
vectors, lists, and strings.




When a queue is represented using a single-linked list, the links should


Give this one a try later!


point from the front toward the rear.




'The "order of complexity" of an algorithm expresses ____________.


Give this one a try later!


the limiting behavior of a function when the argument tends towards infinity




What is the fundamental flaw with the Waterfall software development model?


Give this one a try later!


It assumes that each stage can be completed correctly and fully before
advancing to the next stage.

Document information

Uploaded on
August 12, 2025
Number of pages
33
Written in
2025/2026
Type
Exam (elaborations)
Contains
Questions & answers
$10.50

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.
CLASSROOMTEST
3.4
(10)
Sold
47
Followers
2
Items
7474
Last sold
1 month ago



Why students choose Stuvia

Created by fellow students, verified by reviews

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

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right 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 aced 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