## Extract ‘k’ bits from a given position in a number.

How to extract ‘k’ bits from a given position ‘p’ in a number? Examples: Input : number = 171 k = 5 p = 2… Read More »

- OOPs | Object oriented design
- The Internet and the Web
- Microservices Introduction
- Unknown facts of Networking
- DBMS | Interfaces
- Introduction to Programming Languages
- Virtual Reality, Augmented Reality, and Mixed Reality
- Best way to answer If an Interviewer asks about Salary Expectation to you as a Fresher
- Vector processor classification
- Election algorithm and distributed processing
- DBMS | Challenges of database security
- Image Formats
- Introduction to Blockchain technology | Set 1
- Computer Ports
- Vector instruction types
- Introduction to Parallel Computing
- Computer Network | Wifi protected access (WPA)
- Web Information Retrieval | Vector Space Model
- Computer Network | Wifi protected setup (WPS)
- Find the only different element in an array
- Longest subarray with elements divisible by k
- sinh() function in C++ STL
- Common Video Format
- Introduction to Internet of Things (IoT) | Set 1
- How Does the Blockchain Work?
- Introduction to Scala
- Univariate, Bivariate and Multivariate data and its analysis
- Human - Computer interaction through the ages
- High Definition Multimedia Interface (HDMI)
- Introduction to Blockchain technology | Set 2

How to extract ‘k’ bits from a given position ‘p’ in a number? Examples: Input : number = 171 k = 5 p = 2… Read More »

Creative Programming In Processing | Set 1 (Random Walker) The Lorenz system is a system of ordinary differential equations first studied by Edward Norton Lorenz,… Read More »

The main idea of asymptotic analysis is to have a measure of efficiency of algorithms that doesn’t depend on machine specific constants, mainly because this… Read More »

Prerequisites : INT_MAX and INT_MIN in C/C++ and Applications. Arithmetic shift vs Logical shift Suppose you have a 32-bit system : The INT_MAX would be… Read More »

Around 100 applied for the first round of Microsoft Internship offer. Basic Criteria was to have a CGPA of greater than 7.00. Round 1: Three… Read More »

Round 1 : Online Test Duration: 2+ hours Format: 4 Sections each having 3-4 subsections each having some MCQs Level: Easy | (91/120~) selected Content… Read More »

Given an array of integers with limited range (0 to 1000000). We need to implement an Order statistic tree using fenwick tree. It should support… Read More »

In the recent days, we often find interviewers asking us that have you done any certification. If you are having any certification in your resume,… Read More »

A number N is given. We need to print its ‘K’th Least Significant Bit. Examples : Input : num = 10, k = 4 Output… Read More »

Following are not allowed to use 1) Comparison Operators 2) String functions Examples: Input : num1 = 1233, num2 – 1233 Output : Same Input… Read More »

You are given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to set all bits between i… Read More »

Given a positive number you need to check whether it’s complement and the number are anagrams or not. Examples: Input : a = 4294967295 Output… Read More »

Round I This round was 60 multiple choice questions(20-general aptitude, 20-technical, 20-again technical(based on either communication/electronics/computer science)).Technical was a bit easy and aptitude took… Read More »

In the article Exact Cover Problem and Algorithm X | Set 1 we discussed the Exact Cover problem and Algorithm X to solve the Exact… Read More »

About : numpy.greater_equal(x1, x2[, out]) : checks whether x1 >= x2 or not. Parameters : x1, x2 : [array_like]Input arrays. If x1.shape != x2.shape, they… Read More »