Question Set

1. Is it true that too many recursive calls may result into stack overflow?



Ask Your Doubts Here

Type in
(Press Ctrl+g to toggle between English and the chosen language)

Comments

  • By: guest on 01 Jun 2017 06.01 pm
    Yes, too many recursive calls may result into stack overflow. because when a function is called its return address is stored in stack. After sometime the stack memory will be filled completely. Hence stack overflow error will occur.
Show Similar Question And Answers
QA->Who said "Three o'clock is always too late or too early for anything you want to do’ ?....
QA->What was the theme of United Nations Global Road Safety Week which was observed from May 6 to May 12?....
QA->15. Have too many irons in....
QA->How many orangutans disappear each year as result of palm oil farming?....
QA->The IMF and the World Bank (IBRD) came into existence as a result of ?....
MCQ->What will be the output of the program? public class BoolTest { public static void main(String [] args) { int result = 0; Boolean b1 = new Boolean("TRUE"); Boolean b2 = new Boolean("true"); Boolean b3 = new Boolean("tRuE"); Boolean b4 = new Boolean("false"); if (b1 == b2) / Line 10 / result = 1; if (b1.equals(b2) ) / Line 12 / result = result + 10; if (b2 == b4) / Line 14 / result = result + 100; if (b2.equals(b4) ) / Line 16 / result = result + 1000; if (b2.equals(b3) ) / Line 18 / result = result + 10000; System.out.println("result = " + result); } }....
MCQ->Is it true that too many recursive calls may result into stack overflow?....
MCQ->What will be the output of the program? public class WrapTest { public static void main(String [] args) { int result = 0; short s = 42; Long x = new Long("42"); Long y = new Long(42); Short z = new Short("42"); Short x2 = new Short(s); Integer y2 = new Integer("42"); Integer z2 = new Integer(42); if (x == y) / Line 13 / result = 1; if (x.equals(y) ) / Line 15 / result = result + 10; if (x.equals(z) ) / Line 17 / result = result + 100; if (x.equals(x2) ) / Line 19 / result = result + 1000; if (x.equals(z2) ) / Line 21 / result = result + 10000; System.out.println("result = " + result); } }....
MCQ->What will be the output of the program? public class ObjComp { public static void main(String [] args ) { int result = 0; ObjComp oc = new ObjComp(); Object o = oc; if (o == oc) result = 1; if (o != oc) result = result + 10; if (o.equals(oc) ) result = result + 100; if (oc.equals(o) ) result = result + 1000; System.out.println("result = " + result); } }....
MCQ->Which of the following statements are correct about the Stack collection? It can be used for evaluation of expressions. All elements in the Stack collection can be accessed using an enumerator. It is used to maintain a FIFO list. All elements stored in a Stack collection must be of similar type. Top-most element of the Stack collection can be accessed using the Peek() method.....
Terms And Service:We do not guarantee the accuracy of available data ..We Provide Information On Public Data.. Please consult an expert before using this data for commercial or personal use | Powered By:Omega Web Solutions
© 2002-2017 Omega Education PVT LTD...Privacy | Terms And Conditions
Question ANSWER With Solution