Featured Questions / GATE Overflow for GATE CSE

24 votes

2 answers

21

GATE CSE 1987 | Question: 9e
How many true inclusion relations are there of the form $A \subseteq B$, where $A$ and $B$ are subsets of a set $S$ with $n$ elements?

How many true inclusion relations are there of the form $A \subseteq B$, where $A$ and $B$ are subsets of a set $S$ with $n$ elements?

makhdoom ghaya

3.2k views

makhdoom ghaya asked Nov 14, 2016

17 votes

3 answers

22

GATE CSE 1987 | Question: 6a
A list of $n$ elements is commonly written as a sequence of $n$ elements enclosed in a pair of square brackets. For example. $[10, 20, 30]$ is a list of three elements and $[]$ is a nil list. Five functions are defined below: $car (l)$ returns the first element of its argument ... $f ([32, 16, 8], [9, 11, 12])$ $g ([5, 1, 8, 9])$

A list of $n$ elements is commonly written as a sequence of $n$ elements enclosed in a pair of square brackets. For example. $[10, 20, 30]$ is a list of three elements an...

makhdoom ghaya

2.8k views

makhdoom ghaya asked Nov 14, 2016

18 votes

1 answer

23

probabiltiy
5 integers randomly chosen from 1 to 2015. What is the probability that there is a pair of integers whose difference is a multiple of 4?

5 integers randomly chosen from 1 to 2015. What is the probability that there is a pair of integers whose difference is a multiple of 4?

Akriti sood

3.1k views

Akriti sood asked Nov 7, 2016

29 votes

1 answer

24

List out All Difficult Confusing GATE Questions
Listing out all those GATE questions that need some expert answers . ( / whoses actual given answers are bit confusing / best answer not choosen ). Which may require in depth subject understanding . It will help in last month preparation ... comment them below. @arjun Sir, need expert in detail answers for all these questions... Could you pls do ?

Listing out all those GATE questions that need some expert answers . ( / whoses actual given answers are bit confusing / best answer not choosen ). Which may require in d...

pC

8.8k views

pC asked Aug 27, 2016

1 votes

2 answers

25

UGC NET CSE | September 2013 | Part 3 | Question: 15
Which of the following is the minimum cost for an assignment problem given below? ... $13$ $16$ $17$ $18$

Which of the following is the minimum cost for an assignment problem given below?$$\text{Jobs} \begin{array}{|l|l|l|l|l|ll|} \hline & & \text{A} & \text{B} & \text{C} & \...

go_editor

3.0k views

go_editor asked Jul 22, 2016

89 votes

6 answers

26

GATE CSE 2006 | Question: 72
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The maximum degree of a vertex in $G$ is: $\binom{\frac{n}{2}}{2}.2^{\frac{n}{2}}$ $2^{n-2}$ $2^{n-3}\times 3$ $2^{n-1}$

The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets...

go_editor

17.7k views

go_editor asked Apr 24, 2016

29 votes

5 answers

27

IISc vs IITB
I've seen many questions, comparing IISc Banglore & IIT Bombay. But to be honest I did not find it complete. So I'm asking question here, for comparing IISc and IIT Bombay on following points => 1. Placement opportunities 2. Research opportunities ... Also does by choosing IITB over IISc, what one will miss/gain in long run ? Will there be any significant difference ?

I've seen many questions, comparing IISc Banglore & IIT Bombay. But to be honest I did not find it complete.So I'm asking question here, for comparing IISc and IIT Bomba...

Akash Kanase

31.3k views

Akash Kanase asked Mar 8, 2016

42 votes

2 answers

28

How To Prepare For Written and Interviews?Major Subjects To Focus and Type of Questions asked.
Which IIT's take admission through written Test and Interviews,Upto what Rank They call and Eg Major Subjects To Focus and Type of Questions asked.

Which IIT's take admission through written Test and Interviews,Upto what Rank They call and Eg Major Subjects To Focus and Type of Questions asked.

Anurag_s

12.9k views

Anurag_s asked Feb 15, 2016

44 votes

11 answers

29

GATE CSE 2016 Set 1 | Question: 35
What will be the output of the following $C$ program? void count (int n) { static int d=1; printf ("%d",n); printf ("%d",d); d++; if (n>1) count (n-1); printf ("%d",d); } void main(){ count (3); } $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4 \ 4 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2 \ 2 \ 2$ $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2$

What will be the output of the following $C$ program?void count (int n) { static int d=1; printf ("%d",n); printf ("%d",d); d++; if (n>1) count (n-1); printf ("%d",d); } ...

Sandeep Singh

15.5k views

Sandeep Singh asked Feb 12, 2016

69 votes

4 answers

30

GATE CSE 2016 Set 1 | Question: 36
What will be the output of the following pseudo-code when parameters are passed by reference and dynamic scoping is assumed? a = 3; void n(x) { x = x * a; print (x); } void m(y) { a = 1 ; a = y - a; n(a); print (a); } void main () { m(a); } $6,2$ $6,6$ $4,2$ $4,4$

