1- A) Typically, the best philosophy for exception-handling is? B) Each of the f

Question

1-

A) Typically, the best philosophy for exception-handling is?

B) Each of the following is a method of the Iterator interface, EXCEPT

first()

next()

remove()

hasNext()

C)Does Java 8 has multiple-inheritance?

D)The type of exception that requires a try-catch block or throws statement in order to compile without errors is called

A throwable

A checked exception   

An unchecked exception

A runtime exception

E)Some popular examples of recursion include each of the following, EXCEPT

Fibonacci sequence    

Tower of Hanoi

Liberace sequence          

Factorial

F)"Node<T> next;" and "T data;" are data members often found in what type of class?

Value Member of a HashMap class          

Node class of a Linked List          

Data Member class of an Array          

Item Member of a List class (or implementer)

J)The main difference between a stack and a queue is that ...         

Stacks allow for forward traversal only, whereas queues allow for forward and reverse traversal.          

Queues allow for forward traversal only, whereas stacks allow for forward and reverse traversal.   

H)Bubble, insertion, and selection sort share all of the following features, EXCEPT:         

They have well-defined sorted and unsorted sections.          

They are typically implemented with an outer loop and an inner loop.           T

hey do in-place sorting.           T

hey do their work by finding the next greatest item and inserting it at the beginning      

Add/removal of items follows LIFO for stacks and FIFO for queues          

Add/removal of items follows FIFO for stacks and LIFO for queues

Plaseee do all A,B,C,D,E,F,J,and H

Explanation / Answer

1)

A)

Exception handling is the process of responding to the occurence, during computaion. In general, exception breaks the normal flow of program execution. These exceptions can be handled by try and catch blocks involved in the program.

B)

Iterator is used to iterate through the elements of the given list. It actually takes the place of Enumeration and used to access the all the elements of the list. And next() function used to access the next element in the list, remove() is used to remove the elements in the list and hasNext() is used to check whether there is any next element

But there is no first() function under iterator interface

C)

Java 8 supports multiple inheritance for the interface but not for the classes...

D)

The type of exception in the program includes try and catch block and run the program without any errors is known as unchecked execption this is because run time checked execptions are considered as unchecked exceptions... try and catch blocks are used to managed at runtime

E)

Recursion is defined as calling to a function from the function itself. Liberace sequence is not the most popular recursive example from the given set of programs. Fibonacci, Factorial and Towers of Hanoi uses the recursion widely in their corresponding implementations.

F)

  "Node<T> next;" and "T data;" these data members are often found in Node class of a Linked List. Here next is used to access the node next in the order and data is used to access the data of the current node. Hence elements can be accessed in the order

J)

The main difference between stack and queue is that

Stack uses the concept of LIFO for adding and removal of elements Whereas Queue uses the concept of FIFO for adding and removal of elements from the given list

H)

Bubble, insertion, and selection sort have the features common and from the given list do their work by finding the next greatest item and inserting it at the beginning is the only feature that is not shared by other sorting methods...

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.