Homework Answers
1
We create a link and add it to the head of the chain and then make it the head of chain, so the operation will be O(1)
Answer is d. O(1)
2
the entry returned by peek will be A
all the elements will be popped out before
Answer is a. A
3.
we prefer the first element to 1st index and 2nd element to 2nd index.
since peek return the element that is on the top.
peek() will return element from the last occupied index.
Answer is c. last occupied location of array
please ask in comment if you have any queries or doubts
Add Answer to:
Name: Each question is worth 1 point. 20 1. In a linked-chain implementation of a Stack...
1)Given a Stack implemented with a Linked List, and an O(1) implementation of push and pop,show...
1)Given a Stack implemented with a Linked List, and an O(1) implementation of push and pop,show the Linked List after the following commands are executed: Stack myStack = new Stack(); myStack.push(20); myStack.push(40); myStack.pop(); myStack.push(60); myStack.push(80); 2)If the same commands were used but the Stack was implemented with an Array with maximum size of 10, show what the array would look like after all these commands are executed. Assume O(1) implementation of push and pop here as well. 3)Given a Queue...
c program Here we see a Stack ADT implemented using array. We would like the stack...
c program Here we see a Stack ADT implemented using array. We would like the stack to be usable for different max sizes though, so we need to use dynamic memory allocation for our array as well. #include <stdio.h> #include <stdlib.h> typedef struct { int *data; // stack data, we assume integer for simplicity int top; // top of the stack int maxSize; // max size of the stack } Stack; void StackInit(Stack* stack, int size) { // this...
QUESTION: ADT stack: resizable array-based implementation for Ch4 programming problem 4 "maintain the stacks's top...
QUESTION: ADT stack: resizable array-based implementation for Ch4 programming problem 4 "maintain the stacks's top entry at the end of the array" at array index N-1 where the array is currently allocated to hold up to N entries. MAKE SURE YOU IMPLEMENT the functions: bool isEmpty() const; bool push(const ItemType& newEntry); bool pop(); in ArrayStackP4.cpp //FILE StackInterface.h #ifndef STACK_INTERFACE_ #define STACK_INTERFACE_ template<class ItemType> class StackInterface { public: /** Sees whether this stack is empty. @return True if the...
JAVA 3 LECTURE REVIEW PLEASE NEED ANSWERS ASAP. DUE IN AN HOUR!!! Question 12 points The...
JAVA 3 LECTURE REVIEW PLEASE NEED ANSWERS ASAP. DUE IN AN HOUR!!! Question 12 points The best-case performance for a shell sort is: --- O(1) O(n2) O(n) O(n log n) Signaler cette question Question 22 points The best-case performance for an array of n items using insertion sort is: --- O(n2) O(n) O(1) there is no best-case Signaler cette question Question 3 2 points A recursive method that processes a chain of linked nodes --- uses the first node in...
help me answer the following questions please 1. Stack (LIFO) & its application 1. Stack overflow...
help me answer the following questions please 1. Stack (LIFO) & its application 1. Stack overflow & underflow 2. Implementation: partially filled array & linked list 3. Applications: reverse string, backtracking Exercises: 1) Which of the following applications may use a stack? A. parentheses balancing program. B. Keeping track of local variables at run time. C. Syntax analyzer for a compiler. D. All of the above. 2) Consider the usual algorithm for determining whether a sequence of parentheses is balanced....
In c++ Section 1. Stack ADT – Overview Data Items The data items in a stack...
In c++ Section 1. Stack ADT – Overview Data Items The data items in a stack are of generic DataType. This means use should use templating and your Node class. Structure The stack data items are linearly ordered from the most recently added (the top) to the least recently added (the bottom). This is a LIFO scheme. Data items are inserted onto (pushed) and removed from (popped) the top of the stack. Operations Constructor. Creates an empty stack. Copy constructor....
please answer all questions thanks Question 21 Not yet In a linked-node implementation of a ADT,...
please answer all questions thanks
Question 21 Not yet In a linked-node implementation of a ADT, node does not reference the data in another node answered Points out of 2.00 Select one: True P Flag question False Question 23 Not yet An array implementation of an ADT potentially wastes more space than a linked implementation answered Points out of 2.00 Select one: True P Flag question False Question 25 Should Node be a public class? Briefly explain Not yet answered...
Please help me on all the questions !!!!!!!! Really need help! Will give a thumb up...
Please help me on all the questions !!!!!!!! Really need help! Will give a thumb up for helping. True/False (13) Chapter 14 - A List Implementation that Links Data Adding a node to an empty chain is the same as adding a node to the beginning of a chain. Adding a node at the end of a chain of n nodes is the same as adding a node at position n. You need a temporary variable to reference nodes as...
JAVA Lab Create a class called ArrayBasedStack. Declare the following variables: • data: references an array...
JAVA Lab Create a class called ArrayBasedStack. Declare the following variables: • data: references an array storing elements in the list • topOfStack: an int value representing the location of the stack top in the array • INITIAL_CAPACITY: the default capacity of the stack public class ArrayBasedStack <E> { private E[] data; private int topOfStack; private static final int INITIAL_CAPACITY = 5; } Add a constructor that will initialize the stack with a user-defined initial capacity. The top of the...
**TStack.py below** # CMPT 145: Linear ADTs # Defines the Stack ADT # # A stack (also called a pushdown or LIFO stack)...
**TStack.py below**
# CMPT 145: Linear ADTs
# Defines the Stack ADT
#
# A stack (also called a pushdown or LIFO stack) is a compound
# data structure in which the data values are ordered according
# to the LIFO (last-in first-out) protocol.
#
# Implementation:
# This implementation was designed to point out when ADT operations are
# used incorrectly.
def create():
"""
Purpose
creates an empty stack
Return
an empty stack
"""
return '__Stack__',list()
def is_empty(stack):
"""...
please answer all questions thanks
Question 21 Not yet In a linked-node implementation of a ADT, node does not reference the data in another node answered Points out of 2.00 Select one: True P Flag question False Question 23 Not yet An array implementation of an ADT potentially wastes more space than a linked implementation answered Points out of 2.00 Select one: True P Flag question False Question 25 Should Node be a public class? Briefly explain Not yet answered...
**TStack.py below**
# CMPT 145: Linear ADTs
# Defines the Stack ADT
#
# A stack (also called a pushdown or LIFO stack) is a compound
# data structure in which the data values are ordered according
# to the LIFO (last-in first-out) protocol.
#
# Implementation:
# This implementation was designed to point out when ADT operations are
# used incorrectly.
def create():
"""
Purpose
creates an empty stack
Return
an empty stack
"""
return '__Stack__',list()
def is_empty(stack):
"""...
Most questions answered within 3 hours.
-
a bottle cap manufacturer with four machines and six operators
wants to see if variation in...
asked 41 minutes ago -
State Farm Insurance studies show that in Colorado, 55% of the
auto insurance claims submitted for...
asked 1 hour ago -
Complete the following reactions which form ethers (A
and B) and cyclic ethers (C-E) as major...
asked 1 hour ago -
in a perfectly elastic collision what is the velocity of ball A
if the original direction...
asked 2 hours ago -
PLEASE ANSWER ALL
1) The pressure of the atmosphere decreases with increasing
altitude in the
Choose...
asked 2 hours ago -
A simple random sample of 25,000 individuals are surveyed in
order to determine the prevalence of...
asked 2 hours ago -
People who do very detailed work close up, such as jewelers,
often can see objects clearly...
asked 2 hours ago -
14 years ago, Blue Lake Corp. issued 30 year to maturity
zero-coupon bonds with a par...
asked 2 hours ago -
Warnerwoods Company uses a perpetual inventory system. It
entered into the following purchases and sales transactions...
asked 2 hours ago -
Equivalent Units of Conversion Costs
The Rolling Department of Oak Ridge Steel Company had 6,842 tons...
asked 2 hours ago -
what does the concept of "core competence" mean? why
is this concept important? How would you...
asked 2 hours ago -
__________ is a type of visualization that is linked to strategy
and used within a formal...
asked 2 hours ago