Posts

Showing posts from November 15, 2013

Quantum Internet Benefits

Image
  The quantum internet is a network of quantum computers that are connected together using quantum communication. It has the potential to revolutionize many industries, including: Secure communications: The quantum internet would be inherently secure, as it would be impossible to eavesdrop on quantum communications without being detected. This could be used for applications such as secure financial transactions, government communications, and military applications. Quantum computing: The quantum internet would allow quantum computers to be connected together, which would allow them to solve problems that are currently impossible for classical computers. This could be used for applications such as drug discovery, financial modeling, artificial intelligence, and materials science. Quantum sensors: The quantum internet could be used to connect quantum sensors together, which would allow them to create a global network of sensors that could be used to monitor the environment, detect earthq

Data Structure and Algorithms : Queue Program in Java

Image
Program: public class queuepgm { private int maxSize; private long[] queArray; private int front; private int rear; private int nItems; public queuepgm(int s) { maxSize = s; queArray = new long[maxSize]; front = 0; rear = -1; nItems = 0; } public void enqueue(long j) { if(rear == maxSize-1) rear = -1; queArray[++rear] = j; nItems++; } public long dequeue() { long temp = queArray[front++]; if(front == maxSize) front = 0; nItems--; return temp; } public long peekFront() {     return queArray[front]; } public boolean isEmpty()       { return (nItems==0); } public boolean isFull() { return (nItems==maxSize); } public int size() { return nItems; } public static void main(String[] args) { queuepgm theQueue = new queuepgm(5); // queue holds 5 items theQueue.enqueue(10); theQueue.enqueue(20); theQueue.enqueue(30); theQueue.enqueue(40); System.out.println("Dequeue Values: FIFO"); while( !theQueue.isEmpty() ) { long n = th

Data Structure and Algorithms : Stack Program in Java

Image
Program public class stackpgm { private int maxSize; private long[] stackArray; private int top; public stackpgm(int s) { maxSize = s; stackArray = new long[maxSize]; top = -1; } public void push(long j) {     if(!isFull())     {       stackArray[++top] = j;     } } public long pop() {           return stackArray[top--];             } public long peek() { return stackArray[top]; } public boolean isEmpty() { return (top == -1); } public boolean isFull() { return (top == maxSize-1); } public static void main(String[] args) { stackpgm theStack = new stackpgm(10); theStack.push(1); theStack.push(2); theStack.push(3); theStack.push(4); System.out.println("Pop up values"); while( !theStack.isEmpty() ) { long value = theStack.pop(); System.out.print(value+"\n"); } } } Output

Head and Tail Commands in Linux

Image
Head Command Description : prints output of first part of the file by default it will print first 10 lines Syntax : head filename examples: 1.  head upcasting.java it will print first 10 lines of the file upcasting.java by default. 2. head -n 50 upcasting.java  it will print first 50 lines of the file upcasting.java. 3. head upcasting.java downcasting.java it will print first 10 line of the 2 files upcasting.java and downcasting.java. 4. head *.java it will print all the java files first 10 lines. 5. head *.java *.class it will print all the java and class files first 10 lines. Tail Command: Description : prints output of last part of the file by default it will print last 10 lines Syntax : tail filename Examples: 1. tail upcasting.java it will print last 10 lines of the file upcasting.java by default. 2.  tail -n 50 upcasting.java  it will print last 50 lines of the file upcasting.java. 3.  tail upcasting.java downcasting.java it will pr