Answers by Chhotu / GATE Overflow for GATE CSE

5 votes

61

TIFR CSE 2013 | Part B | Question: 5
Given a weighted directed graph with $n$ vertices where edge weights are integers (positive, zero, or negative), determining whether there are paths of arbitrarily large weight can be performed in time $O(n)$ $O(n . \log(n))$ but not $O (n)$ $O(n^{1.5})$ but not $O (n \log n)$ $O(n^{3})$ but not $O(n^{1.5})$ $O(2^{n})$ but not $O(n^{3})$

Given a weighted directed graph with $n$ vertices where edge weights are integers (positive, zero, or negative), determining whether there are paths of arbitrarily large ...

4.6k views

answered Aug 4, 2017

3 votes

62

GATE IT 2007 | Question: 81
Let $P_1, P_2,\dots , P_n $be $n$ points in the $xy$-plane such that no three of them are collinear. For every pair of points $P_i$ and $P_j$, let $L_{ij}$ be the line passing through them. Let $L_{ab}$ ... $\Theta\left(n\right)$ $\Theta\left(n\log n\right)$ $\Theta\left(n\log^2 n\right)$ $\Theta\left(n^2\right)$

Let $P_1, P_2,\dots , P_n $be $n$ points in the $xy$-plane such that no three of them are collinear. For every pair of points $P_i$ and $P_j$, let $L_{ij}$ be the line pa...

6.4k views

answered Jul 22, 2017

2 votes

63

ISRO2016-22
Let the page fault service time be $10$ ms in a computer with average memory access time being $20$ ns. If one page fault is generated for every $10^6$ memory accesses, what is the effective access time for the memory? 21.4 ns 29.9 ns 23.5 ns 35.1 ns

Let the page fault service time be $10$ ms in a computer with average memory access time being $20$ ns. If one page fault is generated for every $10^6$ memory accesses, w...

6.5k views

answered Apr 23, 2017

8 votes

64

ISRO2016-16
The simplified SOP (Sum of Product) from the Boolean expression $(\text{P} + \overline{\text{Q}} + \overline{\text{R}}) . (\text{P} + \text{Q + R) . (P + Q} +\overline{\text{R}})$ is $(\overline{\text{P}}.\text{Q}+\overline{\text{R}})$ $(\text{P + Q}.\overline{\text{R}})$ $(\text{P}.\overline{\text{Q}}+\text{R})$ $\text{(P.Q + R)}$

The simplified SOP (Sum of Product) from the Boolean expression$$(\text{P} + \overline{\text{Q}} + \overline{\text{R}}) . (\text{P} + \text{Q + R) . (P + Q} +\overline{\t...

8.3k views

answered Apr 23, 2017

5 votes

65

ISRO2015-55
A certain population of ALOHA users manages to generate $70$ request/sec. If the time is slotted in units of $50$ msec, then channel load would be $4.25$ $3.5$ $450$ $350$

A certain population of ALOHA users manages to generate $70$ request/sec. If the time is slotted in units of $50$ msec, then channel load would be$4.25$$3.5$$450$$350$

7.1k views

answered Apr 20, 2017

3 votes

66

ISRO2014-71
Which of the following is not a valid multicast MAC address? $\textsf{01:00:5E:00:00:00}$ $\textsf{01:00:5E:00:00:FF}$ $\textsf{01:00:5E:00:FF:FF}$ $\textsf{01:00:5E:FF:FF:FF}$

Which of the following is not a valid multicast MAC address?$\textsf{01:00:5E:00:00:00}$$\textsf{01:00:5E:00:00:FF}$$\textsf{01:00:5E:00:FF:FF}$$\textsf{01:00:5E:FF:FF:FF...

6.7k views

answered Apr 18, 2017

10 votes

67

ISRO2014-4
Consider the following pseudo- code while (m<n) if (x>y ) and (a<b) then a=a+1 y=y-1 end if m=m+1 end while What is cyclomatic complexity of the above pseudo -code? 2 3 4 5

Consider the following pseudo- codewhile (m<n) if (x>y ) and (a<b) then a=a+1 y=y-1 end if m=m+1 end whileWhat is cyclomatic complexity of the above pseudo -code?2345

8.1k views

answered Apr 15, 2017

67 votes

68

GATE IT 2008 | Question: 39
Consider a CPU where all the instructions require $7$ clock cycles to complete execution. There are $140$ instructions in the instruction set. It is found that $125$ control signals are needed to be generated by the control unit. While designing the horizontal ... size of the control word and control address register? $125, 7$ $125, 10$ $135, 9$ $135, 10$

Consider a CPU where all the instructions require $7$ clock cycles to complete execution. There are $140$ instructions in the instruction set. It is found that $125$ cont...

18.0k views

answered Apr 3, 2017

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