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

Click Here: (PDF Download)

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

B.Sc.IT: Semester – IV

[Java and Data Structure]

Question Paper (June – 2016) [Revised Course]

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) Define multithreaded programming. Explain the Life Cycle of a Thread.
(B) Define this keyboard. Explain two major uses of this keyboard.

Q.2 Attempt Any Three From The Following: (15 Marks)
(A) Write a short note on JVM. Explain the various features of JVM.
(B) Define Array. List and explain different types of Arrays.
(C) Describe the use of while loop statement with a java program to find the sum and average of n-numbers.
(D) Write a Java program to find the reverse of a number and a string using the concept of method overloading.

Q.3 Attempt Any Three From The Following: (15 Marks)
(A) Define Inheritance. Describe the different types of Inheritance supported by Java Programming Language.
(B) What are the two uses of super keyboard in java? Explain each one with an example program.
(C) ‘A class can implement multiple interfaces’ – comment and justify the answer with an appropriate example program.
(D) ‘Multiple catch can be associated with a single try-block’ – Comment and justify the answer.

Q.4 Attempt Any Three From The Following: (15 Marks)
(A) Define file class and list its constructors. List and explain any four methods of File Class.
(B) Define InputStream and OutputStream Classes in java language. List and explain any four methods of each.
(C) Write a java program to accept the name and rollno of a student from the user and store the information into a file using PrintWriter.
(D) Explain the classes and methods required for random access file handling in Java Language.

Q.5 Attempt Any Three From The Following: (15 Marks)
(A) Define Binary Search. Write an algorithm for binary search method and explain its Analysis.
(B) Write the algorithm for push, pop, search and empty operations on Stack Data Structure.
(C) Write a short note on Recursion. Write the iterative and recursive functions to find the factorial of a given number.
(D) Define Array Data Structure and describe its properties. Explain the method of duplicating an Array.

Q.6 Attempt Any Three From The Following: (15 Marks)
(A) Write a java program to implement the concept of single-linked list with the following operations: –
      (i) Create()
      (ii) insertBeg()
      (iii) empty()
      (iv) display()
(B) What is Hashing Function? List and explain the following hashing functions:
      (i) Mid Square
      (ii) Modulo N
(C) What is mean by Tree Traversal? Explain inorder tree traversal and write the algorithm for the inorder tree traversal.
(D) Create B Tree for the given data set 7, 54, 29, 41, 12, 5, 78, 35, 22, and 18.

Q.7 Attempt Any Three From The Following: (15 Marks)
(A) Write a java program to implement the Selection Sort.
(B) Create a max heap for the given data set 10, 15, 3, 21, 77, 35, 12, 89 and 6.
(C) Describe the concept of graph representation using adjacency matrix.
(D) Find the DFS and BFS for the given graph.