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
Recent activity by Daddy
4
answers
1
Gatebook_Mocktest2(Operating Systems)
Process executes the following code for (i=0;i<5,i++) for (j=0;j<5,j++) fork(); The no of child processes created is ?
Process executes the following codefor (i=0;i<5,i++) for (j=0;j<5,j++) fork(); The no of child processes created is ?
1.0k
views
commented
Feb 9, 2017
Operating System
operating-system
fork-system-call
+
–
1
answer
2
option bytes in HLEN
The value of HLEN of IP packet is 1000 in binary. The number of bytes of options are being carried by this packet __________.
The value of HLEN of IP packet is 1000 in binary. The number of bytes of options are being carried by this packet __________.
2.5k
views
answered
Feb 5, 2017
7
answers
3
GATE CSE 2015 Set 1 | Question: 48
Consider a disk pack with a seek time of $4$ milliseconds and rotational speed of $10000$ rotations per minute (RPM). It has $600$ sectors per track and each sector can store $512$ bytes of data. Consider a file stored in ... sector is half of the time for one complete rotation. The total time (in milliseconds) needed to read the entire file is__________________
Consider a disk pack with a seek time of $4$ milliseconds and rotational speed of $10000$ rotations per minute (RPM). It has $600$ sectors per track and each sector can s...
20.5k
views
commented
Feb 5, 2017
Operating System
gatecse-2015-set1
operating-system
disk
normal
numerical-answers
+
–
16
answers
4
GATE IT 2007 | Question: 83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes...
23.2k
views
commented
Feb 5, 2017
Operating System
gateit-2007
operating-system
disk-scheduling
normal
+
–
10
answers
5
GATE CSE 2004 | Question: 68
A hard disk with a transfer rate of $10$ Mbytes/second is constantly transferring data to memory using DMA. The processor runs at $600$ MHz, and takes $300$ and $900$ ... percentage of processor time consumed for the transfer operation? $5.0 \%$ $1.0\%$ $0.5\%$ $0.1\%$
A hard disk with a transfer rate of $10$ Mbytes/second is constantly transferring data to memory using DMA. The processor runs at $600$ MHz, and takes $300$ and $900$ clo...
27.2k
views
commented
Feb 5, 2017
CO and Architecture
gatecse-2004
dma
normal
co-and-architecture
+
–
6
answers
6
GATE CSE 2014 Set 2 | Question: 55
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. ... bus at any time. The maximum number of stores (of one word each) that can be initiated in $1$ millisecond is ________
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 ...
26.9k
views
commented
Feb 5, 2017
Operating System
gatecse-2014-set2
operating-system
memory-management
numerical-answers
normal
+
–
14
answers
7
GATE CSE 2015 Set 1 | Question: 46
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3, 7$ and $20$ ... $T_{3}$ completes its execution at the end of_____________________milliseconds.
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive peri...
38.1k
views
commented
Feb 5, 2017
Operating System
gatecse-2015-set1
operating-system
process-scheduling
normal
numerical-answers
+
–
8
answers
8
GATE CSE 2016 Set 2 | Question: 28
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. Consider the following statements: Each compound in U \ S reacts ... \ S reacts with an even number of compounds. Which one of the above statements is ALWAYS TRUE? Only I Only II Only III None.
Consider a set $U$ of $23$ different compounds in a chemistry lab. There is a subset $S$ of $U$ of $9$ compounds, each of which reacts with exactly $3$ compounds of $U$. ...
16.6k
views
commented
Feb 5, 2017
Set Theory & Algebra
gatecse-2016-set2
set-theory&algebra
difficult
set-theory
+
–
11
answers
9
GATE CSE 2014 Set 1 | Question: 47
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true? There exists a $y$ in the interval $(0,1)$ such that $f(y) = f(y+1)$ For every $y$ ... the function in the interval $(0,2)$ is $1$ There exists a $y$ in the interval $(0,1)$ such that $f(y)$ = $-f(2-y)$
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true?There exis...
21.0k
views
commented
Feb 5, 2017
Calculus
gatecse-2014-set1
calculus
continuity
normal
+
–
4
answers
10
GATE2012 AR: GA-4
Which one of the parts (A, B, C, D) in the sentence contains an ERROR? No sooner had the doctor seen the results of the blood test, than he suggested the patient to see the specialist. no sooner had results of the blood test suggested the patient see the specialist
Which one of the parts (A, B, C, D) in the sentence contains an ERROR?No sooner had the doctor seen the results of the blood test, than he suggested the patient to see th...
3.8k
views
commented
Feb 5, 2017
Verbal Aptitude
gate2012-ar
verbal-aptitude
english-grammar
+
–
12
answers
11
GATE CSE 2005 | Question: 70
Consider a disk drive with the following specifications: $16$ surfaces, $512$ tracks/surface, $512$ sectors/track, $1$ KB/sector, rotation speed $3000$ rpm. The disk is operated in cycle stealing mode whereby whenever one $4$ byte word is ready it is sent ... $40$ nsec. The maximum percentage of time that the CPU gets blocked during DMA operation is: $10$ $25$ $40$ $50$
Consider a disk drive with the following specifications:$16$ surfaces, $512$ tracks/surface, $512$ sectors/track, $1$ KB/sector, rotation speed $3000$ rpm. The disk is op...
65.3k
views
commented
Feb 5, 2017
CO and Architecture
gatecse-2005
co-and-architecture
disk
normal
dma
+
–
3
answers
12
GATE2013 CE: GA-2
$\underset{\text{I}}{\underline{\text{The professor}}}$ $\underset{\text{II}}{\underline{\text{ordered to}}}$ $\underset{\text{III}}{\underline{\text{the students to go}}}$ $\underset{\text{IV}}{\underline{\text{out of the class.}}}$ Which of the above underlined parts of the sentence is grammatically incorrect? I II III IV
$\underset{\text{I}}{\underline{\text{The professor}}}$ $\underset{\text{II}}{\underline{\text{ordered to}}}$ $\underset{\text{III}}{\underline{\text{the students to go}}...
4.8k
views
commented
Feb 4, 2017
Verbal Aptitude
gate2013-ce
english-grammar
verbal-aptitude
+
–
1
answer
13
GATE CSE 2015 Set 1 | Question: GA-8
The given statement is followed by some courses of action. Assuming the statement to be true, decide the correct option. Statement: There has been a significant drop in the water level in the lakes supplying water to the city. Course of ... areas. Statements I and II follow. Statements I and III follow. Statements II and III follow. All the statements follow.
The given statement is followed by some courses of action. Assuming the statement to be true, decide the correct option.Statement:There has been a significant drop in the...
2.1k
views
commented
Feb 4, 2017
Verbal Aptitude
gatecse-2015-set1
verbal-aptitude
normal
statements-follow
+
–
3
answers
14
GATE2012 AR: GA-10
The documents expose the cynicism of the government officials - and yet as the media website reflects, not a single newspaper has reported on their existence. Which one of the following inferences may be drawn with the greatest accuracy from the ... cared. Media reports did not show the existence of the documents. The documents reveal the attitude of the government officials.
The documents expose the cynicism of the government officials – and yet as the media website reflects, not a single newspaper has reported on their existence.Which one ...
1.7k
views
commented
Feb 4, 2017
Verbal Aptitude
gate2012-ar
verbal-aptitude
passage-reading
+
–
5
answers
15
GATE CSE 2014 Set 2 | Question: 35
Let $\langle M \rangle$ be the encoding of a Turing machine as a string over $\Sigma=\left\{0,1\right\}$ ... $L$ is: decidable and recursively enumerable undecidable but recursively enumerable undecidable and not recursively enumerable decidable but not recursively enumerable
Let $\langle M \rangle$ be the encoding of a Turing machine as a string over $\Sigma=\left\{0,1\right\}$. Let $$L=\left\{\langle M \rangle \mid M \text{ is a Turing machi...
27.8k
views
commented
Feb 4, 2017
Theory of Computation
gatecse-2014-set2
theory-of-computation
turing-machine
normal
+
–
9
answers
16
GATE CSE 2010 | Question: 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}$
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 automati...
24.0k
views
commented
Feb 4, 2017
Theory of Computation
gatecse-2010
theory-of-computation
finite-automata
normal
minimal-state-automata
+
–
7
answers
17
GATE IT 2006 | Question: 21
Consider the following first order logic formula in which $R$ is a binary relation symbol. $∀x∀y (R(x, y) \implies R(y, x))$ The formula is satisfiable and valid satisfiable and so is its negation unsatisfiable but its negation is valid satisfiable but its negation is unsatisfiable
Consider the following first order logic formula in which $R$ is a binary relation symbol.$∀x∀y (R(x, y) \implies R(y, x))$The formula issatisfiable and validsatisfia...
13.4k
views
commented
Feb 4, 2017
Mathematical Logic
gateit-2006
mathematical-logic
normal
first-order-logic
+
–
9
answers
18
GATE CSE 2016 Set 1 | Question: 28
A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$, satisfies the following properties: $f(n)=f(n/2)$ if $n$ is even $f(n)=f(n+5)$ if $n$ is odd Let $R=\{ i \mid \exists{j} : f(j)=i \}$ be the set of distinct values that $f$ takes. The maximum possible size of $R$ is ___________.
A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$, satisfies the following properties: $f(n)=f(n/2)...
21.6k
views
commented
Feb 4, 2017
Set Theory & Algebra
gatecse-2016-set1
set-theory&algebra
functions
normal
numerical-answers
+
–
9
answers
19
GATE CSE 2004 | Question: 75
Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the colour pairs used to colour any two letters are different. Both prints of a letter can also be coloured with the same colour. What is the minimum value of $k$ that satisfies this requirement? $9$ $8$ $7$ $6$
Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the colour pa...
16.7k
views
commented
Feb 4, 2017
Combinatory
gatecse-2004
combinatory
+
–
6
answers
20
GATE CSE 2004 | Question: 24
Consider the binary relation: $S= \left\{\left(x, y\right) \mid y=x+1 \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$ The reflexive transitive closure is $S$ ... $\left\{\left(x, y\right) \mid y \leq x \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$
Consider the binary relation:$S= \left\{\left(x, y\right) \mid y=x+1 \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$The reflexive transitive closure is $S$ is$\lef...
9.9k
views
commented
Feb 4, 2017
Set Theory & Algebra
gatecse-2004
set-theory&algebra
easy
relations
+
–
15
answers
21
GATE CSE 2015 Set 2 | Question: 40
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
19.5k
views
commented
Feb 4, 2017
Set Theory & Algebra
gatecse-2015-set2
set-theory&algebra
functions
normal
numerical-answers
+
–
16
answers
22
GATE CSE 2012 | Question: 33
Suppose a fair six-sided die is rolled once. If the value on the die is $1, 2,$ or $3,$ the die is rolled a second time. What is the probability that the sum total of values that turn up is at least $6$ ? $\dfrac{10}{21}$ $\dfrac{5}{12}$ $\dfrac{2}{3}$ $\dfrac{1}{6}$
Suppose a fair six-sided die is rolled once. If the value on the die is $1, 2,$ or $3,$ the die is rolled a second time. What is the probability that the sum total of val...
22.0k
views
commented
Feb 4, 2017
Probability
gatecse-2012
probability
conditional-probability
normal
+
–
10
answers
23
GATE CSE 2002 | Question: 1.8
"If $X$ then $Y$ unless $Z$" is represented by which of the following formulas in propositional logic? ("$\neg$" is negation, "$\land$" is conjunction, and "$\rightarrow$" is implication) $(X\land \neg Z) \rightarrow Y$ $(X \land Y) \rightarrow \neg Z$ $X \rightarrow(Y\land \neg Z)$ $(X \rightarrow Y)\land \neg Z$
"If $X$ then $Y$ unless $Z$" is represented by which of the following formulas in propositional logic? ("$\neg$" is negation, "$\land$" is conjunction, and "$\rightarrow$...
14.8k
views
commented
Feb 4, 2017
Mathematical Logic
gatecse-2002
mathematical-logic
normal
propositional-logic
+
–
2
answers
24
GATE CSE 1996 | Question: 3
Let $f$ be a function defined by $f(x) = \begin{cases} x^2 &\text{ for }x \leq 1\\ ax^2+bx+c &\text{ for } 1 < x \leq 2 \\ x+d &\text{ for } x>2 \end{cases}$ Find the values for the constants $a$, $b$, $c$ and $d$ so that $f$ is continuous and differentiable everywhere on the real line.
Let $f$ be a function defined by$$f(x) = \begin{cases} x^2 &\text{ for }x \leq 1\\ ax^2+bx+c &\text{ for } 1 < x \leq 2 \\ x+d &\text{ for } x>2 \end{cases}$$Find the va...
5.3k
views
commented
Feb 4, 2017
Calculus
gate1996
calculus
continuity
differentiation
normal
descriptive
+
–
4
answers
25
GATE IT 2007 | Question: 76
Consider the sequence $\langle x_n \rangle , \: n \geq 0$ defined by the recurrence relation $x_{n+1} = c . x^2_n -2$, where $c > 0$. Suppose there exists a non-empty, open interval $(a, b)$ such that for all $x_0$ satisfying $a < x_0 < b$, the ... sequence converges to the value? $\frac{1+\sqrt{1+8c}}{2c}$ $\frac{1-\sqrt{1+8c}}{2c}$ $2$ $\frac{2}{2c-1}$
Consider the sequence $\langle x_n \rangle , \: n \geq 0$ defined by the recurrence relation $x_{n+1} = c . x^2_n -2$, where $c 0$.Suppose there exists a non-empty, open...
5.5k
views
commented
Feb 4, 2017
Combinatory
gateit-2007
combinatory
normal
recurrence-relation
+
–
1
answer
26
Test by Bikram | Mock GATE | Test 2 | Question: 58
Fill in the blanks with appropriate words: My son is getting ______ his studies quite well. Over At On Round
Fill in the blanks with appropriate words:My son is getting ______ his studies quite well.Over At On Round
370
views
commented
Feb 3, 2017
GATE
tbb-mockgate-2
verbal-aptitude
prepositions
+
–
12
answers
27
GATE CSE 1994 | Question: 1.6, ISRO2008-29
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
The number of distinct simple graphs with up to three nodes is$15$$10$$7$$9$
34.8k
views
commented
Feb 2, 2017
Graph Theory
gate1994
graph-theory
graph-connectivity
combinatory
normal
isro2008
counting
+
–
7
answers
28
GATE IT 2006 | Question: 66
A router has two full-duplex Ethernet interfaces each operating at $100$ $\text{Mb/s}$. Ethernet frames are at least $84$ $\text{bytes}$ long (including the Preamble and the Inter-Packet-Gap). The maximum packet processing time at the router for wirespeed forwarding to be possible is (in microseconds) $0.01$ $3.36$ $6.72$ $8$
A router has two full-duplex Ethernet interfaces each operating at $100$ $\text{Mb/s}$. Ethernet frames are at least $84$ $\text{bytes}$ long (including the Preamble and ...
22.2k
views
commented
Feb 1, 2017
Computer Networks
gateit-2006
computer-networks
lan-technologies
ethernet
normal
+
–
5
answers
29
GATE IT 2008 | Question: 74
Consider the following relational schema: $\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$ ... the name of the school and the number of its students scoring $100$ in at least one exam nothing; the query has a syntax error
Consider the following relational schema:$\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$$\text{School} (\underline{\tex...
18.2k
views
commented
Jan 31, 2017
Databases
gateit-2008
databases
sql
normal
+
–
1
answer
30
MadeEasy Subject Test: Operating System - Semaphores
595
views
commented
Jan 30, 2017
Operating System
operating-system
made-easy-test-series
semaphore
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register