Dark Mode

Recent activity by King Suleiman

3 answers

1

GATE CSE 2020 | Question: GA-4
The dawn of the $21$st century witnessed the melting glaciers oscillating between giving too much and too little to billions of people who depend on them for fresh water. The UN climate report estimates that without deep cuts to man- ... billions of people. Billions of people are responsible for man-made emissions. Billions of people are affected by melting glaciers.

commented in Verbal Aptitude Feb 12, 2020

2.8k views

9 answers

2

GATE CSE 2016 Set 2 | Question: 28
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. Consider the following statements: Each compound in U \ S reacts ... \ S reacts with an even number of compounds. Which one of the above statements is ALWAYS TRUE? Only I Only II Only III None.

answered in Set Theory & Algebra Jan 24, 2020

12.5k views

3 answers

3

GATE CSE 1995 | Question: 1.10
Consider a grammar with the following productions $S \rightarrow a \alpha b \mid b \alpha c \mid aB$ $S \rightarrow \alpha S\mid b$ $S \rightarrow \alpha b b\mid ab$ $S \alpha \rightarrow bd b\mid b$ The above grammar is: Context free Regular Context sensitive $LR(k)$

commented in Compiler Design Jan 8, 2020

15.4k views

4 answers

4

ISRO2017-68
A critical region is a piece of code which only one process executes at a time is a region prone to deadlock is a piece of code which only a finite number of processes execute is found only in windows NT operating system

commented in Operating System Jan 1, 2020

4.7k views

6 answers

5

GATE CSE 2017 Set 2 | Question: GA-8
$X$ is a $30$ digit number starting with the digit $4$ followed by the digit $7$. Then the number $X^3$ will have $90$ digits $91$ digits $92$ digits $93$ digits

commented in Quantitative Aptitude Dec 29, 2019

9.1k views

1 answer

6

UGC NET CSE | December 2019 | Part 2 | Question: 76
Consider the following statements: The running time of dynamic programming algorithm is always $\theta(\rho)$ where $\rho$ is number of subproblems When a recurrence relation has a cyclic dependency, it is impossible to use that recurrence relation (unmodified) in a correct ... are) true? Only (b) and (a) Only (b) Only (b) and (c) Only (b) and (d)

commented in Others Dec 29, 2019

298 views

6 answers

7

GATE CSE 2015 Set 2 | Question: GA-7
Four branches of a company are located at $\text{M, N, O}$ and $\text{P. M}$ is north of $\text{N}$ at a distance of $4\;\text{km; P}$ is south of $\text{O}$ at a distance of $2\;\text{km; N}$ is southeast of $\text{O}$ by $1\;\text{km}$. What is the distance between $\text{M}$ and $\text{P}$ in $\text{km}$? $5.34$ $6.74$ $28.5$ $45.49$

answered in Analytical Aptitude Dec 29, 2019

9.9k views

12 answers

8

GATE CSE 2005 | Question: 80
Consider the following data path of a $\text{CPU}.$ The $\text{ALU},$ the bus and all the registers in the data path are of identical size. All operations including incrementation of the $\text{PC}$ and the $\text{GPRs}$ are to be carried out in ... $2$ $3$ $4$ $5$

comment edited in CO and Architecture Dec 26, 2019

20.0k views

13 answers

9

GATE CSE 2016 Set 2 | Question: 50
A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to read a block from the disk is $10$ ms. Assume that the cost ... in multiples of $10$ MB. The smallest cache size required to ensure an average read latency of less than $6$ ms is _________ MB.

answered in CO and Architecture Nov 22, 2019

11.3k views

4 answers

10

GATE CSE 2017 Set 1 | Question: 11
Consider the $C$ struct defined below: struct data { int marks [100]; char grade; int cnumber; }; struct data student; The base address of student is available in register $R1$. The field student.grade can be accessed efficiently using: Post-increment ... mode, $X(R1)$, where $X$ is an offset represented in $2's$ complement $16\text{-bit}$ representation

answered in CO and Architecture Nov 15, 2019

11.4k views

3 answers

11

