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 srestha
User srestha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User srestha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
MadeEasy Test Series: Compiler Design  Syntax Directed Translation
Question: Options:
answered
Nov 16
in
Compiler Design

95
views
madeeasytestseries
compilerdesign
syntaxdirectedtranslation
0
votes
2
#compiler
given Grammar E → E + E E → E * E E → ( E ) E → id Find set of handles and viable prefixes for the input string id1 + id2 * id3
answered
Nov 8
in
Compiler Design

799
views
compilerdesign
viableprefix
0
votes
3
Made Easy Test Series:OS
Consider the following solution for critical section problem with 'n' processes P0,P1,P2,......P(n1).For all i,number[i] is an integer array initialized to zero, and for all j,choosing[j] is a binary array initialized to false. CODE FOR Pi : Repeat { ... only. b)S1 and S2 only. c)S2 and S3 only. d)S1 , S2 and S3 (please anyone elaborate this solution.thanks in advance)
answered
Oct 23
in
Operating System

57
views
criticalsection
operatingsystem
0
votes
4
sudo gate test series
Which of the following is not the Application layer protocol in TCP/IP Model? SMTP, FTP, TELNET, POP, MIME, HTTP A FTP, POP, MIME, SMTP B TELNET, HTTP C MIME D None of these
answered
Oct 12
in
Computer Networks

132
views
computernetworks
applicationlayerprotocols
0
votes
5
Virtual Gate Test Series: Computer Networks  Transmission Control Protocol
On TCP connection, consider FIN, SYN packets will take $1$ byte and ACK packets will take $0$ bytes. Assume client and server are working on this connection. Client and server selected random numbers for sequence numbers $100$ and $500$ ... $(D)$ SEQ NUM = 501 and ACK NUM = 301
answered
Oct 12
in
Computer Networks

160
views
computernetworks
tcp
sequencenumber
virtualgatetestseries
+1
vote
6
ISI2014DCG3
$\underset{x \to \infty}{\lim} \bigg( \frac{3x1}{3x+1} \bigg) ^{4x}$ equals $1$ $0$ $e^{8/3}$ $e^{4/9}$
answered
Sep 25
in
Calculus

128
views
isi2014dcg
calculus
limits
+1
vote
7
ISI2016DCG3
The value of $\begin{vmatrix} 1+a& 1& 1& 1\\ 1&1+b &1 &1 \\ 1&1 &1+c &1 \\ 1&1 &1 &1+d \end{vmatrix}$ is $abcd(1+\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d})$ $abcd(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d})$ $1+\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d}$ None of these
answered
Sep 19
in
Linear Algebra

13
views
isi2016dcg
linearalgebra
determinant
0
votes
8
Combinational Circuits: Adders
A full adder circuit is implemented using 2input AND, OR gates; each of which takes 1 unit of delay. If inputs are also available in complements forms, what will be the delay of full adder (in units)?
answered
Aug 4
in
Digital Logic

42
views
0
votes
9
MadeEasy Full Length Test 2019: Digital Logic  Number Representation
The $(r1)$'s complement of a number can be found using formula $(r^{n}r^{m}N)$ where $r$ is base of the number $N$ having $n$ digits and $m$ digits in integral an fraction part respectively. We have been ... $(iv) 517.67$ How many $(r  1)'s$ complement of above decimal numbers can be calculated using mentioned formula?
answered
Aug 4
in
Digital Logic

83
views
digitallogic
numberrepresentation
madeeasytestseries
madeeasytestseries2019
+1
vote
10
GATE2014247
The product of the nonzero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$
answered
Jul 24
in
Linear Algebra

