Dark Mode

Recent activity by parth023

1 answer

1

GATE CSE 1996 | Question: 2.10
The grammar whose productions are $\langle\text{stmt}\rangle \to\text{ if id then } \langle\text{stmt}\rangle$ $\langle\text{stmt}\rangle\to\text{ if id then } \langle\text{stmt}\rangle\text{ else } \langle\text{stmt}\rangle$ ... f has more than two parse trees (d) the sentence if a then if b then c:= d else c:= f has two parse trees

commented in Compiler Design Jan 27

5.5k views

0 answers

2

Decidability
L(M)={0} We can have Tyes for {0} and Tno for Σ∗ ({0}⊂Σ∗{0}⊂Σ∗). Hence, L={M ∣ L(M)={0}} is not Turing recognizable (not recursively enumerable) I don’t understand why this is not decidable. We can easily create a turing that accepts this language

commented in Theory of Computation Dec 30, 2023

244 views

0 answers

3

Made Easy: Counting number of subgraphs of the given graph. How should I approach this question?

commented in Graph Theory Dec 18, 2023

532 views

10 answers

4

GATE CSE 2007 | Question: 80
Consider a machine with a byte addressable main memory of $2^{16}$ bytes. Assume that a direct mapped data cache consisting of $32$ lines of $64$ bytes each is used in the system. A $50 \times 50$ two-dimensional array of bytes is stored in the main ... data cache do not change in between the two accesses. How many data misses will occur in total? $48$ $50$ $56$ $59$

commented in CO and Architecture Dec 16, 2023

32.4k views

1 answer

5

Made Easy Test Series 2024
anyone explain why option B is wrong?

commented in Mathematical Logic Dec 15, 2023

350 views

0 answers

6

Mathematical logic

commented in Mathematical Logic Dec 13, 2023

279 views

1 answer

7

calculus
How do we solve this question: $\lim n \to \infty \sqrt{n^2 + n} - {\sqrt{n^2 +1}}$

commented in Mathematical Logic Nov 26, 2023

262 views

1 answer

8

madeeasy
The decimal equivalent of given 2’s complement number $(110101011.1101)_2$ is:

commented in Digital Logic Nov 6, 2023

385 views

0 answers

9

[Self Doubt] Conversion of SR-flipflop to T-flipflop
The standard approach for solving such problem is as follows: This approach gives us the equation for $S$ & $R$ in terms of $T, Q$ as $S = T\overline Q \qquad \to (1)$ $R = TQ \qquad \to (2)$ I tried using a different ... & $(7)$, we get $S=T\overline{Q}$ and $R=TQ$ which is consistent with the standard approach and maintains $SR=0$

commented in Digital Logic Nov 3, 2023

305 views

4 answers

10

GATE CSE 2017 Set 1 | Question: 21
Consider the Karnaugh map given below, where $X$ represents "don't care" and blank represents $0$. Assume for all inputs $\left ( a,b,c,d \right )$ ... . The above logic is implemented using $2$-input $\text{NOR}$ gates only. The minimum number of gates required is ____________ .

commented in Digital Logic Nov 2, 2023

14.1k views

7 answers

11

GATE CSE 2019 | Question: 30
Consider three $4$-variable functions $f_1, f_2$, and $f_3$, which are expressed in sum-of-minterms as $f_1=\Sigma(0,2,5,8,14),$ $f_2=\Sigma(2,3,6,8,14,15),$ $f_3=\Sigma (2,7,11,14)$ For the following circuit with one AND gate and one XOR gate the output function $f$ can be ... as: $\Sigma(7,8,11)$ $\Sigma (2,7,8,11,14)$ $\Sigma (2,14)$ $\Sigma (0,2,3,5,6,7,8,11,14,15)$

commented in Digital Logic Nov 2, 2023

14.3k views

2 answers

12

ACE TOC Test
Which of the following regular expression represent the set of all the strings not containing $100$ as a substring ? $0^*(1^*0)^*$ $0^*1010^*$ $0^*1^*01^*$ $0^*(10+1)^*$

commented in Theory of Computation Oct 30, 2023

406 views

1 answer

13

Can someone please explain how -170.6875 is the answer or it's mistake in test sereis

commented in Digital Logic Oct 25, 2023

293 views

1 answer

14

Made Easy
What is meant by refinement that has been asked in this following question?

commented in Set Theory & Algebra Oct 7, 2023

411 views

2 answers

15

Unknowm
If n = 15 × 30 × 45 × 60............1500, what will be the number of zeros at the end of n? a) 24 c) 67 b) 97 d) 24

comment edited in Quantitative Aptitude Sep 24, 2023

