Previous GATE Questions

+1 vote

1 answer

1

Modified form of GATE1996_2.15
Quick-sort is run on two inputs shown below to sort in ascending order taking first element as pivot i) 1,2,3,…n ii) n,n−1,n−2,…,2,1 Let S1 and S2 be the number of swaps made for the inputs (i) and (ii) respectively. Then, i) How is S1 and S2 related ? ii) How will the answer change if the pivot is changed to middle element ?

asked 4 days ago in Algorithms by rishi71662data4 Active (1.3k points) | 23 views

0 votes

0 answers

2

GATE1996-2.18
A 1000 Kbyte memory is managed using variable partitions but no compaction. It currently has two partitions of sizes 200 Kbytes and 260 Kbytes respectively. The smallest allocation request in Kbytes that could be denied is for 151 181 231 541 Won ... given 181Kb.But 181 Kb can fit into both 200 Kbytesand 260 Kbytes partitions. Help me ..I'm confused Thanks [closed]

asked Oct 14 in Operating System by #Rahul (157 points) | 29 views

+1 vote

1 answer

3

GATE2001-2.15 GATE1994-1.6
How many undirected graphs are possible with n vertices if graphs are not necessarily connected if they are necessarily connected

asked Oct 12 in Graph Theory by rishi71662data4 Active (1.3k points) | 51 views

+1 vote

0 answers

4

GATE2015-1_39
f (X, Y, Z) = X'YZ + XY' + Y'Z'f (X, Y, Z) = X'YZ + XY' + Y'Z' and g (X, Y, Z) = X'YZ + X'YZ' + XYg (X, Y, Z) = X'YZ + X'YZ' + XY Which one of the following is correct? Both {f}{f} ... of X,Y,Z we can prove non-Linearity and proceed further. PS: I already read @Arjun's solution but please go through my solution and let me know where im getting it wrong.

asked Oct 12 in Digital Logic by Salazar (169 points) | 68 views

0 votes

0 answers

5

Gate2005
Can some one explain

asked Oct 12 in Programming by Ipsita Priyadarsini (239 points) | 27 views

+2 votes

0 answers

6

Modified GATE2014-2-36
Let $L=\left \{ w\in\{0,1\}^* | \text{number of occurances of }(110)=\text{number of occurances of}(011) \right \}$ What is $L$? I think $L$ is regular . Regular expression is -: $L=\left \{ 0^{*}+1^{*}+\left ( \left ( \varepsilon +0+1 \right ) ... \right ) \right ) + 0^{*}\left ( 0110 \right )^*0^{*}+1^* \left ( 11011 \right )^{*}1^{*} \right \}$

asked Oct 9 in Theory of Computation by sourav. Veteran (13.7k points) | 46 views

0 votes

1 answer

7

Gate2009
What is minimum no of 2 to 1 MUX required to generate 2 input AND gate and 2 input ExOR gate A) 1& 2 B)1&3 C)1&1 D)2&2

asked Oct 3 in Digital Logic by ADITYA CHAURASIYA 5 (467 points) | 54 views

0 votes

0 answers

8

Gate2018

asked Sep 17 in Operating System by Harikesh Kumar (365 points) | 49 views

+1 vote

0 answers

9

Gate2018

asked Sep 17 in Operating System by Harikesh Kumar (365 points) | 31 views

0 votes

0 answers

10

gate2000
explain [closed]

asked Sep 17 in Programming by Ipsita Priyadarsini (239 points) | 35 views

+3 votes

1 answer

11

Gate2018
Is a^nb^3^n is CsL or Recursive or Recursive enumerable? Please draw the state transition diagram also I think it is not any of them.because b^3^n I can't put in loop

asked Sep 10 in Theory of Computation by sbose22 (63 points) | 87 views

+1 vote

0 answers

12

Gate2006-33
In general we say that every regular language is CFL. It is given regular union DCFL is context free. For eg if we take kleene closure as regular then union will be regular. If kleene closure is regular how can we say it is CFL? Kleene closure can generate a^n b^nc^n but it is not CFL

asked Sep 5 in Theory of Computation by TusharP (41 points) | 27 views

+1 vote

1 answer

13

EC,GATE2007
An examination consists of two papers , paper1 and paper2 . the probability of failing in paper 1 is 0.3 and that in paper 2 is 0.2 . Given that a student has failed in paper2 , the probability of failing in paper1 is 0.6 .The ... creat sample space and then try to find probability, what's wrong here ? Someone verify pls ...M getting different ans ...

asked Sep 1 in Probability by sid1221 Active (2.1k points) | 93 views

0 votes

0 answers

14

