# Recent activity by Deepanshu

1
What is the minimum number of $2$-input NOR gates required to implement a $4$ -variable function expressed in sum-of-minterms form as $f=\Sigma(0,2,5,7, 8, 10, 13, 15)?$ Assume that all the inputs and their complements are available. Answer: _______
2
Can anyone pls write about ISRO cut off for CSE in GEN and OBC category?
3
What will be the answer to this question ? Will it go in infinite loop ?
4
question about spanning tree? both option are correct or only first
5
Consider the following statements. (i) In max Heap smallest element is at the leaf node. (ii) In max Heap second largest element always the child of root. (iii) Binary search tree can be constructed from max heap in θ(n). (iv) Max Heap can be build from Binary search tree in θ(n) Which of the above option is ... (ii) and (iii) (b) (i), (ii) and (iv) (c) (ii), (iii) and (iv) (d) (i), (iii) and (iv)
6
Hi everyone! I've been recently asked by one of my friends to prove an equation but still, I'm confused how to get it started tho. log(n!) = Ω(nlog(n)) Does anyone know how to help? I'll be very grateful if someone comes to reply to my issue. Thanks in advance.
7
there was a question of apti inwhich teachers represented as traingles educationries as circle what is the answer of that ques ?
8
From a complete binary tree T of 8 leaf nodes, two leaf nodes a and b are selected randomly and uniformly. What is the expected distance between a and b in T?
9
The expenditure ______ as follows ...… Break down or breaks down
10
In Os questions related to first fit,next fit etcv if nothing is given which partition scheme do we assume.Fixed or variable
11
Minimum number of registers required by an optimal code generation algorithm (intermediate results can be stored in memory). And if possible solve it using Sethi-Ullman Algorithm?
12
Q.The number of ways, we can arrange 5 books in 3 shelves ________.
13
Let L = { (a^p)* | p is prime number } and input is {a} . what is minimum number of state in NFA and DFA ?
14
Regural CFL CSL Recursive
15
A UNIX style i-node has 15 direct pointers and one single, one double and one triple indirect pointers. The disk block size is 1KB, disk block address is 64 bits and 48 bit integers are used. What is the maximum possible fize size in bytes? Thanks!
16
Let say L1 is Dcfl and L2=~L1(~ is complement L=L1 Intersection L2 What is L??
17
What are the most common mistakes you have made in tests? A good list will help aspirants reduce their mistakes in GATE. Just listing out some common ones. Missing the NOT in question - our eyes have a tendency to focus on important words and miss the NOT ... you avoid many calculation mistakes. In any formula you do, you must get the correct unit for the result Please add more as answers.
18
19
Consider the following schedule $\text{S : r2(A), w1(B), w1(C), R3(B), r2(B), r1(A), commit_1, r2(C), commit_2, w3(A), commit_3 }$ Consider the following statements : S1 : Schedule(S) is conflict serializable schedule. S2 : Schedule(S) is allowed by 2PL. S3 : Schedule(S) is strict recoverable schedule. S4 : Schedule(S) is allowed by strict 2PL. How many above statements true about schedule(S) ?
20
Consider the system which has virtual address of 36 bits and physical address of 30 bits and page size of 8 KB, page table entry contain 1 valid bit, 2 protection bit and 1 reference bit. Then the approximate page table size in (MB) is ________.
21
Consider a binary tree where for every node ⏐P - Q⏐ ≤ 2. P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for h > 0. The minimum number of nodes present in such binary tree of ... THEY NEED THAT NODE AT RIGHT SUBTREE DIDNT GET THAT ( 3RD NODE AT 2ND LEVEL WHY IS THAT THERE I THINK WITHOUT IT WE ARE SATISYING CONDITIONS
22
THEY GIVE OPTIONS ARE 0 1 2 3 WHAT I DO WAS I PUT P=8,Q=4,R=2 AND X=16 AND THEN GET RESULT ACCORDING TO THAT AND MY RESULT WAS CLOSE TO 1 BUT THEY ARE GIVING ANSWER 0 BY SOME THEOREM WHICH I DONT KNOW CORRECT OR NOT anyones result 0 plzz prove that
23
What is the difference between regular intersection and intersection? (I found out that CFL is closed under regular intersection but not under intersection) Thanks!
24
Consider the following relation: R (ABCDEF) F = {AB → C, BC → A, AC → B, B → D, C → E} The minimum number of relations required which satisfy BCNF, lossless join decomposition and dependency preserving decomposition are ________.
25
26
{w/w€{0,1}^*; w has equal no. of occurrance of ‘001 and ‘010’} is regular or not??