Recent activity by rish1602 / GATE Overflow for GATE CSE

1 answer

1

TIFR CSE 2022 | Part A | Question: 13
Consider the transition system shown in the figure below with the initial state $s_1$. A token is initially placed at $s_1$, and it moves to $s_2$ with probability $\frac{2}{3}$, and to $s_3$ with probability $\frac{1}{3}$. From $s_2$ and $s_3$, the token always ... appear in the run? $\frac{1}{7}$ $\frac{2}{7}$ $\frac{3}{7}$ $\frac{5}{7}$ None of the above

Consider the transition system shown in the figure below with the initial state $s_1$. A token is initially placed at $s_1$, and it moves to $s_2$ with probability $\frac...

408 views

answered Aug 30, 2023

6 answers

2

GATE CSE 2000 | Question: 5
A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it, counting repetitions. What is the number of multisets of size $4$ that can be ... n distinct elements so that at least one element occurs exactly twice? How many multisets can be constructed from n distinct elements?

A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it, counting repetiti...

8.2k views

commented Jan 29, 2022

9 answers

3

GATE CSE 2016 Set 1 | Question: 28
A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$, satisfies the following properties: $f(n)=f(n/2)$ if $n$ is even $f(n)=f(n+5)$ if $n$ is odd Let $R=\{ i \mid \exists{j} : f(j)=i \}$ be the set of distinct values that $f$ takes. The maximum possible size of $R$ is ___________.

A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$, satisfies the following properties: $f(n)=f(n/2)...

21.9k views

answered Jan 20, 2022

4 answers

4

TIFR CSE 2020 | Part B | Question: 2
Consider the following statements. The intersection of two context-free languages is always context-free The super-set of a context-free languages is never regular The subset of a decidable language is always decidable Let $\Sigma = \{a,b,c\}.$ Let $L\subseteq \Sigma$ be the language of ... Only $(1),(2)$ and $(3)$ Only $(4)$ None of $(1),(2),(3),(4)$ are true.

Consider the following statements.The intersection of two context-free languages is always context-freeThe super-set of a context-free languages is never regularThe subse...

1.6k views

answered Jan 15, 2022

2 answers

5

Made Easy Test Series:TOC-Turing Machine
$P_{1}:$ {$<M>|M $ is a TM that accepts atleast $2$ strings of different length} $P_{2}:$ {$<M>|M $ is a TM and there exists an input whose length less than $100,$ on which $M$ halts } The number of problem which is $RE$ but not $REC$ _____________

$P_{1}:$ {$<M>|M $ is a TM that accepts atleast $2$ strings of different length}$P_{2}:$ {$<M>|M $ is a TM and there exists an input whose length less than $100,$ on whi...

1.1k views

answer edited Jan 9, 2022

3 answers

6

Decidable
1)Let G be CFG. Whether L(G) is CFL. Q)Is it decidable or not? 2)Let G be CFG and unambiguous. Whether L(G) is CFL. Q)Is it decidable or not?

1)Let G be CFG. Whether L(G) is CFL.Q)Is it decidable or not?2)Let G be CFG and unambiguous. Whether L(G) is CFL.Q)Is it decidable or not?

2.2k views

answered Jan 9, 2022

2 answers

7

synchronization
does it guarantee mutual exclusion and deadlock prevention?

does it guarantee mutual exclusion and deadlock prevention?

939 views

answered Jan 8, 2022

3 answers

8

MadeEasy Test Series: Operating System - Process Synchronization
P1 terminates but P2 does not P2 terminates but P1 does not Both P1 and P2 terminate Neither P1 nor P2 terminate

P1 terminates but P2 does notP2 terminates but P1 does notBoth P1 and P2 terminateNeither P1 nor P2 terminate

1.5k views

answered Jan 8, 2022

2 answers

9

Applied Test Series
The solution for process synchronization is given below : Which of the following is correct about the above given solution? (A) Satisfies Mutual Exclusion (B) Satisfies Progress (C) Satisfies Bounded wait (D) Suffers from deadlock

The solution for process synchronization is given below : Which of the following is correct about the above given solution? (A) Satisfies Mutual Exclusion(B) Satisfies ...

587 views

answered Jan 8, 2022

1 answer

10

GATE CSE 2016 Set 2 | Question: 46
A student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example, int a[10] [3]; The grammars use D as the start symbol, and use six ... Which of the grammars correctly generate the declaration mentioned above? Both G1 and G2 Only G1 Only G2 Neither G1 nor G2

