Explain use of interface in Java with example program.

What is inheritance? What are advantages of it? Explain how multilevel inheritance is implemented in java with the help of an example.

 Explain use of InputSteam and OutputStream classes with the help of examples.

Write a java program to find simple interest and compound interest. Define proper class and methods in your program.

 What is String class? Explain use of any four methods of String class.

Explain use of abstract class in Java programming. What is abstract method? Explain with example.

What is a class? How a class is different from object? Explain need of private access specifiers in java with example program.

What is object-oriented programming? What are its advantages? Explain Java is platform independent.

Explain different operators available in java.

 Describe the guidelines for the bar code system in compliance with the BMWM Rules 2016, as amended

. Explain the process of authorisation under the BMWM Rules, 2016 as amended.

 Enumerate some major and minor accidents with respect to health care waste management.

. Describe the duties of a waste management officer.

 Describe the laws related to the management of health care waste in India

. Describe how a waste audit helps in planning a health care waste management system.

 Write a short note on the recent developments in the area of finding minimum cost spanning trees.

We can test whether a node 'm' is a proper ancestor of a node 'n' by testing whether' m' precedes 'n' in X-order but follows'n' in Y-order, where X and Y are chosen from (pre, post, in). Determine all those pairs X and Y for which this statement holds.

For each of the Singly Linked List, Circularly Singly Linked List, Doubly Linked List, Circularly Doubly Linked List, write one application that is exclusively suitable for that list. For example, X may be an application for whose implementation, only Circularly Singly Linked List is suitable and others are not suitable. Justify your answer.

 Write an algorithm and a program in ‘C’ language to insert and delete edges  in an adjacency list representation of an undirected graph. Make assumptions, if necessary.

Write an algorithm and program in ‘C’ language to merge two sorted  linked lists. The resultant linked list should be sorted.