Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by `JEET
1
votes
91
TIFR CSE 2018 | Part A | Question: 6
What is the minimum number of students needed in a class to guarantee that there are at least $6$ students whose birthdays fall in the same month ? $6$ $23$ $61$ $72$ $91$
What is the minimum number of students needed in a class to guarantee that there are at least $6$ students whose birthdays fall in the same month ?$6$$23$$61$$72$$91$
3.4k
views
answered
Dec 3, 2019
Combinatory
tifr2018
pigeonhole-principle
combinatory
+
–
1
votes
92
ISI2018-DCG-30
Let $0.01^x+0.25^x=0.7$ . Then $x\geq1$ $0\lt x\lt1$ $x\leq0$ no such real number $x$ is possible.
Let $0.01^x+0.25^x=0.7$ . Then$x\geq1$$0\lt x\lt1$$x\leq0$no such real number $x$ is possible.
521
views
answered
Nov 26, 2019
Quantitative Aptitude
isi2018-dcg
quantitative-aptitude
number-system
inequality
+
–
0
votes
93
ISI2018-DCG-22
Let the sides opposite to the angles $A,B,C$ in a triangle $ABC$ be represented by $a,b,c$ respectively. If $(c+a+b)(a+b-c)=ab,$ then the angle $C$ is $\frac{\pi}{6}$ $\frac{\pi}{3}$ $\frac{\pi}{2}$ $\frac{2\pi}{3}$
Let the sides opposite to the angles $A,B,C$ in a triangle $ABC$ be represented by $a,b,c$ respectively. If $(c+a+b)(a+b-c)=ab,$ then the angle $C$ is$\frac{\pi}{6}$$\fra...
359
views
answered
Nov 20, 2019
Geometry
isi2018-dcg
triangles
non-gate
+
–
17
votes
94
GATE CSE 2015 Set 1 | Question: 35
What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory. int main () { unsigned int x [4] [3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}}; printf ("%u, %u, %u", x + 3, *(x + 3), *(x + 2) + 3); } $2036, 2036, 2036$ $2012, 4, 2204$ $2036, 10, 10$ $2012, 4, 6$
What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory.int main () { unsigned int ...
28.1k
views
answered
Nov 19, 2019
Programming in C
gatecse-2015-set1
programming
programming-in-c
array
normal
+
–
2
votes
95
ISI2016-MMA-8
Let $g: \mathbb{R} \rightarrow \mathbb{R}$ be differentiable with $g'(x^2)=x^3$ for all $x>0$ and $g(1) =1$. Then $g(4)$ equals $64/5$ $32/5$ $37/5$ $67/5$
Let $g: \mathbb{R} \rightarrow \mathbb{R}$ be differentiable with $g'(x^2)=x^3$ for all $x>0$ and $g(1) =1$. Then $g(4)$ equals$64/5$$32/5$$37/5$$67/5$
875
views
answered
Nov 19, 2019
Calculus
isi2016-mmamma
calculus
differentiation
+
–
1
votes
96
ISI2016-DCG-30
Let $p,q,r,s$ be real numbers such that $pr=2(q+s).$ Consider the equations $x^{2}+px+q=0$ and $x^{2}+rx+s=0.$ Then at least one of the equations has real roots. both these equations have real roots. neither of these equations have real roots. given data is not sufficient to arrive at any conclusion.
Let $p,q,r,s$ be real numbers such that $pr=2(q+s).$ Consider the equations $x^{2}+px+q=0$ and $x^{2}+rx+s=0.$ Thenat least one of the equations has real roots.both these...
380
views
answered
Nov 18, 2019
Quantitative Aptitude
isi2016-dcg
quantitative-aptitude
quadratic-equations
roots
+
–
1
votes
97
ISI2016-DCG-28
If one root of a quadratic equation $ax^{2}+bx+c=0$ be equal to the n th power of the other, then $(ac)^{\frac{n}{n+1}}+b=0$ $(ac)^{\frac{n+1}{n}}+b=0$ $(ac^{n})^{\frac{1}{n+1}}+(a^{n}c)^{\frac{1}{n+1}}+b=0$ $(ac^\frac{1}{n+1})^{n}+(a^\frac{1}{n+1}c)^{n+1}+b=0$
If one root of a quadratic equation $ax^{2}+bx+c=0$ be equal to the n th power of the other, then$(ac)^{\frac{n}{n+1}}+b=0$$(ac)^{\frac{n+1}{n}}+b=0$$(ac^{n})^{\frac{1}{n...
632
views
answered
Nov 18, 2019
Quantitative Aptitude
isi2016-dcg
quantitative-aptitude
quadratic-equations
roots
+
–
2
votes
98
ISI2015-MMA-86
The coordinates of a moving point $P$ satisfy the equations $\frac{dx}{dt} = \tan x, \:\:\:\: \frac{dy}{dt}=-\sin^2x, \:\:\:\:\: t \geq 0.$ If the curve passes through the point $(\pi/2, 0)$ when $t=0$, then the equation of the curve in rectangular co-ordinates is $y=1/2 \cos ^2 x$ $y=\sin 2x$ $y=\cos 2x+1$ $y=\sin ^2 x-1$
The coordinates of a moving point $P$ satisfy the equations $$\frac{dx}{dt} = \tan x, \:\:\:\: \frac{dy}{dt}=-\sin^2x, \:\:\:\:\: t \geq 0.$$ If the curve passes through ...
463
views
answered
Nov 18, 2019
Geometry
isi2015-mma
trigonometry
curves
non-gate
+
–
0
votes
99
CMI2015-B-03b
A cook has a kitchen at the top of a hill, where she can prepare rotis. Each roti costs one rupee to prepare. She can sell rotis for two rupees a piece at a stall down the hill. Once she goes down the steep hill, she can not climb back in time make more ... she starts at the top with $P$ paans and $1$ rupee, what is the minimum and maximum amount of money she can have at the end?
A cook has a kitchen at the top of a hill, where she can prepare rotis. Each roti costs one rupee to prepare. She can sell rotis for two rupees a piece at a stall down th...
565
views
answered
Nov 12, 2019
Quantitative Aptitude
cmi2015
descriptive
quantitative-aptitude
+
–
0
votes
100
ISI2015-PCB-A-2
Prove that in any sequence of $105$ integers, there will always be a subsequence of consecutive elements in the sequence, whose sum is divisible by $99$.
Prove that in any sequence of $105$ integers, there will always be a subsequence of consecutive elements in the sequence, whose sum is divisible by $99$.
669
views
answered
Nov 12, 2019
Quantitative Aptitude
descriptive
isi2015-pcb-a
quantitative-aptitude
pigeonhole-principle
+
–
0
votes
101
computer networks general
Which book is good for numerical problems for computer networks for GATE?
Which book is good for numerical problems for computer networks for GATE?
460
views
answered
Nov 11, 2019
Computer Networks
computer-networks
gate-preparation
+
–
0
votes
102
ISI2015-DCG-44
If the distance between the foci of a hyperbola is $16$ and its eccentricity is $\sqrt{2}$, then the equation of the hyperbola is $y^2-x^2=32$ $x^2-y^2=16$ $y^2-x^2=16$ $x^2-y^2=32$
If the distance between the foci of a hyperbola is $16$ and its eccentricity is $\sqrt{2}$, then the equation of the hyperbola is$y^2-x^2=32$$x^2-y^2=16$$y^2-x^2=16$$x^2-...
281
views
answered
Nov 10, 2019
Others
isi2015-dcg
geometry
hyperbola
+
–
2
votes
103
CMI2018-A-5
How many paths are there in the plane from $(0,0)$ to $(m,n)\in \mathbb{N}\times \mathbb{N},$ if the possible steps from $(i,j)$ are either $(i+1,j)$ or $(i,j+1)?$ $\binom{2m}{n}$ $\binom{m}{n}$ $\binom{m+n}{n}$ $m^{n}$
How many paths are there in the plane from $(0,0)$ to $(m,n)\in \mathbb{N}\times \mathbb{N},$ if the possible steps from $(i,j)$ are either $(i+1,j)$ or $(i,j+1)?$$\binom...
638
views
answered
Nov 9, 2019
Combinatory
cmi2018
combinatory
+
–
2
votes
104
CMI2016-A-9
ScamTel has won a state government contract to connect $17$ cities by high-speed fibre optic links. Each link will connect a pair of cities so that the entire network is connected-there is a path from each city to every other city. The contract requires the network to remain ... $34$ $32$ $17$ $16$
ScamTel has won a state government contract to connect $17$ cities by high-speed fibre optic links. Each link will connect a pair of cities so that the entire network is ...
913
views
answered
Nov 9, 2019
Graph Theory
cmi2016
graph-theory
graph-connectivity
+
–
1
votes
105
UGC NET CSE | December 2014 | Part 3 | Question: 31
Any decision tree that sorts $n$ elements has height $\Omega(n)$ $\Omega(\text{lg}n)$ $\Omega(n \text{lg} n)$ $\Omega(n^2)$
Any decision tree that sorts $n$ elements has height$\Omega(n)$$\Omega(\text{lg}n)$$\Omega(n \text{lg} n)$$\Omega(n^2)$
1.9k
views
answered
Nov 5, 2019
Algorithms
ugcnetcse-dec2014-paper3
algorithms
decision-tree
+
–
2
votes
106
CMI2014-A-03
In the code fragment on the right, start and end are integer values and $\text{prime}(x)$ is a function that returns true if $x$ is a prime number and $\text{false}$ otherwise. At the end of the loop: i := 0; j := 0; k := 0; for (m := start; m <= end; m := m+1){ k := k + m ... + m; }else{ j := j + m; } } $k < i+j$ $k = i+j$ $k > i+j$ Depends on $\text{start}$ and $\text{end}$
In the code fragment on the right, start and end are integer values and $\text{prime}(x)$ is a function that returns true if $x$ is a prime number and $\text{false}$ othe...
905
views
answered
Nov 5, 2019
Algorithms
cmi2014
algorithms
identify-function
+
–
6
votes
107
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 6 (Page No. 429 - 430)
Suppose that a system uses DMA for data transfer from disk controller to main memory. Further assume that it takes $t_{1}\: nsec$ on average to acquire the bus and $t_{2}\:nsec$ to transfer one word ... acquiring the bus to send one word and acknowledging a transfer also requires acquiring the bus to send one word.
Suppose that a system uses DMA for data transfer from disk controller to main memory. Further assume that it takes $t_{1}\: nsec$ on average to acquire the bus and $t_{2}...
1.2k
views
answered
Nov 2, 2019
Operating System
tanenbaum
operating-system
input-output
dma
descriptive
+
–
1
votes
108
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 5 (Page No. 429)
A DMA controller has five channels. The controller is capable of requesting a $32$-bit word every $40\: nsec.$ A response takes equally long. How fast does the bus have to be to avoid being a bottleneck?
A DMA controller has five channels. The controller is capable of requesting a $32$-bit word every $40\: nsec.$ A response takes equally long. How fast does the bus have t...
2.2k
views
answered
Nov 2, 2019
Operating System
tanenbaum
operating-system
input-output
dma
descriptive
+
–
0
votes
109
Andrew S. Tanenbaum (OS) Edition 4 Exercise 6 Question 34 (Page No. 468)
Explain the differences between deadlock, livelock, and starvation.
Explain the differences between deadlock, livelock, and starvation.
485
views
answered
Oct 31, 2019
Operating System
tanenbaum
operating-system
deadlock-prevention-avoidance-detection
descriptive
+
–
5
votes
110
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 19 (Page No. 256)
A computer with a $32-bit$ address uses a two-level page table. Virtual addresses are split into a $9-bit$ top-level page table field, an $11-bit$ second-level page table field, and an offset. How large are the pages and how many are there in the address space?
A computer with a $32-bit$ address uses a two-level page table. Virtual addresses are split into a $9-bit$ top-level page table field, an $11-bit$ second-level page table...
2.7k
views
answered
Oct 29, 2019
Operating System
tanenbaum
operating-system
memory-management
multilevel-paging
paging
descriptive
+
–
0
votes
111
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 32 (Page No. 257)
In the $\text{WSClock}$ algorithm of Fig. $3-20(c),$ the hand points to a page with $R = 0.$ If $\tau = 400,$ will this page be removed? What about if $\tau = 1000?$
In the $\text{WSClock}$ algorithm of Fig. $3-20(c),$ the hand points to a page with $R = 0.$ If $\tau = 400,$ will this page be removed? What about if $\tau = 1000?$
724
views
answered
Oct 29, 2019
Operating System
tanenbaum
operating-system
memory-management
page-replacement
descriptive
+
–
1
votes
112
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 22 (Page No. 256)
A computer whose processes have $1024$ pages in their address spaces keeps its page tables in memory. The overhead required for reading a word from the page table is $5\: nsec.$ To reduce this overhead, the computer has a $TLB,$ ... a lookup in $1\: nsec.$ What hit rate is needed to reduce the mean overhead to $2\: nsec?$
A computer whose processes have $1024$ pages in their address spaces keeps its page tables in memory. The overhead required for reading a word from the page table is $5\:...
780
views
answered
Oct 29, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
translation-lookaside-buffer
descriptive
+
–
1
votes
113
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 24 (Page No. 256)
A machine has $48-bit$ virtual addresses and $32-bit$ physical addresses. Pages are $8\: KB.$ How many entries are needed for a single-level linear page table?
A machine has $48-bit$ virtual addresses and $32-bit$ physical addresses. Pages are $8\: KB.$ How many entries are needed for a single-level linear page table?
715
views
answered
Oct 29, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
descriptive
+
–
1
votes
114
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 17 (Page No. 82)
What is a trap instruction? Explain its use in operating systems.
What is a trap instruction? Explain its use in operating systems.
235
views
answered
Oct 29, 2019
Operating System
tanenbaum
operating-system
trap-instruction
descriptive
+
–
0
votes
115
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 25 (Page No. 83)
What is the essential difference between a block special file and a character special file?
What is the essential difference between a block special file and a character special file?
169
views
answered
Oct 29, 2019
Operating System
tanenbaum
operating-system
descriptive
+
–
0
votes
116
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 9 (Page No. 255)
What kind of hardware support is needed for a paged virtual memory to work?
What kind of hardware support is needed for a paged virtual memory to work?
366
views
answered
Oct 29, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
paging
descriptive
+
–
1
votes
117
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 12 (Page No. 255)
The amount of disk space that must be available for page storage is related to the maximum number of processes$,\: n,$ the number of bytes in the virtual address space, $v,$ and the number of bytes of $RAM,\: r$. Give an expression for the worst-case disk-space requirements. How realistic is this amount?
The amount of disk space that must be available for page storage is related to the maximum number of processes$,\: n,$ the number of bytes in the virtual address space, $...
1.1k
views
answered
Oct 29, 2019
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
descriptive
+
–
0
votes
118
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 13 (Page No. 255)
If an instruction takes $1\: nsec$ and a page fault takes an additional $n\: nsec,$ give a formula for the effective instruction time if page faults occur every $k$ instructions.
If an instruction takes $1\: nsec$ and a page fault takes an additional $n\: nsec,$ give a formula for the effective instruction time if page faults occur every $k$ instr...
1.7k
views
answered
Oct 29, 2019
Operating System
tanenbaum
operating-system
memory-management
paging
page-fault
descriptive
+
–
0
votes
119
UGC NET CSE | August 2016 | Part 3 | Question: 51
An operating system supports a paged virtual memory, using a central processor with a cycle time of one microsecond. It costs an additional one microsecond to access a page other than the current one. Pages have $1000$ words, ... and the processor is idle during drum transfers ? $30$ microseconds $34$ microseconds $60$ microseconds $68$ microseconds
An operating system supports a paged virtual memory, using a central processor with a cycle time of one microsecond. It costs an additional one microsecond to access a pa...
6.5k
views
answered
Oct 29, 2019
Operating System
ugcnetcse-aug2016-paper3
operating-system
paging
+
–
0
votes
120
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 46 (Page No. 433)
One way to place a character on a bitmapped screen is to use BitBlt from a font table. Assume that a particular font uses characters that are $16 24$ pixels in true RGB color. How much font table space does each ... a byte takes $100\: nsec,$ including overhead, what is the output rate to the screen in characters/sec?
One way to place a character on a bitmapped screen is to use BitBlt from a font table. Assume that a particular font uses characters that are $16 × 24$ pixels in true RG...
397
views
answered
Oct 29, 2019
Operating System
tanenbaum
operating-system
input-output
descriptive
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
...
14
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register