Questions by reena_kandari / GATE Overflow for GATE CSE

1 votes

1 answer

1

Doubt: modulus of asynchronous counter
mod of following asynchronous counter is?? Due to the delay of OR gate I think mod is $10$.

mod of following asynchronous counter is??Due to the delay of OR gate I think mod is $10$.

942 views

asked Jan 9, 2018

3 votes

1 answer

2

Data rate per connection in transport Layer
In a network that has a maximum TPDU size of $128$ bytes, a maximum TPDU lifetime of $30$ sec, and an $8- bit$ sequence number, what is the maximum data rate per connection? My attempt: in $30 sec$ we can identify $256 bytes$ because ... giving sequence number to each segment and thus calculating the data rate as $256*128*8$ bits in $30 sec$ or $8.7Kbps$.

In a network that has a maximum TPDU size of $128$ bytes, a maximum TPDU lifetime of $30$ sec, and an $8- bit$ sequence number, what is the maximum data rate per connecti...

2.4k views

asked Nov 26, 2017

0 votes

0 answers

3

Resynchroniation in TCP connection establishment-Andrew S.Tanenbaum
Suppose that the clock-driven scheme for generating initial sequence numbers is used with a 15-bit wide clock counter. The clock ticks once every $100msec$, and the maximum packet lifetime is $60 sec$. How often need resynchronization take place (a) in the worst case? (b) when the data consumes $240$ sequence numbers/min?

Suppose that the clock-driven scheme for generating initial sequence numbers is used with a 15-bit wide clock counter. The clock ticks once every $100msec$, and the maxim...

231 views

asked Nov 25, 2017

2 votes

0 answers

4

Any problem whose domain is finite is Decidable or not?
Question no:$1$ "Any problem whose domain is finite is always Decidable" lets take a TM,$M$ and finite domain of problem i.e. finite set of strings for eg. {a,abaa,bba}, Now the problem "whether ... me what is really mean by "Domain of a problem" and "single instance of turing machine's halting problem"?

Question no:$1$ "Any problem whose domain is finite is always Decidable"lets take a TM,$M$ and finite domain of problem i.e. finite set of strings for eg. {a,abaa,bba}, ...

734 views

asked Nov 12, 2017

2 votes

1 answer

5

advantages of segmented paging over pure paging
As we know segmented paging is an improvement over segmentation and paging but I am having some doubts regarding the memory overhead of these three system.It is clear that segmentation need less memory overhead.But about other two system ... of frag mention is much more than pure paging and also extra segmentation table is required in this system?

As we know segmented paging is an improvement over segmentation and paging but I am having some doubts regarding the memory overhead of these three system.It is clear tha...

1.8k views

asked Oct 28, 2017

23 votes

1 answer

6

B+tree with sparse/Dense indexing
Database file consists of $10,000$ records with record size of $100$ bytes, block size $512$ bytes. If sparse B+ tree index is built over given database file with search key size $22$ bytes and both block pointer and record pointer of size $12$ bytes each.Find out a)minimum index block required b)maximum index block required my answers a)$143$ b)$325$.

Database file consists of $10,000$ records with record size of $100$ bytes, block size $512$ bytes. If sparse B+ tree index is built over given database file with search ...

5.8k views

asked Oct 26, 2017

4 votes

1 answer

7

Keys of Relationship set
Suppose the key of entity set A is attribute A, the key of B is B , the key of C is C, the key of D is D. If we translate relationship set R into a relation R (A,B, C,D), what are the keys of R? a) {A} b) {B,C} AND {C,D} c) {A,C} d) {ABC,ACD}

Suppose the key of entity set A is attribute A, the key of B is B , the key of C is C, the keyof D is D. If we translate relationship set R into a relation R (A,B, C,D), ...

754 views

asked Oct 14, 2017

0 votes

1 answer

8

Resource preemption
Which of the following transitions are not possible? (Assume resource preemption is not allowed) A) 2 and 4 B) 3 and 5 C)4 and 5 D)3 and 5 if resource preemption is not allowed then answer should be A) but answer given is D) how it is possible?

Which of the following transitions are not possible? (Assume resource preemption is not allowed)A) 2 and 4B) 3 and 5C)4 and 5D)3 and 5if resource preemption is not allowe...

2.2k views

asked Sep 29, 2017

0 votes

0 answers

9

GROUP-congruence classes
State true or false 1)Let n be an integer,The set Zn of congruence classes of integers n with respect to operation of addition is a GROUP. 2)The set Zn* of non-zero congruence classes modulo of n, with respect to the operation of multiplication is NOT a GROUP, where n is a prime number.

State true or false1)Let n be an integer,The set Zn of congruence classes of integers n with respect to operation of addition is a GROUP.2)The set Zn* of non-zero congrue...

