l

--------------------------
Post Title 'IA-2 Question Bank, Solved'
Post by user 'Adusumilli-Uday-Kumar'
Post encryped with secure 256-bit MD5 Encryption
Post accesable only VIA link
Post will Expire on '21-SEP-2017'
--------------------------



Q1.

\\



Q2.

\\



Q3.

\\



Q4.

\\



Q5.

\\



Q6.

\\



Q7.

\\



Q8.

\\



Q9.

\\



Q10.

\\



Q11.

\\



Q12.

\\



Q13.

\\



Q14.

The following program incorrectly implements a simple form of the producer/ consumer problem. It consists of four classes: Q, the queue that you’re trying to synchronize; Producer, the threaded object that is producing queue entries; Consumer, the threaded object that is consuming queue entries; and PC, the tiny class that creates the single Q, Producer, and Consumer.

// An incorrect implementation of a producer and consumer.
class Q {
int n;
synchronized int get() {
System.out.println("Got: "   n);
return n;
}
synchronized void put(int n) {
this.n = n;
System.out.println("Put: "   n);
}
}
class Producer implements Runnable {
Q q;
Producer(Q q) {
this.q = q;
new Thread(this, "Producer").start();
}
public void run() {
int i = 0;
while(true) {
q.put(i  );
}
}
}
class Consumer implements Runnable {
Q q;
Consumer(Q q) {
this.q = q;
new Thread(this, "Consumer").start();
}
public void run() {
while(true) {
q.get();
}
}
}
class PC {
public static void main(String args[]) {
Q q = new Q();
new Producer(q);
new Consumer(q);
System.out.println("Press Control-C to stop.");
}
}

Although the put( ) and get( ) methods on Q are synchronized, nothing stops the producer from overrunning the consumer, nor will anything stop the consumer from consuming the same queue value twice. Thus, you get the erroneous output shown here (the exact output will vary with processor speed and task load):

Put: 1
Got: 1
Got: 1
Got: 1
Got: 1
Got: 1
Put: 2
Put: 3
Put: 4
Put: 5
Put: 6
Put: 7
Got: 7

After the producer put 1, the consumer started and got the same 1 five times in a row. Then, the producer resumed and produced 2 through 7 without letting the consumer have a chance to consume them. The proper way to write this program in Java is to use wait( ) and notify( ) to signal in
both directions, as shown here:

// A correct implementation of a producer and consumer.
class Q {
int n;
boolean valueSet = false;
synchronized int get() {
while(!valueSet)
try {
wait();
} catch(InterruptedException e) {
System.out.println("InterruptedException caught");
}
System.out.println("Got: "   n);
valueSet = false;
notify();
return n;
}
synchronized void put(int n) {
while(valueSet)
try {
wait();
} catch(InterruptedException e) {
System.out.println("InterruptedException caught");
}
this.n = n;
valueSet = true;
System.out.println("Put: "   n);
notify();
}
}
class Producer implements Runnable {
Q q;
oducer(Q q) {
this.q = q;
new Thread(this, "Producer").start();
}
public void run() {
int i = 0;
while(true) {
q.put(i  );
}
}
}
class Consumer implements Runnable {
Q q;
Consumer(Q q) {
this.q = q;
new Thread(this, "Consumer").start();
}
public void run() {
while(true) {
q.get();
}
}
}
class PCFixed {
public static void main(String args[]) {
Q q = new Q();
new Producer(q);
new Consumer(q);
System.out.println("Press Control-C to stop.");
}
}

Inside get( ), wait( ) is called. This causes its execution to suspend until the Producer notifies you that some data is ready. When this happens, execution inside get( ) resumes. After the data has been obtained, get( ) calls notify( ). This tells Producer that it is okay to put more data in the queue. Inside put( ), wait( ) suspends execution until the Consumer has removed the item from the queue. When execution resumes, the next item of data is put in the queue, and notify( ) is called. This tells the Consumer that it should now remove it. Here is some output from this program, which shows the clean synchronous behavior:
Put: 1
Got: 1
Put: 2
Got: 2
Put: 3
Got: 3
Put: 4
Got: 4
Put: 5
Got: 5




Q15.

class Complex
{
int Real,Imag;
Complex()
{}
Complex(int Real1,int Imag1)
{
Real=Real1;
Imag=Imag1;
}
Complex Add(Complex C1,Complex C2)
{
Complex CSum=new Complex();
CSum.Real=C1.Real C2.Real;
CSum.Imag=C1.Imag C2.Imag;
return CSum;
}

void Display()
{
System.out.println(Real  "   i"   Imag);
}
}

class additionOfComplexNumbers
{
public static void main(String[] a)
{
Complex C1=new Complex(4,8);
Complex C2=new Complex(5,7);
Complex C3=new Complex();
C3=C3.Add(C1,C2);
System.out.print("SUM : ");
C3.Display();
}
}



Q16.

public class StackDemo {
 private static final int capacity = 3;
 int arr[] = new int[capacity];
 int top = -1;

 public void push(int pushedElement) {
  if (top < capacity - 1) {
   top  ;
   arr[top] = pushedElement;
   System.out.println("Element "   pushedElement
       " is pushed to Stack !");
   printElements();
  } else {
   System.out.println("Stack Overflow !");
  }
 }

 public void pop() {
  if (top >= 0) {
   top--;
   System.out.println("Pop operation done !");
  } else {
   System.out.println("Stack Underflow !");
  }
 }

 public void printElements() {
  if (top >= 0) {
   System.out.println("Elements in stack :");
   for (int i = 0; i <= top; i  ) {
    System.out.println(arr[i]);
   }
  }
 }

 public static void main(String[] args) {
  StackDemo stackDemo = new StackDemo();

  stackDemo.pop();
  stackDemo.push(23);
  stackDemo.push(2);
  stackDemo.push(73);
  stackDemo.push(21);
  stackDemo.pop();
  stackDemo.pop();
  stackDemo.pop();
  stackDemo.pop();
 }

}