Write a c program to check whether a number is prime or not. In this tutorial, we are going to write a c program to check whether an input number is prime or not.
Given an integer, Write an efficient c code to check whether a number is prime or not.
Write a program to print 1 to 100 numbers without using loop. Using loop, (for and while loop) we can easily solve this problem. Think for a moment how do you solve this problem without using a loop. We can solve this problem using recursion.
Write a C program to print Fibonacci Series using recursion. Given an input number, we have to write a code to print Fibonacci series up to that number using Recursion.
This question is very important in terms of technical interviews.
You can check my previous post for PHP script to print Fibonacci series. Before solving this problem, Let’s first understand what is Recursion?
What is Recursion?
In recursion, A function calls itself until the base condition is reached. Recursive code is much cleaner and shorter as compared to iterative code.
For better understanding you can check my previous post on recursion and what’s the difference between recursion and iteration.
For better understanding of recursion concept, you can solve Objective Question on Recursion.
Pre-increment Vs Post-increment operators. What’s the difference between pre-increment (++i) and post-increment (i++) operators. In this post, we’ll learn how pre-increment and post-increment operators work in programming.
In this post, You’ll find MCQ which will help you to understand this concept fully.
How to swap two numbers using call by reference in C , C++. In the interviews interviewer generally asked the difference between call by reference and call by value. In this post let’s understand what is call by reference and how to swap two numbers using call by reference method.