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

Click Here: (PDF Download)

Click Here: (PDF View) | Click Here: (Image View) | Click Here: (Text View)

Time: 3 Hours

Total Marks: 100

N.B.:     (1) All Questions are Compulsory.

              (2) Figures to right indicate the marks.

Q.1 Attempt The Following Question: (10 Marks)
(A) Write a short note on JVM.
(B) Describe the concept of using packages in Java.

Q.2 Attempt Any Three From The Following: (15 Marks)
(A) Define Operator. List and explain different types of operators in Java.
(B) Write a short note on Parameterized Constructors.
(C) Write a Java Program to find the user entered number is prime or not.
(D) Write a Java program to find the factorial of a number using a recursive function.

Q.3 Attempt Any Three From The Following: (15 Marks)
(A) Define Super Keyword. List and explain different types of operators in Java.
(B) Describe the methods exception handling in Java.
(C) Write a java programs to find the user entered text is palindrome or not.
(D) Create an interface with a function prototype for adding two numbers and return the sum. Write a java program to implement the interface for adding the two numbers and display the sum.

Q.4 Attempt Any Three From The Following: (15 Marks)
(A) Write a short note on Files and Directories.
(B) Define Input-Stream and Output-Stream. List and explain any two methods of Input-Stream and Output-Stream.
(C) Write a java program to accept a text from the user and count the number of words in the text. (Use Stream Tokenizer).
(D) Write a java program to save the content in a file.

Q.5 Attempt Any Three From The Following: (15 Marks)
(A) Write a short note on Asymptotic Notations.
(B) Define Stack. Write down the Algorithm for stack implementation.
(C) Write a Java program to implement Binary Search Algorithm.
(D) Write a Java program to implement the concept of Circular Queue.

Q.6 Attempt Any Three From The Following: (15 Marks)
(A) List and explain different types of hashing functions.
(B) Write a short note on Tree Traversal Methods.
(C) Write a short note on AVL Tree.
(D) Explain the method of inserting and deleting a node from a doubly linked list.

Q.7 Attempt Any Three From The Following: (15 Marks)
(A) Explain the Prim’s Algorithm to find the Minimum Cost Spanning Tree.
(B) Describe the different methods of graph representation.
(C) Write a Java program to implement the Section Sort.
(D) Write a program to implement the Merge Sort.