Recent activity by Anwesha_Mishra / GATE Overflow for GATE CSE

2 answers

1

NIELIT 2022 April Scientist B | Section A | Question: 31
In a family of six persons $\text{A, B, C, D, E}$ and $\text{F},$ there are two married couples. The family has equal number of male and female. $\text{D}$ is the grandmother of $\text{A}$ and mother of $\text{B}$ $\text{C}$ is ... $ $\text{A}$ is the sister of $\text{F}.$ $\text{D}$ has two grandsons$ None of these

In a family of six persons $\text{A, B, C, D, E}$ and $\text{F},$ there are two married couples. The family has equal number of male and female.$\text{D}$ is the grandmot...

397 views

answered Oct 9, 2023

0 answers

2

Computer networking
If the CRC polynomial has degree n then what is the probability of detecting errors greater than n? a) 1/2^(n-1) b) 1/2^(n+1) c) 1/2^n d) 1/2^(n+2)

If the CRC polynomial has degree n then what is the probability of detecting errors greater than n?a) 1/2^(n-1) b) 1/2^(n+1) c) 1/2^n d) 1/2^(n+2)

299 views

asked Dec 10, 2021

1 answer

3

ME-FT-8
Assume that A and B are only active stations on an ethernet.both has a steady queue of frames to send .to get the control on the channel they uses binary exponential algorithm.both are attempting to transmit the frame.the probability that both are successfully allowed to send the frame on 4th round and in earlier attempts both A and B collides is _ answer is given as 0.11

Assume that A and B are only active stations on an ethernet.both has a steady queue of frames to send .to get the control on the channel they uses binary exponential algo...

838 views

answered Nov 13, 2021

4 answers

4

GATE CSE 2016 Set 1 | Question: 18
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s? $(0+1 )^ *0011 (0+1)^* +(0+1)^*1100(0+1)^*$ $(0+1)^* (00(0+1)^*11+11(0+1)^*00)(0+1)^*$ $(0+1)^*00(0+1)^* + (0+1)^*11 (0+1)^*$ $00(0+1)^*11 +11(0+1)^*00$

Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s?$(0+1 )^ *001...

20.8k views

commented Jun 3, 2020

5 answers

5

GATE IT 2004 | Question: 7
Which one of the following regular expressions is NOT equivalent to the regular expression $(a + b + c)^*$? $(a^* + b^* + c^*)^*$ $(a^*b^*c^*)^*$ $((ab)^* + c^*)^*$ $(a^*b^* + c^*)^*$

