33. try {
34. // some code here
35. } catch (NullPointerException e1) {
36. System.out.print(”a”);
37. } catch (RuntimeException e2) {
38. System.out.print(”b”);
39. } finally {
40. System.out.print(”c”);
41. }
What is the result if a NullPointerException occurs on line
34?
1 c
2 a
3 ab
4 ac
10. class Nav{
11. public enum Direction { NORTH, SOUTH, EAST, WEST }
12. }
13. public class Sprite{
14. // insert code here
15. }
Which code, inserted at line 14, allows the Sprite class to
compile?
a)Direction d = NORTH;
b)Nav.Direction d = NORTH;
c)Direction d = Direction.NORTH;
d)Nav.Direction d = Nav.Direction.NORTH;
I have 100 records in a table with two rows. I need to
display 10 records per page like Google Search. I need only
the Logic(Pagination) in Pure Java. No JSP and all..Thanks
in Advance...
I have one Shopping cart application, i that i have
selected some items, while clicking submit button by
mistake i have clicked twice or trice, that time items are
selected twice or trice. Actually i want only one copy of
items but its selected twice or trice. So how can we avoid
this problem?
What are the restrictions imposed by a Security Manager on
Applets?.
171
For ease of programming you can consider the maze as a 2D
array with colors represented by below integer and
characters (in capital letters).
• B - Black
• W -White
• G- Green
• R- Red
R B W B W W W W
W W
B W B B W W W W
W W
W B W B W W W B
W W
W W B B W W W B
W W
W B W W B B B B
W B
W B W W B W W W
B W
W W B B B W W B
W W
W B W W B W B W
W W
B W B W W W W B
B W
W W W B W W W W
W G
Shortest Route Problem:
• Solution that finds the shortest Route between Red
and Green
 White will have 1 Weight.
 Red and Green carry no weights.
 Shortest path is the path with less weight when you
add up the weights in the path.
86
What are the names of Component subclasses that support
painting?
167
what is meant by multicast?
146
Can we call virtual funciton in a constructor ?
119
Java run-time system generates What class of exceptions?
Write a java program to find the route that connects
between Red and Green Cells.
General Rules for traversal
1. You can traverse from one cell to another
vertically, horizontally or diagonally.
2. You cannot traverse through Black cells.
3. There should be only one Red and Green cell and at
least one of each should be present. Otherwise the array is
invalid.
4. You cannot revisit a cell that you have already
traversed.
5. The maze need not be in the same as given in the
above example
152
what is the messsage u r going to get from an
objectoriented programing?
To Refer this Site to Your Friends 
Site Map
