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
Recent activity by Akriti sood
User Akriti sood
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Akriti sood
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
complexity analysis
Space complexity = input size + extra space So, heap sort also takes input of an 'n' size array. Does this mean that space cost of heap sort algo is O (n).
commented
Jul 1, 2017
in
Algorithms

106
views
1
answer
2
Made easy work book question
Five jobs are waiting to run. Their expected run times are 9,6,3,5,10....which job scheduling technique will result in minimum avg response time. 1) SJF 2) FCFS 3)PRIORITY 4) ROUND ROBIN
commented
Jul 1, 2017
in
Operating System

688
views
1
answer
3
Calculus maxima minima
True / false ? In continuous function if we have three stationary points then always it will be case that either one is maxima and two are minima or one is minima and two are maxima ? I think it is true but i am concerned about constant fucntion
commented
Jul 1, 2017
in
Calculus

200
views
calculus
engineeringmathematics
maximaminima
3
answers
4
Shortest Path Algorithms
For a given undirected weighted graph G with V number of vertices, if you want to find all pair shortest paths then which one of the following is true ? a) run dijkstra's shortest path algorithm only once. b) run dijkstra's shortest path algorithm V times. What if the given graph is directed ?
commented
Jun 28, 2017
in
Algorithms

287
views
algorithms
graphalgorithms
shortestpath
0
answers
5
Candidate key
If (sname,ssub,spart) are composite primary key then can we take null or dublicate value in ssub or in any single attribute in above composite key?
commented
Jun 10, 2017
in
Databases

53
views
1
answer
6
Carl Hamacher
Registers R1 and R2 of a computer contain the decimal values 1200 and 4600.What is the Effective address of the memory operand in each of the following instructions? a) Load 20(R1),R5 b) Move #3000,R5 c) Store R5,30(R1,R2) d) Add (R2),R5 e) Subtract (R1)+,R5
commented
Jun 5, 2017
in
CO and Architecture

1.9k
views
coandarchitecture
carlhamacher
0
answers
7
recurrence relation (rosen )43
58.a)solve the given recurrence relation ? $a_{n}=3a_{n/2}+n$ n=2^k , $a_{1}$=1 by changing the variables $b_{k}=3b_{k1}+2^{k}$ after solving this i got c1.$3^{k}2.2^{k}$ now i am facing difficulty to find the value of c1 ... might be silly can some one help me
comment edited
Jun 4, 2017
in
Combinatory

173
views
permutationandcombination
1
answer
8
Gateforum Computer Networks
Consider sliding window protocol for a 10MBps channel with the propagation delay of 300 µs. If packet size is 1kB then what is the maximum link utilization for window size of 127? a. 100% b. 75% c. 2.8% d. 43%
commented
Jun 3, 2017
in
Computer Networks

298
views
errorandflowcontrol
slidingwindow
2
answers
9
ACE Practice Test question
An electronic assembly consists of two sub systems say A and B from previous testing procedures , the following probability are assumed to be known, P(A fails) = 0.2 P(B fails alone) = 0.15 P (A and B fail) = 0.15 then the conditional probability P(A fails B has failed) =
commented
Jun 3, 2017
in
Probability

150
views
1
answer
10
Pointer and Array
What is the output of the above program? Explanation: (*(*(*p)[1]2)) = E (*(*(*p)[0]+1)) = A E  A = 4
commented
Jun 3, 2017
in
Programming

242
views
arrayofpointers
0
answers
11
[COA] William Stallings ,6.6
Consider a disk that rotates at 3600 rpm.The seek time to move the head between adjacent tracks is 2 ms. There are 32 sectors per track, which are stored in linear order from sector 0 through sector 31.The head sees the sectors in ascending order.Assume ... track 9? b. How long will it take to transfer all the sectors of track 8 to the corresponding sectors of track 9?
commented
Jun 1, 2017
in
CO and Architecture

304
views
coandarchitecture
2
answers
12
Cominatroics
There are 12 copies of Mathematics, 7 copies of Engineering, 3 different books on Medicine and 2 different books on Economics. Find the number of ways in which one or more than one book can be selected? A. 3421 B. 3111 C. 3327 D. 3201
commented
May 31, 2017
in
Combinatory

202
views
1
answer
13
Finding best time complexity
$\begin{align*} & a[n] = \{x_1,x_2,x_3,x_4,....,x_n\} \text{ is an array of integers where } n,x_i > 0. \\ & A = \left [ \text{min}\left ( x_i,x_j \right ) \right ] \cdot \left ( ji \right ) \text{ where } j > i \text{ and } i,j \leq n \\ & \text{What is the best time complexity to find out the value of } A_{\bf max} \; ? \end{align*}$
commented
May 28, 2017
in
Algorithm Challenges

