0
Add your answer:
Earn +20 pts
Explain The merits of using a deque to implement a stack in data structure?
Explain The merits of using a deque to implement a stack in data structure
Can you implement merge sort without using recursion?
Sure, recursion can always be substituted with using a stack.
How do you implement stack without array?
Stacks are often implemented using the same node structure as a linked list.
How can implement round robin sceduler in java using circular doubly linked list?
I'm sorry brother
Can you provide a solution to the diamond-square algorithm using Java and recursion?
Yes. It is possible to provide a solution to the diamond-square algorithm using Java and recursion.
Is it possible to implement stack and queues using linkes list?
Yes it is possible to implement stack and queue using linked list
Explain The merits of using a deque to implement a stack in data structure?
Explain The merits of using a deque to implement a stack in data structure
Can you implement merge sort without using recursion?
Sure, recursion can always be substituted with using a stack.
C program to implement tower of hanoi using array implementation of stack abstract datatype?
stack abstract datatype
What is the relationship between a stack and an array?
There is no inherent relationship between the two. It's possible to implement a stack using an array to store date, but that's about it.
How do you implement stack without array?
Stacks are often implemented using the same node structure as a linked list.
How can implement round robin sceduler in java using circular doubly linked list?
I'm sorry brother
What are advantages of stack?
some disadvantages created in stack using array then that problem solve to linked list use in stack.First advantage for size of stack not limited in linked list using.second essay to stack programme implement using only one pointer.
Can you provide a solution to the diamond-square algorithm using Java and recursion?
Yes. It is possible to provide a solution to the diamond-square algorithm using Java and recursion.
Why you will declare top as -1 for stacks to be empty in c program?
You would do this if you implement a stack using an array. Using a zero-based index to keep track of the top of the stack (the end of the array) means we must use the value -1 to indicate an empty stack. This is because an array of n elements will have indices 0 through n-1, where index n-1 represents the element at top of the stack. An empty stack has 0 elements, therefore the top of the stack is represented by index -1.
How do you solve josephus problem using circular linked list?
The Josephus problem is a problem to locate the place for the last survivour. It shows the power of the circular linked list over the singly linked lists.
How should you design a scientific calculator using C plus plus?
The easiest way to implement a calculator is an RPN calculator (enter the numbers first, perform the operation last). You need a last-in-first-out stack (there's a "stack" class in C++, but you can also implement your own using an array or a linked list), and a set of functions that pop the last elements from the stack and push the result (e.g. Add() pops the last 2 values and pushes their addition).You'll need the math.h library for scientific operations.
