The default custom dictionary is the dictionary to which Microsoft Word adds the word when you do this.
Answer:
<h3>Defination of Software :- </h3>
- software, instructions that tell a computer what to do. Software comprises the entire set of programs, procedures, and routines associated with the operation of a computer system. The term was coined to differentiate these instructions from hardware.
- The physical components of a computer system.
Explanation:
<h3>Hope this helps you dear ✌️</h3><h2>Carry on learning !! </h2>
Answer:
See explaination
Explanation:
StackExample.java
public class StackExample<T> {
private final static int DEFAULT_CAPACITY = 100;
private int top;
private T[] stack = (T[])(new Object[DEFAULT_CAPACITY]);
/**
* Returns a reference to the element at the top of this stack.
* The element is not removed from the stack.
* atreturn element on top of stack
* atthrows EmptyCollectionException if stack is empty
*/
public T peek() throws EmptyCollectionException
{
if (isEmpty())
throw new EmptyCollectionException("stack");
return stack[top-1];
}
/**
* Returns true if this stack is empty and false otherwise.
* atreturn true if this stack is empty
*/
public boolean isEmpty()
{
return top < 0;
}
}
//please replace "at" with the at symbol
Note:
peek() method will always pick the first element from stack. While calling peek() method when stack is empty then it will throw stack underflow error. Since peek() method will always look for first element ffrom stack there is no chance for overflow of stack. So overflow error checking is not required. In above program we handled underflow error in peek() method by checking whether stack is an empty or not.
Answer:
It balances a tree when a long path exist in the left subtree of the left of the root.
Explanation:
Rotation is an operation which is performed on the binary tree which changes the structure of the binary tree but it does not interfere with the order of elements.
A single right rotation strategy is basically for re balancing the tree.When there is along path which exists in the left subtree of the left of the root.