549 views

1 answer

16

number of min MSTs

commented in Algorithms Sep 11, 2023

209 views

1 answer

17

Made Easy Booklet
$x$ and $y$ are integers and if $\frac{x^2} {y^3}$ is an even integer then which of the following must be an even integer? $x - y$ $y + 1$ $\frac{x^2}{y^4}$ $xy$

commented in Quantitative Aptitude Sep 4, 2023

222 views

2 answers

18

physics wallah question
$L_1=a^ * b^ *$ $L_2=a^ + b^ +$ Find $L_2-L_1$: A. $a ^ *$ B. $b ^ *$ C. $a ^ * +b^ *$ D. None

commented in Theory of Computation Aug 26, 2023

401 views

1 answer

19

self doubts
What is the value of summation of n+$\frac{n}{2}$ + $\frac{n}{4}$ + …….+ 1 where n is an even positive integer ?

comment edited in Quantitative Aptitude Aug 25, 2023

536 views

2 answers

20

Made Easy Book
114

commented in Theory of Computation Aug 22, 2023

350 views

0 answers

21

Are GO Classes good ? Reviews from enrolled students preferred.
How do you rate the classes for those subjects ? I would not be in doubt if there were demo lectures for subjects other than maths.

commented in Study Resources Aug 21, 2023

323 views

1 answer

22

TIFR CSE 2023 | Part B | Question: 8
Let $U$ be a finite set and let $h$ be a function mapping $U \times U$ to $U$. Consider the following process that assigns values to all nodes of a complete binary tree with $128$ leaves. Initially, the leaf nodes are assigned arbitrary values from $U$ ... algorithm need to recompute $h$ in order to obtain the correct value of the tree? $7$ $8$ $53$ $127$ $255$

commented in DS Aug 18, 2023

523 views

0 answers

23

isi 2022 PCB
Let B be a binary search tree (BST) on eight nodes filled with the following set of eight integer keys A = {10, 2, 5, 3, 20, 15, 9, 22}. The order in which these keys were inserted to create B is not known. However, it is ... construct and depict pictorially four possible BSTs each of which requires 36 comparisons to check the presence of all the eight keys in A. Justify your answer

comment edited in Programming in C Aug 12, 2023

355 views

1 answer

24

Regular Expresssion I need help in this ??

commented in Theory of Computation Aug 9, 2023

290 views

3 answers

25

GATE CSE 2023 | Question: 38
Let $U=\{1,2, \ldots, n\},$ where $n$ is a large positive integer greater than $1000.$ Let $k$ be a positive integer less than $n$. Let $A, B$ be subsets of $U$ with $|A|=|B|=k$ and $A \cap B=\emptyset$. We say that a permutation of $U$ separates $A$ from $B$ if ... $2\left(\begin{array}{c}n \\ 2 k\end{array}\right)(n-2 k) !(k !)^{2}$

commented in Combinatory Aug 3, 2023

6.3k views

4 answers

26

GATE CSE 2023 | Question: 5
The Lucas sequence $L_{n}$ is defined by the recurrence relation: \[ L_{n}=L_{n-1}+L_{n-2}, \quad \text { for } \quad n \geq 3, \] with $L_{1}=1$ and $L_{2}=3$ ... $L_{n}=\left(\frac{1+\sqrt{5}}{2}\right)^{n}-\left(\frac{1-\sqrt{5}}{2}\right)^{n}$

commented in Combinatory Aug 3, 2023

7.8k views

3 answers

27

Sachin Mittal Sir's course on GO Classes
It is given that m < n lets consider m = 4 and n = 5. If rank(A) = n, this means no of linearly independent columns in A are 5, but we cannot have 5 linearly independent vectors in R4. Where is the problem ?

commented in Linear Algebra Aug 3, 2023

453 views

1 answer

28

Arrays || C Programming
# include <stdio.h> void print(int arr[]) { int n = sizeof(arr)/sizeof(arr[0]); int i; for (i = 0; i < n; i++) printf("%d ", arr[i]); } int main() { int arr[] = {1, 2, 3, 4, 5, 6, 7, 8}; print(arr); return 0; } On GFG output is 1 2 I can’t understand the solution. Help would be appreciated!!

commented in Programming in C Jul 29, 2023

1.2k views

3 answers

29

Practice Test Series Question

comment edited in Theory of Computation Jul 18, 2023

716 views

3 answers

30

Rosen chapter 5.5 question 50
How many ways are there to distribute 5 distinguishable objects into three indistinguishable boxes?

comment edited in Mathematical Logic Jun 28, 2023

1.8k views