Recent activity by Anupreet13 / GATE Overflow for GATE CSE

0 answers

1

GATE 2023 - Career advice based on low score
Hello everyone. My expected marks (as per GO Rank Predictor) is 40.33. These are few cases/conditions in case of me: I am a female candidate belonging to EWS Category. I am from CS / IT branch. I don't want to give IIIT or any ... field is highly appreciated. Please help me. Thanks for reading. :) Note: Please don't give any advice like taking a drop.

Hello everyone. My expected marks (as per GO Rank Predictor) is 40.33. These are few cases/conditions in case of me:I am a female candidate belonging to EWS Category.I am...

2.8k views

commented Feb 19, 2023

5 answers

2

GATE CSE 1997 | Question: 3.4
Given $\Sigma=\{a,b\}$, which one of the following sets is not countable? Set of all strings over $\Sigma$ Set of all languages over $\Sigma$ Set of all regular languages over $\Sigma$ Set of all languages over $\Sigma$ accepted by Turing machines

Given $\Sigma=\{a,b\}$, which one of the following sets is not countable?Set of all strings over $\Sigma$Set of all languages over $\Sigma$Set of all regular languages ov...

12.4k views

commented Oct 18, 2022

9 answers

3

GATE CSE 2018 | Question: 35
Consider the following languages: $\{a^mb^nc^pd^q \mid m+p=n+q, \text{ where } m, n, p, q \geq 0 \}$ $\{a^mb^nc^pd^q \mid m=n \text{ and }p=q, \text{ where } m, n, p, q \geq 0 \}$ ... Which of the above languages are context-free? I and IV only I and II only II and III only II and IV only

Consider the following languages:$\{a^mb^nc^pd^q \mid m+p=n+q, \text{ where } m, n, p, q \geq 0 \}$$\{a^mb^nc^pd^q \mid m=n \text{ and }p=q, \text{ where } m, n, p, q \ge...

21.3k views

commented Oct 16, 2022

2 answers

4

Test by Bikram | Mock GATE | Test 1 | Question: 60
Read the following passage carefully, and answer the question that follows: People who oppose the law that makes it mandatory for two wheeler riders to wear helmets argue that in a democracy, people have the right to take risks as long ... laws is lower than in states with no laws. A great number of people die in road accidents even otherwise.

Read the following passage carefully, and answer the question that follows:People who oppose the law that makes it mandatory for two wheeler riders to wear helmets argue ...

979 views

commented Oct 12, 2022

4 answers

5

GATE CSE 2021 Set 2 | Question: 42
Consider the following multi-threaded code segment (in a mix of C and pseudo-code), invoked by two processes $P_1$ and $P_2$, and each of the processes spawns two threads $T_1$ and $T_2$: int x = 0; // global Lock L1; // global main () { create a ... the value of $y$ as $2.$ Both $T_1$ and $T_2$, in both the processes, will print the value of $y$ as $1.$

Consider the following multi-threaded code segment (in a mix of C and pseudo-code), invoked by two processes $P_1$ and $P_2$, and each of the processes ...

10.4k views

commented Sep 10, 2022

4 answers

6

GATE CSE 2004 | Question: 11
Consider the following statements with respect to user-level threads and kernel-supported threads context switch is faster with kernel-supported threads for user-level threads, a system call can block the entire process Kernel supported threads can be scheduled independently User level threads ... ) and (IV) only (II) and (III) only (I) and (III) only (I) and (II) only

Consider the following statements with respect to user-level threads and kernel-supported threadscontext switch is faster with kernel-supported threadsfor user-level thre...

27.8k views

commented Sep 10, 2022

3 answers

7

GATE CSE 1996 | Question: 22
A computer system uses the Banker's Algorithm to deal with deadlocks. Its current state is shown in the table below, where $P0$, $P1$, $P2$ are processes, and $R0$, $R1$, $R2$ ... the system can be in this state What will the system do on a request by process $P0$ for one unit of resource type $R1$?

A computer system uses the Banker’s Algorithm to deal with deadlocks. Its current state is shown in the table below, where $P0$, $P1$, $P2$ are processes, and $R0$, $R1...

9.1k views

commented Aug 16, 2022

6 answers

8

GATE CSE 2015 Set 1 | Question: 9
The following two functions $P1$ and $P2$ that share a variable $B$ with an initial value of $2$ ... $B$ can possibly take after the execution is______________________.

