Recent activity

0 votes

0 answers

1

ISI2016-DCG-55
$\lim_{x\rightarrow 0}\sin\left(\dfrac{1}{x}\right)$ equals $-1$ $0$ $1$ Does not exist

edited 52 seconds ago in Others by Lakshman Patel RJIT Boss (47.4k points) | 1 view

0 votes

0 answers

2

ISI2016-DCG-56
$\lim_{x\rightarrow 0}\left(1+\dfrac{1}{x^{2}}\right)^{x}$ equals $-1$ $0$ $1$ Does not exist

edited 1 minute ago in Others by Lakshman Patel RJIT Boss (47.4k points) | 1 view

0 votes

0 answers

3

ISI2016-DCG-54
$\lim_{x\rightarrow 0}x\sin\left(\dfrac{1}{x}\right)$ equals $-1$ $0$ $1$ Does not exist

edited 5 minutes ago in Others by Lakshman Patel RJIT Boss (47.4k points) | 1 view

+12 votes

5 answers

4

SCHEDULING
i am getting answer as 6....to calculate waiting time i have removed CPU time used by the process (BT) from total time spend inside(TAT)....not included I/O time(i think I/O is also included in waiting time)..is it correct? Three processors P,Q,R are started at times 0 ,2 ,3 ... TC2 P 0 2 1 5 3 Q 2 3(L) 3 3 1 R 3 1(H) 2 3 1 What is the average waiting time (in milliseconds) ?

comment edited 5 minutes ago in Operating System by abhayk (163 points) | 973 views

0 votes

1 answer

5

ISI2015-DCG-11

answered 6 minutes ago in Others by Satbir Boss (18.3k points) | 5 views

0 votes

0 answers

6

ISI2016-DCG-53
$\lim_{x\rightarrow-1}\dfrac{1+\sqrt[3]{x}}{1+\sqrt[5]{x}}$ equals $\frac{3}{5}$ $\frac{5}{3}$ $1$ $\infty$

edited 11 minutes ago in Others by Lakshman Patel RJIT Boss (47.4k points) | 1 view

0 votes

0 answers

7

ISI2016-DCG-52
The area bounded by $y=x^{2}-4,y=0$ and $x=4$ is $\frac{64}{3}$ $6$ $\frac{16}{3}$ $\frac{32}{3}$

edited 22 minutes ago in Others by Lakshman Patel RJIT Boss (47.4k points) | 1 view

+29 votes

4 answers

8

GATE1990-7-b
In a two-level virtual memory, the memory access time for main memory, $t_{M}=10^{-8}$ sec, and the memory access time for the secondary memory, $t_D=10^{-3}$ sec. What must be the hit ratio, $H$ such that the access efficiency is within $80$ percent of its maximum value?

commented 37 minutes ago in Operating System by Satbir Boss (18.3k points) | 4.7k views

0 votes

0 answers

9

ISI2016-DCG-51
Four squares of sides $x\: cm$ each are cut off from the four corners of a square metal sheet having side $10\: cm.$ The residual sheet is then folded into an open box which is then filled with a liquid costing Rs. $x^{2}$ per $cm^{3}.$ The value of $x$ for which the cost of filling the box completely with the liquid is maximized, is $100$ $50$ $30$ $10$

edited 49 minutes ago in Others by Lakshman Patel RJIT Boss (47.4k points) | 2 views

+31 votes

2 answers

10

GATE2008-35
For inclusion to hold between two cache levels $L_1$ and $L_2$ in a multi-level cache hierarchy, which of the following are necessary? $L_1$ must be write-through cache $L_2$ must be a write-through cache The associativity of $L_2$ must be greater than that of $L_1$ The $L_2$ cache must be at least as large as the $L_1$ cache IV only I and IV only I, II and IV only I, II, III and IV

commented 50 minutes ago in CO and Architecture by PRANAV M (187 points) | 6.4k views

0 votes

1 answer

11

ISI2015-DCG-9

answered 1 hour ago in Others by Satbir Boss (18.3k points) | 7 views

0 votes

1 answer

12

ISI2018-DCG-1
The digit in the unit place of the number $7^{78}$ is $1$ $3$ $7$ $9$

answered 1 hour ago in Others by Ashwani Kumar 2 Boss (15k points) | 9 views

0 votes

1 answer

13

ISI2018-DCG-16
Let $A=\begin{pmatrix} 1 & 1 & 0\\ 0 & a & b\\1 & 0 & 1 \end{pmatrix}$. Then $A^{-1}$ does not exist if $(a,b)$ is equal to $(1,-1)$ $(1,0)$ $(-1,-1)$ $(0,1)$