ME , GATE2006
Assuming $i=\sqrt{-1}$ and t is real number , $\int_{0}^{\Pi /3} e^{it}dt$ given ans is $\sqrt{3}/2 + i/2 , and i am getting \sqrt{3}/2-i/2$ i solved first put $e^{it}= cost +isint$ then and integrate , but in solution they first integrate $e^{it}$ then put the value of it ... but ans different ... why is this happening .. am i missing something ??

asked Aug 29 in Calculus by sid1221 Active (2.1k points) | 32 views

0 votes

0 answers

15

http://ee.gateoverflow.in/212/gate2016-1-2

asked Aug 26 in Linear Algebra by sid1221 Active (2.1k points) | 60 views

0 votes

2 answers

16

Optimal Merge Pattern,similar to http://gateoverflow.in/1997/gate2014-2-38

asked Aug 18 in Algorithms by Ali Jazib Mahmood (167 points) | 96 views

0 votes

0 answers

17

http://gateoverflow.in/492/gate2008-69

asked Aug 13 in Databases by Tuhin Dutta Active (2.3k points) | 69 views

+2 votes

1 answer

18

Gate2018
Where I can find best algorithm video.

asked Jul 8 in Algorithms by Harikesh Kumar (365 points) | 141 views

+2 votes

0 answers

19

#Gate2003
Consider the following logic program P A(x) <- B(x, y), C(y) <- B(x,x) Which of the following first order sentences is equivalent to P? Can anyone explain how it can be solved ? [closed]

asked Jun 29 in Mathematical Logic by Syedarshadali (163 points) | 143 views

+1 vote

2 answers

20

#GATE2018 #GATE #COMPUTERSCIENCE #GATECSE

asked Jun 29 in Computer Networks by popo040 (75 points) | 180 views

+5 votes

1 answer

21

GATE2003-13-ECE
Without any additional circuitry an $8:1 $ MUX can be used to obtain (a) Some but not all Boolean functions of $3$ variables (b) All function of $3$ variables but none of $4$ variables (c) All functions of $3$ variables and some but not all of $4$ variables (d) All functions of $4$ variables

asked Jun 20 in Digital Logic by sourav. Veteran (13.7k points) | 179 views

0 votes

0 answers

22

Gate2000-21
(a) Suppose you are given an empty B+- tree where each node (leaf and internal) can store up to 5 key values. Suppose values 1, 2,.....10 are inserted, in order, into the tree. Show the tree pictorially after 6 insertions, and after ... approximately is the average number of keys in each leaf level node. in the normal case, and with the insertion as in (b).

asked Jun 6 in Databases by shalini j (257 points) | 76 views

+1 vote

0 answers

23

GATE2009-35
The running time of an algorithm is represented by the following recurrence relation: T(n)={nT(n3)+cnn≤3 otherwise T(n)={nn≤3T(n3)+cn otherwise Which one of the following represents the time complexity of the algorithm [closed]

asked Jun 3 in Algorithms by shalini j (257 points) | 109 views

0 votes

0 answers

24

GATE2007-IT-24
A depth-first search is performed on a directed acyclic graph. Let d[u] denote the time at which vertex u is visited for the first time and f[u] the time at which the dfs call to the vertex u terminates. Which of the following statements is always true for all edges (u, v) in the graph ?

asked May 24 in Algorithms by shalini j (257 points) | 93 views

0 votes

0 answers

25

gate2003-66
what if the number n is converted to decimal to find cube root and then find its complexity.will it be wrong to convert the number to decimal?

asked May 23 in Algorithms by nabadeep (217 points) | 57 views

+1 vote

1 answer

26

GATE2005-IT-53
i am confused about how the while loop breaks if a=''DBC" and b="BD"? i suppose here both occurence of B and D will have zero count in count arrray when for loop is checked. please explain?

asked May 23 in Algorithms by nabadeep (217 points) | 78 views

0 votes

1 answer

27

GATE2008-67
In the question http://gateoverflow.in/490/gate2008-67, why is the formula Number of third level page tables possible= Physical memory size / Size of a third level page table being used to calculate the number of third level page tables?

asked May 9 in Operating System by kauray (325 points) | 189 views

0 votes

0 answers

28

GATE2012_34
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: 245.248.128.0/20. The ISP wants to give half of this chunk of addresses to Organization A, and a quarter to Organization B, while retaining the remaining with itself. Which of the following is a valid allocation of address to A and B? [closed]

asked May 1 in Computer Networks by shalini j (257 points) | 94 views

0 votes

1 answer

29

GATE2013_34
A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each ... x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution? [closed]

asked Apr 29 in Operating System by shalini j (257 points) | 132 views

0 votes

0 answers

30

GATE2007-5
Consider the DAG with V={1,2,3,4,5,6} shown below. Which of the following is not a topological ordering? [closed]

asked Apr 27 in Programming by shalini j (257 points) | 112 views

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

Previous GATE Questions

Recent Posts

Recent Blog Comments

Recent Badges