Recent activity by Deepanshu

11 answers

GATE2019-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)?$ Assume that all the inputs and their complements are available. Answer: _______

commented Feb 5, 2019 in Digital Logic 13.1k views

1 answer

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?

commented Feb 5, 2019 in GATE 826 views

0 answers

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 ?

commented Feb 4, 2019 in Digital Logic 685 views

1 answer

gate 2019
question about spanning tree? both option are correct or only first

question about spanning tree? both option are correct or only first

commented Feb 4, 2019 in Algorithms 406 views

1 answer

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 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)

commented Feb 4, 2019 in DS 1k views

1 answer

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 how to help? I'll be very grateful if someone comes to reply to my issue. Thanks in advance.

commented Feb 3, 2019 in Study Resources 182 views

1 answer

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 ?

commented Feb 3, 2019 in Verbal Aptitude 746 views

2 answers

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?

commented Feb 3, 2019 in Programming 1.6k views

1 answer

Gate 19
The expenditure ______ as follows ...… Break down or breaks down

The expenditure ______ as follows ...… Break down or breaks down

commented Feb 3, 2019 in Verbal Aptitude 2.1k views

0 answers

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

commented Jan 30, 2019 in Operating System 100 views

0 answers

Made easy test series
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?

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?

commented Jan 30, 2019 in CO and Architecture 364 views

3 answers

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 ________.

commented Jan 29, 2019 in Combinatory 1.2k views

2 answers

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 ?

commented Jan 28, 2019 in Theory of Computation 158 views

2 answers

Find the language
Regural CFL CSL Recursive

Regural CFL CSL Recursive

commented Jan 28, 2019 in Theory of Computation 93 views

0 answers

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 bit integers are used. What is the maximum possible fize size in bytes? Thanks!

commented Jan 28, 2019 in Operating System 127 views

1 answer

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??

commented Jan 28, 2019 in Theory of Computation 124 views

8 answers

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 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.

commented Jan 27, 2019 in Revision 1.7k views

0 answers

made easy cbt

commented Jan 24, 2019 in Databases 160 views

3 answers

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 : 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) ?

commented Jan 24, 2019 in Databases 1.2k views

0 answers

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 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 ________.

commented Jan 23, 2019 in CO and Architecture 179 views

0 answers

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 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

closed Jan 23, 2019 in Algorithms 104 views

1 answer

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 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

closed Jan 23, 2019 in Verbal Aptitude 292 views

1 answer

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!

commented Jan 22, 2019 in Theory of Computation 80 views

0 answers

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 decomposition and dependency preserving decomposition are ________.

commented Jan 19, 2019 in Databases 161 views

0 answers

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??

commented Jan 17, 2019 in Computer Networks 101 views

0 answers

#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??

commented Jan 16, 2019 in Theory of Computation 184 views

0 answers

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

asked Jan 14, 2019 in Mathematical Logic 79 views

0 answers

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) stable 3) both 4 ) none of above that program is inplace for sure .... but altast in ... comparison based properties are not satisfied.... ( i know without question little difficult but i dont remember where i saw that question )

edited Jan 14, 2019 in Programming 87 views

0 answers

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-off algorithm. The probability that the contention ends in round 3 is _____ (up to 3 decimal points)

comment edited Jan 11, 2019 in Computer Networks 179 views

0 answers

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 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

comment edited Jan 11, 2019 in CO and Architecture 67 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Subjects

Network Sites

Recent activity by Deepanshu

Log In

Register

Recent Posts

Subjects

Recent Blog Comments

Network Sites

Recent activity by Deepanshu