The following two functions $P1$ and $P2$ that share a variable $B$ with an initial value of $2$ execute concurrently.$$\begin{array}{|l|l|}\hline \text{P1() \{ } & \tex...

12.4k views

commented Jul 6, 2022

7 answers

9

GATE CSE 2000 | Question: 1.21
Let $m[0]\ldots m[4]$ be mutexes (binary semaphores) and $P[0]\ldots P[4]$ be processes. Suppose each process $P[i]$ executes the following: wait (m[i]); wait (m(i+1) mod 4]); ........... release (m[i]); release (m(i+1) mod 4]); This could cause Thrashing Deadlock Starvation, but not deadlock None of the above

Let $m[0]\ldots m[4]$ be mutexes (binary semaphores) and $P[0]\ldots P[4]$ be processes. Suppose each process $P[i]$ executes the following:wait (m[i]); wait (m(i+1) mod ...

22.3k views

commented Jul 6, 2022

5 answers

10

GATE CSE 1996 | Question: 2.19
A solution to the Dining Philosophers Problem which avoids deadlock is to ensure that all philosophers pick up the left fork before the right fork ensure that all philosophers pick up the right fork before the left fork ensure that one particular ... the right fork, and that all other philosophers pick up the right fork before the left fork None of the above

A solution to the Dining Philosophers Problem which avoids deadlock is toensure that all philosophers pick up the left fork before the right forkensure that all philosoph...

11.1k views

commented Jul 6, 2022

3 answers

11

GATE CSE 1988 | Question: 10iib
Given below is solution for the critical section problem of two processes $P_0$ and $P_1$ ... until false Determine of the above solution is correct. If it is incorrect, demonstrate with an example how it violates the conditions.

Given below is solution for the critical section problem of two processes $P_0$ and $P_1$ sharing the following variables:var flag :array [0..1] of boolean; (initially fa...

4.2k views

commented Jul 6, 2022

7 answers

12

GATE IT 2005 | Question: 85b
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, the ... $(t + 100)$ is : $>100$ but finite $\infty$ $3$ $>3$ and $\leq 100$

Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to...

15.0k views

commented Aug 9, 2021

9 answers

13

GATE CSE 2015 Set 2 | Question: 31
A Young tableau is a $2D$ array of integers increasing from left to right and from top to bottom. Any unfilled entries are marked with $\infty$, and hence there cannot be any entry to the right of, or below a $\infty$. The following Young tableau ... The minimum number of entries (other than $1$) to be shifted, to remove $1$ from the given Young tableau is _____.

A Young tableau is a $2D$ array of integers increasing from left to right and from top to bottom. Any unfilled entries are marked with $\infty$, and hence there cannot be...

13.3k views

commented Aug 5, 2021

2 answers

14

Peter Linz Edition 4 Exercise 2.1 Question 2.d, 2.e (Page No. 47)
(d) all strings with at least one a and exactly two b’s (e) all the strings with exactly two a’s and more than two b’s.

(d) all strings with at least one a and exactly two b’s(e) all the strings with exactly two a’s and more than two b’s.

18.8k views

commented Jul 30, 2021

3 answers

15

GATE IT 2004 | Question: 45
A serial transmission $T1$ uses $8$ information bits, $2$ start bits, $1$ stop bit and $1$ parity bit for each character. A synchronous transmission $T2$ uses $3$ eight-bit sync characters followed by $30$ eight-bit information characters. If ... $136$ characters/sec $100$ characters/sec, $136$ characters/sec $80$ characters/sec, $153$ characters/sec

A serial transmission $T1$ uses $8$ information bits, $2$ start bits, $1$ stop bit and $1$ parity bit for each character. A synchronous transmission $T2$ uses $3$ eight-b...

14.2k views

commented Jun 16, 2021

3 answers

16

How is the complement of Language L is Context free ??
The complement of the language $L$ containing an equal number of $a's$,$b's$ and $c's$ is (a) regular (b) context free (c) context sensitive but not context free (d) recursive and not a cfl.

The complement of the language $L$ containing an equal number of $a's$,$b's$ and $c's$ is (a) regular(b) context free(c) context sensitive but not context free(d) recursi...

7.3k views

commented Jun 9, 2021

10 answers

17

GATE CSE 2010 | Question: 39
Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular expressions below represents $L$? $(0^*10^*1)^*$ $0^*(10^*10^*)^*$ $0^*(10^*1)^*0^*$ $0^*1(10^*1)^*10^*$

Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular express...

22.4k views

commented Nov 23, 2020

1 answer

18

MadeEasy Test Series 2019: Programming & DS - Hashing
Consider the hashing table with 'm' slots and 'n' keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search is_ Answer 1.647

Consider the hashing table with 'm' slots and 'n' keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search...

1.3k views

commented Jun 19, 2020

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