Steps Towards Totality...

Today, I submitted my first project "A simple Shell". This is the first project I had done at CDAC. I was the project leader in this project and the other members were:
1. Rajendra Nautiyal (d0653069)
2. Nehil Parashar (d0653074)
3. Raj Kumar Rathore (d0653083)
Project group was decided on 06/11/2006 and luckily they made me PL(Question asked by Mr. Prasad Pandit). At the beginning all of us din know how to proceed so we started reading about the UNIX and proceeded in the wrong direction. The deadline was today i.e. 29/12/2006. So we were relax as there is enough time for us but definitly we were wrong.
We proceeded in the wrong direction and in the middle we were so busy with other subjects that there is no meeting and we were loosing our enthusiasm(which should be maintained by the PL among Group) and in the last 10 days before the submission of the project we all were there with some concept. Rajendra Nautiyal had done a good job in this project. He is the one who was maintaining the strength and enthusiasm among the group members. He had given a good contribution to this project eventhough he is still confused how the flow is going and how it is working. Nehil Parashar (we call his parser as the task given to him was parsing) stuff was to perform the parsing stuff. He had done very well but it was too late for me. The output which I was expecting was not there at all. Raj K. Rathore is the person who loose all hopes and was not able to perform well in the project. Now, it comes to me what I had done? In the middle I too loose the hope for the completion but due to Rajendra Nautiyal I was able to merge the project in one and do the other stuff in the project like combining all, Report, Documentation etc. In the beginning I was fast but as the group is not that much fast so lessen my speed and in the middle loose.
We named our shell as [PTStation] (Programming Test Station). My concept which I was using to crete something as the name says i.e. Something like PARIKSHAK but you know the overall story what happened. But what we have submitted is a good job done by all.
Simultaneously another project of CNET(Computer Networks) is running. Luckily, the group members have made in PL in this project as well. We are simulating the work of DLL(Data Link Layer) in the TCP/IP Stack. As from the first project we have learned lots of things so I can believe that we will not face such sort of problems. My group members in this proejct are:
1. Rajendra Nautiyal
2. Raj K. Rathore
The submission deadline for this project is 05thJan'07. Let's see how far we can go.


NCST is giving me what I need with all the facilities and support, But there is one thing which I am in lack of i.e. CONSTANT MOTIVATION.

OPAD QUIZ
(BASED ON MEMORY)


1. Java is a
a. compiled language
b. interpreted language
c. intermediary language
d. Both 1 & 2

2. Difference between Method Overloading & Method Overriding

3. When a class B extends class A then what are the properties of A are there in B and what is the scope of both of the classes.

4. When Class B extends Class A then how we can create the object of Class B successfully.
A a= new B();

5. What are the properties of abstract and interface. What are the similarities and what are the differences

6. For each try block what are the rules to be followed

7. Reusability of code can be implemented using
a. composition
b. encapsulation

8. Given the following code:
int arr[] = new int[5];
System.out.print(arr.length);
What will be the output?

9. Mark and Sweep in Java uses which Methodology
a. BFS
b. DFS
c.Minimum Spanning Tree

10. FileWriter class. How can the data be appended to a existing file
FileWriter fw = new FileWriter("Test",True);
FileWriter fw = new FileWriter("Test",False);
FileWriter fw = new FileWriter("Test");

11. Insertion Sort complexity on a given set of data
1 3 4 9 12
a. O(N log N)
b. O(log N)
c. O(N)

12. Complexity of finding a maximum element from
a. Unsorted Array
b. Max Heap


13. There are two linklist with M and N elements each where M > N
Both linklist meet at point X. What is the complexity to reach at element X.
O(N)
O(M*N)

14. Given a graph
8 2
0------------------0----------------------0
| | | \ 3
| | | \
7| | 5 | O
| | | /
| | | / 6
0------------------0----------------------0
10 4

Apply prims algo and generate the sequence in which the nodes will be visited. Minimum Spanning Tree

15. AVL tree nodes are given as under
50, 25, 12, 75, 62, 65, 87, 99, 90
Give how many left and right rotations are needed
Ans. 3 3

16.
0------------------------------------------0
/


Apply DFS on a directed graph and give the sequence in which they will be visited. vising order was alphabetical order

17. Given a sequence of
Inorder:
Preorder
Create the Post Order of that tree.

18. Inorder Successor of a tree is
a. right most
b. left most

19. Create MinHeap and then give inorder of that.

20. for(float r=5; r!=10; r=r+0.53)

Give the output whether infinite or not

21. Sequence of following in a java program is
a. package, import, class
b. import, package, class

22. Which technique is used to travel through a Maze
a. Backtracking
b. Minimum Spanning Tree

23. When JVM runs its Garbage Collector then which method is called
a. Finally
b. Finalize
c. Final

24.