What will be the output of the following pseudo-code when parameters are passed by reference and dynamic scoping is assumed? a = 3; void n(x) { x = x * a; ...

Sandeep Singh

24.0k views

Sandeep Singh asked Feb 12, 2016

99 votes

12 answers

31

GATE CSE 2016 Set 2 | Question: 30
Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two instances of $U_{G}$, it is required to implement ... $1 \leq i \leq 10$. Ignoring all other delays, the minimum time required to complete this computation is ____________ nanoseconds.

Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two...

Akash Kanase

22.8k views

Akash Kanase asked Feb 12, 2016

108 votes

7 answers

32

GATE CSE 2016 Set 2 | Question: 44
Consider the following languages. $L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$ ... not recursive $L_{1}, L_{2}$ are recursive and $L_{3}$ is not recursive $L_{1}, L_{2}, L_{3}$ are recursive

Consider the following languages.$L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$,$L_{2} = \left\{\left\langl...

Akash Kanase

33.6k views

Akash Kanase asked Feb 12, 2016

75 votes

8 answers

33

GATE CSE 2016 Set 2 | Question: 33
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac{3 \tau_2}{4}=2\tau_3$. If the longest pipeline stage is split into two pipeline stages of equal latency , the new frequency is __________ $\text{GHz}$, ignoring delays in the pipeline registers.

Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac...

Akash Kanase

19.2k views

Akash Kanase asked Feb 12, 2016

8 votes

2 answers

34

MadeEasy Test Series: Mathematical Logic - First Order Logic
Match the following Lists List-I A. There are atmost two apples. B. There are exactly two apples. C. There is atmost one apple. D. There is exactly one apple. List-II 1. ... D (a) 1 2 3 4 (b) 3 2 1 4 (c) 1 3 2 4 (d) 3 1 2 4 $a$ $b$ $c$ $d$

Match the following ListsList-IA. There are atmost two apples.B. There are exactly two apples.C. There is atmost one apple.D. There is exactly one apple.List-II1. $\foral...

vikas khuswaha

1.5k views

vikas khuswaha asked Jan 26, 2016

68 votes

4 answers

35

Minimum NAND/NOR Gates - Realization for ExOR,ExNor,Adder,Subtractor
Minimum No of Gates NAND/NOR Ex-OR Ex-Nor Half Adder Half Subtractor Full Adder Full Subtractor NAND ? ? ? ? ? ? NOR ? ? ? ? ? ?

Minimum No of Gates NAND/NOR Ex-OREx-NorHalf AdderHalf SubtractorFull AdderFull SubtractorNAND??????NOR??????

bahirNaik

82.3k views

bahirNaik asked Dec 17, 2015

31 votes

1 answer

36

TIFR CSE 2014 | Part B | Question: 5
Let $G = (V,E)$ be an undirected connected simple (i.e., no parallel edges or self-loops) graph with the weight function $w: E \rightarrow \mathbb{R}$ on its edge set. Let $w(e_{1}) < w(e_{2}) < · · · < w(e_{m})$ ... $w_{i} = w(e_{i})$ by its square $w^{2}_{i}$ , then $T$ must still be a minimum spanning tree of this new instance.

Let $G = (V,E)$ be an undirected connected simple (i.e., no parallel edges or self-loops) graph with the weight function $w: E \rightarrow \mathbb{R}$ on its edge set. Le...

makhdoom ghaya

3.2k views

makhdoom ghaya asked Nov 19, 2015

3 votes

1 answer

37

A player in the Powerball lottery picks five different integers between 1 and 59, inclusive, and a sixth integer between 1 and 39

A player in the Powerball lottery picks five different integers between 1 and 59, inclusive, and a sixth integer between 1 and 39, which may duplicate one of the earlier ...

Arjun

2.1k views

Arjun asked Jul 18, 2015

1 votes

2 answers

38

It is known that a bus will arrive at random at a certain location sometime between 3:00 P.M. and 3:30 P.M.

It is known that a bus will arrive at random at a certain location sometime between 3:00 P.M. and 3:30 P.M. A man decides that he will go at random to this location betwe...

Arjun

3.1k views

Arjun asked Jul 14, 2015

4 votes

2 answers

39

number of function
How many functions are there from the set {1, 2, . . . , n}, where n is a positive integer, to the set {0, 1} a) that assign 1 to exactly one of the positive integers less than n?

How many functions are there from the set {1, 2, . . . , n}, where n is a positive integer, to the set {0, 1}a) that assign 1 to exactly one of the positive integers les...

Anu

3.8k views

Anu asked Jul 13, 2015

9 votes

9 answers

40

Kenneth Rosen Edition 6 Question 45 (Page No. 346)
How many bit strings of length eight contain either three consecutive 0s or four consecutive 1s?

How many bit strings of length eight contain either three consecutive 0s or four consecutive 1s?

Anu

8.9k views

Anu asked Jul 13, 2015

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true