0 votes
1 answer
21
44. Evaluate each of these expressions. a) 1 1000 ∧ (0 1011 ∨ 1 1011) b) (0 1111 ∧ 1 0101) ∨ 0 1000 c) (0 1010 ⊕ 1 1011) ⊕ 0 1000 d) (1 1011 ∨ 0 1010) ∧ (...
0 votes
0 answers
22
Got call letter for IISC CSA Ph.D interview. Requesting you to share preparation tips or sample interview/test questions. Thank you
1 votes
1 answer
25
0 votes
1 answer
28
0 votes
2 answers
29
Construct a DFA with minimum number of states, accepting all strings over {a, b} such that the number of a’s is divisible by three and the number of b’s is divisible ...
0 votes
0 answers
31
0 votes
0 answers
33
directed acyclic graph(DAG)is a simplified step from the AST. Solve the following expressions by AST and DAG: X=(((a+a))+((a+a)+(a+a)))
1 votes
0 answers
34
1 votes
0 answers
38
1. Generate intermediate code for the following code segment. a) (x<y) and (y>z) and not z b) if(i%2==0)evensum=evensum+elseoddsum=oddsum+i;
0 votes
0 answers
39
Design a circuit with 4 inputs that has outputs with a binary value equal to the number of inputs that are HIGH.
0 votes
0 answers
40