Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Deepanshu
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Deepanshu
11
answers
1
GATE CSE 2019 | Question: 50
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: _______
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)?$ ...
30.1k
views
commented
Feb 5, 2019
Digital Logic
gatecse-2019
numerical-answers
digital-logic
canonical-normal-form
2-marks
+
–
1
answer
2
ISRO 2019
Can anyone pls write about ISRO cut off for CSE in GEN and OBC category?
Can anyone pls write about ISRO cut off for CSE in GEN and OBC category?
1.2k
views
commented
Feb 5, 2019
GATE
isro19
+
–
0
answers
3
GATE 2019
What will be the answer to this question ? Will it go in infinite loop ?
What will be the answer to this question ?Will it go in infinite loop ?
1.3k
views
commented
Feb 4, 2019
Digital Logic
usergate2019
usermod
+
–
0
answers
4
gate 2019
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 ... ) and (iii) (b) (i), (ii) and (iv) (c) (ii), (iii) and (iv) (d) (i), (iii) and (iv)
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 sear...
2.0k
views
commented
Feb 4, 2019
1
answer
5
Mid exam
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.
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 ho...
429
views
commented
Feb 3, 2019
Study Resources
log
question
factorial
+
–
1
answer
6
gate dummy question
there was a question of apti inwhich teachers represented as traingles educationries as circle what is the answer of that ques ?
there was a question of apti inwhich teachers represented as traingles educationries as circle what is the answer of that ques ?
1.2k
views
commented
Feb 3, 2019
2
answers
7
gate 2019
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?
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?
2.4k
views
commented
Feb 3, 2019
1
answer
8
Gate 19
The expenditure ______ as follows ...… Break down or breaks down
The expenditure ______ as follows ...…Break down or breaks down
2.5k
views
commented
Feb 3, 2019
0
answers
9
First fit,Next fit assumptions
In Os questions related to first fit,next fit etcv if nothing is given which partition scheme do we assume.Fixed or variable
In Os questions related to first fit,next fit etcv if nothing is given which partition scheme do we assume.Fixed or variable
383
views
commented
Jan 30, 2019
1
answer
10
Made easy test series
The 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.
The 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-Ullm...
1.5k
views
commented
Jan 30, 2019
Compiler Design
compiler-design
code-generation
made-easy-test-series
numerical-answers
+
–
3
answers
11
MadeEasy Subject Test 2019: Combinatory - Permutations And Combinations
Q.The number of ways, we can arrange 5 books in 3 shelves ________.
Q.The number of ways, we can arrange 5 books in 3 shelves ________.
2.9k
views
commented
Jan 29, 2019
Combinatory
discrete-mathematics
combinatory
made-easy-test-series
+
–
2
answers
12
self doubt
Let L = { (a^p)* | p is prime number } and input is {a} . what is minimum number of state in NFA and DFA ?
Let L = { (a^p)* | p is prime number } and input is {a} . what is minimum number of state in NFA and DFA ?
502
views
commented
Jan 28, 2019
Theory of Computation
theory-of-computation
finite-automata
+
–
1
answer
13
Test by Bikram | Mock GATE | Test 3 | Question: 53
The $TCP$ congestion window is set to $20$ $KB$ and a timeout occurs. Assume that the maximum segment size is $1$ $KB$. Then, if the next four transmission bursts are all successful, the window size is _______ $KB$.
The $TCP$ congestion window is set to $20$ $KB$ and a timeout occurs. Assume that the maximum segment size is $1$ $KB$.Then, if the next four transmission bursts are all ...
631
views
commented
Jan 28, 2019
Computer Networks
tbb-mockgate-3
numerical-answers
computer-networks
tcp
congestion-control
+
–
2
answers
14
Find the language
Regural CFL CSL Recursive
ReguralCFLCSLRecursive
288
views
commented
Jan 28, 2019
0
answers
15
Testbook Test Series: Operating System - Disks
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!
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 b...
294
views
commented
Jan 28, 2019
Operating System
testbook-test-series
operating-system
disk
+
–
1
answer
16
Self doubt
Let say L1 is Dcfl and L2=~L1(~ is complement L=L1 Intersection L2 What is L??
Let say L1 is Dcfl and L2=~L1(~ is complement L=L1 Intersection L2 What is L??
489
views
commented
Jan 28, 2019
Theory of Computation
theory-of-computation
+
–
9
answers
17
Common Careless Mistakes
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 ... many calculation mistakes. In any formula you do, you must get the correct unit for the result Please add more as answers.
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 “...
4.0k
views
commented
Jan 27, 2019
Revision
mistakes
preparation
+
–
0
answers
18
made easy cbt
500
views
commented
Jan 24, 2019
3
answers
19
MadeEasy Test Series 2019: Databases - Transaction And Concurrency
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 ... ) is strict recoverable schedule. S4 : Schedule(S) is allowed by strict 2PL. How many above statements true about schedule(S) ?
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 :...
3.2k
views
commented
Jan 24, 2019
Databases
transaction-and-concurrency
made-easy-test-series
+
–
0
answers
20
Made Easy CBT
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 ________.
Consider the system which has virtual address of 36 bits and physical address of 30 bits and page size of 8KB, page table entry contain 1 valid bit, 2 protection bit and ...
625
views
commented
Jan 23, 2019
Operating System
operating-system
paging
virtual-memory
+
–
0
answers
21
MADE EASY CBT2
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 ... 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
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 su...
227
views
closed
Jan 23, 2019
1
answer
22
MADE EASY CBT-2
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
THEY GIVE OPTIONS ARE 0123WHAT 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 SOM...
625
views
closed
Jan 23, 2019
1
answer
23
Context Free Languages
What is the difference between regular intersection and intersection? (I found out that CFL is closed under regular intersection but not under intersection) Thanks!
What is the difference between regular intersection and intersection?(I found out that CFL is closed under regular intersection but not under intersection)Thanks!
329
views
commented
Jan 22, 2019
Theory of Computation
context-free-language
theory-of-computation
+
–
0
answers
24
made easy test series
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 ________.
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 d...
631
views
commented
Jan 19, 2019
0
answers
25
madeeasy test series
answer given as 255.255.255.254 how it is correct please check??
answer given as 255.255.255.254 how it is correct please check??
363
views
commented
Jan 17, 2019
0
answers
26
#madeeasy
{w/w€{0,1}^*; w has equal no. of occurrance of ‘001 and ‘010’} is regular or not??
{w/w€{0,1}^*; w has equal no. of occurrance of ‘001 and ‘010’} is regular or not??
434
views
commented
Jan 16, 2019
0
answers
27
SELF DOUBT
The number of totally ordered sets compatible to the given POSET are_________ IS IT TOPOLOGICAL SORT POSSIBLE OR TOTAL CHAINS POSSIBLE IN DIAGRAM
The number of totally ordered sets compatible to the given POSET are_________IS IT TOPOLOGICAL SORT POSSIBLE OR TOTAL CHAINS POSSIBLE IN DIAGRAM
244
views
asked
Jan 14, 2019
0
answers
28
self doubt
what are comparison based algo properties ? there was a question dont remember much which they take random program and then there are options like 1) comparison based 2) stable 3) both 4 ) none of above that program is inplace for sure .... but altast ... based properties are not satisfied.... ( i know without question little difficult but i dont remember where i saw that question )
what are comparison based algo properties ?there was a question dont remember much which they take random program and then there are options like 1) comparison based 2) s...
364
views
edited
Jan 14, 2019
0
answers
29
SELF DOUBT
Two CSMA/CD stations are each trying to transmit large files of multiple frames. After each frame is sent, they contend for the channel using the binary exponential back-off algorithm. The probability that the contention ends in round 3 is _____ (up to 3 decimal points)
Two CSMA/CD stations are each trying to transmit large files of multiple frames. After each frame is sent, they contend for the channel using the binary exponential back-...
621
views
comment edited
Jan 11, 2019
0
answers
30
ME TEST SERIES DOUBT
A CPU Manufacturer company has two designs p1 and p2 for a synchronous pipeline processor. P1 has 5 pipeline stages with execution times of 3 ns, 4 ns, 3 ns, 2 ns, 4 ns while the design P2 has 6pipeline stage with 3 ns each (execution time). The time that can be saved by P2 over P1 for executing 1000 Instructions is _____________ ns. iam getting answer 997 but they give 1001
A CPU Manufacturer company has two designs p1 and p2 for a synchronous pipeline processor.P1 has 5 pipeline stages with execution times of 3 ns, 4 ns, 3 ns, 2 ns, 4 ns wh...
334
views
comment edited
Jan 11, 2019
CO and Architecture
co-and-architecture
pipelining
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register