Question

Exercises (5 marks) • Write a recursive method to compute the number of elements in a queue? • Write a recursive method to check whether a given string is palindrome? • Write a recursive method to add the first n terms of the series $1 + \frac{1}{2} - \frac{1}{3} + \frac{1}{4} - \frac{1}{5} + ...$ Exercises • What does mystryMethod () do? void mystryMethod(Node n, int vall, int val2) { if (n.data == vall) { Node node = new Node(val2); node.next = n.next; n.next = node; return; } mystryMethod(n.next, vall, val2); }

          Exercises (5 marks)
• Write a recursive method to compute the
number of elements in a queue?
• Write a recursive method to check whether a
given string is palindrome?
• Write a recursive method to add the first n
terms of the series
$1 + \frac{1}{2} - \frac{1}{3} + \frac{1}{4} - \frac{1}{5} + ...$
Exercises
• What does mystryMethod () do?
void mystryMethod(Node n, int vall, int val2) {
if (n.data == vall) {
Node node = new Node(val2);
node.next = n.next;
n.next = node;
return;
}
mystryMethod(n.next, vall, val2);
}

Exercises (5 marks)
• Write a recursive method to compute the
number of elements in a queue?
• Write a recursive method to check whether a
given string is palindrome?
• Write a recursive method to add the first n
terms of the series
1 + (1)/(2) - (1)/(3) + (1)/(4) - (1)/(5) + ...
Exercises
• What does mystryMethod () do?
void mystryMethod(Node n, int vall, int val2)
if (n.data == vall)
Node node = new Node(val2);
node.next = n.next;
n.next = node;
return;

mystryMethod(n.next, vall, val2);

Added by Kimberly R.

Question

Please give Ace some feedback