Implement the solution for the N-Queens problem using stacks (required), Let the user define N (input) <= some Nmax (this should not affect the algorithm or its implementation details). You do not need to implement your own stack. Your code should have sufficient comments so a reader can understand your logic. The output should either be the queens locations {rows, columns}, or  a graphical interface of the chess board with the queen locations (which can also be dynamic, during execution, showing the location changes). I will need the Your code files (.cpp, .h, etc.) A README.txt file showing how the users should execute/run your program A Makefile file that contains all the commands needed to compile your code on Tesla@cs. All the code will be tested on Tesla@cs with its g++. Your code should be able to be compiled by executing make

import java.util.HashMap; import java.util.Map; public class LinearSearchMap {     // Define a method that takes in a map and a target value as parameters     public static boolean linearSearch(Map<String, Integer> map, int target) {         // Iterate through each entry in the map         for () {             // Check if the value of the current entry is equal to the target             if () {                 // If the value is equal to the target, return true             }         }         // If no entry with the target value is found, return false     }     public static void main(String[] args) {         // Create a HashMap of strings and integers         Map<String, Integer> numbers = new HashMap<>();         // Populate the HashMap with key-value pairs         numbers.put("One", 1);         numbers.put("Two", 2);         numbers.put("Three", 3);         numbers.put("Four", 4);         numbers.put("Five", 5);         // Set the target value to search for…

I have already done number 1. I just need help with number 2.  Implement Stack<E> with an internal LineNodePlus<E>. You have been given the code for the StackADT<E> interface and all of the List files needed. You must come up with a new Stack.java that implements the StackADT interface and uses a LineNodesPlus internally to store the stack.  Construct test cases for the Stack (StackTest.java) to ensure it works correctly. StackADT.java public interface StackADT<E>{ // Stack class ADT     /**     * Clears the stack.     */    public void clear();     /**     * Pushes argument it onto the stack. Argument is stored in the top of the     * stack. Returns false if the stack is out of space.     *     * @param it value to be pushed onto the stack     * @return true if the value is stored     */    public boolean push(E it);     /**     * Pop and return the value at the top of the stack.     *     * @return value stored at the top of the stack     */    public E…

Create a class Stack. This stack will be implemented using the LinkedList class that has been provided. This stack will hold values of a generic type (<T>).   Your Stack should have the following public methods: public void push(int n) public T pop() public T peek() public T size() public boolean isEmpty()   public class LinkedList <T> { private Node head; private Node tail; private int size;   public LinkedList() { head = null; tail = null; size = 0; }   public void append(T data) { Node newNode = new Node(data); if (head == null) { head = newNode; } else { tail.next = newNode; } tail = newNode; size++; }   public void prepend(T data) { Node newNode = new Node(data); if (head == null) { head = newNode; tail = newNode; } else { newNode.next = head; head = newNode; } size++; }   public T getHead() { return head.data; }   public T getTail() { return tail.data; }   public int size() { return size; }   public void removeByValue(T data) { Node current = head; while…

Im trying to figure out a java homework assignment where I have to evaluate postfix expressions using stacks and Stringtokenizer as well as a isNumber method. when I try to run it it gives me an error. this is the code I have so far:   static double evaluatePostfixExpression(String expression){     // Write your code       Stack aStack = new Stack();       double value1, value2;     String token;     StringTokenizer tokenizer = new StringTokenizer(expression);     while (tokenizer.hasMoreTokens()) {       token = tokenizer.nextToken();       if(isNumber(expression)) {         value1 = (double)aStack.pop();         value2 = (double)aStack.pop();         if (token.equals("+")) {           aStack.push(value2+value1);         } else if (token.equals("-")) {           aStack.push(value2-value1);         } else if (token.equals("*")) {           aStack.push(value2*value1);         } else if (token.equals("/")) {           aStack.push(value2/value1);         }       }           }…

Can you write a program in python for the dining philosopher problems that do not have deadlock? You have to use semaphores and use the strategy that a philosopher only picks the fork if both (left and right) are available. def philosopher(id: int, fork: list): The main is if __name__ == "__main__": semaphoreList = list() #this list will hold one semaphore per fork Philosophers = 5 for i in range(Philosophers): semaphoreList.append(multiprocessing.Semaphore(1)) philosopherList = list() for i in range(Philosophers): #instantiate all processes representing philosophers philosopherList.append(multiprocessing.Process(target=philosopher, args=(i, semaphoreList))) for j in range(Philosophers): #start all child processes philosopherList[j].start() for k in range(Philosophers): #join all child processes philosopherList[k].join() sample output: DEBUG: philosopher2 has chopstick2 DEBUG: philosopher2 has chopstick3 DEBUG: philosopher2 eating DEBUG: philosopher1 has chopstick1 DEBUG: philosopher0…

Using Java to design and implement the class PascalTriangle that will generate a Pascal Triangle from a given number of rows. Represent each row in a triangle as a list and the entire triangle as a list of these lists. Please implement the class ArrayList for these lists. Please do not use the binomial coeffiient formula { C(n,k)= n! / (k!*(n-k)!) to create the triangle. The triangle has to be generate using in this way: each row of the triangle begins and ends with 1, value at (x,y) equals to sum of value at (x-1, y-1) & (x-1,y), whereas x is the row number and y is the columm.

Please help with this Java program, and include explanations and comments

Write a program for Stack (Array-based or linked list-based) in Python. Test the scenario below with the implementation and with the reasoning of the answer. Make comments with a short description of what is implemented. Include source codes and screen-captured outputs. Stack: A letter means doing a push operation and an asterisk means doing a pop operation in the below sequence. Give the sequence of letters that are returned by the pop operations when this sequence of operations is performed on an initially empty stack. A*BCE**F*GH***I*

Your crazy boss has assigned you to write a linear array-based implementation of the IQueue interface for use in all the company's software. You've tried explaining why that's a bad idea with logic and math, but to no avail. So - suppress your inner turmoil and complete the add() and remove() methods of the AQueue class and identify the runtime order of each of your methods. /** A minimal queue interface */ public interface IQueue { /** Add element to the end of the queue */ public void add(E element); /** Remove and return element from the front of the queue * @returns fırst element * @throws NoSuchElementException if queue is empty */ public E remove(); /** Not an ideal Queue */ public class AQueue implements IQueue{ private El) array: private int rear; public AQueue(){ array = (E[)(new Object[10]): rear = 0: private void expandCapacity) { if (rear == array.length) { array = Arrays.copyOf(array, array.length 2): @Override public void add(E element) { / TODO @Override public E…