100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Previously searched by you
Previously searched by you
logo
CSE 2050_ Exam 2 Questions with 100% Actual correct answers | verified | latest update | Graded A+ | Already Passed | Complete Solution £6.57   Add to cart
Quickly navigate to
Preview
  2.  
  3. CSE 2050
  4.  
  5. CSE 2050
  6.  
  7. CSE 2050

Exam (elaborations)

CSE 2050_ Exam 2 Questions with 100% Actual correct answers | verified | latest update | Graded A+ | Already Passed | Complete Solution

 5 views  0 purchase

CSE 2050_ Exam 2 Questions with 100% Actual correct answers | verified | latest update | Graded A+ | Already Passed | Complete Solution

Preview 1 out of 4  pages

Document information

  • June 24, 2024
  • 4
  • 2023/2024
  • Exam (elaborations)
  • Questions & answers

Subjects

  • cse 2050 exam 2 questions with 100 actual corre

Written for

All documents for this subject (68)

Seller

avatar-seller
Hkane

Reviews received

Content preview

CSE 2050: Exam 2
Sub-problems are solved from the bottom up. Each problem is trivially solved as the
combination of previously-solved subproblems. - ANS-Dynamic Programming

Something that is true every time we reach a certain point - ANS-invariant

Dictionary Comprehension: What results in a dictionary with 50 items? - ANS-X = {i//2: i
for i in range(100)}

What are the three steps of dynamic programming? - ANS-1. Identify base cases
2. Implement iteratively or recursively
3. Add memoization (keep set of visited vertices)

A function repeatedly calls itself until it reaches a base case. - ANS-Recursion

Before attempting to solve a new sub-problem, a collection is referenced to see if this
sub-problem has already been solved. - ANS-Memoization

Quicksort is an in-place algorithm, it doesn't require creation of new lists while sorting. -
ANS-True, but mergesort is not.

T/F When calculating fibonacci numbers, the recursive solution uses more memory but
is faster than the iterative solution. - ANS-False

What is true about recursive algorithms? - ANS-(1) They are helpful for exploring
branching paths. (2) Without memoization, they often solve the same subproblems
repeatedly

When implementing a binary search in python, what must be avoided to achieve a
logarithmic worst case running time? - ANS-slicing

Which quadratic sorting algorithm is least likely to sort the following list L fastest:
"""
import random
L = [randm.randint(0,2050) for i in range 10000] - ANS-bubble sort; selection sort would
be the fastest for random placement

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller Hkane. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for £6.57. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

72042 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy revision notes and other study material for 14 years now

Start selling
£6.57
  • (0)
  Add to cart