Steps Towards Totality...

Attempt any 6 questions. Each question carry 10 marks

1. a> All papers written by a student has at least one other author who is not a student.
Assume
paper(Y ) stands for Y is a paper,
author(X,Y ) stands for X is an author of Y and
std(X) stands for X is a student


b> x2 - y2 =1. Prove by Contradiction

2. The Boolean expression on variables A,B,C,D,E and simplified expression was given. Find out what are the don't
care conditions used to Simplify that expression

3. a> Give the result
5
i> E 2
i=0

ii> ......

iii> .......

iv> .......

..
b> 0.423 (Recurrence Relation)

4. a> Two relations R1 and R2 were given. Generate R1oR2 using the Boolean Matrix on zero and one
b> For what values of a and b the linear equations
x + 2y + 3z =6
..............
..............

will have
a> no solution
b> infinite number of solution
c> unique solution

5. a> Find inverse modulo 27 mod 11.
b> Explain RSA Algorithm with an example.

6. a> Poisson Distribution
An event occurs 2 times in one hour. What is the probability that event will not in occur between 8 am to 9 am.

b> How many 4 letter initial be created provided the last letter should me a consonant

7. Create a Turing Machine which accepts input {0,1} and the number of 0's and 1's should be equal to reach final state.
e.g. 0011, 1100, 0101, etc

8. a> Generate grammer for {ancbn | n>0 }
b> A sequence of productions were given and based on that

Q1. Which type of grammer this is?
Q2. Will this string "..........." be accepted
Q3. Which language best describes this
a> Turing Machine
b> Context Free
c> Context Sensitive
d> Regular Expression

9. a> Find mean, standard deviation and variance of Given Data
b> Probability that 3 persons will not have B'day on the same day?

1. The class Testing is saved in a file named as "Test.java". What will happen when we compile Test.java
public class Testing
{
public static void main(String[] args)
{
System.out.println("Testing Program");
}
}

a> Will give compilation Error
b> Prints Testing Program
c> Compiles Successfully
d> Runtime Error


2. It was based on Clone Method
class A implements Clonable
{
p s v m(String[] args)
{
System.out.println("Clone Method");
}
}

Clone not Supported Exception



3. Give the output of the code given below

class A
{
p s v m(String[] args)
{
System.out.print("Main1");
}
static public void main(String[] args)
{
System.out.print("Main2");
}
}

a> Main1
b> Main2
c> Main1 followed by Main2
d> Runtime Error

4. What is the value of variable count

class hello
{
public int count=0;
void check(int a)
{
if(a==0)
return;
else
{
a=a-1;
count++;
}
}

public static void main(String[] args)
{
hello h=new hello();
h.check(5);
System.out.println(count);
}
}


a>5 b> 6 c>4 d>0

5. Accessibility Sequence

public private protected default in the Ascending Sequence


6. How many rotations are needed to balance the AVL tree given

Give on which node and which rotation is needed i.e Left or Right

7. A sequence of integer is given construct an AVL tree and also give how many left rotations and how many right rotations
are needed during the construction of the tree.

8. What will be the output of the following code:
int a=5;
switch(a)
{
default: System.out.println("default");
case 5: System.out.print("Five");
case 10: System.out.print("Ten");
break;
}

a> Five Ten
b> default Five Ten
c> Ten
d> Five

9. There are two types of Heap namely Min Heap and Max Heap. You are given a sequence of integers and you have to identify
which one is not a heap.

10. A hash table uses the probing and two methods Chaining and one more
You have to tell in which method clusters are created

11. What will be the output of the following program
int a=11;
for(int i=0; i<3; i++)
// a=a+1;
a=a-1;
System.out.println(a);

a> 14
b> 8
c> 9
d> 10

12. A postorder sequence of given and you have to generate the preorder and tree is Binary

13. A preorder and inorder of the tree is given. Create the postorder of that tree.

14. A linklist is
a> link
b> a tree
c> a graph
d> both b and c

15. What will be the value in variable i:
double i=7/3;
a> 2.33333333
b> 2.0
c> 3
d> None of the above

16. What will be the output of the following code
class A
{
try
{
psvm(String[] args)
{

System.out.println("Try");
}
}
finally
{
int a=5/0;
System.out.println("Finally");
}
}

a> Try followed by error followed by Finally
b> Try followed by Arithmetic Exception
c> Try followed by Finally
d> None of the above