answered 1 hour ago in Others by Ashwani Kumar 2 Boss (15k points) | 3 views

0 votes

1 answer

14

ISI2018-DCG-12
Let $A=\{10,11,12,13, \dots ,99\}$. How many pairs of numbers $x$ and $y$ are possible so that $x+y\geq 100$ and $x$ and $y$ belong to $A$? $2405$ $2455$ $1200$ $1230$

commented 1 hour ago in Others by toxicdesire Active (1.1k points) | 16 views

+27 votes

3 answers

15

GATE2001-20
Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two successive tracks is $0.2$ millisecond. Consider a set of disk requests to ... at track $0$ and the elevator algorithm is used to schedule disk requests, what is the worse case time to complete all the requests?

commented 2 hours ago in Operating System by suchithreddy (391 points) | 2.7k views

+23 votes

7 answers

16

GATE2006-80
A CPU has a $32 KB$ direct mapped cache with $128$ byte-block size. Suppose A is two dimensional array of size $512 \times512$ with elements that occupy $8$-bytes each. Consider the following two C code segments, $P1$ and $P2$. P1: for (i=0; i<512; i++) { for (j=0; j<512 ... by $P1$ be $M_{1}$and that for $P2$ be $M_{2}$. The value of $M_{1}$ is: $0$ $2048$ $16384$ $262144$

commented 2 hours ago in CO and Architecture by PRANAV M (187 points) | 4.3k views

0 votes

1 answer

17

ISI2015-DCG-8

answered 2 hours ago in Others by Satbir Boss (18.3k points) | 8 views

0 votes

1 answer

18

ISI2015-DCG-1
The sequence $\frac{1}{{\log_{3}}^{2}}$, $\frac{1}{{\log_{6}}^{2}}$, $\frac{1}{{\log_{12}}^{2}}$, $\frac{1}{{\log_{24}}^{2}}$ is in Arithmetic progression (AP) Geometric progression ( GP) Harmonic progression (HP) None of these.

edited 2 hours ago in Others by makhdoom ghaya Boss (29.7k points) | 25 views

0 votes

2 answers

19

COA:- Memory Access Time

answered 2 hours ago in CO and Architecture by Akash Ghosh (99 points) | 214 views

0 votes

1 answer

20

Consider a memory of 8 words per block.If 2 clock cycle are required to transfer address from CPU to main memory

commented 3 hours ago in CO and Architecture by Akash Ghosh (99 points) | 308 views

+2 votes

1 answer

21

Graph
The problem of finding the set of vertices reachable from a given vertex in a graph can be solved in time A. O(|V|^2) B. O(|V| + |E|) C. O(|V||E|) D. none of these

commented 3 hours ago in Algorithms by kunal shahare (9 points) | 71 views

+2 votes

1 answer

22

regular languages
A Language is said to be regular iff (a) There exists a Right Linear Regular Grammar for L (b) There exists a Left Linear Regular Grammar for L (c) There exists a nfa with single final state (d) There exists a dfa with single final state (e) There exists a nfa without ԑ - move Which are true? (i) All are true (b) a, b, c are true (c) a, b, c, e are true (d) a, b, d are true

commented 3 hours ago in Theory of Computation by mohan123 Junior (785 points) | 119 views

0 votes

1 answer

23

ISI2015-DCG-7

answered 3 hours ago in Others by Satbir Boss (18.3k points) | 10 views

0 votes

0 answers

24

UGC self doubt
According to closure properties chart DCFL are closed under the complimentations but CFL's are not. L= 0n1n | n≥0 is DCFL so L' will also be DCFL. Again Lk is for any k≥1 means L to power any k≥1 should not be DCFL because DCFL's are not closed under union. where I am wrong Sir?

commented 3 hours ago in Theory of Computation by Nitesh Singh 2 Active (2.5k points) | 71 views

+24 votes

7 answers

25

GATE2009-41
The above DFA accepts the set of all strings over $\{0,1\}$ that begin either with $0$ or $1$. end with $0$. end with $00$. contain the substring $00$.

answered 3 hours ago in Theory of Computation by immanujs (219 points) | 2.7k views

+13 votes

2 answers

26

GATE1999-1.5
Context-free languages are closed under: Union, intersection Union, Kleene closure Intersection, complement Complement, Kleene closure

commented 3 hours ago in Theory of Computation by Nitesh Singh 2 Active (2.5k points) | 1.6k views

+32 votes

7 answers

27

GATE2009-40
Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ are languages as defined below: $L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}$ $L_2=\left \{ a^i b^j c^k \mid i,j,k \geq 0 \right \}$ Then $L$ is Not recursive Regular Context free but not regular Recursively enumerable but not context free.

answered 3 hours ago in Theory of Computation by immanujs (219 points) | 3k views

+29 votes

5 answers

28

GATE2015-1-20
Consider a 4-bit Johnson counter with an initial value of 0000. The counting sequence of this counter is 0, 1, 3, 7, 15, 14, 12, 8, 0 0, 1, 3, 5, 7, 9, 11, 13, 15, 0 0, 2, 4, 6, 8, 10, 12, 14, 0 0, 8, 12, 14, 15, 7, 3, 1, 0

commented 3 hours ago in Digital Logic by Nitesh Singh 2 Active (2.5k points) | 4.8k views

+27 votes

7 answers

29

GATE2009-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.

answer edited 4 hours ago in Theory of Computation by immanujs (219 points) | 4.2k views

0 votes

1 answer

30

Cache design and Memory Access

answered 4 hours ago in CO and Architecture by Akash Ghosh (99 points) | 88 views

0 votes

1 answer

31

TANCET 2017 DBMS

answered 4 hours ago in Databases by commenter commenter (441 points) | 29 views

+38 votes

8 answers

32

GATE2010-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}$