259
views
algorithms
timecomplexity
1
answer
14
[COA] I/o Organization
Consider the following statements: 1. Change program counter value 2. Change page table register context 3. Disable interrupt 4. Initiate I/o on a disk using memory mapped I/o which of the above can be executed in only in system mode? a.) 1,3,4 b)2,3,4 c.)1,2,3 d)2,4,1 Please give valid explanation with your answer.
commented
May 27, 2017
in
CO and Architecture

290
views
coandarchitecture
interrupts
1
answer
15
testbook
A) 1 & 3 B) 1 & 2 C)2 & 3 D) 1 2,& 3
commented
May 26, 2017
in
Databases

49
views
databases
1
answer
16
Percentage
In an election involving two candidates ,68 votes were declare invalid .the wining candidate secure 52 % and wins by 98 votes.the total no. of vote polled is.anyone can help me?
answer selected
May 26, 2017
in
Numerical Ability

1.1k
views
2
answers
17
Dstree
Given numbers from 1 to 8. Number 5 is the root of BST.How many number of BST are possible with given constraint.
commented
May 25, 2017
in
Programming

70
views
0
answers
18
Counting
https://gateoverflow.in/?qa=blob&qa_blobid=14775353093279358576 I'm unable to understand how the value of K, is equivalent to selecting m integers with repetition allowed, out of n integers (1,2,3,...,n). Kindly explain in detail, preferably visual detail.
commented
May 25, 2017
in
Mathematical Logic

73
views
#counting
discretemathematics
1
answer
19
Silly window syndrome
One of the case of Silly window syndrome occurrence is when sender is producing only one byte at a time from transport layer . And for that Nagles solution is " collect it upto RTT time (worst case ) or upto 1 MSS (if before waiting upto RTT we ... from sender side. If this solution will be applied here too then every chat will become an email . Plzz clear this thing ???
commented
May 25, 2017
in
Computer Networks

342
views
1
answer
20
computer architecture
Can we have overflow in unsigned numbers ??? We know that in unsigned numbers with n bits we can represent numbers from 0 to 2^n  1.EX: with 4 bits from o to 15.Now if I add 14 + 15 = 29 which we cant represent using 4 bits...can we say ... I feel is In unsigned numbers whenever we get an endaround carry there will always be an overflow ..Please correct me if I am wrong....
commented
May 24, 2017
in
CO and Architecture

57
views
coandarchitecture
2
answers
21
Probability puzzles
A grasshopper is sitting on a little stone, which we'll call stone zero. Ahead of him, arranged in a line, are stones one, two, three, et cetera, all the way up to nine. The grasshopper would like to reach that ninth stone, for reasons unknown ... two: he could take one big jump, or two little ones. How many different paths can the grasshopper take to reach his destination?
commented
May 24, 2017
in
Probability

342
views
probability
engineeringmathematics
conditionalprobability
3
answers
22
Algorithms
what is the maximum difference between height of two nodes of AVL tree a.1 b.2 c.3 d.none
commented
May 23, 2017
in
Algorithms

81
views
1
answer
23
Algorithms
To sort the following numbers which algorithm will suit the best (i) 1 to 100 integers (ii) 0 to 1000000 integers a)bucket sort for both b) (i)radix sort (ii)quick sort c) (i)quick sort (ii)merge sort d) (i) merge sort (ii)quick sort
commented
May 23, 2017
in
Algorithms

100
views
1
answer
24
Longest Common Subsequence
For finding longest common subsequence(LCS), standard sources mention that the recursive procedure consisting of the recursive tree occupies O(m+n) space( WITHOUT applying Dynamic Programming). I am unable to understand why is space occupied O(m+n)? Consider the tree of LCS(3,3). ... value of2^ k = O(m+n) and hence, space should be k=log(m+n). What's wrong with my logic?
commented
May 23, 2017
in
Algorithms

536
views
algorithms
longestcommonsubsequence
dynamicprogramming
0
answers
25
Probbility puzzles
Three men  conveniently named A, B, and C  are fighting a duel with pistols. It's A's turn to shoot. The rules of this duel are rather peculiar: the duelists do not all shoot simultaneously, but instead take turns. A fires at B, B fires at C, ... that B is a better shot, and hits with probability 0.75  all shots are independent. What's the probability that A wins the duel?
commented
May 23, 2017
in
Probability

445
views
probability
conditionalprobability
0
answers
26
distance vector routing
Suppose that forwarding table are all established then, What will be the table for A immediately after the link AE goes down? Is it that the distance to all other nodes is marked infinite? If it not so, then how the table for node A finally gets stabilized?
commented
May 23, 2017
in
Computer Networks

355
views
computernetworks
distancevectorrouting
2
answers
27
Flow control
In flow control, the timer used is started when the transmission of the packet starts or when the last bit of the packet is transmitted? Any questions in flow control related to the timer?
commented
May 23, 2017
in
Computer Networks

