Tip 1 : Conceptual Concept for Networking, Operating System
Tip 2 : Questions on Binary Search
Tip 3 : Basics Data Structures
Tip 1 : Networking Projects on Python
Tip 2 : DSA Skills
Online Meeting for DSA and Networking problems



The given array is sorted in non-decreasing order.
Step 1 - Read the search element from the user.
Step 2 - Find the middle element in the sorted list.
Step 3 - Compare the search element with the middle element in the sorted list.
Step 4 - If both are matched, then display "Given element is found!!!" and terminate the function.
Step 5 - If both are not matched, then check whether the search element is smaller or larger than the middle element.
Step 6 - If the search element is smaller than middle element, repeat steps 2, 3, 4 and 5 for the left sublist of the middle element.
Step 7 - If the search element is larger than middle element, repeat steps 2, 3, 4 and 5 for the right sublist of the middle element.
Step 8 - Repeat the same process until we find the search element in the list or until sublist contains only one element.
Step 9 - If that element also doesn't match with the search element, then display "Element is not found in the list!!!" and terminate the function.
Questions about networking and System Designs
Difference between process and program.
Define Virtual Memory.
About Projects
Tip 1 : Basic Concept of OS, Networking
Tip 2 : College Projects

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?