Dark Mode

Recent activity by Vegeta

9 answers

1

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

commented in Theory of Computation Jan 16, 2019

21.2k views

5 answers

2

GATE CSE 2016 Set 2 | Question: 16
The number of states in the minimum sized DFA that accepts the language defined by the regular expression. $(0+1)^{*} (0+1) (0+1)^{*}$ is ________.

commented in Theory of Computation Jan 16, 2019

15.7k views

6 answers

3

GATE IT 2006 | Question: 32
Let $L$ be a context-free language and $M$ a regular language. Then the language $L ∩ M$ is always regular never regular always a deterministic context-free language always a context-free language

commented in Theory of Computation Jan 12, 2019

9.8k views

2 answers

4

Which of the following languages are CFL?
Which of the following languages are CFL? $L_1= \left \{ 0^n 1^m \mid n \leq m \leq 2n \right \} \\[1em] L_2 =\left \{ a^i b^j c^k \mid i=2j \text{ or } j=2k \right \}$

commented in Theory of Computation Jan 7, 2019

1.9k views

0 answers

5

self doubt
Consider the string “GATE2000”, the number of non-trivial substrings of given string are i am constatly confused in these types of substrings questions please specify some resource or plzz derive how to solve these questions

commented in Compiler Design Jan 5, 2019

765 views

5 answers

6

GATE IT 2007 | Question: 85
Consider the $B^{+}$ tree in the adjoining figure, where each node has at most two keys and three links. Keys $K15$ and then $K25$ are inserted into this tree in that order. Now the key $K50$ is deleted from the $B^+$ tree resulting after the two ... (i) and (ii) are true Statements (ii) and (iii) are true Statements (iii) and (i) are true All the statements are false

commented in Databases Jan 4, 2019

17.4k views

1 answer

7

MADE EASY
The Necessary condition to diagonalize a matrix is that A) ITS all eigen values should be distdist B) its eigen vectors should be indeindepent C) its eigen values should be real D) matrix is non singular

commented in Linear Algebra Jan 3, 2019

1.4k views

7 answers

8

GATE CSE 2018 | Question: 26
Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$. Consider the following statements. P does not have an inverse P has a repeated eigenvalue P cannot be diagonalized Which one of the ... III are necessarily true Only II is necessarily true Only I and II are necessarily true Only II and III are necessarily true

commented in Linear Algebra Dec 20, 2018

27.2k views

1 answer

9

#self doubt #minimum spanning tree
T/F In a graph G=(V,E) suppose that each edge e ∊ E has an integer weight w(e) such that 1<= W(e) <=n Then there is a an o(mlogn) time algorithm to ﬁnd a minimum spanning tree in G. Also,Does this "weight w(e) such that 1<= W(e) <=n" has significance on time complexity or we consider it as some edges weights and proceed?

commented in Algorithms Dec 18, 2018

346 views

1 answer

10

Compiler: Viable Prefixes
Consider the following grammar: $S\rightarrow0S1 | 01$ How many of the following are the viable prefixes of the grammar? i. 01 ii. 001 iii. 00011 iv. 00S1 PS: given answers i, ii and iv , please explain!

commented in Compiler Design Dec 10, 2018

1.3k views

7 answers

11

TIFR CSE 2019 | Part B | Question: 13
A row of $10$ houses has to be painted using the colours red, blue, and green so that each house is a single colour, and any house that is immediately to the right of a red or a blue house must be green. How many ways are there to paint the houses? $199$ $683$ $1365$ $3^{10}-2^{10}$ $3^{10}$

commented in Combinatory Dec 9, 2018

4.9k views

3 answers

12

GATE CSE 2018 | Question: 23
A $32\text{-bit}$ wide main memory unit with a capacity of $1\;\textsf{GB}$ is built using $256\textsf{M} \times 4\text{-bit}$ DRAM chips. The number of rows of memory cells in the DRAM chip is $2^{14}$. The ... The percentage (rounded to the closest integer) of the time available for performing the memory read/write operations in the main memory unit is _________.

commented in CO and Architecture Dec 6, 2018

25.7k views

2 answers

13

selfas
f(n) + O(f(n)) = Θ(f(n)) True or not? Explain please

asked in Algorithms Nov 17, 2018

567 views

7 answers

14

GATE CSE 2006 | Question: 11
Consider a weighted complete graph $G$ on the vertex set $\{v_1,v_2,.....v_n\}$ such that the weight of the edge $(v_i, v_j)$ is $2|i-j|$. The weight of a minimum spanning tree of $G$ is: $n-1$ $2n-2$ $\begin{pmatrix} n \\ 2 \end{pmatrix}$ $n^2$

