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 MiNiPanda
User MiNiPanda
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User MiNiPanda
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
4
answers
1
GATE19882xii
Consider the following program skeleton and below figure which shows activation records of procedures involved in the calling sequence. $p \rightarrow s \rightarrow q \rightarrow r \rightarrow q.$Write the access links of the activation records to enable correct access and variables in the ... q; procedure r; begin q end r; begin r end q; procedure s; begin q end s; begin s end p;
commented
Dec 10, 2019
in
Compiler Design

1.3k
views
gate1988
normal
descriptive
runtimeenvironments
compilerdesign
2
answers
2
ISI 2014 PCB A2
Let $m$ and $n$ be two integers such that $m \geq n \geq 1.$ Count the number of functions $f : \{1, 2, \ldots , n\} \to \{1, 2, \ldots , m\}$ of the following two types: strictly increasing; i.e., whenever $x < y, f(x) < f(y),$ and nondecreasing; i.e., whenever $x < y, f(x) ≤ f(y).$
commented
Nov 24, 2019
in
Set Theory & Algebra

299
views
isi2014
settheory&algebra
functions
3
answers
3
TIFR2013A1
An infinite twodimensional pattern is indicated below. The smallest closed figure made by the lines is called a unit triangle. Within every unit triangle, there is a mouse. At every vertex there is a laddoo. What is the average number of laddoos per mouse? $\quad 3$ $\quad 2$ $\quad 1$ $\left(\dfrac{1}{2}\right)$ $\left(\dfrac{1}{3}\right)$
comment edited
Sep 14, 2019
in
Numerical Ability

465
views
tifr2013
numericalability
permutationandcombination
5
answers
4
GATE200475
Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the colour pairs used to colour any two letters are different. Both prints of a letter can also be coloured with the same colour. What is the minimum value of $k$ that satisfies this requirement? $9$ $8$ $7$ $6$
commented
Apr 4, 2019
in
Combinatory

4.3k
views
gate2004
permutationandcombination
0
answers
5
Hashing
Consider an open address hash table with uniform hashing. Out of 10 locations, 8 are occupied. What are the expected number of probes in an unsuccessful and successful search respectively?
commented
Mar 8, 2019
in
Algorithms

204
views
hashing
datastructures
uniformhashing
probability
8
answers
6
Kenneth Rosen Edition 6 Question 45 (Page No. 346)
How many bit strings of length eight contain either three consecutive 0s or four consecutive 1s?
commented
Feb 28, 2019
in
Combinatory

2.4k
views
permutationandcombination
counting
0
answers
7
Pg 345 Question 23, 6th Edition KH Rosen
How many strings of three decimal digits do not contain the same digit three times? have exactly two digits that are 4s? I know question is easy but the answer is not matching with the one given over here Please someone verify.. Does the word “string” mean that we can take 0 as the first digit as well?
commented
Feb 27, 2019
in
Combinatory

61
views
kennethrosen
discretemathematics
1
answer
8
Computer Network
20 Gbps link each user using 5Gbps when active<20% time the user is active> Max. users that the network can be used by? Using circuit switching?
commented
Feb 21, 2019
in
Computer Networks

128
views
computernetworks
0
answers
9
#GATE 2019
I am getting 58.33 marks in Gate 2019(Computer Science).What are my chances and what should be my preference for M.Tech?
commented
Feb 11, 2019
in
IISc/IITs

384
views
0
answers
10
Sheldon and Ross
Two balls each equally likely to be colored either red or blue, are put in an urn. At each stage one of the balls is randomly chosen, its color is noted, and it is then returned to the urn.if the first two balls chosen are colored red, what is the probability that a>both balls in the urn are colored red b>the next ball chosen will be red how to solve this?
commented
Feb 7, 2019
in
Probability

121
views
0
answers
11
#math
comment moved
Feb 7, 2019
in
Set Theory & Algebra

110
views
gate19
1
answer
12
GATE 2019  The number of times printf statement is executed is:
int main() { float sum, i = 1.0, j = 2.0; while (i/j > 0.0625) { j = j + j; printf("%f", i+j); } } The number of times printf statement is executed is:
comment moved
Feb 7, 2019
in
Programming

249
views
4
answers
13
GATE 2019
Let U = {1, 2, ..., n} and A = {(x, X), x ∈ X and X ⊆ U}. Consider the following two statements for A. (i) A = n*$\small 2^{n1}$ (ii) A= Sigma(k=1 to n) k.(nCk) Which of the following is correct? (a) (i) only (b) (ii) only (c) Both (i) and (ii) (d) None of the above
commented
Feb 6, 2019
in
Set Theory & Algebra

