Skip to content
All Medium Articles
Copy elision (or Copy omission) is a compiler optimization technique that avoids unnecessary copying of objects. Now a days, almost every compiler uses it. Let… Read More
Write a program to find sum of positive integers without using any operator. Only use of printf() is allowed. No other library function can be… Read More
Like functions, we can also pass variable length arguments to macros. For this we will use the following preprocessor identifiers.To support variable length arguments in… Read More
In this post, we will try to cover many ambiguous questions like following. Guess the output of following programs. // PROGRAM 1 #include <stdio.h> int… Read More
Given a partially filled 9×9 2D array ‘grid[9][9]’, the goal is to assign digits (from 1 to 9) to the empty cells so that every… Read More
Following questions have been asked in GATE CS 2007 exam. 1) Information about a collection of students is given by the relation studinfo(studId, name, sex).… Read More
Partition problem is to determine whether a given set can be partitioned into two subsets such that the sum of elements in both subsets is… Read More
Following questions have been asked in GATE CS 2009 exam. 1) S –> aSa| bSb| a| b ;The language generated by the above grammar over… Read More
Following questions have been asked in GATE CS 2011 exam. 1) Let P be a regular language and Q be context-free language such that Q… Read More
Following questions have been asked in GATE CS 2006 exam. 1) Station A uses 32 byte packets to transmit messages to Station B using a… Read More
Following questions have been asked in GATE CS 2007 exam.  1) The address of a class B host is to be split into subnets with… Read More
Following questions have been asked in GATE CS 2008 exam. 1) What is the maximum size of data that the application layer can pass on… Read More
Following questions have been asked in GATE CS 2005 exam. 1) An organization has a class B network and wishes to form subnets for 64… Read More
Following Questions have been asked in GATE 2011 CS exam.  1) A layer-4 firewall ( a device that can look at all protocol headers up… Read More
Following questions have been asked in GATE 2008 CS exam. 1) Let R and S be two relations with the following schema R (P,Q,R1,R2,R3) S… Read More
Following questions have been asked in GATE CS 2005 exam.  1) Normally user programs are prevented from handling I/O directly by I/O instructions in them.… Read More
Following questions have been asked in GATE CS 2012 exam.  1) The protocol data unit(PDU) for the application layer in the Internet stack is (A) Segment (B)… Read More
Following questions have been asked in GATE 2009 CS exam.  1) Consider two transactions T1 and T2, and four schedules S1, S2, S3, S4 of… Read More
Following Questions have been asked in GATE 2011 exam.  1. Consider a relational table with a single record for each registered student with the following… Read More
Following Questions have been asked in GATE 2012 exam. 1) Consider the following transactions with data items P and Q initialized to zero: T1: read… Read More

Start Your Coding Journey Now!