Top Five Websites to Learn Programming Online. There is no age for learning and when it comes to learn programming. The online resources are best since you get to know the latest stuff and tricks. Another important reason why you would like learning programming online is that you won’t need any teacher as such and you will in turn save money. So basically which websites are best to learn programming online? We assimilated the 5 best websites from which you can easily learn programming/coding and achieve your purpose.
Write a C program to multiply two numbers without using * multiplication operator.
Given two numbers, both numbers are positive. Write a program to multiply two numbers without using * multiplication operator. Think for a moment how to solve this problem .
You can use multiple approaches to find the solution of a problem.
Write a program to reverse a linked list using recursion. Given a singly linked list, we have to write a code to reverse a linked list using recursion. This question is mostly asked in interviews.
In my previous post, I have explained how to reverse a linked list using an iterative approach. In this post, We will learn how to reverse a linked list using recursion. The time complexity for both iterative and recursive approach is O(n).
How to find missing number in array of 1 to n. This question is generally asked in technical interviews. The problem statement is something like that. Given an array of numbers from 1 to 100. The array is sorted. One number is missing from an array. You have to find the missing number from an array. Also there is no duplicates in an array.
MCQ on Recursion
These MCQ helps you to understand the concept of Recursion.
1) Which Data Structure is used to perform Recursion?
Binary Search is a searching algorithm that finds the value in a sorted array in O(logN) time complexity. In my previous post i discuss how to implement binary search using iterative method. In this post i’ll explain how to implement binary search using recursion.
Binary Search Program, Algorithm & their Time Complexity. In this tutorial, You’ll learn about binary search algorithm, how it’s useful in searching and the time complexity of a binary search.
A Binary Search is used to search an element in a sorted array. Binary search is also known as half-interval search or logarithmic search. It works by comparing a value (value needs to search) to the middle element an array. If a value matches with the middle element then the position is returned otherwise the algorithm repeats if the value is less than or greater than the middle element.
A Binary search algorithm is efficient than the linear search algorithm. The time complexity of binary search is O(log(n)).
Write a program to print middle element of a linked list. It is also the most asked question in interviews. I assume you have a basic understanding of linked list and it’s concept.