## GATE | GATE CS 2011 | Question 31

Given i=√-1, what will be the evaluation of the integral ? (A) 0 (B) 2 (C) -i (D) i Answer: (D) Explanation: Quiz of this… Read More »

## GATE | GATE CS 2011 | Question 30

Which one of the following options is CORRECT given three positive integers x, y and z, and a predicate? P(x) = ¬(x=1)∧∀y(∃z(x=y*z)⇒(y=x)∨(y=1)) (A) P(x) being… Read More »

## GATE | GATE CS 2011 | Question 29

We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the… Read More »

## GATE | GATE CS 2011 | Question 28

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 »

## GATE | GATE CS 2011 | Question 27

Consider two binary operators ‘ ‘ and ‘‘ with the precedence of operator being lower than that of the operator. Operator is right associative while… Read More »

## GATE | GATE CS 2011 | Question 65

2) Consider the language L1,L2,L3 as given below. L1={ | p,q N} L2={ | p,q N and p=q} L3={ | p,q,r N and p=q=r} Which… Read More »

## Microsoft Interview | Set 21

Hi, a brief documentation of my Microsoft experience is as follows: Group Activity: On the evening before the interview we had a group activity round.… Read More »

## Cisco Interview | Set 5

Interview consists of one written and two technical rounds followed by HR round. Written Test : Total 50 questions Aptitude : 20 Technical : 30… Read More »

## GATE | GATE CS 2011 | Question 25

An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array A[0 :n-1] is given below. Let Li denote… Read More »

## GATE | GATE CS 2011 | Question 24

1) Let P be a regular language and Q be context-free language such that Q P. (For example, let P be the language represented by… Read More »

## GATE | GATE CS 2011 | Question 23

A max-heap is a heap where the value of each parent is greater than or equal to the values of its children. Which of the… Read More »

## GATE | GATE CS 2011 | Question 22

What does the following fragment of C-program print? filter_none edit close play_arrow link brightness_4 code char c[] = “GATE2011”; char *p =c; printf(“%s”, p +… Read More »

## GATE | GATE CS 2011 | Question 21

Consider a hypothetical processor with an instruction of type LW R1, 20(R2), which during execution reads a 32-bit word from memory and stores it in… Read More »

## GATE | GATE CS 2011 | Question 65

Let the page fault service time be 10ms in a computer with average memory access time being 20ns. If one page fault is generated for… Read More »

## GATE | GATE CS 2011 | Question 19

The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary… Read More »