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

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

• 1.
  J a va a n d D a t a S t r u c t u r e Q u e s t i o n P a p e r ( S e p t e m b e r – 2 0 1 3 ) [ R e v i s e d C o u r s e ] 1 | Page M u m b a i B . S c . I T S t u d y F a c e b o o k | T w i t t e r | I n s t a g r a m | G o o g l e + | Y o u T u b e – Kamal T. 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. (5) (B) Describe the concept of using packages in Java. (5) Q.2 Attempt Any Three From The Following: (15 Marks) (A) Define Operator. List and explain different types of operators in Java. (5) (B) Write a short note on Parameterized Constructors. (5) (C) Write a Java Program to find the user entered number is prime or not. (5) (D) Write a Java program to find the factorial of a number using a recursive function. (5) Q.3 Attempt Any Three From The Following: (15 Marks) (A) Define Super Keyword. List and explain different types of operators in Java. (5) (B) Describe the methods exception handling in Java. (5) (C) Write a java programs to find the user entered text is palindrome or not. (5) (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. (5) Q.4 Attempt Any Three From The Following: (15 Marks) (A) Write a short note on Files and Directories. (5) (B) Define Input-Stream and Output-Stream. List and explain any two methods of Input- Stream and Output-Stream. (5) (C) Write a java program to accept a text from the user and count the number of words in the text. (Use Stream Tokenizer). (5) (D) Write a java program to save the content in a file. (5) Q.5 Attempt Any Three From The Following: (15 Marks) (A) Write a short note on Asymptotic Notations. (5) (B) Define Stack. Write down the Algorithm for stack implementation. (5) (C) Write a Java program to implement Binary Search Algorithm. (5) (D) Write a Java program to implement the concept of Circular Queue. (5)
• 2.
  J a va a n d D a t a S t r u c t u r e Q u e s t i o n P a p e r ( S e p t e m b e r – 2 0 1 3 ) [ R e v i s e d C o u r s e ] 2 | Page M u m b a i B . S c . I T S t u d y F a c e b o o k | T w i t t e r | I n s t a g r a m | G o o g l e + | Y o u T u b e – Kamal T. Q.6 Attempt Any Three From The Following: (15 Marks) (A) List and explain different types of hashing functions. (5) (B) Write a short note on Tree Traversal Methods. (5) (C) Write a short note on AVL Tree. (5) (D) Explain the method of inserting and deleting a node from a doubly linked list. (5) Q.7 Attempt Any Three From The Following: (15 Marks) (A) Explain the Prim’s Algorithm to find the Minimum Cost Spanning Tree. (5) (B) Describe the different methods of graph representation. (5) (C) Write a Java program to implement the Section Sort. (5) (D) Write a program to implement the Merge Sort. (5)