1.4k
views
0
answers
14
textbook
please gie the answer
comment moved
Feb 6, 2019
in
Algorithms

95
views
2
answers
15
Gate 2019
When will we get our response sheet and the official key sheet?
comment moved
Feb 6, 2019
in
GATE

1.8k
views
0
answers
16
MadeEasy Test Series 2019: Computer Networks  Congestion Control
Consider a TCP connection using the multiplicative additive congestion control algorithm where the window size is 1 MSS and the threshold is 32 MSS. At the $8^{th}$ transmission timeout occurs and enters in the congestion detection ... transmission. So we have to take the window size after the 12 RTTs right and not at 12th RTT?
commented
Jan 31, 2019
in
Computer Networks

357
views
computernetworks
congestioncontrol
madeeasytestseries2019
madeeasytestseries
1
answer
17
ME MOCK 2
We are given a C function, mystery() as follows. void mystery(int m, int n) { while(m<=n) { m++; n; } } Let X be the number of times the comparission inside the while loop ( i.e., m<=n ) is performed, when mystery(127,255) is called. Then the value of X is _______________
commented
Jan 31, 2019
in
DS

95
views
algorithms
1
answer
18
B+ tree maximum and minimum height
commented
Jan 30, 2019
in
Databases

685
views
btree
indexing
databases
1
answer
19
GOCompiler1: Parsing9
For which of the following languages a LL(1) grammar does not exist? $\{a^n o b^n \mid n \geq 1\} \cup \{ a^n b^{n} \mid n \geq 1 \}$ $\{ a^n b^m \mid m,n \geq 0 \}$ $\{a^ib^j\mid i\geq j\}$ $\{a^ib^j\mid i= j\}$
comment edited
Jan 28, 2019
in
Compiler Design

320
views
go2019cd1
2
answers
20
MadeEasy Full Length Test 2019: Combinatory  Permutations And Combinations
The number of ways 5 letter be put in 3 letter boxes A,B,C. If letter box A must contain at least 2 letters.
comment edited
Jan 25, 2019
in
Combinatory

238
views
discretemathematics
permutationandcombination
madeeasytestseries2019
madeeasytestseries
0
answers
21
MadeEasy Full Length Test 2019: Operating System  Process Schedule
comment edited
Jan 23, 2019
in
Operating System

206
views
operatingsystem
processschedule
madeeasytestseries2019
madeeasytestseries
0
answers
22
general aptitude
statements: some authors are teachers No teacher is a lady. conclusion: I.some teachers are not ladies II.some ladies are teachers according to me neither conclusion I follows nor II am i correct??
comment edited
Jan 21, 2019
in
Verbal Ability

111
views
1
answer
23
MadeEasy Test Series 2019: Databases  Transaction And Concurrency
Consider the following schedule $\text{S : r2(A), w1(B), w1(C), R3(B), r2(B), r1(A), commit_1, r2(C), commit_2, w3(A), commit_3 }$ Consider the following statements : S1 : Schedule(S) is conflict ... ) is strict recoverable schedule. S4 : Schedule(S) is allowed by strict 2PL. How many above statements true about schedule(S) ?
comment edited
Jan 21, 2019
in
Databases

363
views
transactions
madeeasytestseries2019
madeeasytestseries
0
answers
24
hamming code
what is approach to solve this type of question?
closed
Jan 20, 2019
in
Computer Networks

127
views
hammingcode
computernetworks
hamming
hamming
distance
0
answers
25
Made Easy Gate Mock2 Question 56
In the given network system, station A needs to send a payload of 1600 B from its network layer to station B. If fragmentation is done, then the actual data size to be transmitted is ______________
closed
Jan 18, 2019
in
Computer Networks

200
views
madeeasytestseries
0
answers
26
MadeEasy Full Length Test 2019: Databases  Er Diagram
Consider the following ER diagram: How many number of relations are required for the above ER diagram? 2 3 5 1 Solution: My doubt is: Since $E_2$ isn't involved in total participation with $E_1$ so on merging we might get 2NF ... 2NF violation. So by default which case is to be considered when normalization form is not mentioned?? 1NF?
asked
Jan 18, 2019
in
Databases

148
views
databases
erdiagram
madeeasytestseries2019
madeeasytestseries
1
answer
27
Time complexity
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers O(log n) O(n log n) O(n)^2 O(n^2 log n) The answer given was B but since worst case time is stated shouldn't the answer be C? I mean we can check all possible pairs in the worst case. Correct me if I am wrong?
comment edited
Jan 18, 2019
in
Algorithms

