Exam (elaborations)

CS 1332 TOP Study Guide Questions and CORRECT Answers

6 views 0 purchase

Course
CS 1332

Institution
CS 1332

ArrayList Constructor() (code) ngArray = (T[]) new Object[INITIAL_CAPACITY]; = 0; ArrayList RemoveAtIndex() (code) BIG O - O(n) Steps: 1. Store element to return 2. edge case - removing from end 3. edge case - list empty 4. shift element to be removed to back of the list and null out {...

[Show more]

Preview 3 out of 29 pages

View example

Uploaded on May 23, 2024
Number of pages 29
Written in 2023/2024
Type Exam (elaborations)
Contains Questions & answers

cs 1332

Institution CS 1332
Course CS 1332

$9.99

Added

Add to cart Add to wishlist

100% satisfaction guarantee
Immediately available after payment
Both online and in PDF
No strings attached

CS 1332 TOP Study Guide Questions and CORRECT Answers ArrayList Constructor() (code) ✔✔✔this.backingArray = (T[]) new Object[INITIAL_CAPACITY]; this.size = 0; ArrayList RemoveAtIndex() (code) ✔✔✔ BIG O - O(n) Steps: 1. Store element to return 2. edge case - removing from end 3. edge case - list empty 4. shift element to be removed to back of the list and null out { T element = backingArray[index]; if (index == size - 1) { backingArray[index] = null; } else if (size == 0) { return null; } else { for(int i = index; i < size - 1; i ++) { backingArra y[i] = backingArray[i + 1]; } backingArray[size - 1] = null; } size -= 1; return element; } ArrayList isEmpty() (code) ✔✔✔ public boolean isEmpty() { return size == 0; } ArrayList removeFromFront() (code) ✔✔✔ BIG O - O(n) Steps: 1. store element to return 2. edge case - if empty 3. shift all elements --> front element is at the back { T element = backingArray[0]; if (size == 0) { return null; } for (i = 0; i < size - 1; i++) { backingArray[i] = backingArray[i + 1]; } back ingArray[size - 1] = null; size -= 1; return element; } ArrayList removeFromBack() (code) ✔✔✔ BIG O - O(1) Steps: 1. store element to return 2. check if empty 3. set the last element to null { T element = backingArray[size - 1]; if (size == 0) { return null; } backingArray[size - 1] = null; size -= 1; return element; } ArrayList get() (code) ✔✔✔ BIG O - O(1) { return backingArray[index]; } ArrayList addAtIndex() (code) ✔✔✔ BIG O - O(n) Steps: 1. does index = size, add to back 2. regrow an d shift

The benefits of buying summaries with Stuvia:

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

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

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 WIZGrades. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

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

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

75323 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

Popular Universities in the United States

Popular books

Find notes and summaries for these qualifications