GATE CSE 2017 Set 1 | Question: 49
Consider a RISC machine where each instruction is exactly $4$ bytes long. Conditional and unconditional branch instructions use PC-relative addressing mode with Offset specified in bytes to the target location of the branch instruction. Further the Offset is ... $i,$ then the decimal value of the Offset is ____________ .

answered in CO and Architecture Nov 14, 2019

11.1k views

1 answer

12

GATE CSE 2011 | Question: 11
A computer handles several interrupt sources of which of the following are relevant for this question. Interrupt from CPU temperature sensor (raises interrupt if CPU temperature is too high) Interrupt from Mouse (raises Interrupt if the ... the HIGHEST priority? Interrupt from Hard Disk Interrupt from Mouse Interrupt from Keyboard Interrupt from CPU temperature sensor

commented in Operating System Nov 12, 2019

7.8k views

6 answers

13

GATE CSE 2008 | Question: 73
Consider a machine with a $2$-way set associative data cache of size $64$ Kbytes and block size $16$ bytes. The cache is managed using $32$ bit virtual addresses and the page size is $4$ Kbytes. A program to be run on this machine begins as follows: double ARR[ ... to array $\text{ARR}$. The cache hit ratio for this initialization loop is: $0\%$ $25\%$ $50\%$ $75\%$

commented in CO and Architecture Nov 11, 2019

6.5k views

3 answers

14

GATE CSE 1994 | Question: 1.21
Which one of the following statements is true? Macro definitions cannot appear within other macro definitions in assembly language programs Overlaying is used to run a program which is longer than the address space of a computer Virtual memory can ... than the address space of a computer It is not possible to write interrupt service routines in a high level language

comment edited in Operating System Nov 8, 2019

6.6k views

1 answer

15

MadeEasy Subject Test 2019: Computer Networks - Congestion Control
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 1 MSS and the threshold at the start is 1st transmission is 16 MSS. Assume TCP use ... after transmission of 7th packet . What is the congestion window size at the end of 14 RTT (in MSS)?

commented in Computer Networks Sep 7, 2019

789 views

2 answers

16

GATE CSE 2016 Set 1 | Question: GA10
In a process, the number of cycles to failure decreases exponentially with an increase in load. At a load of $80$ units, it takes $100$ cycles for failure. When the load is halved, it takes $10000 \ \text{cycles}$ for failure.The load for which the failure will happen in $5000 \ \text{cycles}$ is _____________. $40.00$ $46.02$ $60.01$ $92.02$

commented in Quantitative Aptitude Aug 27, 2019

14.3k views

9 answers

17

GATE CSE 2019 | Question: 10
Let $G$ be an arbitrary group. Consider the following relations on $G$: $R_1: \forall a , b \in G, \: a R_1 b \text{ if and only if } \exists g \in G \text{ such that } a = g^{-1}bg$ ... $R_1$ and $R_2$ $R_1$ only $R_2$ only Neither $R_1$ nor $R_2$

comment reshown in Set Theory & Algebra Aug 26, 2019

13.1k views

5 answers

18

GATE 2019
Let U = {1, 2, ..., n} and A = {(x, X), x ∈ X and X ⊆ U}. Consider the following two statements for |A|. (i) |A| = n*$\small 2^{n-1}$ (ii) |A|= Sigma(k=1 to n) k.(nCk) Which of the following is correct? (a) (i) only (b) (ii) only (c) Both (i) and (ii) (d) None of the above

commented in Set Theory & Algebra Aug 26, 2019

10.9k views

5 answers

19

GATE CSE 2018 | Question: 43
Let $G$ be a graph with $100!$ vertices, with each vertex labelled by a distinct permutation of the numbers $1, 2,\ldots, 100.$ There is an edge between vertices $u$ and $v$ if and only if the label of $u$ can be obtained by swapping two adjacent ... denote the degree of a vertex in $G$, and $z$ denote the number of connected components in $G$. Then, $y+10z=$ ______.

answered in Algorithms Aug 26, 2019

16.1k views

5 answers

20

GATE CSE 2016 Set 2 | Question: 02
Let $f(x)$ be a polynomial and $g(x)=f'(x)$ be its derivative. If the degree of $(f(x)+f(-x))$ is $10$, then the degree of $(g(x) - g(-x))$ is __________.

answered in Calculus Aug 25, 2019

8.2k views

15 answers

21

GATE CSE 2015 Set 3 | Question: 5
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ________.

commented in Combinatory Aug 23, 2019

11.7k views

6 answers

22

GATE CSE 2014 Set 2 | Question: 51
A cycle on $n$ vertices is isomorphic to its complement. The value of $n$ is _____.

answered in Graph Theory Aug 21, 2019

14.4k views

5 answers

23

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?

commented in Combinatory Aug 4, 2019

5.7k views

1 answer

24

GATE CSE 1993 | Question: 01.6
Which of the following improper integrals is (are) convergent? $\int ^{1} _{0} \frac{\sin x}{1-\cos x}dx$ $\int ^{\infty} _{0} \frac{\cos x}{1+x} dx$ $\int ^{\infty} _{0} \frac{x}{1+x^2} dx$ $\int ^{1} _{0} \frac{1-\cos x}{\frac{x^5}{2}} dx$

commented in Calculus Aug 1, 2019

1.3k views

11 answers

25

GATE CSE 2015 Set 2 | Question: 35
Consider the alphabet $\Sigma = \{0, 1\}$, the null/empty string $\lambda$ and the set of strings $X_0, X_1, \text{ and } X_2$ generated by the corresponding non-terminals of a regular grammar. $X_0, X_1, \text{ and } X_2$ are related as follows. $X_0 = 1 X_1$ $X_1 = 0 X_1 + 1 X_2$ ... $10(0^*+(10)^*)1$ $10(0^*+(10)^*)^*1$ $1(0+10)^*1$ $10(0+10)^*1 +110(0+10)^*1$

commented in Theory of Computation Jul 24, 2019

15.0k views

6 answers

26

GATE CSE 2017 Set 1 | Question: 38
Consider the following languages over the alphabet $\Sigma = \left \{ a, b, c \right \}$. Let $L_{1} = \left \{ a^{n}b^{n}c^{m}\mid m,n \geq 0 \right \}$ and $L_{2} = \left \{ a^{m}b^{n}c^{n}\mid m,n \geq 0 \right \}$. Which of the following are context-free languages? $L_{1} \cup L_{2}$ $L_{1} \cap L_{2}$ I only II only I and II Neither I nor II

commented in Theory of Computation Jul 24, 2019

11.3k views

6 answers

27

GATE CSE 2014 Set 2 | Question: 36
Let $L_1=\{w\in\{0,1\}^*\mid w$ $\text{ has at least as many occurrences of }$ $(110)'\text{s as }$ $(011)'\text{s} \}$. Let $L_2=\{w \in\{0,1\}^*\ \mid w$ $ \text{ has at least as many occurrences of }$ ... is TRUE? $L_1$ is regular but not $L_2$ $L_2$ is regular but not $L_1$ Both $L_1$ and $L_2$ are regular Neither $L_1$ nor $L_2$ are regular

answered in Theory of Computation Jul 23, 2019

19.7k views

7 answers

28

GATE CSE 2012 | Question: 46
Consider the set of strings on $\{0,1\}$ in which, every substring of $3$ symbols has at most two zeros. For example, $001110$ and $011001$ are in the language, but $100010$ is not. All strings of length less than $3$ are also in the language. A partially ...

answered in Theory of Computation Jul 23, 2019

10.6k views

9 answers

29

GATE CSE 2010 | Question: 41
Let $w$ be any string of length $n$ in $\{0,1\}^*$. Let $L$ be the set of all substrings of $w$. What is the minimum number of states in non-deterministic finite automation that accepts $L$? $n-1$ $n$ $n+1$ $2^{n-1}$

answered in Theory of Computation Jul 23, 2019

19.8k views

6 answers

30

GATE CSE 2009 | Question: 16, ISRO2017-12
Which one of the following is FALSE? There is a unique minimal DFA for every regular language Every NFA can be converted to an equivalent PDA. Complement of every context-free language is recursive. Every nondeterministic PDA can be converted to an equivalent deterministic PDA.

answered in Theory of Computation Jul 23, 2019

12.8k views