Java and Data Structure (April – 2015) [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 (April – 2015) [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 Class. Explain the format of designing a Java Class.
(B) Define inheritance. Describe the different types of inheritance supported by java programming language.

Q.2 Attempt Any Three From The Following: (15 Marks)
(A) Write a short note on JVM. Explain the various features and advantages of JVM.
(B) Define Constructor. Explain different types of Constructor in Java.
(C) Write a Java program for finding the reverse of a number and a string using the concept of method Overloading.
(D) Write a java program to add two complex numbers.

Q.3 Attempt Any Three From The Following: (15 Marks)
(A) Define multithread programming. Explain the life cycle of a thread.
(B) What is meant by packages? Explain how a package can be created and imported in java program.
(C) ‘A class can implement multiple interfaces’ – comment and justify the answer with an appropriate example program.
(D) Explain the concept of exception mechanism using Try-Cash Statement.

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 ny four methods of each.
(C) Explain the classes and methods required for random access file handling in java language.
(D) 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.

Q.5 Attempt Any Three From The Following: (15 Marks)
(A) Define Sequential Search. Write an algorithm for sequential search method and explain its analysis.
(B) Write a short note on stack data structure and list various operation performed on stack. Explain the various applications of stack.
(C) Write the algorithm for push, search and empty operations on stack data structure by listing all the variables.
(D) Write a short note on recursion. Explain the iterative and recursive functions for the finding the factorial of a given number.

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) Explain the concept of hashing as an Efficient Searching Technique.
(C) List and explain various Collision Handling Techniques with the hashing methods.
(D) What is mean by tree traversal? Write an algorithm for Inorder Tree Traversal.

Q.7 Attempt Any Three From The Following: (15 Marks)
(A) Write an algorithm for Selection Sort. Explain the selection sort method by considering a set of 8 natural numbers.
(B) Define Graph. List and explain any four properties of a graph.
(C) Describe the concept of graph representation using Adjacency Matrix.

(D) Write a java program for implementing the Depth First Search (DFS) Graph Traversal Method.

==========================================================
Follow "Mumbai B.Sc.IT Study" @
• YouTube: Click Here
• Facebook: Click Here
• Instagram: Click Here
• Twitter: Click Here
• Slideshare: Click Here
• Tumblr: Click Here
• Flickr: Click Here
• Pinterest: Click Here

Follow "Kamal T." @
• Facebook: Click Here
• Instagram: Click Here
• Twitter: Click Here
• LinkedIn: Click Here
• VK: Click Here
• Behance: Click Here

• Snapchat: skmkamal

NOTE:
If You're a B.Sc.IT Student of Mumbai University...and you've a previous year question papers then please mail us @ kamalbscit@yahoo.in
==========================================================