MANAV RACHNA UNIVERSITY, FARIDABAD
Department of Computer Science and Technology
Course: B.Tech. CSE Semester: II
Session: Jan- June 2025 Subject: Data Structures CSH103B T&P
________________________________________________________________________
LAB 0
Aim: To implement and analyse basic concepts (functions) of C programming
CO1: To implement the operations of Linear data structures using static memory
allocation.
Bloom's Taxonomy Level: BT3
1. Write a program in C to call two functions func_iter(int n), func_rec(int n), to print the
factorial of a number using iteration and recursion respectively.
2. Write a program in C to call a fuctionfunc_greatest(int a, int b, int c) to find the greatest
number among three number given by user.
3. Write a program in C to call a function func_fibonacci(int n) to print Fibonacci series .
4. Write a program in C to call a function func_palindrome (int n) to check whether a
number is palindrome or not.