1.

Object is an instance of _________

2. OOPS principles are
a. Class

b)Inheritance

c) a is correct

d)a &b are correct

3. Class consists of
a. a) Objects and Methods

b) Instance variables and methods

b. Object and instance variables

d) a ,b ,c are correct

4. Constructor has the same name as

a. a) Class

b) Object

c) Method

d) All the above

5. Recursion is
a. a) Calling a function itself

b) Calling a class

b. c) Calling an object

d) a ,b ,c are correct

6. Keyword for inheritance is---------7. The three access specifiers are --------, ---------, -----------8. members declared to be private can be accessed
a. Inside the class

b. Outside the class

c. A && b

d. None

9. Class is declared using the keyword________

10. The class name followed by the parenthesis specifies a _______
11. Define class
12. Define object
13. Define argument\
14. Define parameters
15. A________ initializes an object immediately
16. In C++ dynamically allocated memory is released by______
17. In JAVA reallocation is carried by_______
18. Write the use of finalize method
19. Write the use of final method\
20. Package are containers of _________define package
21. Syntax for importing a package
22. Define single inheritance
23. Define multipath inheritance

25

Define hierarchical inheritance

26

An abnormal condition at run time is called____________

27

Exception handling used in JAVA are_____,_____,_______,_______,_____

28

A try can have multiple________

29

A single catch cannot have multiple______

30

We can use finally instead of_______

31

Write the syntax for throw

32

Define multithreading

33

Multitasking is divided in to_______,_______

34

Define process based multitasking

35

Define thread based multitasking

36

Threads state are________,_________,________

37

Synchronization is carried by________

38

JAVA program starts running from the ______

39

Define deadlock

40

Define monitor

41

What is ITC

42

Define synchronization

1. Write a program to illustrate class

2. Explain constructors with example
3. Explain parameterized constructors with example
4. Write a program to implement constructor overloading
5. Explain call by reference
6. Explain return by reference
7. Explain recursion with example
8. Write short notes on
i.

Static

ii.

Final

9. Explain single inheritance

10. Explain multilevel inheritance
11. Explain hierarchical inheritance
12. Explain method overriding
13. Explain the try and catch statement
14. Explain throw statement with syntax
15. Explain throws statement with syntax
16. Explain finally statement with syntax
17. Explain nested try statement with syntax
18. Explain thread
19. Explain the state of thread
20. What is inter thread communication
21. Explain deadlock
22. Explain the concept of synchronization
23. Write a program to implement synchronization

1) Explain interface with example

2) Explain package with example
3) Write an account of inheritance and their types
4) Give an brief account of exception handling in JAVA
5) Explain the various exception handlers in JAVA
6) Explain multithreading with example
7) Write notes on
i. Deadlock
ii. Synchronization
iii. Inter thread communication

8) Write a program to implement the state of thread

9) Write a program to implement multithreading

Unit-v

1. __________provides support for applets

2. Applets class is contained in_________ package
3. All applets are subclass of_______
4. AWT stands for____________
5. Methods in applet are______
6. When an applet is started AWT calls ________,______
7. To redraw an applet we use_______
8. To set the background color of the applets we use _______
9. To output an applet to the window we use_______
10. To execute an applet we use________
11. An to redraw an applet we use_______
12. An to redraw an applet we use_______
13. To redraw an applet we use_______
14. An applet can be viewed using_____

15. Examples of web browsers are______,_____

16. GUI stands for_______
17. AWT are contained in _______ package
18. The two most common windows derived are those derived from ____<____
19. At the top of the AWT hierarchy is __________
20. ________is the subclass of component
21. ________is the subclass of container
22. Frame constructors are_____,_____
23. Drawing function can be defined using __________class

Section-B
1. Write notes on Applet
2. explain the life time of an Applet
3. Write the Applets display method
4. Give an account of passing parameters to an applet
5. Tabulate the AWT class
6. Write short notes on frames
7. explain the AWT window fundamental
8. explain the SWING component
9. write a note on Tabbed pane
10. write a note on scroll pane

