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
COP 3530 Exam 1 Question and answers correctly solved 2024 £10.46   Add to cart
Quickly navigate to
Preview
  2.  
  3. COP
  4.  
  5. COP

Exam (elaborations)

COP 3530 Exam 1 Question and answers correctly solved 2024

 5 views  0 purchase
  • Module
  • COP
  • Institution
  • COP

COP 3530 Exam 1 Question and answers correctly solved 2024 COP 3530 Exam 1 Linear Search Algorithm Worst Time Complexity - correct answer O(n) Binary Search Algorithm Worst Time Complexity - correct answer O(logn) List Properties - correct answer 1. Consists of nodes with data & poi...

[Show more]

Preview 2 out of 6  pages

Document information

  • September 7, 2024
  • 6
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers

Subjects

  • cop 3530 exam 1
  • cop 3530 exam 1 question and answers correctly sol

Written for

  • COP
  • COP

Seller

avatar-seller
flyhigher329

Reviews received

Content preview

COP 3530 Exam 1
Linear Search Algorithm Worst Time Complexity - correct answer ✔O(n)


Binary Search Algorithm Worst Time Complexity - correct answer ✔O(logn)


List Properties - correct answer ✔1. Consists of nodes with data & pointer to
next/prev
2. Stores similar elements
3. Non-contiguous memory
4. No random access


List operations - correct answer ✔pushfront, pushback, popfront, popback,
find, addBefore, addAfter, erase, topFront, topBack, isEmpty


Stacks follow which priority model? - correct answer ✔LIFO (last in, first out)


Stack operations big O - correct answer ✔All common operations are O(1)


Stack use cases - correct answer ✔function call stack, evaluate expressions,
backtracking, balanced parenthesis, undo (ctrl z), back button


Queues follow which priority model? - correct answer ✔FIFO (first in, first
out)


Queue operations - correct answer ✔enqueue (adding new element to back),
dequeue (removing element at front), size, isEmpty

, Queue operations big O - correct answer ✔All O(1)


Queue rightward drift problem - correct answer ✔n-enqueue & n-dequeue
operations causes queue to behave as full when it is empty (fixed by circular
array implementation)


Queue use cases - correct answer ✔task scheduling by OS, packet
forwarding by routers


To increment the back element in a circular-array-based queue: - correct
answer ✔back = (back + 1) % capacity


3 Properties of trees - correct answer ✔1 root, each node has only 1 parent,
no cycles


Tree use cases - correct answer ✔family, decision, file systems, expression
trees, search trees


Tree ancestor - correct answer ✔All nodes that can be reached by only
moving upward along tree


Tree descendant - correct answer ✔All nodes that can be reached by only
moving downward along tree


Subtree - correct answer ✔A tree whose root is a child of that node


(Tree) level/depth - correct answer ✔Distance from root

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

Will I be stuck with a subscription?

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

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

73243 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
£10.46
  • (0)
  Add to cart