Java and Data Structure (October – 2016) [IDOL - Revised Course | Question Paper]

Java and Data Structure (October – 2016) [Revised Course | Question Paper]

Download: @GitHub | @G-Drive | @SlideShare | @Text

Time: 3 Hours

Total Marks: 100

NOTE:
(1) All Questions are Compulsory.

(2) Numbers to the right indicate marks.

Q.1 Attempt Both the Questions: (10 Marks)

(A) Explain JVM brief.

(B) Does Java support Multiple Inheritances? Justify your answer.

Q.2 Attempt Any Three Questions: (15 Marks) 

(A) Explain the features of Java.

(B) Give the meaning of public static void main(String a[]).

(C) What are Constructors? Explain different types of constructor with example.

(D) With the help of suitable JAVA programs describe following function Overloading.

Q.3 Attempt Any Three Questions: (15 Marks)

(A) What is Inheritance? Explain different types of Inheritance supported by Java with an example.

(B) Define a package, and give the list of steps used to create a package in Java. Explain with a sample code.

(C) Discuss on the Visibility of base class members in privately and publicly inherited classes.

(D) What is a Java Exception & its Types? Define try, catch, and throw in an Exception block.

Q.4 Attempt Any Three Question: (15 Marks)

(A) What is meant by stream? What are the types of streams and classes? Explain in detail.

(B) Explain how to create files and directories with the help of Java Files Class.

(C) What is the necessity of two types of streams – byte streams and character streams?

(D) List the methods in InputStream and Reader Class.

Q.5 Attempt Any Three Question: (15 Marks)

(A) Define Stack. Explain the various operations are performed on the stack and give some applications of stack.

(B) How do you find the complexity of an algorithm? What is the relation between the time and space complexities of an algorithm? Justify your answer with an example.

(C) What is Queue in Data Structure? State the algorithm for ENQUEUE (insert element in Queue) and DEQUEUE (delete element from Queue).

(D) Define Binary Search. Write an algorithm for Binary Search method and explain its analysis.

Q.6 Attempt Any Three Question: (15 Marks)

(A) What is Linked List? Explain the different types of Linked List.

(B) What are Expression Trees? Represent the following expression using a tree. Comment on the result that you get when this tree is traversed in Preorder, Inorder and postorder. (a-b) / ((c*d)+e).

(C) Define Hashing. How do collision happen during hashing? Explain the different techniques resolving of collision.

(D) What are the advantages and disadvantages of Linked List?

Q.7 Attempt Any Three Question: (15 Marks)

(A) Define Node, Degree, Siblings, Depth/Height, and Level.

(B) What is a Heap? Give three properties of Heaps?

(C) Explain an algorithm for the Bubbles Sort.

(D) Which are the two standard ways of traversing a graph? Explain them with an example of each.