Section _C
37. Write briefly about the HTML applet tag

38. Write a program for creating a banner using applet

39. Write a program for mouse event handling
40. explain the graphic class for
i. drawing line
ii. drawing rectangle
iii. drawing ellipse
iv. drawing circle
41. write a program using JBUTTON class
42. write a program using radio BUTTON class
43. Write a note on TREE
44. Write notes on SWING

Data structures

1.

A _______ is a list of homogeneous data elements

a. Array

2.

b. List

c. Linked list

d. Tree

The number of elements is called the

a. Length of array

b. Upper bound

c. Lower bound

d. None

3.

A _________is a list of finite number of homogenous data elements

4.

Length of the array can be obtained by_________

5.

Traversing refers to _________elements at least once

6.

Insertion refers to _______elements in an array

7.

Deletion refers to _______elements in an array

8.

Insertion can be made at _______&&______of an array

9.

deletion can be made at _______&&______of an array

10. In linear array downward refers to _______

11.

In linear array upward refers to _______

12. Sorting refers to

a. a. Finding

b. Arranging

b. c. Locating

d. None

13. Searching refers to

a. a. Sorting

b. Arranging

b. c. Locating

d. None

14. The search is said to be successful if it is in the______

15. The search is said to be_______ if it is not in the list

16. Binary search is done when the list is in the
a. Sorted order

b. unsorted

c. a && b is correct

d. None

17. In a binary search mid is found is found by

a. Beg +End b. Beg-End
c. Beg+End/2d. Beg-End/2

18. A way of organizing data to store and express the relation ship is
known as
a. Algorithm

b. Flow chart

c. Data structure

d. Program

19. In what order pushdown stack are accessed

a. LIFO

b. FIFO

c. LILO

d. FILO

20. Stack is a__________ list

21. Queue is a ________list
22. Linear data structures are________,_________
23. In a Queue new element added is called a _______element
24. A stack is a __________list
25. In a Queue new element deleted is called a _______element
26. A Queue is a __________list
27. A _____is a data object whose instances are of the form(e1,e2,e3,e4)

28.

a. Stack

b. Queue

c. Linear list

d. Linked list

In a ________representation element is represented as node

a. Stack

b. Queue

c. Linear list

d. Linked list

29. In a linked list each node contain________,__________

30. Define data structures
31. Define array
32. A __________ is a set of instances or values
a. Data model Stack

b. Data objects

c. Data class

d. Data structures

33. the time at which a job completes is called a

a. Start time

b. Finish time

c. End time

d. Run time

34. DEQUEUE is called as ___________

35. In a dequeue elements can be added at________
36. In a dequeue elements can be removed________
37. Define Priority Queue
38. In a priority Queue each element is assigned a __________
39. Priority Queue has ___________elements
40. Elements in a priority queue are_______,_______,______
41. Priority Queue follows ________
42. Higher priority elements are processed before _______

Section-B
1. Explain the representation of linear array in memory
2. Explain the concept of traversing of linear array
3. Write notes on inserting elements into an array
4. Write notes on deleting elements into an array
5. Write an account of bubble sort

6. Explain linear search

7. Explain Quick sort
8. Write the algorithm for binary search
9. Write a program to implementing bubble sort
10. Write a program to implementing linear search
11. Explain stack using array
12. Explain the concept of queue
13. Write notes on priority Queue
14. Give an account of DEQUEUE

Section-C

1. Explain
i. Insertion into an array
ii. Deletion into an array
2. Give a brief account of
i. Quick sort
ii. Algorithm of quick sort
iii. Example of quick sort
3. Give a brief account of
i. Bubble sort
ii. Algorithm of Bubble sort
iii. Example of Bubble sort

4. Give a brief account of

