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
Data Structures and Algorithms Midterm Questions with correct Answers $8.99   Add to cart
Quickly navigate to
Preview
  2.  
  3. Data Structures And Algorithms
  4.  
  5. Data Structures and Algorithms

Exam (elaborations)

Data Structures and Algorithms Midterm Questions with correct Answers
 4 views  0 purchase
  • Course
  • Data Structures and Algorithms
  • Institution
  • Data Structures And Algorithms

Data Structures and Algorithms Midterm Linear Search - Answer- slow --> N/2 comparisons O(N) Binary Search - Answer- Fast, but the array must be sorted log2(N) Drawbacks --> insertion takes longer O(logN) Unordered Arrays - Answer- fast insertion O(1) slow linear search and delet...

[Show more]

Preview 1 out of 4  pages

Document information

  • August 18, 2024
  • 4
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers

Subjects

Written for

  • Data Structures and Algorithms
  • Data Structures and Algorithms

Seller

avatar-seller
Freshy

Content preview

Data Structures and Algorithms
Midterm
Linear Search - Answer- slow --> N/2 comparisons
O(N)

Binary Search - Answer- Fast, but the array must be sorted log2(N)
Drawbacks --> insertion takes longer
O(logN)

Unordered Arrays - Answer- fast insertion O(1)
slow linear search and deletion O(N)

Ordered arrays - Answer- fast binary search O(logN)
slow insertion and deletion O(N)

Bubble Sort - Answer- Comparisons: O(N^2)
Swaps: O(N^2) (less than comparisons)
Big O: O(N^2)

Selection Sort - Answer- Comparisons: O(N^2)
Swaps: O(N)
Big O: O(N^2) --> faster than bubble sort

Insertion Sort - Answer- Comparisons: O(N^2)
--> max is N*(N-1)/2, average is N*(N-1)/4
Shifts (copies): O(N^2) --> shift is not as time consuming as a swap
--> Average: N*(N-1)/4
Big O: O(N^2) --> 1/2 the time than bubble sort

Data that is already sorted it runs in O(N) --> efficient way for arrays that are only
slightly oout of order

Enhanced Insertion sort - Answer- Comparisons: O(NlogN)
Shift: O(N^2)
Big O: O(N^2) --> faster than bubble sort

Stacks - Simple Applications - Answer- Reversing a word
Delimiter matching

Stacks and Queues - Answer- abstract data structures
Complexity O(1)

Priority Queue - Answer- dequeue is O(1) but enqueue is O(N) --> slow insertion, so
priority queue is often implemented using a heap to improve insertion time

Arrays - Answer- Advantages

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 or Stuvia-credit 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 Freshy. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

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

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

78140 documents were sold in the last 30 days

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

Start selling
$8.99
  • (0)
  Add to cart