17. The hight of ACBT(Almost Complete Binary Tree) is given (5). The minimum no of nodes that tree can have

18. Find which one is not a Flow Augmented Path in the graph given

19. A Graph was given. Apply Prim's and Kruskal's Algorithms and give the output of each one of them

20. BufferedInputStream wraps with
a> FileInputStream
b> FileReader
c> ........
d> ........

21. What will be printed
Class A
{
int x;
psvm(String[] args)
{
A a1=new A();
a1.x=5;
A a2=new A();
a2=a1;
a2.x++;
System.out.println(a1.x);
}
}

a. 5
b. 6
c. 7
d. 4

22. Which one is correct to create a multidimensional array:
a> int a[][] = new int[5][5];
b> int a[3][3] = new int[5][5];
c> int a[3][3];
d> none

23. A doubly link list is as follows
A -----> B ---------> C
<----- <---------

Remove the B node without using the third variable

24. A DFS function was given .
What that function will return
a> PREORDER
b> INORDER
c> POSTORDER
d> None of the above


25. One question I din remember if you remember than please reply to me



++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Human tends to err.
Its getting true for me for most of the time. In starting of a new thing you think like, You will do this, You will do this and so on. But as per the ending We see how far we were from our goal which we needed to achieve. I realized that at the beginning of the joining I was having a lots of dreams and as the module is at the end I haven't achieved many of my goals but still I am not demoralised. I am still able to cope up with the situations and giving my best to achieve that Goal.
Two thoughts which I follows most of the time are:
Believe in the Best
And
Try and try until you succeed

Problem Week Number 3
This week three problems:

1. I am currently using the stumbleupon. I am unable to get how that entry gets added to that server and how it gives pages according to a huge amount of users choice and preference's as I click on the Stumble Button.

2. I am facing a problem for 1 week was that I had converted pdf file to ps format but I am unable to print that file in unix environment. I din know which command is there to print that ps file. Its fulll form is PostScript.

3. I am working in LAN if I have something to share then I am unable to send it to another system unless and until I upload it to my account. Currently working in Windows 2000. I think Active Directory is not set or LAN sharing file transfer is not available.
Rest problems, next week. . . . . . .

Everybody in his/her life likes someone and after the parents the only one who lives with his/her Whole Life. I saw a dream yesterday and that dream is the one of the most precious moment from my life which I need. What I saw in my Dream is something like . . .


That night was the most precious night for me. But I haven't seen her face.

I can't forget that first hug with that girl(dream girl). . . . . . . .

Today, I realized that I had wasted lots of time, I came to know about the mistakes I had done and what I have to do to improve my performance. I don't know but I had created an image which I think is not good. I can't understand how that sort of image is created. For now it is fine but I don't need that image in other minds. The last day before the final test takes you to the journey so far that realizes you what you had done since starting and if start thinking then you realize and come to know what mistakes you have done so far and note down if possible that what you have to do to improve. The last day preparation tells a lot about that subject and the time which has gone and will never come back just because "Time and tide waits for none".

The last day before that first exam(test) either it will be going to motivate you as you come to know that I was able to do better than what I had did. So, The suggestion from my side:
its never too late "Start Now"

the last class on DSAL(Data Structure and Algorithms). I learned many new things from that topic. But still it is a vast topic so I would like to learn more on that topic with implementation. The concepts which I had grasp from those Classes are very good and far new to me as I had never implemented those concepts in programming. Playing with References was a good game. Java is getting interesting as all the MGPT's will be implemented on Java only.
The last MGPA was a cube painted. I had implemented the logic and all the sample inputs were running successfully but I got stuck there as there were 8 inputs in which I had satisfied the 4 inputs. That's the power of thinking out of 100 students only 9 cleared. I would like to have a book or write a book on "how to think to solve a problem within time bound".
As I will get experience on more problem solving I think that I will be able to write the steps or how to build a program more faster. One thing which one should remember is the Inheritence property i.e. The problem which you have solved with an Approach that Approach is necessary and you should remember that approach as that concept may be applied to some other problem as well. So try to get a lot of approaches for a single problem or get different approaches from different people. That will be of great help. This 9th MGPA was not tough but the thinking was vast.



Still need a lot of practice to be perfect.

But, Nobody is perfect we try to be perfect.




I did my best, which was not satisfactory.