i. Linear search
ii. Algorithm of Linear search
iii. Example of Linear search
5. Give a brief account of
i. Binary search
ii. Algorithm of Binary search
iii. Example of Binary search
6. Explain briefly the array concept and the operations on array
7. Give an account on insertion into an array
8. Give an account on deletion into an array
9. Explain briefly the Queue concept and the operations on queue
10. Give an account on insertion into an queue
11. Give an account on deletion into an queue

UNIT-II
Section-A
1. ` _______is a linear collection of data elements called nodes
2. Define linked list
3. Each node is divided into_______ parts
4. First part of the node is called _____
5. Last part of the node is called _____
6. Null pointer is denoted by______
7. To traverse we use ________variable
8. node can be inserted at the
a. beginning

b. end

b. c. a &&b is correct

d. a &&b is wrong

9. The list which contains unused space is called

a. Hash table

b. periodic table

c. Free pool

d. all the above

10. The technique of using unused space is called as ______

11. When there is no data in the list it is known as
a. Overflow

b. underflow

C. a &&b correct

d. all are wrong

12. When there is full of data in the list it is known as

a. Overflow

b. underflow

C. a &&b correct

d. all are wrong

13. Header linked list has_______

14. Linked list has last node containing null pointer
15. In __________the last node points back to the first node
16. Define ground header linked list
17. Define circular header linked list

18. define two way list

19. define two way header linked list
20. define pointer

Section B
1. Write short notes on linked list
2. Explain traversing a linked list
3. Explain searching a linked list
4. Explain searching a linked list when the list is in sorted order
5. Explain searching a linked list when the list is in unsorted order
6. Explain garbage collection
7. Explain overflow, underflow
8. Write notes on insertion at the beginning of the linked list
9. Write notes on insertion at the end of the linked list
10. Write notes on deletion a node following a given node

11. Write notes on two way list

12. Explain two way header linked list

Section C
1. Explain briefly the traversal in a linked list with algorithm
2. Give an account of
a. Searching a linked list in sorted order
b. Searching a linked list in unsorted order
3. Explain the various insertion techniques in a linked list
4. Explain the various deletion techniques in a linked list
5. Explain the operation on two way header linked list

UNIT-III
Section-A
1. _______is a nonlinear data structure
a. linked list

b. array

b. c. Tree

c. all

2. Tree is a ________data structure

3. Define binary tree
4. A binary tree has
a. 1 node
b. c.

0 node

b. 2 node
d. All

5. Define sub tree

6. Terminal nodes have
a. 1 node

b. 2 node

b. c. 0 node

d. All

7. The line drawn from a node to its successor is called

a. Vertex
b. c.

Path

8. Define edge
9. Define vertex
10. Define path

b. Edge
d. None

1) A way of organizing data to store and express the relation ship is

known as
a. Algorithm
c. Data structure

b. Flow chart
d. Program

2) In what order pushdown stack are accessed

a. LIFO

b. FIFO

c. LILO

d. FILO

3) Stack is a__________ list

4) Queue is a ________list
5) Linear data structures are________,_________
6) In a Queue new element added is called a _______element
7) A stack is a __________list
8) In a Queue new element deleted is called a _______element

9) A Queue is a __________list
10) A _____is a data object whose instances are of the form(e1,e2,e3,e4)
in finite number
a. Stack

b. Queue

c. Linear list

d. Linked list

11) IN a ________representation element is represented as node

a. Stack

b. Queue

c. Linear list

d. Linked list

12) In a linked list each node contain________,__________

13) Define data structures
14) Define array
15) A __________ is a set of instances or values
a. Data model Stack

b. Data objects

c. Data class

d. Data structures

16) the time at which a job completes is called a

a. Start time

b. Finish time

c. End time

d. Run time

17) recursive procedures are implemented using

a. Stack

b. Queue

c. Linear list

d. Linked list

18) in a linked list each link contains ________,_________

19) What is abstract data type
20) Define recursion
21) What is dynamic memory allocation
22) A linear list may be specifies as
a. Stack

b. Abstract data type

c. Queue

d. Linked list