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 Hirak
User Hirak
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Hirak
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
MadeEasy Test Series: Compiler Design  Syntax Directed Translation
Consider the following grammar and their Syntax Directed Translation (SDT) rules. (Here id represent a integer and id.val is value of that integer) S1: Given SDT is Lattributed and using Lattributed evaluation the value of ... doubt here: Is there any difference in the way of evaluation of Lattributed SDT and Sattributed SDT ?
answered
Jul 15
in
Compiler Design

186
views
madeeasytestseries
compilerdesign
syntaxdirectedtranslation
+2
votes
2
Profit and loss Self doubt
The marked price of a table is Rs. 1200, which is 20% above the cost price. It is sold at a discount of 10% on the marked price. Find the profit percent. (a) 10% (b) 8% (c) 7.5% (d) 6% What approach can I use for these type of questions?
answered
Jun 4
in
Numerical Ability

85
views
profitloss
costmarketprice
numericalability
generalaptitude
+2
votes
3
Doubt on GATE Question
Read the statements: All women are entrepreneurs. Some women are doctors. Which of the following conclusions can be logically inferred from the above statements? All women are doctors All doctors are entrepreneurs All entrepreneurs are women Some entrepreneurs are doctors ... Is it because , if we make set of doctor as 0, then All doctors are entrepreneurs is meaningless.
answered
Jun 1
in
Mathematical Logic

64
views
discretemathematics
mathematicallogic
+3
votes
4
Probability question of CLRS
In a restaurant each of $n$ customer gives a hat to the hat check person. The hat check person gives the hat back to the customer in a random order. What is expected number of customer who get back their own hat?
answered
May 31
in
Probability

112
views
algorithms
probability
+1
vote
5
UGCNETJune2015III30
The minimum payload of a TCP segment is 65,535 65,515 65,495 65,475
answered
May 31
in
Others

1.4k
views
ugcnetjune2015iii
computernetworks
tcp
+2
votes
6
Cache Average access time
So as we know there are 2 different approaches for cache.. Sequential and the Hierarchical. Exactly which formula should I use when only access times and hit ratio is mentioned in case of 2 level memory system..? It would be great if someone explains how to approach questions related to average access time.
answered
May 19
in
CO and Architecture

136
views
cachememory
coandarchitecture
+3
votes
7
Made Easy Test Series:Discrete MathematicsPoset
Consider the following Posets: $I)\left ( \left \{ 1,2,5,7,10,14,35,70 \right \},\leq \right )$ $II)\left ( \left \{ 1,2,3,6,14,21,42 \right \},/ \right )$ $III)\left ( \left \{ 1,2,3,6,11,22,33,66 \right \},/ \right )$ Which of the above poset are isomorphic to $\left ( P\left ( S \right ),\subseteq \right )$ where $S=\left \{ a,b,c \right \}?$
answered
May 18
in
Set Theory & Algebra

74
views
poset
madeeasytestseries
discretemathematics
+5
votes
8
TEST BOOK QUESTION
CAN SOMEBODY EXPLAIN THIS ANSWER PLZ !!!
answered
May 14
in
Digital Logic

68
views
#digitallogic
+1
vote
9
analysis of algorithm
answered
May 9
in
Algorithms

60
views
+3
votes
10
Combination doubt
A shipping clerk has to weigh 10 distinct packets. He weighs them four at a time, weighing all the possible combinations of the packets from the ten. The average weight of all the weighing combination is found to be 800 gm. What is the combined weight of all the size packets?
answered
May 7
in
Numerical Ability

29
views
gate2016ec3
combinational
+2
votes
11
Made Easy Test Series:Algo Asymptotic Complexity
$1)n^{2019}=O\left (n^{2020} \right )$ $2)O(n^{2019})=O\left (n^{2020} \right )$ Which one is correct?? If $1)$ is correct, why $2)$ not correct?
answered
May 6
in
Algorithms

159
views
madeeasytestseries
algorithms
0
votes
12
Resource Allocation
Consider a scenario where 3 processes P1, P2 and P3 are sharing x resources of the same type. The maximum need of the three processes is 4, 8, 6. It is also known that the maximum combined need of both processes P1 and P2 at a time is 9 and they always execute only in combined manner. Then the value of x is ___
answered
May 4
in
Operating System

544
views
operatingsystem
+1
vote
13
Made Easy Test Series:TOCTuring Machine
$P_{1}:$ {$<M>M $ is a TM that accepts atleast $2$ strings of different length} $P_{2}:$ {$<M>M $ is a TM and there exists an input whose length less than $100,$ on which $M$ halts } The number of problem which is $RE$ but not $REC$ _____________
answered
May 3
in
Theory of Computation

144
views
theoryofcomputation
turingmachine
testseries
0
votes
14
Made Easy Test Series: DS
A $d$ary heap is a binary heap, but instead of $2$ children, nodes have $d$ children. A $dary$ heap can be represented by $1D$ array as follows. The root is kept in $A[1]$, and it's $d$ children are kept in order in $A[2]$ through $A[d+1]$ ... $A\left [ d^{2}+d+2 \right ]$
answered
May 2
in
DS

85
views
madeeasytestseries
datastructure
+1
vote
15
Allen Career Institute: Discrete Math
Let $f : A \rightarrow B$ be a bijection and let $E,F$ be subjects of $A$, Now, we consider the following statements about the function $f :$ $P : f(E \cup F) = f (E) \cup f(F)$ ... None of $P$ and $Q$ is correct I thought $Q$ is true, but answer is both true. Is both true because of bijective function or ans given incorrect?
answered
May 1
in
Set Theory & Algebra