286
views
computernetworks
networkflow
0
answers
28
Ethernet frame
If the length of IPv4 datagram is less than 46 bytes then padding bits are added to it as minimum length allowed in ethernet frame is 46 bytes. Question : At the receiver side, how to determine the length of actual data and padding? Any numericals related to it?
commented
May 23, 2017
in
Computer Networks

143
views
1
answer
29
Calculus
The interval in which $f(x) = \cot^{1}x + x$ increases, is (a) $R$ (b)$(0,\infty )$ (c)$R[n\pi]$ (d)None of these
commented
May 22, 2017
in
Calculus

241
views
calculus
engineeringmathematics
2
answers
30
#Pondicherry University Entrance  2011 #Qn 68 #M.Tech C.S.E #DS
Qn. 68 Which of the data structure is suitable for implementing a buffer to file? (A) File (B) Linked List (C) Array (D) All of the above (E) None of the above
commented
May 19, 2017
in
DS

92
views
2
answers
31
Conditional Probability IITB (RA) 2016
This question was asked in IITB (RA) admissions 2016. I have two blue dice, with which I play a game. If I throw a double six (i.e. if I get two six on both the dices) then I win the game. I separately throw a red dice. If I get ... rolled the three die. I turn around to you and said, "I won!". What is the probability that I actually won the game?
commented
May 19, 2017
in
Probability

373
views
probability
conditionalprobability
gate2016admission
admissions
interview
1
answer
32
Probability IITB (RA) 2016
This question was asked in IITB (RA) 2016 admissions. Three person A, B and C each have a bag of five different coloured balls. All three bags have balls from same five colours. A grabs B and C's bag and took two balls without looking ... and took two balls and put them in his bag without looking. What is the probability that all three bags have different coloured balls?
commented
May 19, 2017
in
Probability

329
views
probability
gate2016admission
admissions
iitbombay
3
answers
33
CSL and Regular language
if L1 = { anbncn  n>= 0 } and L2 = { anbmck  k,n,m>=0} L1 is CSL and L2 is regular. Now L3 = L1.(L2)*. Is L3 is regualar or CSL?
commented
May 11, 2017
in
Theory of Computation

625
views
theoryofcomputation
contextsensitive
regularlanguages
2
answers
34
basic aptitude
Ten different letters of alphabet are given, words with 5 letters are formed from these given letters. Then, the number of words which have at least one letter repeated is: A. 69760 B. 30240 C. 99748 D. 42386 i got ans from the method totol words  no word repeated , ... 10*10*10*10*9*5!/4! + 10*10*10*10*!0 from this getting different ans where is going wrong ? someone verify pls
commented
May 10, 2017
in
Combinatory

282
views
engineeringmathematics
1
answer
35
iit kanpur written test
I had been shortlisted for iit kanpur test to be held on 13th may in their campus but i could'nt fill up the form to register myself for th exam.Today i got a mail from IIT kanpur that since i have not confirmed my participation,they wont arrange tests for me. will i not be allowed to give test now?Can anyone pls suggest something?? THanks in advand.
commented
May 10, 2017
in
Written Exam

439
views
iitkanpur
writtentest
mtech
1
answer
36
organization of ALU.
Can anyone explain organization of ALU. Why multiplexer and immediate value is used in ALU implementation ? Why we are not directly load data from register into ALU to perform operation?
commented
May 10, 2017
in
CO and Architecture

145
views
coandarchitecture
1
answer
37
Graph theory and Applications Bondy and Murty Exercise Qn 1.9
A k partite graph is one where vertex set can be partitioned into k subsets so that no edge has both end in any one subset. A complete k partite graph is one that is simple and in which each vertex is joined to every other vertex that is not ... on n vertices then  E(G)  <=  E(Tm,n), with equality only if G isomorphic to Tm,n
commented
May 9, 2017
in
Graph Theory

311
views
graphtheory
discretemathematics
4
answers
38
Join Number of Tuples
Suppose you are given relations r(A, B) and s(A, C). Suppose that r has 10000 tuples, and s has 5000 tuples. Suppose attribute r.A has 1001 distinct values, and s.A also has 1001 distinct values. The maximum possible size of the join result is
commented
May 9, 2017
in
Databases

916
views
naturaljoin
databases
relationalalgebra
0
answers
39
#SWITCH_CN
Can any one explain why collision is not possible inside a switch and router ? I read it in book that switch and router separate the collision domain and that is why collision is not possible inside a switch and router. But I did not understand the meaning of this...
commented
May 8, 2017
in
Computer Networks

119
views
2
answers
40
APTITUDE
The sum of all numbers greater than 10,000 formed by using the digits 0,2,4,6,8 no digit being repeated in any number is??
answer selected
Apr 22, 2017
in
Numerical Ability

350
views
50,741
questions
57,233
answers
197,993
comments
104,579
users