answer edited 4 hours ago in Theory of Computation by immanujs (219 points) | 4.4k views

0 votes

1 answer

33

UPPCL AE 2018:55

commented 4 hours ago in Algorithms by pawan kumarln Boss (12k points) | 26 views

+18 votes

4 answers

34

GATE2009-15
Which one of the following languages over the alphabet $\{0,1\}$ is described by the regular expression: $(0+1)^*0(0+1)^*0(0+1)^*$? The set of all strings containing the substring $\text{00}$ The set of all strings containing at most two $\text{0}$'s The set of all strings containing at least two $\text{0}$'s The set of all strings that begin and end with either $\text{0}$ or $\text{1}$

answered 4 hours ago in Theory of Computation by immanujs (219 points) | 1.6k views

+33 votes

4 answers

35

GATE2003-70
Let $G= (V,E)$ be a directed graph with $n$ vertices. A path from $v_i$ to $v_j$ in $G$ is a sequence of vertices ($v_{i},v_{i+1}, \dots , v_j$) such that $(v_k, v_{k+1}) \in E$ for all $k$ in $i$ through $j-1$. A simple path is a path in which no ... path length from $j$ to $k$ If there exists a path from $j$ to $k$, every simple path from $j$ to $k$ contains at most $A[j,k]$ edges

commented 4 hours ago in Algorithms by aeaswar81 (13 points) | 4.1k views

+1 vote

0 answers

36

doubt
Is a null matrix also a diagonal matrix? i read somewhere atleast one element in diagonal should be non zero to be a diagonal matrix //provided null matrix will be square and can a null square matrix be a scalar matrix ?

commented 5 hours ago in Mathematical Logic by Bikram Veteran (70.9k points) | 135 views

0 votes

1 answer

37

ISI2015-DCG-6

answer edited 5 hours ago in Others by Satbir Boss (18.3k points) | 16 views

0 votes

1 answer

38

memory modules
Consider the main memory system that consists of 8 memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied for 100 nanoseconds (ns) by the data, address, and control signals. During the same ... be on the bus at any time. The maximum number of requests(of one word each) that can be completed in 1millisecond is ________

answered 5 hours ago in CO and Architecture by Akash Ghosh (99 points) | 28 views

0 votes

1 answer

39

ISI2018-DCG-25
There are three circles of equal diameter (10 units each) as shown in the figure below. The straight line $PQ$ passes through the centres of all the three circles. The straight line $PR$ is a tangent to the third circle at $C$ and cuts the second circle at the points $A$ and $B,$ as shown in the figure.Then the length of the line segment $AB$ is 6 units 7 units 8 units 9 units

edited 5 hours ago in Others by Naveen Kumar 3 Boss (14.4k points) | 7 views

0 votes

0 answers

40

ISI2018-DCG-21
A box with a square base of length $x$ and height $y$ has an open top and its volume is $32$ cubic centimetres, as shown in the figure below. The values of $x$ and $y$ that minimize the surface area of the box are $x=4$ cm $\&$ $y=2 $ cm $x=3$ cm $\&$ $y=\frac{32}{9} $ cm $x=2$ cm $\&$ $y=8 $ cm none of these.

edited 5 hours ago in Others by Naveen Kumar 3 Boss (14.4k points) | 5 views

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

Recent Posts

Recent Blog Comments