Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by 2019_Aspirant
1
votes
1
GATE Overflow | Mock GATE | Test 1 | Question: 65
Consider the following operators used in an arbitrary regular expression parsing. (In all the below statements, capital letters denote the operator. Ignore quotes.) 'xPy' denotes a double occurrence of either x or y. ... Which of the following strings does not belong to the above given regular expression? bbaaabba baaabb bbbaaaa baabbaaaa
Consider the following operators used in an arbitrary regular expression parsing.(In all the below statements, capital letters denote the operator. Ignore quotes.)'xPy' d...
1.2k
views
answered
Jan 13, 2019
Theory of Computation
go-mockgate-1
theory-of-computation
regular-expression
+
–
2
votes
2
TIFR CSE 2019 | Part A | Question: 8
Consider the following toy model of traffic on a straight , single lane, highway. We think of cars as points, which move at the maximum speed $v$ ... the following graphs most accurately captures the relationship between the speed $v$ and the density $\rho$ in this model ?
Consider the following toy model of traffic on a straight , single lane, highway. We think of cars as points, which move at the maximum speed $v$ that satisfies the follo...
1.2k
views
answered
Dec 19, 2018
Quantitative Aptitude
tifr2019
quantitative-aptitude
speed-time-distance
non-gate
+
–
0
votes
3
TIFR CSE 2019 | Part A | Question: 3
$A$ is $n \times n$ square matrix for which the entries in every row sum to $1$. Consider the following statements: The column vector $[1,1,\ldots,1]^T$ is an eigen vector of $A.$ $ \text{det}(A-I) = 0.$ $\text{det}(A) = 0.$ Which of the above statements must be ... Only $(i)$ Only $(ii)$ Only $(i)$ and $(ii)$ Only $(i)$ and $(iii)$ $(i),(ii) \text{ and }(iii)$
$A$ is $n \times n$ square matrix for which the entries in every row sum to $1$. Consider the following statements:The column vector $[1,1,\ldots,1]^T$ is an eigen vector...
3.2k
views
answered
Dec 19, 2018
Linear Algebra
tifr2019
engineering-mathematics
linear-algebra
eigen-value
+
–
0
votes
4
Kenneth Rosen Edition 6th Exercise 7.1 Question 23 (Page No. 458)
Find a recurrence relation for the number of bit strings of length n that contains a pair of consecutive 0s
Find a recurrence relation for the number of bit strings of length n that contains a pair of consecutive 0s
473
views
answered
Dec 15, 2018
Combinatory
kenneth-rosen
discrete-mathematics
recurrence-relation
+
–
6
votes
5
GATE CSE 1994 | Question: 20
A grammar $G$ is in Chomsky-Normal Form (CNF) if all its productions are of the form $A \to BC$ or $A \to a$, where $A,B$ and $C$, are non-terminals and $a$ is a terminal. Suppose $G$ is a CFG in CNF and $w$ is a string in $L(G)$ of length $n$, then how long is a derivation of $w$ in $G$?
A grammar $G$ is in Chomsky-Normal Form (CNF) if all its productions are of the form $A \to BC$ or $A \to a$, where $A,B$ and $C$, are non-terminals and $a$ is a terminal...
5.0k
views
answered
Dec 8, 2018
Compiler Design
gate1994
compiler-design
grammar
normal
descriptive
+
–
0
votes
6
GATE2018 CE-1: GA-10
Each of the letters arranged as below represents a unique integer from $1$ to $9.$ The letters are positioned in the figure such that $(A \times B \times C), (B \times G \times E)$ and $(D \times E \times F)$ are equal. Which integer among the following choices cannot be represented by the letters $A, B, C, D, E, F \ or \ G?$ A D B G E C F $4$ $5$ $6$ $9$
Each of the letters arranged as below represents a unique integer from $1$ to $9.$ The letters are positioned in the figure such that $(A \times B \times C), (B \times G ...
2.6k
views
answered
Dec 6, 2018
Analytical Aptitude
gate2018-ce-1
general-aptitude
analytical-aptitude
logical-reasoning
+
–
1
votes
7
GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into ...
48.8k
views
answered
Dec 4, 2018
Computer Networks
gatecse-2009
computer-networks
sliding-window
normal
isro2016
+
–
1
votes
8
Generating Function
What will be solution of this function for coefficient of $x^{100}$? $\frac{1}{\left ( 1-x^{10} \right )(1-x^{20})(1-x^{50})}$
What will be solution of this function for coefficient of $x^{100}$?$$\frac{1}{\left ( 1-x^{10} \right )(1-x^{20})(1-x^{50})}$$
1.7k
views
answered
Dec 3, 2018
Combinatory
generating-functions
discrete-mathematics
+
–
0
votes
9
GATE IT 2005 | Question: 82b
A database table $T_1$ has $2000$ records and occupies $80$ disk blocks. Another table $T_2$ has $400$ records and occupies $20$ disk blocks. These two tables have to be joined as per a specified join condition that needs to be evaluated for ... outer loop, the reduction in number of block accesses required for reading the data will be $0$ $30400$ $38400$ $798400$
A database table $T_1$ has $2000$ records and occupies $80$ disk blocks. Another table $T_2$ has $400$ records and occupies $20$ disk blocks. These two tables have to be ...
16.3k
views
answered
Nov 23, 2018
Databases
gateit-2005
databases
normal
joins
+
–
0
votes
10
Bijective function
Let R be set of all real numbers, and A = B = R*R A function A-> B is defined by f(a,b) = (a+b,a-b) How to prove it is a bijective function?
Let R be set of all real numbers, and A = B = R*RA function A- B is defined byf(a,b) = (a+b,a-b)How to prove it is a bijective function?
601
views
answered
Nov 9, 2018
Set Theory & Algebra
discrete-mathematics
functions
+
–
0
votes
11
Self doubt
No of JK / T FFs needed to design synchronous counter for sequence 1,4,2,3,1,4,2,3,1,4...
No of JK / T FFs needed to design synchronous counter for sequence 1,4,2,3,1,4,2,3,1,4...
849
views
answered
Nov 9, 2018
Digital Logic
digital-logic
digital-counter
+
–
0
votes
12
GATE CSE 1992 | Question: 07a
Consider the function $F(n)$ for which the pseudocode is given below : Function F(n) begin F1 ← 1 if(n=1) then F ← 3 else For i = 1 to n do begin C ← 0 For j = 1 to n – 1 do begin C ← C + 1 end F1 = F1 * C end F = F1 end [$n$ is a positive integer greater than zero] Derive a recurrence relation for $F(n)$.
Consider the function $F(n)$ for which the pseudocode is given below :Function F(n) begin F1 ← 1 if(n=1) then F ← 3 else For i = 1 to n do begin C ← 0 For j = 1 to ...
3.6k
views
answered
Oct 13, 2018
Algorithms
gate1992
algorithms
recurrence-relation
descriptive
+
–
1
votes
13
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$
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 pa...
16.8k
views
answered
Sep 6, 2018
Combinatory
gatecse-2004
combinatory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
