Data Structures and Algorithms FINAL QUESTIONS AND ANSWERS
4 views 0 purchase
Course
Data Structures and Algorithms
Institution
Data Structures And Algorithms
Data Structures and Algorithms FINAL
Stack - Answer- Organizes its entries according to the order in which they were added. Last In - First Out
Binary Operator - Answer- When an operator has two operands ie: a + b
Unary Operator - Answer- When an operator has one operand ie: -5
Infix Ex...
Data Structures and Algorithms FINAL
Stack - Answer- Organizes its entries according to the order in which they were
added. Last In - First Out
Binary Operator - Answer- When an operator has two operands ie: a + b
Unary Operator - Answer- When an operator has one operand ie: -5
Infix Expression - Answer- When a binary operator is between expressions
Prefix Expression - Answer- When the operator is before the expression.
Postfix Expression - Answer- When the operator is after the expression
Program Counter - Answer- When a program executes, a special location called the
program counter references the current instruction.
Activation Record/Frame - Answer- When a method is called, the programs run-time
environment creates an objected called the activation record/frame
Java Stack/Program Stack - Answer- At the time the program is called, the activation
record is pushed onto a stack called the Java Stack or the Program Stack
Queue - Answer- Organizes entries according to the order in which they were added.
First in - First out.
Double ended queue - Answer- A queue that allows you to add, remove, or retrieve
entires at both sides (front and back) of the queue.
Priority Queue - Answer- A queue that organizes objects according to their priorities.
Tail Reference - Answer- An external reference to the last node in the chain. Makes
it so you don't have to traverse chain to find last node if you only have reference to
head of chain.
Circular Array - Answer- When the queue reaches the end of the array, we can
added entries to the queue at the beginning of the array where there are empty slots.
Circular Linked Chain - Answer- When the last node references the first node so no
node contains null in its next field.
Linear Linked Chain - Answer- The last node would contain null.
Doubly Linked Chain - Answer- When the nodes can reference the previous node as
well as the next node in a chain.
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 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.
