Recent activity by arks / GATE Overflow for GATE CSE

2 answers

1

#testbook_testseries leaky bucket
a leaky bucket used to control data flow,how many of data bits are left in bucket if host send a burst of data at the rate of 250 kbps for first 24 seconds and remain silent for next 16 seconds .then again burst of data is sent at the rate of 120 kbps for next 20 seconds and output rate is 8500 kbps?? $10^4$ $10^6$ $100$ $10^{8}$

a leaky bucket used to control data flow,how many of data bits are left in bucket if host send a burst of data at the rate of 250 kbps for first 24 seconds and remain sil...

1.1k views

answered Jan 25, 2023

3 answers

2

Leaky bucket algorithm

2.1k views

answered Jan 25, 2023

8 answers

3

GATE CSE 2003 | Question: 66
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$

The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is rep...

24.2k views

commented Jan 8, 2023

1 answer

4

CFG is ambiguous is it possible to make top down and bottom up parsing?
If a grammer(CFG) is ambiguous then we can construct the topdown and bottomup parsing is possible directly???or we will make them into unambiguous then we will construct???

If a grammer(CFG) is ambiguous then we can construct the topdown and bottomup parsing is possible directly???or we will make them into unambiguous then we will construct?...

2.0k views

commented Jan 3, 2023

4 answers

5

GATE CSE 2020 | Question: 32
Consider the following languages. $\begin{array}{ll} L_1= \{ wxyx \mid w,x,y \in (0+1)^{+} \} \\ L_2= \{xy \mid x,y \in (a+b)^{*}, \mid x \mid=\mid y \mid, x \neq y \} \end{array}$ ... context- free but not regular and $L_2$ is context-free. Neither $L_1$ nor $L_2$ is context- free. $L_1$ context- free but $L_2$ is not context-free.

Consider the following languages.$$\begin{array}{ll} L_1= \{ wxyx \mid w,x,y \in (0+1)^{+} \} \\ L_2= \{xy \mid x,y \in (a+b)^{*}, \mid x \mid=\mid y \mid, x \neq y \} \e...

17.9k views

commented Dec 24, 2022

2 answers

6

Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 8 (Page No. 174)
Consider a multiprogrammed system with degree of $6$ (i.e., six programs in memory at the same time). Assume that each process spends $40\%$ of its time waiting for I/O. What will be the CPU utilization?

Consider a multiprogrammed system with degree of $6$ (i.e., six programs in memory at the same time). Assume that each process spends $40\%$ of its time waiting for I/O. ...

2.7k views

commented Dec 23, 2022

7 answers

7

GATE CSE 2004 | Question: 14
Consider the following relation schema pertaining to a students database: Students (rollno, name, address) Enroll (rollno, courseno, coursename) where the primary keys are shown underlined. The number of tuples in the student and Enroll tables are $120$ and $8$ respectively. What ... Student * Enroll), where *' denotes natural join? $8, 8$ $120, 8$ $960, 8$ $960, 120$

Consider the following relation schema pertaining to a students database:Students (rollno, name, address)Enroll (rollno, courseno, coursename)where the primary keys are s...

28.6k views

answered Nov 12, 2022

2 answers

8

TIFR CSE 2014 | Part B | Question: 10
Given a set of $n$ distinct numbers, we would like to determine both the smallest and the largest number. Which of the following statements is TRUE? These two elements can be determined using $O\left(\log^{100}n\right)$ ... comparisons do not suffice, however these two elements can be determined using $2(n - 1)$ comparisons. None of the above.

Given a set of $n$ distinct numbers, we would like to determine both the smallest and the largest number. Which of the following statements is TRUE?These two elements can...

5.4k views

comment edited Jan 31, 2022

2 answers

9

Doubt
for all the above questions answer the following : a ) how many minimum relation tables are required which satisfy 1NF b) how many minimum relation tables are required which satisfy 3NF c) how many minimum relation tables are required which satisfy BCNF d) minimum tables required Note: please provide detailed answer

for all the above questions answer the following :a ) how many minimum relation tables are required which satisfy 1NFb) how many minimum relation tables are required whic...

2.5k views

comment edited Jan 29, 2022

3 answers

10

TIFR CSE 2014 | Part A | Question: 11
A large community practices birth control in the following peculiar fashion. Each set of parents continues having children until a son is born; then they stop. What is the ratio of boys to girls in the community if, in the absence of birth control, $51\%$ of the babies are born male? $51:49$ $1:1$ $49:51$ $51:98$ $98:51$

A large community practices birth control in the following peculiar fashion. Each set of parents continues having children until a son is born; then they stop. What is th...

1.6k views

commented Jan 26, 2022

1 answer

11