10.1k
views
gate20142
linearalgebra
eigenvalue
normal
numericalanswers
0
votes
11
Michael Sipser Edition 3 Exercise 1 Question 55 (Page No. 91)
The pumping lemma says that every regular language has a pumping length $p,$ such that every string in the language can be pumped if it has length $p$ or more. If $p$ is a pumping length for language $A,$ so is any length $p^{'}\geq p.$ The minimum pumping ... $\epsilon$ $1^{*}01^{*}01^{*}$ $10(11^{*}0)^{*}0$ $1011$ $\sum^{*}$
answered
Jul 14
in
Theory of Computation

46
views
michaelsipser
theoryofcomputation
regularlanguages
pumpinglemma
proof
descriptive
0
votes
12
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?
answered
Jul 14
in
Combinatory

2.4k
views
permutationandcombination
counting
0
votes
13
Michael Sipser Edition 3 Exercise 2 Question 30 (Page No. 157)
Use the pumping lemma to show that the following languages are not context free$.$ $\{0^{n}1^{n}0^{n}1^{n}\mid n\geq 0\}$ $\{0^{n}\#0^{2n}\#0^{3n}\mid n\geq 0\}$ $\{w\#t\mid w$ $\text{ is a substring of}$ $ t,$ $\text{where}$ ... $\text{each}$ $ t_{i}\in\{a,b\}^{*},$ $\text{and}$ $ t_{i}=t_{j}$ $\text{ for some}$ $ i\neq j\}$
answered
Jul 13
in
Theory of Computation

38
views
michaelsipser
theoryofcomputation
contextfreelanguages
pumpinglemma
0
votes
14
MADEEASY
Consider a set S={1000,1001,1002........,9999}. The numbers in set S having atleast one digit as 2 and atleast one digit as 5 are?
answered
Jul 11
in
Combinatory

265
views
counting
0
votes
15
Kenneth Rosen Edition 6th Exercise 7.5 Question 3 e (Page No. 507)
Which of these relations on the set of all functions from Z to Z are equivalence relations? Determine the properties of an equivalence relation that the others lack. {(f, g)  f(0) = g(1) and f(1) = g(0)} In many ... made to check the reflexive property. Why can't we check f(0)=f(0) to confirm the reflexive property. Please help.
answered
Jul 5
in
Set Theory & Algebra

74
views
discretemathematics
kennethrosen
+2
votes
16
UGCNETJune2019II22
Consider the following Ccode fragment running on a $32$bit $X86$ machine: typedef struct { union { unsigned char a; unsigned short b; } U; unsigned char c; }S; S B[10]; S*p=&B[4]; S*q=&B[5]; p → U.b=0x1234; /* structure S takes 32bits */ If M is the value of $qp$ ... $(M,N)$ is $(1,1)$ $(3,2)$ $(1,2)$ $(4,4)$
answered
Jul 3
in
Programming

391
views
ugcnetjune2019ii
programminginc
+1
vote
17
UGCNETJune2019II24
Consider the following C++ function f(): unsigned int f(unsigned int n) { unsigned int b=0; while (n) { b+=n & 1; n>>1; } return b; } The function f() returns the int that represents the ____P____ in the binary representation of positive integer n, where P is number of $0$’s number of bits number of consecutive $1$’s number of $1$’s
answered
Jul 2
in
Object Oriented Programming

164
views
ugcnetjune2019ii
programminginc
+1
vote
18
UGCNETJune2019II20
Suppose that a computer program takes $100$ seconds of execution time on a computer with multiplication operation responsible for $80$ seconds of this time. How much do you have to improve the speed of the multiplication operation if you are asked to execute this program four times faster? $14$ times faster $15$ times faster $16$ times faster $17$ times faster
answered
Jul 2
in
CO and Architecture

238
views
ugcnetjune2019ii
0
votes
19
Kenneth Rosen Edition 7th Exercise 2.1 Question 23 (Page No. 126)
How many elements does each of these sets have where $a$ and $b$ are distinct elements? $P (\left \{a,b, \left \{a,b \right \} \right \})$ $P\left \{ \phi, a, \left \{ a \right \},\left \{ \left \{ a \right \} \right \}\right \}$ $P(P(\phi ))$
answered
Jul 1
in
Set Theory & Algebra

20
views
kennethrosen
discretemathematics
settheory&algebra
+2
votes
20
Kenneth Rosen Edition 7th Exercise 2.1 Question 24 (Page No. 126)
Determine whether each of these sets is the power set of a set, where $a$ and $b$ are distinct elements. $\phi$ $\left \{ \phi ,\left \{ a \right \} \right \}$ $\left \{ \phi ,\left \{ a \right \},\left \{ \phi ,a \right \} \right \}$ $\left \{ \phi ,\left \{ a \right \},\left \{ b \right \},\left \{ a,b \right \} \right \}$
answered
Jul 1
in
Set Theory & Algebra

21
views
kennethrosen
discretemathematics
settheory&algebra
+2
votes
21
Cormen Edition 3 Exercise 8.3 Question 4 (Page No. 200)
Show how to sort $n$ integers in the range $0$ to $n^31$ in $O(n)$ time.
answered
Jun 30
in
Algorithms

54
views
cormen
algorithms
sorting
radixsort
descriptive
0
votes
22
Kenneth Rosen: Counting13
How many bit strings with length not exceeding $n$ ,where n is a positive integer ,consist entirely of $1's?$
answered
Jun 25
in
Combinatory

89
views
counting
discretemathematics
0
votes
23
ISI2018MMA17
There are eight coins, seven of which have the same weight and the other one weighs more. In order to find the coin having more weight, a person randomly chooses two coins and puts one coin on each side of a common balance. If these two coins are found to have the same ... as before. The probability that the coin will be identified at the second draw is $1/2$ $1/3$ $1/4$ $1/6$
answered
Jun 20
in
Probability

58
views
isi2018mma
engineeringmathematics
probability
0
votes
24
ISI2018MMA18
Let $A_1 = (0, 0), A_2 = (1, 0), A_3 = (1, 1)\ $and$\ A_4 = (0, 1)$ be the four vertices of a square. A particle starts from the point $A_1$ at time $0$ and moves either to $A_2$ or to $A_4$ with equal probability. Similarly, in each of the subsequent ... $T$ be the minimum number of steps required to cover all four vertices. The probability $P(T = 4)$ is $0$ $1/16$ $1/8$ $1/4$
answered
Jun 20
in
Probability

47
views
isi2018mma
engineeringmathematics
probability
0
votes
25
ISI2019MMA22
A coin with probability $p (0 < p < 1)$ of getting head, is tossed until a head appears for the first time. If the probability that the number of tosses required is even is $2/5$, then the value of $p$ is $2/7$ $1/3$ $5/7$ $2/3$
answered
Jun 20
in
Probability

141
views
isi2019mma
probability
+1
vote
26
TIFR2015A12
Consider two independent and identically distributed random variables $X$ and $Y$ uniformly distributed in $[0, 1]$. For $\alpha \in \left[0, 1\right]$, the probability that $\alpha$ max $(X, Y) < XY$ is $1/ (2\alpha)$ exp $(1  \alpha)$ $1  \alpha$ $(1  \alpha)^{2}$ $1  \alpha^{2}$
answered
Jun 19
in
Probability

267
views
tifr2015
probability
randomvariable
uniformdistribution
0
votes
27
TIFR2013A5
The late painter Maqbool Fida Husain once coloured the surface of a huge hollow steel sphere, of radius $1$ metre, using just two colours, Red and Blue. As was his style however, both the red and blue areas were a bunch of highly irregular disconnected regions. The late ... $11 sq. metres$; None of the above.
answered
Jun 17
in
Numerical Ability

771
views
tifr2013
geometry
numericalability
+1
vote
28
TIFR2015A15
Let $A$ and $B$ be nonempty disjoint sets of real numbers. Suppose that the average of the numbers in the first set is $\mu_{A}$ and the average of the numbers in the second set is $\mu_{B}$; let the corresponding variances be $v_{A}$ and $v_{B}$ ... $p.v_{A}+ (1  p). v_{B} + (\mu_{A} \mu_{B})^{2}$
answered
Jun 16
in
Numerical Ability

288
views
tifr2015
statistics
0
votes
29
Michael Sipser Edition 3 Exercise 1 Question 38 (Page No. 89)
An $\text{allNFA}$ $M$ is a $\text{5tuple}$ $(Q, Σ, δ, q_{0}, F)$ that accepts $x\in\sum^{*}$ if every possible state that $M$ could be in after reading input $x$ is a state from $F.$ Note ... string if some state among these possible states is an accept state$.$ Prove that $\text{allNFAs}$ recognize the class of regular languages$.$
answered
Jun 15
in
Theory of Computation

40
views
michaelsipser
theoryofcomputation
finiteautomata
nfa
regularlanguages
0
votes
30
Lexical Analysis: Self Doubt
The above diagram is Transition Diagrams for identifiers. As we can see that the identifier is said to be accepted if it starts with a letter and ends with a valid delimiter, which includes blank symbol, arithmetic, logical operator, left parenthesis, right ... with a delimiter and + is a valid delimiter and the error in declaration will not be detected at this stage...
answered
Jun 9
in
Compiler Design

207
views
compilerdesign
lexicalanalysis
tokens
compilertokenization
0
votes
31
AlgorithmSelf Doubt
How in a heap there are at most $\lceil \frac{n}{2^{h+1}} \rceil$ nodes of height h.
answered
Jun 6
in
Algorithms

58
views
algorithms
selfdoubt
0
votes
32
Stallings 6e Exercise11.10 (page number539) I/O Management
A 32bit computer has two selector channels and one multiplexor channel. Each selector channel supports two magnetic disk and two magnetic tape units. The multiplexor channel has two line printers, two card readers, and ten VDT terminals ... reader 1.2 Kbytes/s VDT 1 Kbytes/s Estimate the maximum aggregate I/O transfer rate in this system
answered
Jun 5
in
Operating System

67
views
descriptive
operatingsystem
disks
filesystem
coandarchitecture
0
votes
33
GATE 2019:EC
The value of integral $\int_{0}^{\pi }\int_{y}^{\pi }\frac{\sin x}{x}dxdy$ is equal to_________
answered
Jun 3
in
Linear Algebra

82
views
discretemathematics
+3
votes
34
Compiler design Self doubt
S → aSbS /bSaS / ϵ S → aABb A→ c/ ϵ B → d/ ϵ Which of the following is LL1. Explain in details.
answered
Jun 1
in
Compiler Design

81
views
compilerdesign
ll1parser
parsing
syntaxdirectedtranslation
+1
vote
35
TIFR2011A1
If either wages or prices are raised, there will be inflation. If there is inflation, then either the government must regulate it or the people will suffer. If the people suffer, the government will be unpopular. Government will not be unpopular. Which of the ... are not raised Prices are not raised If the inflation is not regulated, then the prices are not raised Wages are not raised
answered
May 31
in
Mathematical Logic

761
views
tifr2011
mathematicallogic
normal
logicalreasoning
+2
votes
36
TIFR2010A4
If the bank receipt is forged, then Mr. M is liable. If Mr. M is liable, he will go bankrupt. If the bank will loan him money, he will not go bankrupt. The bank will loan him money. Which of the following can be concluded from the above statements? Mr. M is liable The receipt is not forged Mr. M will go bankrupt The bank will go bankrupt None of the above
answered
May 31
in
Mathematical Logic

537
views
tifr2010
logicalreasoning
mathematicallogic
+1
vote
37
Kenneth Rosen Edition 7th Exercise 1.4 Question 47 (Page No. 56)
Establish these logical equivalences, where $x$ does not occur as a free variable in $A$. Assume that the domain is nonempty. $(\forall x P(x)) \wedge A \equiv \forall x (P(x) \wedge A)$ $(\exists x P(x)) \wedge A \equiv \exists x (P(x) \wedge A)$
answered
May 30
in
Mathematical Logic

41
views
kennethrosen
discretemathematics
mathematicallogic
propositionallogic
+4
votes
38
GateForum Question Bank :Graph Theory
What is the probability that there is an edge in an undirected random graph having 8 vertices? 1 1/8
answered
May 20
in
Graph Theory

147
views
graphtheory
discretemathematics
0
votes
39
#probability(self doubt)
An automobile showroom has 10 cars, 2 of which are defective. If you are going to buy the 6th car sold that day at random, then the probability of selecting a defective car is??
answered
May 13
in
Combinatory

50
views
probability
+4
votes
40
ISI2018MMA26
Let $C_i(i=0,1,2...n)$ be the coefficient of $x^i$ in $(1+x)^n$.Then $\frac{C_0}{2} – \frac{C_1}{3}+\frac{C_2}{4}\dots +(1)^n \frac{C_n}{n+2}$ is equal to $\frac{1}{n+1}\\$ $\frac{1}{n+2}\\$ $\frac{1}{n(n+1)}\\$ $\frac{1}{(n+1)(n+2)}$
answered
May 11
in
Combinatory

138
views
isi2018mma
engineeringmathematics
discretemathematics
generatingfunctions
Page:
1
2
3
4
5
6
...
26
next »
50,645
questions
56,596
answers
195,825
comments
102,087
users