Skip to content
Pooja Bhatia Classes Hari Nagar
  • We teach following classes
    • Class 12
    • Class 11
    • Class 10
    • Class 9
  • Sumita Arora IP/CS Solutions
  • Jobs/Internship
Pooja Bhatia Classes Hari Nagar

Class 12 CS Chapter 6 Back Exercise Part C Solutions Sumita Arora New Syllabus

/ listing12CSSA, Uncategorized / By Neha
1. Write a function that takes a number and tests if it is a prime number using recursion technique.
...
click here for answer
2. Implement a function product( ) to multiply 2 numbers recursively using + and – operators only.
...
click here for answer
3. The hailstone sequence starting at a positive integer n is generated by following two simple rules. If n is even, the next number in the sequence is n / 2. If n is odd, the next number in the sequence is 3*n + 1. Repeating this process, the hailstone sequence gets generated. Write a recursive function hailstone(n) which prints the hailstone sequence beginning at n. Stop when the sequence reaches the number 1 (since otherwise, we would loop forever 1, 4, 2, 1, 4, 2, …)
def hail(n): ...
click here for answer
4. A happy number is a number in which the eventual sum of the square of the digits of the number is equal to 1.
...
click here for answer
5. A list namely Adm stores admission numbers of 100 students in it, sorted in ascending order of admission numbers. Write a program that takes an admission number and looks for it in list Adm using binary search technique. The binary search function should use recursion in it.
def adm_search(arr, ...
click here for answer
Post navigation
← Previous Post
Next Post →
  • We teach following classes
    • Class 12
    • Class 11
    • Class 10
    • Class 9
  • Sumita Arora IP/CS Solutions
  • Jobs/Internship
  • We teach following classes
  • Sumita Arora IP/CS Solutions
  • Jobs/Internship

Copyright © 2025 Pooja Bhatia Classes Hari Nagar | Powered by Pooja Bhatia Classes Hari Nagar.