A student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example,int a[10] [3...

9.1k views

commented Jan 7, 2022

1 answer

11

Zeal Workbook: Databases - Relational Calculus
Answer is all Doubt ---how (1,4) is present in O/p

Answer is all Doubt -how (1,4) is present in O/p

492 views

answered Dec 30, 2021

2 answers

12

Raghuramkrishnan Exercise-4.3 question 11 page no-127 Relational Algebra
Suppliers(sid, sname, address) Parts(pid, pname, color) Catalog(sid, pid, cost) Find the pids of the most expensive parts supplied by suppliers named Yosemite Sham

Suppliers(sid, sname, address)Parts(pid, pname, color)Catalog(sid, pid, cost)Find the pids of the most expensive parts supplied by suppliers named Yosemite Sham

1.3k views

answered Dec 30, 2021

1 answer

13

Made Easy Test Series:Time Complexity
Consider the following program: int Bar(int n){ if(n<2) return; } else{ int sum=0; int i,j; for(i=1;i<=4;i++) Bar(n/2); for(i=1;i<=n;i++){ for(j=1;j<=i;j++){ sum=sum+1; } } } Now consider the following ... $Bar\left ( n \right )$ is $O \left ( n^{3}logn^{2} \right )$ How many statements are correct________________

Consider the following program:int Bar(int n){ if(n<2) return; } else{ int sum=0; int i,j; for(i=1;i<=4;i++) Bar(n/2); for(i=1;i<=n;i++){ for(j=1;j<=i;j++){ sum=sum+1; } ...

2.4k views

comment edited Dec 26, 2021

10 answers

14

GATE CSE 2001 | Question: 1.10, UGCNET-Dec2012-III: 36
Suppose a processor does not have any stack pointer registers, which of the following statements is true? It cannot have subroutine call instruction It cannot have nested subroutines call Interrupts are not possible All subroutine calls and interrupts are possible

Suppose a processor does not have any stack pointer registers, which of the following statements is true?It cannot have subroutine call instructionIt cannot have nested s...

18.2k views

commented Dec 25, 2021

3 answers

15

MadeEasy Test Series: Databases - Relational Algebra
Consider relation R' and S' have n' and m' tuples, respectively. Choose the best matching between List-I (Expression) and List-II (Maximum number of tuple): Soln. According to me Answer should be Option C. 1.R union S = m+n (easy nothing to say) 2 ... 3 3 3 5 4 3 3 3 6 Now in R natual join S = m * n So option C should suffice isn't it ?

Consider relation ‘R’ and ‘S’ have ‘n’ and ‘m’ tuples, respectively. Choose the best matching between List-I (Expression) and List-II (Maximum number of t...

2.9k views

answered Dec 25, 2021

1 answer

16

Ace Test Series: DBMS - Correlated Sql Query
According to me it should be – “Retrieve the names of all students with a lower rank, than all students with age < 18 ”

According to me it should be – “Retrieve the names of all students with a lower rank, than all students with age < 18 ”

1.3k views

commented Dec 25, 2021

2 answers

17

Workbook - DBMS (Made Easy)
A relation (from the relational database model) consist of a set of tuples, which implies that a) relational model supports multi-valued attributes whose values can be represented in sets. b) for any two tuples, the value associated with all ... with one or more of their attributes must differ. d) all tuples in a particular relation may have different attributes.

A relation (from the relational database model) consist of a set of tuples, which implies thata) relational model supports multi-valued attributes whose values can be rep...

1.9k views

answered Dec 25, 2021

4 answers

18

MadeEasy Subject Test: Databases - Er Diagram
Minimum no of table for this ER diagram

Minimum no of table for this ER diagram

1.2k views

answered Dec 25, 2021

5 answers

19

GATE CSE 2014 Set 2 | Question: 35
Let $\langle M \rangle$ be the encoding of a Turing machine as a string over $\Sigma=\left\{0,1\right\}$ ... $L$ is: decidable and recursively enumerable undecidable but recursively enumerable undecidable and not recursively enumerable decidable but not recursively enumerable