329 views

asked Sep 27, 2017

0 votes

0 answers

10

TRUE/FALSE
1) For Bottom-up implementation of L-attributed definition all the semantic actions must be at the end of productions(Postfix SDT). I think it is true because for BU implementation of L-attributed definition it must be based on LL(1) grammar.and we can convert ... then we will get different outputs during BU and TD parsing and this case is not desired in SDT. please share your views.

1) For Bottom-up implementation of L-attributed definition all the semantic actions must be at the end of productions(Postfix SDT).I think it is true because for BU imple...

557 views

asked Sep 19, 2017

5 votes

1 answer

11

Data Structure
Given the following declaration: Node declaration: struct LLNode{ int data; struct LLNode *next; } typedef struct LLNode Node; following are the functions to insert a node at start of Linked List. Assume "head"is pointer to first Node of the Linked List. ... (head_ref); *(head_ref)=NewNode; } Which Of the following is correct Implementation A)ONLY A B)ONLY B C)both D)None

Given the following declaration:Node declaration:struct LLNode{ int data; struct LLNode *next; } typedef struct LLNode Node;following are the functions to insert a node a...

798 views

asked Sep 7, 2017

0 votes

0 answers

12

floating point representation
Consider a computer system that stores a floating-point numbers with 16-bit mantissa and an 8-bit exponent, each in two’s complement. find The smallest and largest positive values which can be stored in the system.

Consider a computer system that stores a floating-point numbers with 16-bit mantissa and an 8-bit exponent, each in two’s complement. find The smallest and largest posi...

696 views

asked Aug 31, 2017

8 votes

2 answers

13

LCM/HCF
Find the number of combinations of (a, b, c) if LCM (a, b) = 1000, LCM (b, c) = 2000, LCM (c, a) = 2000. I am getting total 96 combinations

Find the number of combinations of (a, b, c) if LCM (a, b) = 1000, LCM (b, c) = 2000, LCM (c, a) = 2000.I am getting total 96 combinations

808 views

asked Aug 26, 2017

8 votes

1 answer

14

LL(1) AND LALR(1)
As I know that LL(1) and LALR(1) grammars are incomperable ,but if a grammar is LL(1) then, it may be LALR(1) if the following conditions hold. 1.A ε-free LL(1) grammar is also a SLR(1) grammar and thus LALR(1) too. 2. A LL ... empty derivation may or may not be LALR(1). can anyone explain each point with example. and what is this "non-empty derivation/empty derivation"?

As I know that LL(1) and LALR(1) grammars are incomperable ,but if a grammar is LL(1) then, it may be LALR(1) if the following conditions hold.1.A ε-free LL(1) grammar i...

2.5k views

asked Aug 15, 2017

2 votes

1 answer

15

497 views

asked Aug 14, 2017

1 votes

0 answers

16

Ullman 4.1
What language does this grammar generate? S-->(L)|a L-->L,S|S

What language does this grammar generate?S >(L)|aL >L,S|S

168 views

asked Aug 14, 2017

9 votes

2 answers

17

classification of lexical and syntactic errors in complier phases
I am writing down some errors and its type with a reason.If there something wrong please correct it with a valid reason. 1.fi(a==10) this is not a lexical error, because lexical analyzer cannot tell whether fi is a misspelling ... token. but this says it is streams of valid tokens 6.int d=10.10.10 lexical error as invalid num token.

I am writing down some errors and its type with a reason.If there something wrong please correct it with a valid reason.1.fi(a==10)this is not a lexical error, because le...

2.3k views

asked Aug 14, 2017

2 votes

0 answers

18

Kenneth Rosen Edition 6th Exercise 8.4 Question 17 (Page No. 575)
Find the number of paths of length n between two different vertices in K4 if n is a) 2. b) 3. c) 4. d) 5.

Find the number of paths of length n between two different vertices in K4 if n isa) 2. b) 3. c) 4. d) 5.

1.2k views

asked Aug 8, 2017

1 votes

0 answers

19

Probability
Suppose that in the production of 60-ohm radio resistors, nondefective items are those that have a resistance between 58 and 62 ohms and the probability of a resistor's being defective is 0.1%.The resistors are sold in lots of 200, with the ... are nondefective. What is the probability that a given lot will violate this guarantee? (Use the Poisson distribution.) Using bernoulli:18%

Suppose that in the production of 60-ohm radioresistors, nondefective items are those that have aresistance between 58 and 62 ohms and the probabilityof a resistor’s be...

667 views

asked Aug 7, 2017

1 votes

0 answers

20

FirstThird of a regular set

205 views

asked Jul 31, 2017

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