56
views
discretemathematics
+2
votes
16
Made Easy Test Series:DSStack and Queue
Consider a single array $A\left [ 0...........(n1) \right ]$ is used to implement two stacks. Two stacks grows from opposite end of the array. Variable $top_{1}$ and $top_{2}$ points to the location of the topmost elements in each of the stacks ... the number of elements are present in the array at any time? $A)ntop_{2}+top_{1}$ $B)n+1top_{2}+top_{1}$
answered
May 1
in
DS

74
views
datastructure
madeeasytestseries
0
votes
17
Gate 2018: Probability
In a box, there are $2$ red, $3$ black and $4$ blue coloured balls. The probability of drawing $2$ blue balls in sequence without replacing, and then drawing $1$ black ball from this box is _________ %.
answered
May 1
in
Probability

155
views
usergate2018
probability
normal
+1
vote
18
Number of nodes in heap of height 'h'
The number of nodes of height $h$ in any $n$element heap is ________. $h$ $2^{h}$ ceil $\left[\frac{n}{2^{h}}\right]$ ceil $\left[\frac{n}{2^{h+1}}\right]$ Answer is given as D, But I think it should be C. Because, even if you take height=1 then possible nodes are 3 and 2.
answered
Apr 26
in
DS

3.2k
views
datastructure
binarytree
binaryheap
+1
vote
19
Resource allocation in packet switching and circuit switching
Resource Reservation is a feature of: A. Circuit Switching B. Packet Switching C. Both (A) and (B) D. None of these PS: In virtual packet switching resouce allocation is done during setup, while in datagram packet switching, there is no allocation. http://www.slideshare.net/mukeshnt/chap8switching
answered
Apr 11
in
Computer Networks

1.1k
views
networkswitching
resourceallocation
computernetworks
+2
votes
20
GATE2014 EC1: GA4
The statistics of runs scored in a series by four batsmen are provided in the following table. Who is the most consistent batsman of these four? ... $K$ $L$ $M$ $N$
answered
Apr 10
in
Numerical Ability

1.5k
views
gate2014ec1
statistics
numericalability
+1
vote
21
Q: why it is said that one of the key characteristic of distance vector routing is knowledge about the entire network while one of the key characteristic of link state routing is knowledge about the neighborhood ??
answered
Apr 5
in
Computer Networks

369
views
computernetworks
+2
votes
22
UGCNETJuly2018II46
Which of the following statements are true? Three broad categories of Networks are Circuit Switched Networks Packet Switched Networks Message Switched Networks Circuit Switched Network resources need not be reserved during the set up phase In packet switching there is no resource allocation for packets a and b only b and c only a and c only a, b and c
answered
Apr 3
in
Computer Networks

429
views
ugcnetjuly2018ii
computernetworks
networkswitching
+2
votes
23
time complexity
int fun(int n) { int count = 0; for (int i = n; i > 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count; } what is the time complexity
answered
Mar 31
in
Algorithms

3.1k
views
timecomplexity
+1
vote
24
Self Doubts:
Q. An SJF algorithm is simply a priority algorithm where the priority is : A) predicted next cpu burst B) The inverse of the predicted next cpu burst C) the current cpu burst D)anything the user want so in this what will be the ans it's a) or c) ? I confused with these two options.please gives proper explanation.
answered
Mar 29
in
Operating System

74
views
operatingsystem
+2
votes
25
when an inverter is placed in both inputs of SR flip flop
When an inverter is placed between both inputs of an SR flipflop, the resulting flipflop is [A]. JK flipflop [B]. D flipflop [C]. T flipflop [D]. Master slave JK flipflop ans given is B but how
answered
Mar 23
in
Digital Logic

1.2k
views
+1
vote
26
Is Fork ,System calls and Threads are there in syllabus?
answered
Mar 21
in
Operating System

125
views
0
votes
27
GATE2016154
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to sustain output ... needs to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.
answered
Feb 4
in
Computer Networks

12.2k
views
gate20161
computernetworks
tokenbucket
normal
numericalanswers
+1
vote
28
probability
Manish has to travel from A to D changing buses at stops B and C enroute.The maximum waiting time at either stop can be 8 minutes each,but any time of waiting upto 8 minutes is equally likely at both places.He can afford upto 13 minutes of waiting time if he is to arrive at D on time,What is probability Manish will arrive late at D?
answered
Jul 2, 2018
in
Probability

674
views
+4
votes
29
GATE199626
A computer system has a threelevel memory hierarchy, with access time and hit ratios as shown below: $\overset{ \text {Level $1$ (Cache memory)} \\ \text{Access time = $ ... time of less than $100 nsec$? What is the average access time achieved using the chosen sizes of level $1$ and level $2$ memories?
answered
Sep 1, 2017
in
CO and Architecture

3.5k
views
gate1996
coandarchitecture
cachememory
normal
+1
vote
30
Number of moves of smallest disc in tower of Hanoi
______ is the number of moves of the smallest disc in Tower of Hanoi implementation where the tower consisting of 17 discs (numbered from 0 to 16) Answer given: $2^{16}$ = 65536 Please explain
answered
Jul 28, 2017
in
DS

1.3k
views
algorithms
programming
recursion
+3
votes
31
complexity
1) Time complexity to insert a node in the end of circular linked list, if pointer to first node is given and the number of nodes in the list is N, is 1) O(1) 2)O(log N) 3)O(N) 4)O(N log N)
answered
Jul 24, 2017
in
Programming

1k
views
50,647
questions
56,508
answers
195,518
comments
100,942
users