All Hard Articles
Consider the same data as given in previous question. After the update in the previous question, the link N1-N2 goes down. N2 will reflect this… Read More
Consider the same recursive C++ function that takes two arguments  C++ unsigned int foo(unsigned int n, unsigned int r) {     if (n > 0)         return… Read More
Hi, A brief documentation of my SAP Labs, India interview is as follows: Interview Round 1: Q1. What is I of ACID properties? Q2. What… Read More
Consider a database table T containing two columns X and Y each of type integer. After the creation of the table, one record (X=1, Y=1)… Read More
On a non-pipelined sequential processor, a program segment, which is a part of the interrupt service routine, is given to transfer 500 bytes from an… Read More
If the difference between expectation of the square of a random variable (E[X²]) and the square of the expectation of the random variable (E[X])² is… Read More
(A) Q3 is planar while K4 is not  (B) Neither K4 nor Q3 are planar  (C) Both K4 and Q3 are planar  (D) K4 is… Read More
final class Complex {        private final double re;     private final double im;        public Complex(double re, double im) {         this.re = re;         this.im =… Read More
Predict the output of following Java Program // filename Main.java class Grandparent {     public void Print() {         System.out.println("Grandparent's Print()");     } }     class Parent extends… Read More
Which of the following is true about interfaces in java. 1) An interface can contain following type of members. ....public, static, final fields (i.e., constants)… Read More
Choose the most appropriate alternative from the options given below to complete the following sentence: Despite several ––––––––– the mission succeeded in its attempt to resolve… Read More
Table A Id Name Age ---------------- 12 Arun 60 15 Shreya 24 99 Rohit 11 Table B Id Name Age ---------------- 15 Shreya 24 25… Read More
Suppose (A, B) and (C,D) are two relation schemas. Let r1 and r2 be the corresponding relation instances. B is a foreign key that refers… Read More
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4… Read More
The worst case running time to search for an element in a balanced in a binary search tree with n2^n elements is (A) (B) (C)… Read More
We are given an array of n points in the plane, and the problem is to find out the closest pair of points in the… Read More
Output of following program?  CPP #include <iostream>#include<string>using namespace std; class Base{public:    virtual string print() const    {        return \"This is Base class\";    }}; class Derived : public Base{public:    virtual string print() const    {        return \"This… Read More
Location: Guagaon Position: Software Developer I decided to write this post because when i was preparing, I didn’t find any help on google about the… Read More
Given n line segments (p1, q1), (p2, q2), … (pn, qn), find if the given line segments intersect with each other or not. Example: Input:… Read More
The problem is to find the shortest paths between every pair of vertices in a given weighted directed Graph and weights may be negative. We… Read More