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 kireeti
8
answers
1
GATE CSE 2012 | Question: 32
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X$. It is used in the pseudocode shown below to implement ... take on a non-zero value when the lock is actually available works correctly but may starve some processes works correctly without starvation
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X...
30.1k
views
commented
Jan 6, 2015
Operating System
gatecse-2012
operating-system
process-synchronization
normal
+
–
3
answers
2
GATE CSE 2014 Set 2 | Question: 8
Consider the equation $(123)_5=(x8)_y$ with $x$ and $y$ as unknown. The number of possible solutions is _____ .
Consider the equation $(123)_5=(x8)_y$ with $x$ and $y$ as unknown. The number of possible solutions is _____ .
9.5k
views
answered
Dec 27, 2014
Digital Logic
gatecse-2014-set2
digital-logic
number-representation
numerical-answers
normal
+
–
2
answers
3
I think the answer should be 32 but its not in options? Help me in this question..
906
views
answered
Dec 4, 2014
2
answers
4
GATE CSE 2012 | Question: 56
The cost function for a product in a firm is given by $5q^{2}$, where $q$ is the amount of production. The firm can sell the product at a market price of $\text₹ 50$ per unit. The number of units to be produced by the firm such that the profit is maximized is $5$ $10$ $15$ $25$
The cost function for a product in a firm is given by $5q^{2}$, where $q$ is the amount of production. The firm can sell the product at a market price of $\text₹ 50$ pe...
5.6k
views
answered
Nov 10, 2014
Quantitative Aptitude
gatecse-2012
quantitative-aptitude
cost-market-price
normal
+
–
1
answer
5
GATE CSE 2014 Set 3 | Question: 46
With respect to the numerical evaluation of the definite integral, $K = \int \limits_a^b \:x^2 \:dx$, where $a$ and $b$ are given, which of the following statements is/are TRUE? The value of $K$ obtained using the trapezoidal rule is always ... ;s rule is always equal to the exact value of the definite integral. I only II only Both I and II Neither I nor II
With respect to the numerical evaluation of the definite integral, $K = \int \limits_a^b \:x^2 \:dx$, where $a$ and $b$ are given, which of the following statements is/ar...
3.5k
views
answered
Oct 26, 2014
Numerical Methods
gatecse-2014-set3
numerical-methods
trapezoidal-rule
simpsons-rule
normal
+
–
2
answers
6
GATE CSE 1997 | Question: 1.2
The Newton-Raphson method is used to find the root of the equation $X^2-2=0$. If the iterations are started from -1, the iterations will converge to -1 converge to $\sqrt{2}$ converge to $\sqrt{-2}$ not converge
The Newton-Raphson method is used to find the root of the equation $X^2-2=0$. If the iterations are started from -1, the iterations willconverge to -1converge to $\sqrt{2...
12.1k
views
answered
Oct 26, 2014
Numerical Methods
gate1997
numerical-methods
newton-raphson
normal
non-gate
out-of-gate-syllabus
+
–
3
answers
7
GATE CSE 1995 | Question: 2.15
The iteration formula to find the square root of a positive real number $b$ using the Newton Raphson method is $x_{k+1} = 3(x_k+b)/2x_k$ $x_{k+1} = (x_{k}^2+b)/2x_k$ $x_{k+1} = x_k-2x_k/\left(x^2_k+b\right)$ None of the above
The iteration formula to find the square root of a positive real number $b$ using the Newton Raphson method is$x_{k+1} = 3(x_k+b)/2x_k$$x_{k+1} = (x_{k}^2+b)/2x_k$$x_{k+1...
2.6k
views
answered
Oct 26, 2014
Numerical Methods
gate1995
numerical-methods
newton-raphson
normal
out-of-gate-syllabus
+
–
2
answers
8
GATE CSE 1996 | Question: 2.5
Newton-Raphson iteration formula for finding $\sqrt[3]{c}$, where $c > 0$ is $x_{n+1}=\frac{2x_n^3 + \sqrt[3]{c}}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 - \sqrt[3]{c}}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 + c}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 - c}{3x_n^2}$
Newton-Raphson iteration formula for finding $\sqrt[3]{c}$, where $c 0$ is$x_{n+1}=\frac{2x_n^3 + \sqrt[3]{c}}{3x_n^2}$$x_{n+1}=\frac{2x_n^3 - \sqrt[3]{c}}{3x_n^2}$$x_{...
1.9k
views
answered
Oct 26, 2014
Numerical Methods
gate1996
numerical-methods
newton-raphson
normal
out-of-syllabus-now
+
–
1
answer
9
Is the value obtained by trapezoidal rule greater than
Is the value obtained by trapezoidal rule greater than the exact value and also compare the value obtained in the case of simpsons rule.
Is the value obtained by trapezoidal rule greater than the exact value and also compare the value obtained in the case of simpsons rule.
843
views
answered
Oct 26, 2014
Numerical Methods
trapezoidal-rule
non-gate
+
–
8
answers
10
GATE CSE 2008 | Question: 24
Let $P =\sum \limits_ {i\;\text{odd}}^{1\le i \le 2k} i$ and $Q = \sum\limits_{i\;\text{even}}^{1 \le i \le 2k} i$, where $k$ is a positive integer. Then $P = Q - k$ $P = Q + k$ $P = Q$ $P = Q + 2k$
Let $P =\sum \limits_ {i\;\text{odd}}^{1\le i \le 2k} i$ and $Q = \sum\limits_{i\;\text{even}}^{1 \le i \le 2k} i$, where $k$ is a positive integer. Then$P = Q - k$$P = Q...
6.0k
views
answered
Oct 26, 2014
Combinatory
gatecse-2008
combinatory
easy
summation
+
–
3
answers
11
GATE CSE 2014 Set 1 | Question: 3
Let $G=(V,E)$ be a directed graph where $V$ is the set of vertices and $E$ the set of edges. Then which one of the following graphs has the same strongly connected components as $G$ ? $G_1$ = $(V,E_1)$ ... $u$ to $v$ in $E\}$ $G_4$ = $(V_4,E)$ where $V_4$ is the set of vertices in $G$ which are not isolated
Let $G=(V,E)$ be a directed graph where $V$ is the set of vertices and $E$ the set of edges. Then which one of the following graphs has the same strongly connected compon...
17.0k
views
answered
Oct 25, 2014
DS
gatecse-2014-set1
data-structures
graph-theory
ambiguous
+
–
1
answer
12
GATE CSE 1995 | Question: 20
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is currently serving a request at track $55$. If the queue of requests kept in FIFO order is $10, 70, 75, 23, 65$ which of the two disk scheduling algorithms ... Come First Served) and SSTF (Shortest Seek Time First) will require less head movement? Find the head movement for each of the algorithms.
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is currently serving a request at track $55$. If the queue of requests kept in FIFO order is $$10, 7...
123k
views
answered
Oct 25, 2014
Operating System
gate1995
operating-system
disk-scheduling
normal
descriptive
+
–
1
answer
13
GATE CSE 1996 | Question: 1.18
The process state transition diagram in the below figure is representative of a batch operating system an operating system with a preemptive scheduler an operating system with a non-preemptive scheduler a uni-programmed operating system
The process state transition diagram in the below figure is representative ofa batch operating systeman operating system with a preemptive scheduleran operating system wi...
8.7k
views
answered
Oct 25, 2014
Operating System
gate1996
operating-system
normal
process
+
–
5
answers
14
GATE CSE 1996 | Question: 2.18
A $1000$ $\text{Kbyte}$ memory is managed using variable partitions but no compaction. It currently has two partitions of sizes $200$ $\text{Kbyte}$ and $260$ $\text{Kbyte}$ respectively. The smallest allocation request in $\text{Kbyte}$ that could be denied is for $151$ $181$ $231$ $541$
A $1000$ $\text{Kbyte}$ memory is managed using variable partitions but no compaction. It currently has two partitions of sizes $200$ $\text{Kbyte}$ and $260$ $\text{Kbyt...
21.2k
views
answered
Oct 25, 2014
Operating System
gate1996
operating-system
memory-management
normal
+
–
4
answers
15
GATE CSE 2001 | Question: 2.4
Seven (distinct) car accidents occurred in a week. What is the probability that they all occurred on the same day? $\dfrac{1}{7^7}\\$ $\dfrac{1}{7^6}\\$ $\dfrac{1}{2^7}\\$ $\dfrac{7}{2^7}\\$
Seven (distinct) car accidents occurred in a week. What is the probability that they all occurred on the same day?$\dfrac{1}{7^7}\\$$\dfrac{1}{7^6}\\$$\dfrac{1}{2^7}\\$$\...
19.9k
views
commented
Oct 25, 2014
Probability
gatecse-2001
probability
normal
+
–
5
answers
16
GATE CSE 1996 | Question: 26
A computer system has a three-level memory hierarchy, with access time and hit ratios as shown below: ... of less than $100 nsec$? What is the average access time achieved using the chosen sizes of level $1$ and level $2$ memories?
A computer system has a three-level memory hierarchy, with access time and hit ratios as shown below:$$\overset{ \text {Level $1$ (Cache memory)} \\ \text{Access time = ...
15.2k
views
answered
Oct 25, 2014
CO and Architecture
gate1996
co-and-architecture
cache-memory
normal
+
–
2
answers
17
On a set of n elements, how many relations are there that are both irreflexive and antisymmetric?
On a set of n elements, how many relations are there that are both irreflexive and antisymmetric? Please explain how to calculate .
On a set of n elements, how many relations are there that are both irreflexive and antisymmetric?Please explain how to calculate .
26.5k
views
commented
Oct 24, 2014
Set Theory & Algebra
set-theory&algebra
relations
+
–
5
answers
18
GATE CSE 2013 | Question: 8
Consider the languages $L_1 = \phi$ and $L_2 = \{a\}$. Which one of the following represents $L_1 {L_2}^* \cup {L_1}^*$ ? $\{\epsilon\}$ $\phi$ $a^*$ $\{\epsilon, a\}$
Consider the languages $L_1 = \phi$ and $L_2 = \{a\}$. Which one of the following represents $L_1 {L_2}^* \cup {L_1}^*$ ?$\{\epsilon\}$$\phi$$a^*$$\{\epsilon, a\}$
18.9k
views
answered
Oct 22, 2014
Theory of Computation
gatecse-2013
theory-of-computation
normal
regular-language
+
–
5
answers
19
GATE CSE 1995 | Question: 2.23
A finite state machine with the following state table has a single input $x$ and a single out $z$ ... $C$ is: $01$ $10$ $101$ $110$
A finite state machine with the following state table has a single input $x$ and a single out $z$.$$\begin{array}{|c|ll|}\hline\textbf{present state} & \qquad \textbf{nex...
11.4k
views
commented
Oct 20, 2014
Theory of Computation
gate1995
theory-of-computation
finite-automata
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register