Recent activity by shgarg / GATE Overflow for GATE CSE

0 answers

1

Conceptual Question
When we want to minimise a DFA,at first we partition the final and non-final states.Then we divide those states into several more partitions until all the states in each partition belong to the same equivalence class.Now my question is suppose we have a ... the dead state)?Also please tell me whether that dead state should be counted as one of the states in the minimised dfa?

When we want to minimise a DFA,at first we partition the final and non-final states.Then we divide those states into several more partitions until all the states in each ...

126 views

asked Nov 14, 2018

2 answers

2

MadeEasy Workbook: Digital Logic - Adder
x and y are two n bit numbers. these numbers are added by n bit carry look ahead adder which uses k logic levels. if the average gate delay of carry look ahead adder is d then what will be the maximum Delay of carry look ahead adder circuit? N2 Kd Nkd Nd

x and y are two n bit numbers. these numbers are added by n bit carry look ahead adder which uses k logic levels. if the average gate delay of carry look ahead adder is d...

1.7k views

commented Nov 12, 2018

1 answer

3

MadeEasy Workbook: Computer Networks - Subnetting
A class B network address 130.50.0.0 is submitted as follows. The last 10 bits of the host I'd are allotte for host number and the remaining 6 bits are reserved for subnet number. Q- what are the first hosts address of 1st and 4th subnets? 130.50.4.1 and 130.50.16.1 130.50.1.1 and 130.50.4.1 130.50.0.0 and 130.50.3.0 None of these

A class B network address 130.50.0.0 is submitted as follows. The last 10 bits of the host I'd are allotte for host number and the remaining 6 bits are reserved for subne...

2.4k views

commented Nov 9, 2018

0 answers

4

Made Easy Booklet
Suppose a binary tree has only three nodes A, B and C and you are given that the post-order traversal for the tree is B-A-C. The exact preorder traversal for the tree is. C-A-B A-B-C C-B-A A definite pre-order traversal cannot be determined from the information given

Suppose a binary tree has only three nodes A, B and C and you are given that the post-order traversal for the tree is B-A-C. The exact preorder traversal for the tree is....

4.6k views

closed Nov 6, 2018

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