Author Archives: Thomas Mani P
OUTPUT 2015
The following function is a part of some class. Assume ‘x’ and ‘y’ are positiveintegers, greater than 0. Answer the given questions along with dry run / working. (i) What will be returned bysomeFun(24,2)? (ii) What will be returned bysomeFun(84,2)?(iii) … Continue reading
Posted in Output, Uncategorized
Leave a comment
OUTPUT 2016
The following function Check( ) is a part of some class. What will the function Check( ) return when the values of both ‘m’ and ‘n’ are equal to 5? Show the dry run / working OUTPUT : Check(5,5) 6 … Continue reading
Posted in Output
Leave a comment
Linked List 2019
A linked list is formed from the objects of the class Node. The class structure of the Node is given below: class Node { int num; Node next; } Write an Algorithm OR a Method to find and display the … Continue reading
Posted in Linked list
Leave a comment
Linked List 2018
A linked list is formed from the objects of the class Node. The class structure of the Node is given below: class Node { int n; Node link; } Write an Algorithm OR a Method to search for a number … Continue reading
Posted in Linked list
Leave a comment
Linked List 2017
A linked list is formed from the objects of the class Node. The class structure of the Node is given below: class Node { int num; Node next; } Write an Algorithm OR a Method to count the nodes that … Continue reading
Posted in Linked list
Leave a comment
Linked List 2016
A linked list is formed from the objects of the class Node. The class structure of the Node is given below: class Node { String name; Node next; } Write an Algorithm OR a Method to search for a given … Continue reading
Posted in Linked list
Leave a comment
Linked list 2015
A linked list is formed from the objects of the class: class Nodes{int num;Nodes next;}Write an Algorithm OR a Method to print the sum of nodes that contains only odd integers of an existing linked list.The method declaration is as … Continue reading
Posted in Linked list
Leave a comment
internal nodes – external nodes
Internal nodes: Nodes which have sub nodes or children. External nodes: Nodes which do not have any sub nodes. They are also known as leaves.
Posted in Basic
Leave a comment
exceptional handling – finally
The way to handle anomalous situations during run time. Finally, is a block of code which is executed with or without exceptions
Posted in Basic
Leave a comment