Interested to Buy Any Domain ? << Click Here >> for more details...
Which data structure is applied when dealing with a recursive function?
- 1 Answers
- 1109 Views
- I also Faced
- E-Mail Answers
Answer Posted / Pallavi Awasthi
A call stack is a data structure that stores function calls and their associated information during the execution of a program. When a recursive function is called, its information is pushed onto the call stack, allowing for proper function invocation order and memory management.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Write a program for Sorting an Array. Which sorting will you prefer?
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
What sort of serious problems have you experienced, and how have you handled them?
Can you declare an array without assigning the size of an array?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
