Recent activity by Soumik Dutta / GATE Overflow for GATE CSE

2 answers

1

GO Classes 2023 | IIITH Mock Test 1 | Question: 60
If $4$ Maths books are selected from $6$ different Maths books and $3$ English books are chosen from $5$ different English books, how many ways can the seven books be arranged on a shelf if a Maths is at the beginning and an English book is in the middle of the shelf $216000$ $218000$ $206000$ $226000$

If $4$ Maths books are selected from $6$ different Maths books and $3$ English books are chosen from $5$ different English books, how many ways can the seven books be arr...

1.1k views

answered Mar 27, 2023

3 answers

2

GO Classes 2023 | IIITH Mock Test 1 | Question: 97
If $7\:\theta\: 13\: \alpha\: 3 = 60,$ and $12\:\theta\: 13\: \alpha\: 4 = 100,$ then $38\:\theta\: 39\: \alpha\: 3 =\:?$ $313$ $219$ $343$ $231$

If $7\:\theta\: 13\: \alpha\: 3 = 60,$ and $12\:\theta\: 13\: \alpha\: 4 = 100,$ then $38\:\theta\: 39\: \alpha\: 3 =\:?$$313$$219$$343$$231$

731 views

commented Mar 27, 2023

0 answers

3

GO Classes 2023 | IIITH Mock Test 1 | Question: 99
Each of $P, Q, R, S, W, X, Y$ and $Z$ has been married at most once. $X$ and $Y$ are married and have two children $P$ and $Q. Z$ is the grandfather of the daughter $S$ of $P$. Further, $Z$ and $W$ are married and are parents of $R$. ... law of $R$ $P$ and $R$ are not married to each other $P$ is a son of $X$ and $Y$ $Q$ cannot be married to $R$

Each of $P, Q, R, S, W, X, Y$ and $Z$ has been married at most once. $X$ and $Y$ are married and have two children $P$ and $Q. Z$ is the grandfather of the daughter $S$ o...

830 views

commented Mar 27, 2023

4 answers

4

GATE CSE 2023 | Question: 20
Let $A$ be the adjacency matrix of the graph with vertices $\{1,2,3,4,5\}.$ Let $\lambda_{1}, \lambda_{2}, \lambda_{3}, \lambda_{4}$, and $\lambda_{5}$ be the five eigenvalues of $A$. Note that these eigenvalues need not be distinct. The value of $\lambda_{1}+\lambda_{2}+\lambda_{3}+\lambda_{4}+\lambda_{5}=$____________

Let $A$ be the adjacency matrix of the graph with vertices $\{1,2,3,4,5\}.$Let $\lambda_{1}, \lambda_{2}, \lambda_{3}, \lambda_{4}$, and $\lambda_{5}$ be the five eigenva...

13.6k views

commented Feb 21, 2023

2 answers

5

GATE CSE 2023 | Question: 3
Let $\textsf{SLLdel}$ be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let $\textsf{DLLdel}$ be another function that deletes a node in a doubly-linked list given a pointer to the node ... $\textsf{DLLdel}$ are $O(1)$ $\textsf{SLLdel}$ is $O(n)$ and $\textsf{DLLdel}$ is $O(1)$

Let $\textsf{SLLdel}$ be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let $\textsf...

10.9k views

commented Feb 15, 2023

15 answers

6

GATE CSE 2017 Set 1 | Question: 22
Consider the language $L$ given by the regular expression $(a+b)^{*} b (a+b)$ over the alphabet $\{a,b\}$. The smallest number of states needed in a deterministic finite-state automaton (DFA) accepting $L$ is ___________ .

Consider the language $L$ given by the regular expression $(a+b)^{*} b (a+b)$ over the alphabet $\{a,b\}$. The smallest number of states needed in a deterministic finite-...

29.8k views

answered Jan 20, 2023

8 answers

7

GATE CSE 2008 | Question: 63
The $P$ and $V$ operations on counting semaphores, where s is a counting semaphore, are defined as follows: $P(s):$ $s=s-1;$ If $s < 0$ then wait; $V(s):$ $s=s+1;$ If $s \leq0$ then wake up process waiting on s; Assume that $P_b$ and $V_b$ the wait ... $x_b$ and $y_b$ are respectively $0$ and $0$ $0$ and $1$ $1$ and $0$ $1$ and $1$

The $P$ and $V$ operations on counting semaphores, where s is a counting semaphore, are defined as follows:$P(s):$$s=s-1;$If $s < 0$ then wait;$V(s):$$s=s+1;$If $s \leq0$...

23.5k views

commented Jan 16, 2023

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