Dark Mode

Recent activity by Dknights

2 answers

1

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 49
Consider a $2 \times 2$ matrix M. Which of the following are NOT POSSIBLE for the system of equations $M x=p?$ no solutions for some but not all $\vec{p}$; exactly one solution for all other $\vec{p}$ exactly one solution for ... some $\vec{p}$, exactly one solution for some $\vec{p}$ and more than one solution for some $\vec{p}$

commented in Linear Algebra Feb 7

524 views

0 answers

2

#self doubt
Can someone please verify it ? isn't should be 8. https://www.toppr.com/ask/question/the-cardinality-of-the-power-set-of-left-phi-left-phiright-left-phi-left/ Let S={ϕ,{ϕ},{ϕ,{ϕ}}} P(s)= Power Set of set S P(s)={ϕ,{ϕ},{ϕ,{ϕ}},{ϕ,{ϕ,{ϕ}}},{{ϕ},{ϕ,{ϕ}}},{ϕ,{ϕ},{ϕ,{ϕ}}}} n(P(s))=6.

asked in Set Theory & Algebra Feb 6

115 views

1 answer

3

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 29
The largest positive number in 2's complement format represented with 8-bits is: $(\mathrm{FF})_{16}$ $(128)_{10}$ $(777)_8$ $(01111111)_2$

commented in Digital Logic Feb 6

456 views

1 answer

4

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 26
Which attributes in the following grammar are synthesized? A.a B.b B.x C.c

commented in Compiler Design Feb 6

775 views

1 answer

5

#self doubt
In the above figure, how many topological sorts are possible, I tried the following method, if we include 5 _ _ _ _ _ for 5 space 5c3 for (2,3,1) then 2 position is 4,0 so a total of 10 if we do like 4 5 _ _ _ _ then only ... GFG the total possible sorts are 13 can someone why this difference is coming ? https://www.geeksforgeeks.org/all-topological-sorts-of-a-directed-acyclic-graph/

commented in Graph Theory Feb 1

133 views

1 answer

6

#self doubt
Can someone please explain the following case of combination I means identical D means different DOIB with boxes being empty and non empty As in this question the given value in question itself i am not able to interpret. https://gateoverflow.in/420251/go-classes-test-series-2024-mock-gate-test-12-question-17

answer selected in Combinatory Jan 31

195 views

0 answers

7

#self doubt
Can someone please explain how to calculate TLB size?

asked in Operating System Jan 19

145 views

0 answers

8

#self doubt
Can someone please explain why no of lineary independent solutions are n-r .… My confusion is if in 3*3 Matrix rank is 2 means 2 lineary independent rows right? How solution is getting calculated as 3-2=1?

asked in Linear Algebra Jan 10

56 views

1 answer

9

#self doubt
a^n ww^r a^n .. (n>=0, w belongs to (a,b)*) Can someone please explain the flow how we will process the language in CFL.

edited in Theory of Computation Jan 9

89 views

1 answer

10

#self doubt
I found this statement in math blog.....can anyone please help on this… For a upper triangular Matrix I tried to derive with Eigen values as 1,2,0,0,0 for 5*5 but I am not getting rank as 2 for this Matrix.

commented in Linear Algebra Jan 7

106 views

0 answers

11

#self doubt
Are these topics in the Gate 2024 syllabus? clocks, simple interest, time work, profit loss, and some other quantitative aptitude topics I found it in some mock tests.

asked in Quantitative Aptitude Jan 6

83 views

1 answer

12

#Applied Course
Please explain this.

asked in Theory of Computation Jan 4

107 views

0 answers

13

#Applied Course
what should be correct according to gate PYQs?

asked in Operating System Jan 4

100 views

2 answers

14

GATE CSE 2022 | Question: 17
Which of the following statements is/are $\text{TRUE}$ for a group $\textit{G}?$ If for all $x,y \in \textit{G}, \; (xy)^{2} = x^{2} y^{2},$ then $\textit{G}$ is commutative. If for all $x \in \textit{G}, \; x^{2} = 1,$ then ... $2,$ then $\textit{G}$ is commutative. If $\textit{G}$ is commutative, then a subgroup of $\textit{G}$ need not be commutative.

commented in Set Theory & Algebra Jan 3

7.4k views

1 answer

15

commented in Algorithms Jan 2

159 views

0 answers

16

