GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Answers by Himanshu1
User Himanshu1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Himanshu1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
Gate_EE_2006
answered
Mar 10, 2016
in
Calculus

165
views
engineeringmathematics
integration
+4
votes
2
GATE2012CYGA1
If (1.001)1259= 3.52 and (1.001)2062= 7.85, then (1.001)3321= 2.23 4.33 11.37 27.64
answered
Feb 21, 2016
in
Numerical Ability

115
views
gate2012cy
numericalability
modulararithmetic
+45
votes
3
GATE2016233
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\tau_1,\tau_2$ and $\tau_3$ such that $\tau_1 =\frac{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 __________ $GHz$, ignoring delays in the pipeline registers.
answered
Feb 16, 2016
in
CO & Architecture

2.5k
views
gate20162
co&architecture
pipelining
normal
numericalanswers
+27
votes
4
GATE2016232
The width of the physical address on a machine is $40$ bits. The width of the tag field in a $512$ KB $8$way set associative cache is ________ bits.
answered
Feb 13, 2016
in
CO & Architecture

2.6k
views
gate20162
co&architecture
cachememory
normal
numericalanswers
+2
votes
5
In a m*n order Matrix, How many submatrices are possible?
answered
Feb 4, 2016
in
Linear Algebra

1.2k
views
+13
votes
6
GATE2005IT52
Let G be a weighted undirected graph and e be an edge with maximum weight in G. Suppose there is a minimum weight spanning tree in G containing the edge e. Which of the following statements is always TRUE? There exists a cutset in G having ... having all edges of maximum weight. Edge e cannot be contained in a cycle. All edges in G have the same weight.
answered
Jan 19, 2016
in
Algorithms

1.2k
views
gate2005it
algorithms
spanningtree
normal
+3
votes
7
GATECE2011
A firm is selling its product at Rs. $60$ per unit. The total cost of production is Rs. $100$ and firm is earning a total profit of Rs. $500$. Later, the total cost increased by $30\%$. By what percentage should the price be increased to maintain the same profit level? 5 10 15 30
answered
Jan 17, 2016
in
Numerical Ability

654
views
gatece2011
numericalability
percentage
+2
votes
8
How should the relation be decomposed so that it is in BCNF ?
answered
Jan 16, 2016
in
Databases

92
views
databases
+21
votes
9
GATE2007IT84
Consider the B+ tree in the adjoining figure, where each node has at most two keys and three links. Keys K 15 and then K 25 are inserted into this tree in that order. Exactly how many of the following nodes (disregarding the links) will be present in the tree after the two insertions? 1 2 3 4
answered
Jan 14, 2016
in
Databases

1.6k
views
gate2007it
databases
btree
normal
+18
votes
10
GATE1999_21
Consider a Btree with degree $m$, that is, the number of children, $c$, of any internal note (except the root) is such that $m \leq c \leq 2m1$. Derive the maximum and minimum number of records in the leaf nodes for such a Btree with height $h, h \geq 1$. (Assume that the root of a tree is at height 0).
answered
Jan 14, 2016
in
Databases

1.4k
views
gate1999
databases
btree
normal
+1
vote
11
Final Analysis DIJIKSTRA ALGORITHM
answered
Jan 12, 2016
in
Algorithms

585
views
algorithms
graphalgorithms
multistagegraph
dynamicprogramming
+9
votes
12
Aloha
You have two computers, $A$ and $B$, sharing a wireless network in your room. The network runs the slotted Aloha protocol with equalsized packets. You want $B$ to get twice the throughout over the wireless network as $A$ whenever both nodes are backlogged. You configure $A$ ... to, in order to achieve your throughout goal? $p/(1+p)$ $p/(1+2p)$ $2p/(1+p)$ $1/2$
answered
Jan 8, 2016
in
Computer Networks

234
views
slotted_aloha
computernetworks
+2
votes
13
Eigenvalues and Eigenvectors
Here answer is B. Can anyone explain this? I am confused with option A and B.
answered
Jan 8, 2016
in
Linear Algebra

1.5k
views
+1
vote
14
How long does it take for the packet to get to the receiver?
answered
Jan 4, 2016
in
Computer Networks

90
views
computernetworks
+3
votes
15
Conflict
If lalr(1) has no conflict then clr(1) never contain any conflict It is true or false If it is false explain
answered
Jan 1, 2016
in
Compiler Design

99
views
compilerdesign
+2
votes
16
What are the possible values of x and y after completion of the program
answered
Jan 1, 2016
in
Operating System

147
views
operatingsystem
processsynchronization
+3
votes
17
Counting number of functions which are neither 11 nor onto
answered
Dec 31, 2015
in
Combinatory

75
views
permutationsandcombinations
engineeringmathematics
+5
votes
18
Question on combinatorics
Given solution of this question: I think that number of 5 elements subsets with 7 should be C(n1, 4) instead of C(n,4) as we have already fixed 7 so number of elements left will be n1. Please check
answered
Dec 31, 2015
in
Combinatory

228
views
engineeringmathematics
permutationsandcombinations
+2
votes
19
Question on counting number of ways scholarship can be distributed
answered
Dec 31, 2015
in
Combinatory

72
views
permutationsandcombinations
engineeringmathematics
+1
vote
20
What is the correct implementation of UP operation in a binary semaphore
answered
Dec 30, 2015
in
Operating System

373
views
operatingsystem
semaphore
processsynchronization
0
votes
21
What is the approach to find preorder from given inorder?
answered
Dec 29, 2015
in
Programming

1.6k
views
datastructure
0
votes
22
Solve the problem
A boy sells apples for 12 cents each and pears for 7 cents each.Suppose the boy collected $3.21.How many apples and pears did he sell?
answered
Dec 25, 2015
in
Numerical Ability

55
views
0
votes
23
TIFR2011MathsB15
A gardener throws $18$ seeds onto an equilateral triangle shaped plot of land with sides of length one metre. Then at least two seeds are within a distance of $25$ centimetres. TRUE/FALSE
answered
Dec 23, 2015
in
Numerical Ability

101
views
tifrmaths2011
numericalability
geometry
+1
vote
24
Drd0 2008 q11 ch3 i/o interface
answered
Dec 22, 2015
in
CO & Architecture

156
views
co&architecture
clockfrequency
+1
vote
25
maths_mock_test
How many labelled subgraphs of $K_n$ are isomorphic to $W_{n1}$? (Where $K_n$ : Complete graph with $n$ vertices , $W_n$ : Wheel graph with $ n+1$ vertices) 1.$\frac{(n1)!}{2}$ 2. $\frac{(n2)!}{2}$ 3. $\frac{n!}{2(n1)}$ 4. $\frac{n!}{2(n1)^2}$
answered
Dec 20, 2015
in
Graph Theory

163
views
graphtheory
graphisomorphism
outofsyllabusnow
+5
votes
26
Is it lattice
Why is it not lattice?
answered
Dec 20, 2015
in
Set Theory & Algebra

219
views
settheory&algebra
lattice
+4
votes
27
ER DIAGRAM
I think ans is A,Please Confirm?
answered
Dec 19, 2015
in
Databases

421
views
databases
erdiagram
+43
votes
28
GATE2007IT63
A group of 15 routers are interconnected in a centralized complete binary tree with a router at each tree node. Router i communicates with router j by sending a message to the root of the tree. The root then sends the message back down to ... The mean number of hops per message, assuming all possible router pairs are equally likely is 3 4.26 4.53 5.26
answered
Dec 19, 2015
in
Computer Networks

1.7k
views
gate2007it
computernetworks
routing
binarytree
normal
+4
votes
29
Probability
In a hash table of size 6 currently the locations 0,2,4 and 5 are occupied. The probability of a new record going into location 1 with a hash function resolving collisions by linear probing is (assume uniform hashing) a)2/3 b)1/3 c)1 d) 1/6
answered
Dec 19, 2015
in
Programming