TIFR CSE 2014 | Part A | Question: 13
Let $L$ be a line on the two dimensional plane. $L'$s intercepts with the $X$ and $Y$ axes are respectively $a$ and $b$. After rotating the co-ordinate system (and leaving $L$ untouched), the new intercepts are $a'$ and $b'$ respectively. Which ... $\frac{b}{a}+\frac{a}{b}=\frac{b'}{a'}+\frac{a'}{b'}$. None of the above.

Let $L$ be a line on the two dimensional plane. $L'$s intercepts with the $X$ and $Y$ axes are respectively $a$ and $b$. After rotating the co-ordinate system (and leavin...

1.5k views

comment edited Jan 25, 2022

5 answers

12

GATE CSE 1997 | Question: 15
Consider the following function. Function F(n, m:integer):integer; begin if (n<=0) or (m<=0) then F:=1 else F:F(n-1, m) + F(n, m-1); end; Use the recurrence relation ... value of $F(n, m)$? How many recursive calls are made to the function $F$, including the original call, when evaluating $F(n, m)$.

Consider the following function.Function F(n, m:integer):integer; begin if (n<=0) or (m<=0) then F:=1 else F:F(n-1, m) + F(n, m-1); end;Use the recurrence relation $\beg...

4.6k views

answer edited Jan 25, 2022

1 answer

13

#dbms #serializability
There exist an schedule which serializable but is neither view serializable nor conflict serializable ?

There exist an schedule which serializable but is neither view serializable nor conflict serializable ?

3.3k views

commented Jan 24, 2022

1 answer

14

countability
if a language is not recursively enumerable, then is it uncountable language? I believe every language over ∑ is subset of ∑* which is a countable set and as subset of countable set is countable therefore every language itself is countable whether it is recursively enumerable or not.

if a language is not recursively enumerable, then is it uncountable language? I believe every language over ∑ is subset of ∑* which is a countable set and as subset o...

341 views

answered Jan 23, 2022

2 answers

15

Countability
A language in NOT - RE is un-countably infinite. true or false?

A language in NOT - RE is un-countably infinite. true or false?

1.9k views

answer edited Jan 23, 2022

4 answers

16

GATE CSE 1989 | Question: 14a
Symbolize the expression "Every mother loves her children" in predicate logic.

Symbolize the expression "Every mother loves her children" in predicate logic.

5.8k views

commented Jan 13, 2021

6 answers

17

GATE CSE 2000 | Question: 2.8
What can be said about a regular language $L$ over $\{ a \}$ whose minimal finite state automaton has two states? $L$ must be $\{a^n \mid n \ \text{ is odd}\}$ $L$ must be $\{a^n \mid n \ \text{ is even}\}$ $L$ must be $\{a^n \mid n \geq 0\}$ Either $L$ must be $\{a^n \mid n \text{ is odd}\}$, or $L$ must be $\{a^n \mid n \text{ is even}\}$

What can be said about a regular language $L$ over $\{ a \}$ whose minimal finite state automaton has two states?$L$ must be $\{a^n \mid n \ \text{ is odd}\}$$L$ must be...

8.9k views

commented Dec 9, 2020

3 answers

18

TIFR CSE 2019 | Part B | Question: 11
Consider the following non-deterministic automaton,where $s_1$ is the start state and $s_4$ is the final (accepting) state. The alphabet is $\{a,b\}$. A transition with label $\epsilon$ can be taken without consuming any symbol from the input. Which of the following regular expressions correspond ... $(a+b)^*ba^*$ $(a+b)^*ba(aa)^*$ $(a+b)^*$ $(a+b)^*baa^*$

Consider the following non-deterministic automaton,where $s_1$ is the start state and $s_4$ is the final (accepting) state. The alphabet is $\{a,b\}$. A transition with l...

2.1k views

commented Dec 8, 2020

10 answers

19

GATE CSE 2008 | Question: 78
Let $x_n$ denote the number of binary strings of length $n$ that contain no consecutive $0$s. Which of the following recurrences does $x_n$ satisfy? $x_n = 2x_{n-1}$ $x_n = x_{\lfloor n/2 \rfloor} + 1$ $x_n = x_{\lfloor n/2 \rfloor} + n$ $x_n = x_{n-1} + x_{n-2}$

Let $x_n$ denote the number of binary strings of length $n$ that contain no consecutive $0$s.Which of the following recurrences does $x_n$ satisfy?$x_n = 2x_{n-1}$$x_n = ...

8.5k views

answered Aug 1, 2020

16 answers

20

GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________

The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________

54.0k views

commented Jul 30, 2020

5 answers

21

TIFR CSE 2015 | Part A | Question: 6
Ram has a fair coin, i.e., a toss of the coin results in either head or tail and each event happens with probability exactly half $(1/2)$. He repeatedly tosses the coin until he gets heads in two consecutive tosses. The expected number of coin tosses that Ram does is. $2$ $4$ $6$ $8$ None of the above

Ram has a fair coin, i.e., a toss of the coin results in either head or tail and each event happens with probability exactly half $(1/2)$. He repeatedly tosses the coin u...

5.1k views

commented Jul 28, 2020

6 answers

22

GATE CSE 2014 Set 1 | Question: 9
A machine has a $32\text{-bit}$ architecture, with $1\text{-word}$ long instructions. It has $64$ registers, each of which is $32$ bits long. It needs to support $45$ instructions, which have an immediate operand in ... to two register operands. Assuming that the immediate operand is an unsigned integer, the maximum value of the immediate operand is ____________

A machine has a $32\text{-bit}$ architecture, with $1\text{-word}$ long instructions. It has $64$ registers, each of which is $32$ bits long. It needs to support $45$ ins...

18.4k views

commented Jul 25, 2020

6 answers

23

GATE IT 2007 | Question: 25
What is the largest integer $m$ such that every simple connected graph with $n$ vertices and $n$ edges contains at least $m$ different spanning trees ? $1$ $2$ $3$ $n$

What is the largest integer $m$ such that every simple connected graph with $n$ vertices and $n$ edges contains at least $m$ different spanning trees ?$1$$2$$3$$n$

21.5k views

commented Jul 24, 2020

7 answers

24

GATE CSE 2008 | Question: 23
Which of the following statements is true for every planar graph on $n$ vertices? The graph is connected The graph is Eulerian The graph has a vertex-cover of size at most $\frac{3n}{4}$ The graph has an independent set of size at least $\frac{n}{3}$

Which of the following statements is true for every planar graph on $n$ vertices?The graph is connectedThe graph is EulerianThe graph has a vertex-cover of size at most $...

55.1k views

commented Jul 19, 2020

4 answers

25

GATE CSE 1999 | Question: 2.22
The main difference(s) between a CISC and a RISC processor is/are that a RISC processor typically has fewer instructions has fewer addressing modes has more registers is easier to implement using hard-wired logic

The main difference(s) between a CISC and a RISC processor is/are that a RISC processor typicallyhas fewer instructionshas fewer addressing modeshas more registersis easi...

9.1k views

commented Jul 10, 2020

5 answers

26

GATE CSE 2011 | Question: 21
Consider a hypothetical processor with an instruction of type $\text{LW R1, 20(R2)}$, which during execution reads a $32\text{-bit}$ word from memory and stores it in a $32\text{-bit}$ ... mode implemented by this instruction for the operand in memory? Immediate addressing Register addressing Register Indirect Scaled Addressing Base Indexed Addressing

Consider a hypothetical processor with an instruction of type $\text{LW R1, 20(R2)}$, which during execution reads a $32\text{-bit}$ word from memory and stores it in a ...

17.5k views

commented Jul 10, 2020

8 answers

27

GATE CSE 2005 | Question: 65
Consider a three word machine instruction $\text{ADD} A[R_0], @B$ The first operand (destination) $ A[R_0] $ uses indexed addressing mode with $R_0$ as the index register. The second operand (source) $ @B $ uses indirect addressing mode. $A$ and $B$ ... (first operand). The number of memory cycles needed during the execution cycle of the instruction is: $3$ $4$ $5$ $6$

Consider a three word machine instruction$\text{ADD} A[R_0], @B$The first operand (destination) $“A[R_0]”$ uses indexed addressing mode with $R_0$ as the index regist...

34.3k views

commented Jul 10, 2020

5 answers

28

GATE CSE 1990 | Question: 3-i
Choose the correct alternatives (More than one may be correct). Two NAND gates having open collector outputs are tied together as shown in below figure. The logic function $Y,$ implemented by the circuit is, $Y=ABC + DE$ $Y=\overline{ABC + DE}$ $Y=ABC.DE$ $Y=\overline{ABC.DE}$

Choose the correct alternatives (More than one may be correct).Two NAND gates having open collector outputs are tied together as shown in below figure.The logic function ...

7.4k views

answer edited Jul 8, 2020

1 answer

29

TIFR CSE 2018 | Part A | Question: 12
An $n \times n$ matrix $M$ with real entries is said to be positive definite if for every non-zero $n$-dimensional vector $x$ with real entries, we have $x^{T}Mx>0.$ Let $A$ and $B$ be symmetric, positive definite matrices of size ... $(3)$ Only $(1)$ and $(3)$ None of the above matrices are positive definite All of the above matrices are positive definite

An $n \times n$ matrix $M$ with real entries is said to be positive definite if for every non-zero $n$-dimensional vector $x$ with real entries, we have $x^{T}Mx>0.$ Let ...

1.7k views

commented Jul 8, 2020

6 answers

30

TIFR CSE 2019 | Part A | Question: 5
Asha and Lata play a game in which Lata first thinks of a natural number between $1$ and $1000$. Asha must find out that number by asking Lata questions, but Lata can only reply by saying Yes or no . Assume that Lata always tells the truth. What is ... she can always find out the number Lata has thought of? $10$ $32$ $100$ $999$ $\text{None of the above}$

Asha and Lata play a game in which Lata first thinks of a natural number between $1$ and $1000$. Asha must find out that number by asking Lata questions, but Lata can onl...

4.4k views

answered Jul 6, 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