commented in Algorithms Nov 4, 2018

14.7k views

0 answers

15

Memory Overhead
What is memory overhead? Is it's size same as size of page table for the process?

commented in Operating System Nov 1, 2018

1.5k views

1 answer

16

TOC SELF DOUBT
Which of the following is true:? 1) For a given grammar, there is one and only one language. 2) For a given language, there is one and only one grammar. Please explain with example.

commented in Theory of Computation Oct 29, 2018

255 views

0 answers

17

Made easy
Option (a) Best fit (b) Next fit (c) First fit

closed in Operating System Oct 29, 2018

248 views

4 answers

18

Avg stall cycles per instruction
Suppose that in $500$ memory references there are $50$ misses in the first level cache and $20$ misses in second level cache. Assume miss penalty from the $L_{2}$ cache to memory is $100$ cycles. The hit time of $L_{2}$ cache is $20$ ... $L_{1}$ cache is $10$ cycles. If there are $2.5$ memory references per instruction. How many average stall cycle per instruction?

commented in CO and Architecture Oct 26, 2018

4.7k views

4 answers

19

MadeEasy Test Series: CO & Architecture - Cache Memory
Suppose that in 250 memory references there are 30 misses in first level cache and 10 misses in second level cache. Assume that miss penalty from L$_2$ cache memory are 50 cycles. The hit time of L$_2$ cache is 10 cycles. The ... with given misses = 1800 stall cycles = 1800-1250 = 550 number of stalls/instruction= 550/200 = 2.75 please verify

commented in CO and Architecture Oct 26, 2018

3.9k views

3 answers

20

self doubt in OS(galvin)
All safe states are deadlock free. But we can go to deadlock with some combination of sequence? So if the question is, from the safe state can we enter deadlock? Ans should be YES. please give your thought

commented in Operating System Oct 22, 2018

897 views

6 answers

21

deadlock
If a process is in unsafe state, then: (a) It is in deadlock (b) It might successfully complete (c) It will lead to deadlock (d) None of the above

commented in Operating System Oct 22, 2018

10.7k views

2 answers

22

CPU utilization
If the waiting time for a process is p and there are n processes in the memory then the CPU utilization is given by, a. $\frac{p}{n}$ b. $p^{n}$ c. $1-p^{n}$ d. $n-p^{n}$

answered in Operating System Oct 22, 2018

3.8k views

0 answers

23

commented in Operating System Oct 18, 2018

335 views

1 answer

24

Scheduling Overheads
Consider three processes that require 10, 20, 30 units and arrive at time 0, 2, 4. The number of scheduling overheads needed using S.R.T.F. scheduling is I think answer is 1 at time t = 10

answered in Operating System Oct 17, 2018

3.9k views

5 answers

25

ISRO-2013-18
How many check bits are required for $16$ bit data word to detect $2$ bit errors and single bit correction using hamming code? $5$ $6$ $7$ $8$

commented in Computer Networks Oct 16, 2018

9.8k views

4 answers

26

GATE IT 2005 | Question: 26
Traceroute reports a possible route that is taken by packets moving from some host $A$ to some other host $B$. Which of the following options represents the technique used by traceroute to identify these hosts: By progressively querying routers about the next ... in the ascending order of their hop distance from $A$ By locally computing the shortest path from $A$ to $B$

commented in Computer Networks Oct 15, 2018

14.3k views

1 answer

27

self doubt
CRC can detect any odd number of errors. CRC can detect all burst errors of less than the degree of the polynomial. Please explain and if possible give proof

asked in Computer Networks Oct 15, 2018

741 views

7 answers

28

GATE CSE 2003 | Question: 28
Which of the following functionality must be implemented by a transport protocol over and above the network protocol? Recovery from packet losses Detection of duplicate packets Packet delivery in the correct order End to end connectivity

commented in Computer Networks Oct 15, 2018

14.1k views

3 answers

29

Sliding window protocol
Station A needs to send a message consisting of 10 packets to station B using a sliding window of size 4. All packets are ready and can be transferred immediately.Selective repeat and GBN are used at 2 different times and every 5th packet get lost for ... of transmissions that A has to make in selective repeat and GBN respectively to ensure safe delivery to B. Then x+y= ?

commented in Computer Networks Oct 11, 2018

6.2k views

3 answers

30

Ace Test Series: Computer Networks - Sliding Window
Pls verify that Ans. would be 45 or 46 ?

commented in Computer Networks Oct 10, 2018

975 views