The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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

589
views
engineeringmathematics
integration
+9
votes
2
GATE2012 CY: GA1
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

553
views
gate2012cy
numericalability
modulararithmetic
+111
votes
3
GATE2016233
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.
answered
Feb 16, 2016
in
CO and Architecture

6.7k
views
gate20162
coandarchitecture
pipelining
normal
numericalanswers
+72
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 and Architecture

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

4.2k
views
+5
votes
6
GATE20028
Consider the following circuit. $A = a_2a_1a_0$ and $B=b_2b_1b_0$ are three bit binary numbers input to the circuit. The output is $Z=z_3z_2z_1z_0$. R0, R1 and R2 are registers with loading clock shown. The registers are loaded with their input data with the falling edge of a ... b. What does the circuit implement?
answered
Jan 26, 2016
in
Digital Logic

788
views
gate2002
digitallogic
normal
descriptive
digitalcounter
+25
votes
7
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 all edges ... $G$ 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

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

2.2k
views
numericalability
gate2013ce
profitloss
+2
votes
9
How should the relation be decomposed so that it is in BCNF ?
In the relation R(ABCD) , AB>C , C>AD How should the table be decomposed so that it is in BCNF , One decomposed relation will be ACD ,what should be other should it be BC , but if it is then there is no functional ... do ABC , then I have C>A but C is not a superkey in ABC , so how should the decomposition be done ?
answered
Jan 16, 2016
in
Databases

181
views
databases
+50
votes
10
GATE2007IT84
Consider the $B^+$ tree in the adjoining figure, where each node has at most two keys and three links. Keys $K15$ and then $K25$ 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

5k
views
gate2007it
databases
btree
normal
+35
votes
11
GATE199921
Consider a Btree with degree $m$, that is, the number of children, $c$, of any internal node (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

2.9k
views
gate1999
databases
btree
normal
+1
vote
12
Final Analysis DIJIKSTRA ALGORITHM
Acc. to dijkstra's algorithm: What will be the shortest path from A to B ? 1) When the edge of length 15 is present. 2) when the edge of length 15 is removed.
answered
Jan 12, 2016
in
Algorithms

785
views
algorithms
graphalgorithms
multistagegraph
dynamicprogramming
+12
votes
13
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 send packets with ... of $B$ 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

345
views
slotted_aloha
computernetworks
+5
votes
14
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

3.6k
views
+1
vote
15
How long does it take for the packet to get to the receiver?
Consider a route in a store and forward network going through 9 intermediate nodes. The packet contains 1100 bits and are transmitted at 64 Kbps. Assume propagation delay over the links are negligible. As a packet travels along the ... get to the receiver if the nodes transmit on a "first come first served" basis (in ms) ?
answered
Jan 4, 2016
in
Computer Networks

158
views
computernetworks
+3
votes
16
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

209
views
compilerdesign
+2
votes
17
What are the possible values of x and y after completion of the program
int x=0,y=0; par begin begin x=1; y=y+x; end begin y=2; x=x+3; end par end what are the possible values of x and y after completion of the program? a. x=1 ,y=2 b.x=1,y=3 c.x=4,y=6
answered
Jan 1, 2016
in
Operating System

218
views
operatingsystem
processsynchronization
+4
votes
18
Counting number of functions which are neither 11 nor onto
Let $A = \left \{1, 2, 3, 4 \right \}$. Number of functions possible on $A$ which are neither $11$ nor onto is _________.
answered
Dec 31, 2015
in
Combinatory

268
views
permutationandcombination
engineeringmathematics
+5
votes
19
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

637
views
engineeringmathematics
permutationandcombination
+2
votes
20
Question on counting number of ways scholarship can be distributed
Given explanation of the question: I believe that in place of last C(8,3) it should be C(7,3) because 3 people have been already chosen before that. Please check whether I am correct or not.
answered
Dec 31, 2015
in
Combinatory

106
views
permutationandcombination
engineeringmathematics
+4
votes
21
What is the correct implementation of UP operation in a binary semaphore
these are the codes for down and up operations in a binary semaphore. The down operation's code seems to be correct, but I am having some doubt in the UP's code. Suppose a process p1 arrives and executes down. ... down, it will be forced to sleep again.. Am I missing something, or is the above implementation incorrect ?
answered
Dec 30, 2015
in
Operating System

810
views
operatingsystem
semaphore
processsynchronization
0
votes
22
What is the approach to find preorder from given inorder?
The inorder traversal of a tree resulted in FBGADCE. Then preorder traversal would result in. a)FGBDECA b)ABFGCDE C)BFGCDEA d)AFGBDEC
answered
Dec 29, 2015
in
Programming

3.5k
views
datastructures
0
votes
23
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

92
views
0
votes
24
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

169
views
tifrmaths2011
numericalability
geometry
+3
votes
25
Drd0 2008 q11 ch3 i/o interface
In an n CPU shared bus system, if z is the probability that any CPU requests the bus in a given cycle, the probability that only one CPU uses the bus is given by A. Nz(1z)n1 B. Z(1z)n1 C. N(1z)n D. (N1)z(1z)n
answered
Dec 22, 2015
in
CO and Architecture

324
views
coandarchitecture
clockfrequency
+1
vote
26
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

251
views
graphtheory
graphisomorphism
outofsyllabusnow
+9
votes
27
Is it lattice
Why is it not lattice?
answered
Dec 20, 2015
in
Set Theory & Algebra

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

499
views
databases
erdiagram
+129
votes
29
GATE2007IT63
A group of $15$ routers is 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 router $j$. 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

4.8k
views
gate2007it
computernetworks
routing
binarytree
normal
+4
votes
30
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

209
views
+2
votes
31
How does partitioning step acts as a conquering step in quick sort ?
T(n)=aT(n/b) +f(n) here f(n) is the cost of conquering the subproblems i.e. cost of merging all the subproblems in order to solve the problem but in case of partioning we are dividng the array around a particular pivot ... the time complexity of quicksort why do we take O(n) time for f(n) ,how is acting as a conquering step?
answered
Dec 16, 2015
in
Algorithms

135
views
sorting
+1
vote
32
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 sent: (a) The ... can send 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

597
views
computernetworks
+1
vote
33
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 that every subset ... $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

428
views
tifr2013
graphalgorithms
unsolved
+47
votes
34
GATE199202,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 "sentential" form. ... . FOLLOW(A) and RFOLLOW(A) are always the same. All the three sets are identical. All the three sets are different.
answered
Dec 10, 2015
in
Compiler Design

1.9k
views
gate1992
parsing
compilerdesign
normal
+10
votes
35
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

1.1k
views
+47
votes
36
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,\ldots,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 one subtree are less than all ... $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

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

361
views
0
votes
38
which of the following statements is correct regarding Regular language?
1.Every Ragular Language have an equivalent LR(0)grammer. 2. Every DCFL have an equivalent LR(0) grammer
answered
Dec 5, 2015
in
Theory of Computation

462
views
+8
votes
39
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

1.6k
views
permutationandcombination
0
votes
40
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

5.3k
views
gate2003
algorithms
sorting
normal
Page:
1
2
next »
50,741
questions
57,244
answers
198,019
comments
104,611
users