Answer:
answer = 1
for i in range(1, 1111, 2):
answer *= i
print(answer)
Explanation:
The result is: 1867661487583158519937007997593731768674710592395936453814589179168970488627486922435352153202170177468180449036460330489883227953920786805094193880129176242750706494757506292242513096874889912138041641434433821228611320718319399459865627764413363015842622109227229695987391658459583021203370153652674793604946843921588657975214048903891877905278158326695472816452229608456097609116519045810867129060580585147954461081838126748579250596173066031868654116793938302170110362754673884690241925481893823673916009076351110558645412222773118927086453253674705050538434792606852567079575854841390964177213252754015145265445261542957834970632574543428225247242488955307645556148572185949820791464992259236192606284766174288372574869081003838416637821295590820946372288692264397746175279884156247638880688731656093911498376399334121390341627286952705811600644061948275361728751637451512725082376969150560038940786375629981515779279396085386198351152320090978588430101676704229895114350886499131456005886390334346220238579530541662198038029084029447261270224035584412162390327122500762501298502491940263477106501424307313102108306951120296510397274150253596249878157904612419169854362011297315737418348969961989528582716326033338095891309343771263480361729925724962879195879868448756011080612327885089033870698092857432512937836751109257833022671357201287794589267907954829015862301288301132960212133783812669550047024479011437136932727298699319362640380859375
Answer:
a) you must identify your operating system. Follow the instructions of your operating system.
b) Delete the browsing history in Internet Explorer, follow these steps:
Start Internet Explorer from the desktop.
Press Alt to display the menu bar.
On the Tools menu, click Internet Options.
Select all the checkboxes then click Remove.
Explanation:
Restart Internet Explorer and try it.
Explanation:
I think you first get interviewed?
Then you get like a test and then have to explain it to the admission people on a whiteboard or something.
Answer:
put full question or book or article
Explanation:
Answer:
See explaination
Explanation:
class OurLinkedList<E> { // The head is the first node of the LinkedList private Node<E> head; /** * No argument constructor, as mentioned in question to initialize the head pointer with null */ public OurLinkedList() { head=null; } public void addFront(E e) { if(head==null) { head=new Node<E>(e);//forgot <E> } else { Node<E> temp=head; Node<E> n=new Node<E>(e); //forgot <E> n.setNext(temp); head=n; } } /* * The add(E data) method add the node to the end of the linked List, It first checks if the Linked List is empty or not >> If the * Linked list is not empty then, * the temp pointer traverses to the end of the linked List and inserts a new Node with data that is * passes as argument at the end of the linked List * */ public void add(E data) { if(head == null) { return; } Node<E> temp = head; Node<E> nodeToAdd = new Node<>(data); /* Moving temp pointer to end of the linked list where next pointer is null */ while(temp.getNext() != null) { temp.setNext(temp.getNext()); } // adding nodeToadd to the end of the linked List temp.setNext(nodeToAdd); } /** * This method checks if the head of the Linked List is null it returns TRUE otherwise it return FALSE */ public boolean isEmpty() { if(head==null) { return true; } return false; } /** * the method remove, removes the first node of the list. If the list is empty is does nothing, if the List is not empty * then it removes the first element of the linked List. */ public void remove() { if (!isEmpty()) { Node<E> toRemoved = head; head = head.getNext(); toRemoved.setNext(null); } } /** * the size() method returns the size of the Linked List, * this method calculates the size of the linkedList by traversing through each node and incrementing the * length variable value */ public int size() { int length = 0; Node<E> current = head; while (current != null) { current = current.getNext(); length++; } return length; } public String toString() { if(isEmpty()) { return "head ==> null"; } Node<E> temp=head; String s="head ==> "; while(temp!=null) { s+=temp.getData()+" ==> "; temp=temp.getLink(); } s+=" null"; return s; } /* method to reverse the Linked List */ Node<E> reverse() { Node<E> prev = null; Node<E> current = head; Node<E> next = null; while (current != null) { next = current.getNext(); current.setNext(prev); prev = current; current = next; } head = prev; return head; } }
Node.java
/* this file contains the Implementation of Node class, * Node class contains if pointer of Node type which points to next Node * and a variable to hold the data */ public class Node<E> { private E data; private Node<E> next; public Node(E data) { this.data = data; next = null; } public void setNext(Node<E> next) { this.next=next; } public Node<E> getLink() { return next; } public E getData() { return data; } public void setData(E data) { this.data = data; } public Node<E> getNext() { return next; } }
Main.java <Contains the drive code for the program>
/* This class is the driver class of the program, this file contains the * code which checks the working of other components of the program * */ public class Main { public static void main(String[] args) { OurLinkedList<Integer> llist=new OurLinkedList<Integer>(); // checking if linked list id empty System.out.println("is empty: "+llist.isEmpty()); // after adding first element to list llist.addFront(10); System.out.println("is empty: "+llist.isEmpty()); // adding more elements to th elist llist.addFront(20); llist.addFront(30); llist.addFront(40); // printing the list using toString() method System.out.println("\n\nBefore Reversing the list:\n"+llist.toString()); // calling the reverse method llist.reverse(); System.out.println("\n\nAfter Reversing the list:\n"+llist.toString());
}
}
