Two integers n and k are given. Our task is to print K-rounding of n. K-rounding is the minimum positive integer X, such that x… Read More

SAP Labs had visited our campus for offering 6 months internship. ROUND 1:(Online Round) – 75 min It consisted of 5 sections. Section 1: Aptitude… Read More

A tree is always a Bipartite Graph as we can always break into two disjoint sets with alternate levels. In other words we always color… Read More

The nth Taxicab number Taxicab(n), also called the n-th Hardy-Ramanujan number, is defined as the smallest number that can be expressed as a sum of… Read More

Prerequisite: Introduction to Internet Protocol version 6 IP version 6 is the new version of Internet Protocol, which is way better than IP version 4… Read More

Prerequisite: Predicates and Quantifiers Set 2, Propositional Equivalences Every Theorem in Mathematics, or any subject for that matter, is supported by underlying proofs. These proofs… Read More

It is the complementary of head command.The tail command, as the name implies, print the last N number of data of the given input. By… Read More

Prerequisite: HTTP Non-Persistent & Persistent Connection – Set 1 For question point of view you need to know that Non-persistent connection is known as HTTP… Read More

Instance variable: As we all know that when the value of variable is varied from object to object then that type of variable is known… Read More

In circuit switching network resources (bandwidth) are divided into pieces and bit delay is constant during a connection. The dedicated path/circuit established between sender and… Read More

Prerequisite : Predicates and Quantifiers Set 1, Propositional Equivalences Logical Equivalences involving Quantifiers Two logical statements involving predicates and quantifiers are considered equivalent if and… Read More

Find the output of the program public class GFG { public static void main(String[] args) { char x = 'X'; int i = 0; System.out.print(true… Read More

Given an array with n distinct elements. An array is said to be almost sorted (non-decreasing) if any of its elements can occur at a… Read More

Round-1 The first round comprised of 10 MCQ questions including C, JAVA output questions and technical portions. 2 Coding questions. One of the coding questions… Read More

Given a Linked List of length n and block length k rotate in a circular manner towards right/left each block by a number d. If… Read More