125
views
+2
votes
30
How does partitioning step acts as a conquering step in quick sort ?
answered
Dec 16, 2015
in
Algorithms

97
views
sorting
+1
vote
31
Patterson Chap 1 Foundtion Q 2
Calculate the total time required to transfer a 1000KB file in the following cases, assuming an RTT of 50 ms, a packet size of 1 KB data, and an initial 2 × RTT of “handshaking” before data is ... four (23−1), and so on. (A justification for such an exponential increase will be given in Chapter 6.)
answered
Dec 14, 2015
in
Computer Networks

321
views
computernetworks
0
votes
32
TIFR2013B15
Let $G$ be an undirected graph with $n$ vertices. For any subset $S$ of vertices, the set of neighbours of $S$ consists of the union of $S$ and the set of vertices $S'$ that are connected to some vertex in $S$ by an edge of $G$. The graph $G$ has the nice property ... $O \left(\sqrt{n}\right)$ but not $O (\log n)$ $O (n)$ but not $O \left(\sqrt{n}\right)$
answered
Dec 13, 2015
in
Algorithms

244
views
tifr2013
graphalgorithms
+18
votes
33
GATE1992_02,xiii
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: For a context free grammar, FOLLOW(A) is the set of terminals that can appear immediately to the right of nonterminal $A$ in some " ... are always the same. (c). All the three sets are identical. (d). All the three sets are different.
answered
Dec 10, 2015
in
Compiler Design

642
views
gate1992
parsing
compilerdesign
normal
+9
votes
34
Combination
For a game in which 2 partners oppose 2 other partners, six men are available. If every possible pair must play against every other pair, the number of games to be played is 9a) 36 (b) 45 (c) 42 (d) 90
answered
Dec 10, 2015
in
Combinatory

350
views
+19
votes
35
TIFR2015B4
First, consider the tree on the left. On the right, the nine nodes of the tree have been assigned numbers from the set $\left\{1, 2,....9\right\}$ so that for every node, the numbers in its left subtree and right subtree lie in disjoint intervals (that is, all numbers in ... ^{9}=512$ $2^{4}.3^{2}.5.9=6480$ $2^{3}.3.5.9=1080$ $2^{4}=16$ $2^{3}.3^{3}=216$
answered
Dec 8, 2015
in
DS

460
views
tifr2015
binarytree
permutationsandcombinations
+1
vote
36
toc
for DCFL there exists LL(k) or not?
answered
Dec 5, 2015
in
Theory of Computation

233
views
0
votes
37
which of the following statements is correct regarding Regular language?
answered
Dec 5, 2015
in
Theory of Computation

297
views
+3
votes
38
In how many ways can the entrepreneur assign 5 different tasks to 3 employees if each should get atleast 1 task ?
answered
Dec 4, 2015
in
Combinatory

761
views
permutationsandcombinations
0
votes
39
GATE200361
In a permutation \(a_1 ... a_n\), of n distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i > a_j\). If all permutations are equally likely, what is the expected number of inversions in a randomly chosen permutation of \(1. . . n\)? \(\frac{n(n1)}{2}\) \(\frac{n(n1)}{4}\) \(\frac{n(n+1)}{4}\) \(2n[\log_2n]\)
answered
Dec 2, 2015
in
Algorithms

2k
views
gate2003
algorithms
sorting
normal
+2
votes
40
no. of gates
answered
Dec 1, 2015
in
Digital Logic

151
views
Page:
1
2
next »
27,349
questions
35,204
answers
84,249
comments
33,328
users