Which one of the following regular expressions is NOT equivalent to the regular expression $(a + b + c)^*$?$(a^* + b^* + c^*)^*$$(a^*b^*c^*)^*$$((ab)^* + c^*)^*$$(a^*b^* ...

8.9k views

commented Jun 3, 2020

1 answer

6

Ullman (Compiler Design) Edition 2 Exercise 4.7 Question 4 (Page No. 278)
Show that the following grammar $S\rightarrow Aa\mid bAc\mid dc\mid bda$ $A\rightarrow d$ is LALR(1) but not SLR(1).

Show that the following grammar$S\rightarrow Aa\mid bAc\mid dc\mid bda$$A\rightarrow d$is LALR(1) but not SLR(1).

1.5k views

answered Aug 22, 2019

1 answer

7

Ullman (Compiler Design) Edition 2 Exercise 4.7 Question 5 (Page No. 278)
Show that the following grammar $S\rightarrow Aa\mid bAc\mid Bc\mid bBa$ $A\rightarrow d$ $B\rightarrow d$ is LR(1) but not LALR(1).

Show that the following grammar$S\rightarrow Aa\mid bAc\mid Bc\mid bBa$$A\rightarrow d$$B\rightarrow d$is LR(1) but not LALR(1).

766 views

answered Aug 22, 2019

2 answers

8

Ullman (Compiler Design) Edition 2 Exercise 4.4 Question 3 (Page No. 231)
Compute FIRST and FOLLOW for the grammar of $S\rightarrow SS + \mid SS {\ast} \mid a$

Compute FIRST and FOLLOW for the grammar of $S\rightarrow SS + \mid SS {\ast} \mid a$

540 views

answered Aug 20, 2019

1 answer

9

Test by Bikram | Data Structures | Test 2 | Question: 21
Following keys have to be inserted in exact order into the hash table with $9$ slots. $5, 28, 19, 15, 20, 33, 12, 17, 10$ The auxiliary hash functions is $h(k)=K$ mod table size, where table size is $9$ . Which of the following represent the contents of ... $10,28,19,20,12,5,15,33,17$ $33,28,19,20,12,5,15,10,17$ $20,28,19,10,12,5,15,33,17$

Following keys have to be inserted in exact order into the hash table with $9$ slots.$5, 28, 19, 15, 20, 33, 12, 17, 10$The auxiliary hash functions is $h(k)=K$ mod table...

816 views

answered Aug 16, 2019

1 answer

10

Test by Bikram | Data Structures | Test 2 | Question: 5
Consider the following sequence $( 50,17,14,8, 13,10, 2,5,7,12)$ what is the Minimum number of interchanges required to make it Max heap? $4$ $2$ $3$ $0$

Consider the following sequence $( 50,17,14,8, 13,10, 2,5,7,12)$ what is the Minimum number of interchanges required to make it Max heap?$4$$2$$3$$0$

397 views

answered Aug 16, 2019

0 answers

11

KPGCET-CSE-2019-67
The postfix notation for infix notation $a^*(b+c)+d÷e$ is given by $abc^*+de ÷ +$ $abc+^*de ÷ +$ $abcde +^*÷ +$ $abc^*+de + ÷$

The postfix notation for infix notation $a^*(b+c)+d÷e$ is given by$abc^*+de ÷ +$$abc+^*de ÷ +$$abcde +^*÷ +$$abc^*+de + ÷$

204 views

commented Aug 5, 2019

0 answers

12

KPGCET-CSE-2019-60
The conflict serializability can be determined by ______ of the graph containing READs and WRITEs of transactions of a schedule as vertices and READ-WRITE, WRITE-READ and ______ in the time order as edges acyclicity, READ-READ cyclicity, READ-WRITE cyclicity, WRITE-READ acyclicity, WRITE-WRITE

The conflict serializability can be determined by ______ of the graph containing READs and WRITEs of transactions of a schedule as vertices and READ-WRITE, WRITE-READ and...

116 views

commented Aug 5, 2019

0 answers

13

KPGCET-CSE-2019-45
In the transaction management of schedule, the Conflict serializability implies View serializability View serializability implies Conflict serializability Conflict serializability does not implies View serializability None of these

In the transaction management of schedule, theConflict serializability implies View serializabilityView serializability implies Conflict serializabilityConflict serializa...

175 views

commented Aug 5, 2019

0 answers

14

KPGCET-CSE-2019-43
The distinction between B tree and B+ tree is that В tree contains data at all memory locations whereas B+ tree contains data at leaf level nodes B+ tree contains data at all levels and B tree contains data only at the leaf nodes. Both contain data at all levels Both contains data only at leaf nodes.

The distinction between B tree and B+ tree is thatВ tree contains data at all memory locations whereas B+ tree contains data at leaf level nodesB+ tree contains data at ...

290 views

commented Aug 5, 2019

0 answers

15

KPGCET-CSE-2019-40
The following relational algebra operators form complete set of operators. The other operators can be represented by any combinations of these : $\{ \rho, \sigma , \Pi, – , \cap \}$ $\{ \sigma , ÷, – , \cup, X \}$ $ \{ \sigma, \Pi, – , \cup, X \}$ $\{ \sigma, \Pi, – , \cap, ÷ \}$

The following relational algebra operators form complete set of operators. The other operators can be represented by any combinations of these : $\{ \rho, \sigma , \Pi, �...

184 views

commented Aug 5, 2019

1 answer

16

KPGCET-CSE-2019-30
The tower of Hanoi puzzle with $n (n > 1)$ different dimensional disks stacked on peg A in the decreasing order of their size with largest dimensional disk at the bottom and smallest dimensional disk at the top. The disks are to be transferred from peg A to Peg B using peg C with one disk at a ... transfers is given by $2T(n − 1) +2$ $2T(n-1) + 1$ $T(n-1) +T(n − 2)$ $2T(n)$

The tower of Hanoi puzzle with $n (n 1)$ different dimensional disks stacked on peg A in the decreasing order of their size with largest dimensional disk at the bottom a...

320 views

commented Aug 5, 2019

0 answers

17

KPGCET-CSE-2019-24
The transitive dependencies between attributes of a relation (relational DBMS file) is eliminated by the application of $1$st normal form $2$nd normal form $3$rd normal form $4$th normal form rule on the relation.

The transitive dependencies between attributes of a relation (relational DBMS file) is eliminated by the application of$1$st normal form$2$nd normal form$3$rd normal form...

180 views

commented Aug 5, 2019

0 answers

18

KPGCET-CSE-2019-9
The normalization is a way to implement Good software engineering principles Good database design principles Structured Query Language Database Schema

The normalization is a way to implementGood software engineering principlesGood database design principlesStructured Query LanguageDatabase Schema

270 views

commented Aug 5, 2019

1 answer

19

KPGCET-CSE-2019-4
The schema for the entire database is designed using Data definitional language Structured query language Data manipulation language Schema structure language

The schema for the entire database is designed using Data definitional languageStructured query languageData manipulation language Schema structure language

337 views

commented Aug 5, 2019

0 answers

20

KPGCET-CSE-2019-3
The process of normalization is used to Enhance the number of relations Determine the relationship between different relations Minimize the redundancies & eliminate anomalies Ease the computational work.

The process of normalization is used toEnhance the number of relations Determine the relationship between different relations Minimize the redundancies & eliminate anomal...

325 views

commented Aug 5, 2019

1 answer

21

KPGCET-CSE-2019-2
In relational DBMS, the closure of functional dependencies facilitates To determine the candidate key To determine the foreign key To determine the dependency of an attribute with other attribute/s None of these

In relational DBMS, the closure of functional dependencies facilitates To determine the candidate key To determine the foreign key To determine the dependency of an attr...

307 views

commented Aug 5, 2019

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