#self doubt
Telephone calls arrive at an exchange according to the Poisson process at a rate λ= 2/min. Calculate the probability that exactly two calls will be received during each of the first 5 minutes of the hour. the given solution is: Assume that N is the number of calls received during 1 ... 5) = 32 x e-10 P(M =5) = 0.00145, where e is a constant, which is approximately equal to 2.718.

edited in Probability Dec 30, 2023

434 views

1 answer

17

#Applied Course
How I2-I4 is counted?

asked in CO and Architecture Dec 29, 2023

127 views

2 answers

18

#self doubt
Two boys start running from a point on an oval track at the same time in the same direction. The first boy takes 18 minutes to run one lap and the second boy takes 12 minutes to run a lap. How many minutes after the start will the faster boy have a two-laps lead over the slower boy? The given answer is 72.

asked in Quantitative Aptitude Dec 29, 2023

250 views

0 answers

19

#Applied Course
Assume the scenario of AIMD where the size of the congestion window of a TCP connection is 40KB when a timeout occurs, the initial threshold is 38 KB. The MSS is 2KB. At which transmission after a timeout the sender window reaches 20 KB? The given ... line At which transmission after a timeout the sender window reaches 20 KB? we need to count from starting or after timeout?

asked in Computer Networks Dec 28, 2023

166 views

1 answer

20

#self doubt
In the following question common lcs numbers are 4 so first 3 option should be correct or only first...there is no only written in 2,3 like only 2 or 3 so we can mark 2,3 option also?

commented in Algorithms Dec 28, 2023

146 views

1 answer

21

#Applied Course
I think 3rd option is right but they mentioned The binary representation of -39 is : 1011001 2's complement of 1011001 will be: 1's complement of 1011001 + 1 => 0100110 + 1 = 0100111 = 39

asked in Digital Logic Dec 24, 2023

138 views

0 answers

22

#self doubt
The following key values are inserted into a B+ tree, where order of the internal node is 5 and order of leaf node is 4. The order of the internal node is the maximum number of tree pointers in each node. The maximum number of times leaf nodes would get split up as a result if the insertion sequence is: 3, 10, 12, 14, 29, 38, 45, 55, 60

asked in Databases Dec 24, 2023

104 views

2 answers

23

#self doubt
MIN DFA of {w: w contains an even number of 0s and exactly two 1s} MIN DFA of {w: w contains an even number of 0s or exactly two 1s} ex 111 is valid

edited in Theory of Computation Dec 23, 2023

160 views

1 answer

24

#self doubt
How many skew symmetric matrices are possible with a number set = [-2,-1,1,2,3,4,0] 0 can be used at most 3 times other numbers are allowed for repetition.

asked in Linear Algebra Dec 22, 2023

116 views

0 answers

25

#self doubt
If [dn,/] is a lattice, then x=n/x for all x belongs to dn

asked in Set Theory & Algebra Dec 21, 2023

70 views

1 answer

26

#Applied Course
Consider the below-given statements about the transactions where L-Si(X) indicates that transaction Ti acquires a shared lock on X. L-Xi(X) indicates that transaction Ti acquires an exclusive lock on X. Ui indicates that transaction Ti releases its lock on X. I. The schedule S: L-S1(X); R1( ... ;U1(Y); L-X2(Y); W2(Y); R2(X); U2(X); C2; U2(Y); Is generated by both 2PL and strict-2PL.

asked in Databases Dec 19, 2023

145 views

1 answer

27

#Applied Course
Consider a demand-paging system with a paging disk that has an average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond per memory access. Thus, each memory reference ... of the total) cause page faults. The effective memory access time is _____ micro-seconds (Round off to 1 decimal place)

asked in Operating System Dec 18, 2023

193 views

1 answer

28

#Applied Course
In a variant of quick sort, the n/10th smallest element is selected in every recursive call using a Θ(n) time algorithm, which is the worst-case time complexity for this sorting algorithm. T(n)=T(n/10)+T(9n/10)+O(n) This is what I tried according ... is getting calculated by o(n) in every recursive call can someone clarify this line what will be the effect of this on an algorithm?

asked in Algorithms Dec 16, 2023

184 views

0 answers

29

asked in Digital Logic Dec 15, 2023

173 views

0 answers

30

Find the MIS and MaxIS

asked in Graph Theory Dec 14, 2023

138 views