Dark Mode

Answers by HM

0 votes

1

GATE IT 2007 | Question: 44, ISRO2015-34
A hard disk system has the following parameters : Number of tracks $= 500$ Number of sectors/track $= 100$ Number of bytes /sector $= 500$ Time taken by the head to move from one track to adjacent track $= 1 \ ms$ Rotation speed $= 600 \ rpm$. What is ... time taken for transferring $250$ bytes from the disk ? $300.5 \ ms$ $255.5 \ ms$ $255 \ ms$ $300 \ ms$

answered in Operating System Dec 29, 2022

18.4k views

0 votes

2

Kernal level vs User level thread
Consider two processes X having P threads and Y having Q threads with equal time slices respectively.Threads are mixed with user level threads (ULT) and kernel level threads (KLT) with P > Q. Now consider the following statements I) If all threads are user level threads ... . III only 2. II and III only 3. I and II only 4.I, II and III How statement-1 Is true??

answered in Operating System Dec 15, 2022

880 views

0 votes

3

Applied Course | Mock GATE | Test 1 | Question: 31
Which of the following statement is/are correct? A Router has a physical and logical(IP) address for each of its interfaces. A router acts only on those packets in which the link-layer destination address matches the address of ... changes the link-layer address of the packet (both source and destination) when it forwards the packet. All the above

answered in Computer Networks Dec 14, 2022

412 views

0 votes

4

GATE CSE 2015 Set 1 | Question: 41
Consider an Entity-Relationship $(\text{ER})$ model in which entity sets $E_{1}$ and $E_{2}$ are connected by an $m:n$ relationship $R_{12}$. $E_{1}$ and $E_{3}$ are connected by a $1 : n$ ($1$ ... from the above $\text{ER}$ model, then the minimum number of relations that would be generated if all relation are in $\text{3NF}$ is________________.

answered in Databases Dec 7, 2022

13.8k views

0 votes

5

Identify the type of Grammar
The Grammar E$\rightarrow$ EE | a is LR(1) SLR(1) LR(0) None

answered in Compiler Design Nov 22, 2022

2.8k views

0 votes

6

ISI2014-PCB-CS-6b
In a LAN, $n^2$ routers are connected in an $n \times n$ mesh such that $R(i, j)$ represents a router in the $i$-th row and $j$-th column of the mesh. Find how many distinct shortest paths exist between two routers $R(i_1, j_1)$ ... how many of these distinct shortest paths will be node disjoint, i.e., with no common node except the source and the destination? Justify your answer.

answered in Computer Networks Sep 29, 2022

566 views

0 votes

7

database system concepts, self doubt
select all the right options $\forall_{t_1, \;t_2 \;\in \;r(R)}\big[(t_1(\alpha)=t_2(\alpha))\; \rightarrow (t_1(\beta)=t_2(\beta))\big]$ implies that there is $\alpha \rightarrow \beta$ ... functional dependencies should be possible on individual decomposed relations or when they joined. BCNF decomposition of a relation is default lossless decomposition.

answered in Databases Sep 16, 2022

120 views

0 votes

8

GATE CSE 2019 | Question: 12
Let $G$ be an undirected complete graph on $n$ vertices, where $n > 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to $n!$ $(n-1)!$ $1$ $\frac{(n-1)!}{2}$

answered in Graph Theory Dec 30, 2021

16.4k views