113
views
0
answers
28
MadeEasy Full Length Test 2019: Theory of Computation  Identify Class Languages
comment edited
Jan 15, 2019
in
Theory of Computation

222
views
identifyclasslanguage
theoryofcomputation
madeeasytestseries2019
madeeasytestseries
0
answers
29
MadeEasy Full Length Test 2018: Digital Logic  Number Representations
2’s complement representation of the number $(89)_{10}$ is 7 5 4 3 I don’t understand their solution. Please help.
comment edited
Jan 15, 2019
in
Digital Logic

151
views
digitallogic
numberrepresentation
madeeasytestseries
madeeasytestseries2019
0
answers
30
MadeEasy Test Series 2019: Theory of computation  Grammer
Let L be the language of all strings on [0,1] ending with 1. Let X be the language generated by the grammar G. $S \rightarrow 0S/1A/ \epsilon $ $A \rightarrow 1S/0A$ Then $L \cup X= $ ∅ ∑* L X Ans given : B. ... a language which contains all strings that do not end with 1. But is it so? Can't we generate 11 from the grammar? Please verify.
asked
Jan 15, 2019
in
Theory of Computation

150
views
theoryofcomputation
grammar
madeeasytestseries2019
madeeasytestseries
0
answers
31
Madeeasy Max Heap 2019
Please explain the logic behind this shortcut and when to be used?
comment edited
Jan 14, 2019
in
Algorithms

324
views
heap
datastructures
binaryheap
algorithms
madeeasytestseries
0
answers
32
made easy
let an be the recurrenence relation which satisfies $a_{n}=4(a_{n1}a_{n2})$ with $a_{1}$=2 and $a_{2}=8$. let X corresponds to the value of $a_{17}$.then values of $log_{2}(\left  x \right )$ will be _____? am getting 18.
closed
Jan 12, 2019
in
Combinatory

68
views
0
answers
33
Gate2000
A relation R is defined on the set of integers as xRy iff (x+y) is even. Which of the following statements is true? A R is not an equivalence relation B R is an equivalence relation having 1 equivalence class C R is an equivalence relation having 2 equivalence classes D R is an equivalence relation having 3 equivalence classes Engineering Mathematics Sets and Relations
closed
Jan 11, 2019
in
Mathematical Logic

59
views
relations
engineeringmathematics
1
answer
34
MadeEasy Full Length Test 2019: General Aptitude  Probability
A packet of 20 batteries is known to include 4 batteries that are defective. If 8 batteries are randomly chosen and tested, the probability that finding among them not more than 1 defective is Ans: 0.5033 Solution provided: How can we apply Binomial distribution ...
answer selected
Jan 10, 2019
in
Numerical Ability

244
views
generalaptitude
numericalability
probability
madeeasytestseries2019
madeeasytestseries
3
answers
35
VIEW SERIALIZABILITY
Consider the 2 transactions T1: R(A) W(A) W(B) T2: R(A) W(A) R(B) W(B) How many view serializable schedules are possible which are not conflict serializable? (A) 0 (B) 1 (C) 2 (D) 3
comment edited
Jan 8, 2019
in
Databases

663
views
view_serializable
databases
transactions
concurrency
1
answer
36
[MEasy Test Discrete]
The number of seven digit integers possible with sum of the digits equal to 11 and formed by using the digits 1, 2 and 3 only are ________.
edited
Jan 6, 2019
in
Combinatory

66
views
0
answers
37
pushdown automata
what will be the pushdown automata for the language, L=a^n b^m where n=2m+1.
comment edited
Jan 3, 2019
in
Theory of Computation

55
views
0
answers
38
DCFL or CFL?
Given that: { A^m B^n C^k/ if (k=even) then m=n} { A^m B^n C^k/ if (n=even) then m=k} Which of the above languages are DCFL? According to me it is CFL as we have to first count k and then compare other inputs.. same for second language ... is both are DCFL? it is only possible if skip path is exists here? does it exist for DCFLs? so confused please guide me? if given answer is correct?
comment edited
Jan 3, 2019
in
Theory of Computation

222
views
theoryofcomputation
dcfl
contextfreelanguages
0
answers
39
Self Made[Variation to Gate 2004 Ques]
Let X and Y be two exponentially distributed and independent random variables with mean α and β, respectively. If Z = MAX (X,Y), then the mean of Z is given by
comment edited
Jan 3, 2019
in
Probability

51
views
engineeringmathematics
probability
0
answers
40
#integration
I=$\int_{1}^{\infty }a^{ceil (log _{b} x ) } dx$
comment edited
Jan 3, 2019
in
Calculus

52
views
integration
50,737
questions
57,384
answers
198,537
comments
105,331
users