MNNIT CC 2021-22 Classes

C Class 7

.. Previous Page

Class recording: Here

PPTs:

static variables and online judges from here.
Recursion from here.

February 13th, 2022

[Scroll to the bottom of this page to discuss stuff].

Reading

Read the attached presentation to learn about number system base conversions and working of bitwise operators before coming in for the next class.

Tasks

Offline practice

Recursion

Write a program (WAP) to input a number n from the user and print the first n terms of the Fibonacci series using recursive function.
WAP to input a number n and find the sum of first n natural numbers using a recursive function.
WAP to input a number n and find the sum of first n even numbers using a recursive function.
WAP to input a number n and find the sum of the digits of the number n using a recursive function.
WAP to input a number n and a number p and find the value of n raised to the power p using a recursive function.
WAP to take appropriate values (a and d) as input and find the sum of an Arithmetic Progression (AP) using recursion.
Given a function defined as:
```
 f(1) = 3
 f(n) = 2 * f(n - 1) - 1
```
WAP to input an integer n and display the sum of first n terms of the above series using recursion.

static keyword

Give the output of the following code:

#include <stdio.h>

void print_count()
{
    static int count1 = 1;
    int count2 = 1;
    printf( "Count1 = %d, Count2 = %d\n", count1++, count2++);
}

int main()
{
    print_count();
    print_count();
    print_count();
    return 0;
}

Click to reveal answer...

Output:


Count1 = 1, Count2 = 1

Count1 = 2, Count2 = 1

Count1 = 3, Count2 = 1

Online Judge

Create CodeForces account if you haven’t done so already and solve the following problems:
Create HackerRank account if you haven’t done so already and solve the following problems:

Meme zone

This site is open source. Improve this page.