Let $\langle M \rangle$ be the encoding of a Turing machine as a string over $\Sigma=\left\{0,1\right\}$. Let $$L=\left\{\langle M \rangle \mid M \text{ is a Turing machi...

28.0k views

comment edited Dec 22, 2021

2 answers

20

GATE CSE 2021 Set 2 | Question: 12
Let $L_1$ be a regular language and $L_2$ be a context-free language. Which of the following languages is/are context-free? $L_1 \cap \overline{L_2} \\$ $\overline{\overline{L_1} \cup \overline{L_2}} \\$ $L_1 \cup (L_2 \cup \overline{L_2}) \\$ $(L_1 \cap L_2) \cup (\overline{L_1} \cap L_2)$

Let $L_1$ be a regular language and $L_2$ be a context-free language. Which of the following languages is/are context-free?$L_1 \cap \overline{L_2} \\$$\overline{\overlin...

10.0k views

commented Dec 22, 2021

1 answer

21

test series doubt
hi, C an anyone answer this question? @arjun sir, According to me there is no mutual exclusion and hence deadlock is not created.

hi,Can anyone answer this question? @arjun sir, According to me there is no mutual exclusion and hence deadlock is not created.

422 views

commented Dec 21, 2021

1 answer

22

Gateforum Test Series: Databases - Sql
the table “Sales89” contains information about the address,zip,sale-date,price and inflamation-adjusted “real-price” of 222 sales of single family homes in calcutta during 1989.Here is the table schema

the table “Sales89” contains information about the address,zip,sale-date,price and inflamation-adjusted “real-price” of 222 sales of single family homes in calcut...

539 views

answered Dec 20, 2021

5 answers

23

GATE IT 2004 | Question: 73
Consider the following entity relationship diagram $(ERD)$, where two entities $E1$ and $E2$ have a relation $R$ of cardinality 1:m. The attributes of $E1$ are $A11$, $A12$ and $A13$ where $A11$ is the key attribute. The attributes of $E2$ are $A21$ ... normal form ($3NF$) is designed from the above $ERD$. The number of tables in the database is $2$ $3$ $5$ $4$

Consider the following entity relationship diagram $(ERD)$, where two entities $E1$ and $E2$ have a relation $R$ of cardinality 1:m.The attributes of $E1$ are $A11$, $A12...

19.2k views

commented Dec 20, 2021

1 answer

24

Gate applied test series 2022
Given 2 functions X and Y, we can say function X covers function Y iff all the minterms of function Y are covered by function X ( i.e X should be superset of Y). Let Y be a function of 3 ternary variables, Y(a,b) having 15 minterms. The number of functions covering Y are ______

Given 2 functions X and Y, we can say function X covers function Y iff all the minterms of function Y are covered by function X ( i.e X should be superset of Y). Let Y b...

319 views

answered Dec 19, 2021

1 answer

25

#TOC NPTEL ASSIGNMENT Question about reducibility
Please help me understand this question. I have searched on internet, but not avail. Click this to see the question

Please help me understand this question. I have searched on internet, but not avail. Click this to see the question

474 views

answered Dec 16, 2021

2 answers

26

Made Easy Test series
Consider the following language : P1 : {<M, x, k>| M is a TM and M does not halt on x within k steps} P2 : {<M>| M is TM and L(M) = $\phi$} P3 : {<M>| M is a TM and L(M) = finite language} The number of problems which are not RE is/are _______ ?

Consider the following language :P1 : {<M, x, k>| M is a TM and M does not halt on x within k steps}P2 : {<M>| M is TM and L(M) = $\phi$}P3 : {<M>| M is a TM and L(M) = f...

673 views

commented Dec 16, 2021

5 answers

27

GATE CSE 2001 | Question: 1.13
A CPU has two modes -- privileged and non-privileged. In order to change the mode from privileged to non-privileged a hardware interrupt is needed a software interrupt is needed a privileged instruction (which does not generate an interrupt) is needed a non-privileged instruction (which does not generate an interrupt) is needed

A CPU has two modes privileged and non-privileged. In order to change the mode from privileged to non-privilegeda hardware interrupt is neededa software interrupt is ne...

22.4k views

commented Dec 14, 2021

6 answers

28

UGC NET CSE | January 2017 | Part 3 | Question: 11
Consider the following relation: Works(emp_name, company_name,salary) Here,emp name is primary key. Consider the following SQL query Select emp name From works T where salary > (select avg(salary) from works S where T. company ... all the companies. Find all employees who earn more than the average salary of all employees of their company.

Consider the following relation:Works(emp_name, company_name,salary)Here,emp name is primary key.Consider the following SQL querySelect emp name From works T where salary...

1.7k views

answered Dec 13, 2021

5 answers

29

GATE IT 2008 | Question: 77
A binary tree with $n > 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbours. Starting with the above tree, while there remains a node $v$ of degree two in the tree, add ... will remain at the end of the process? $2 * n_1- 3$ $n_2 + 2 * n_1 - 2$ $n_3 - n_2$ $n_2+ n_1- 2$

A binary tree with $n 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbo...

14.9k views

commented Dec 13, 2021

4 answers

30

Probability of Dice
A pair of dice is rolled, till a sum of either 5 or 7 obtained. Find the probability that 5 comes before 7?

A pair of dice is rolled, till a sum of either 5 or 7 obtained. Find the probability that 5 comes before 7?

790 views

answered Dec 12, 2021

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