Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User MiNiPanda
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by MiNiPanda
9
answers
1
GATE CSE 2005 | Question: 52
A random bit string of length n is constructed by tossing a fair coin n times and setting a bit to 0 or 1 depending on outcomes head and tail, respectively. The probability that two such randomly generated strings are not identical is: $\frac{1}{2^n}$ $1 - \frac{1}{n}$ $\frac{1}{n!}$ $1 - \frac{1}{2^n}$
comment edited
in
Probability
Sep 16, 2021
5.5k
views
gatecse-2005
probability
binomial-distribution
easy
4
answers
2
GATE CSE 1988 | Question: 2xii
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 ... procedure r; begin q end r; begin r end q; procedure s; begin q end s; begin s end p;
commented
in
Compiler Design
Dec 10, 2019
4.1k
views
gate1988
normal
descriptive
runtime-environment
compiler-design
2
answers
3
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 non-decreasing; i.e., whenever $x < y, f(x) ≤ f(y).$
commented
in
Set Theory & Algebra
Nov 24, 2019
1.1k
views
isi2014
set-theory&algebra
functions
3
answers
4
TIFR CSE 2013 | Part A | Question: 1
An infinite two-dimensional 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
in
Quantitative Aptitude
Sep 14, 2019
1.0k
views
tifr2013
quantitative-aptitude
combinatory
9
answers
5
GATE CSE 2004 | Question: 75
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
in
Combinatory
Apr 4, 2019
10.4k
views
gatecse-2004
combinatory
1
answer
6
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
in
Algorithms
Mar 8, 2019
735
views
hashing
data-structures
uniform-hashing
probability
9
answers
7
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
in
Combinatory
Feb 28, 2019
4.8k
views
combinatory
counting
0
answers
8
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
in
Combinatory
Feb 27, 2019
196
views
kenneth-rosen
discrete-mathematics
1
answer
9
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
in
Computer Networks
Feb 21, 2019
292
views
computer-networks
0
answers
10
#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
in
IISc/IITs
Feb 11, 2019
522
views
0
answers
11
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
in
Probability
Feb 7, 2019
698
views
0
answers
12
#math
comment moved
in
Set Theory & Algebra
Feb 7, 2019
228
views
gate19
2
answers
13
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
in
Programming
Feb 7, 2019
664
views
5
answers
14
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^{n-1}$ (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
in
Set Theory & Algebra
Feb 6, 2019
10.4k
views
0
answers
15
textbook
please gie the answer
comment moved
in
Algorithms
Feb 6, 2019
189
views
2
answers
16
Gate 2019
When will we get our response sheet and the official key sheet?
comment moved
in
GATE
Feb 6, 2019
2.1k
views
0
answers
17
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
in
Computer Networks
Jan 31, 2019
1.1k
views
computer-networks
congestion-control
made-easy-test-series
1
answer
18
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
in
DS
Jan 31, 2019
343
views
algorithms
1
answer
19
B+ tree maximum and minimum height
commented
in
Databases
Jan 30, 2019
5.7k
views
b-tree
indexing
databases
1
answer
20
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 9
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
in
Compiler Design
Jan 28, 2019
961
views
go-cd-1
3
answers
21
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
in
Combinatory
Jan 25, 2019
710
views
discrete-mathematics
combinatory
made-easy-test-series
1
answer
22
MadeEasy Full Length Test 2019: Operating System - Process Schedule
comment edited
in
Operating System
Jan 23, 2019
678
views
operating-system
process-scheduling
made-easy-test-series
0
answers
23
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
in
Verbal Aptitude
Jan 21, 2019
789
views
analytical-aptitude
logical-reasoning
statements-follow
3
answers
24
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
in
Databases
Jan 21, 2019
2.3k
views
transaction-and-concurrency
made-easy-test-series
0
answers
25
hamming code
what is approach to solve this type of question?
closed
in
Computer Networks
Jan 20, 2019
445
views
hamming-code
computer-networks
hamming
hamming
distance
0
answers
26
Made Easy Gate Mock-2 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
in
Computer Networks
Jan 18, 2019
508
views
made-easy-test-series
0
answers
27
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 ... 2-NF violation. So by default which case is to be considered when normalization form is not mentioned?? 1-NF?
asked
in
Databases
Jan 18, 2019
450
views
databases
er-diagram
made-easy-test-series
1
answer
28
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
in
Algorithms
Jan 18, 2019
706
views
algorithms
time-complexity
algorithm-design
0
answers
29
MadeEasy Full Length Test 2019: Theory of Computation - Identify Class Languages
Consider the following language over ∑={0,1} $L_{1} = \left \{ a^{\left \lfloor \frac{m}{n} \right \rfloor}| m,n \geq 1; n<m \right \}$ $L_{2} = \left \{ a^{m^{n}}| m,n \geq 1; n<m \right \}$ Which of them are regular? Both L1 and L2 Only L2 Only L1 None Ans. A. Both Please explain.
comment edited
in
Theory of Computation
Jan 15, 2019
563
views
identify-class-language
theory-of-computation
made-easy-test-series
0
answers
30
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
in
Digital Logic
Jan 15, 2019
403
views
digital-logic
number-representation
made-easy-test-series
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Aptitude Overflow Book
Participate in Machine Learning benchmarking
GATE Overflow Tikz Templates
UPSC One Time Registration OTR Online Form 2022
DRDO CEPTAM 10 Online Form 2022
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.5k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.5k)
Admissions
(644)
Exam Queries
(838)
Tier 1 Placement Questions
(17)
Job Queries
(72)
Projects
(9)
Unknown Category
(851)
Recent Blog Comments
Sir some test due date passed 1-2 months ago pls...
@lalitver10 There is no restriction in doing...
@GateOverflow04 link fixed now.
@Arjun @Deepak Sir, In Test Schedule google...
sir is this for gate? it has way more questions...