Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
sutanay3
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by sutanay3
6
votes
1
GATE CSE 2005 | Question: 73
In a packet switching network, packets are routed from source to destination along a single path having two intermediate nodes. If the message size is $24$ bytes and each packet contains a header of $3$ bytes, then the optimum packet size is: $4$ $6$ $7$ $9$
In a packet switching network, packets are routed from source to destination along a single path having two intermediate nodes. If the message size is $24$ bytes and each...
42.1k
views
answered
Oct 30, 2018
Computer Networks
gatecse-2005
computer-networks
network-switching
normal
+
–
2
votes
2
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.3k
views
answered
Oct 17, 2018
Operating System
gatecse-2015-set1
operating-system
disk
normal
numerical-answers
+
–
2
votes
3
GATE CSE 2009 | Question: 30
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be ... deadlock Only $P1$ and $P2$ will be in deadlock Only $P1$ and $P3$ will be in deadlock All three processes will be in deadlock
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used....
33.7k
views
answered
Oct 14, 2018
Operating System
gatecse-2009
operating-system
resource-allocation
normal
+
–
4
votes
4
GATE CSE 2015 Set 3 | Question: 1
The maximum number of processes that can be in $\textit{Ready}$ state for a computer system with $n$ CPUs is : $n$ $n^2$ $2^n$ Independent of $n$
The maximum number of processes that can be in $\textit{Ready}$ state for a computer system with $n$ CPUs is :$n$$n^2$$2^n$Independent of $n$
30.2k
views
answered
Oct 9, 2018
Operating System
gatecse-2015-set3
operating-system
process-scheduling
easy
+
–
29
votes
5
GATE CSE 2017 Set 1 | Question: 25
Consider a two-level cache hierarchy with $L1$ and $L2$ caches. An application incurs $1.4$ memory accesses per instruction on average. For this application, the miss rate of $L1$ cache is $0.1$; the $L2$ cache experiences, on average, $7$ misses per $1000$ instructions. The miss rate of $L2$ expressed correct to two decimal places is ________.
Consider a two-level cache hierarchy with $L1$ and $L2$ caches. An application incurs $1.4$ memory accesses per instruction on average. For this application, the miss rat...
24.1k
views
answered
Oct 4, 2018
CO and Architecture
gatecse-2017-set1
co-and-architecture
cache-memory
numerical-answers
+
–
0
votes
6
GATE CSE 2006 | Question: 20, ISRO2015-17
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$ interest. T1 start T1 B old $=12000$ new $=10000$ ... $3$ because transaction T1 has committed We can apply redo and undo operations in arbitrary order because they are idempotent
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$...
27.6k
views
answered
Aug 30, 2018
Databases
gatecse-2006
databases
transaction-and-concurrency
normal
isro2015
+
–
4
votes
7
ISI2016
Find the number of positive integers n for which $n^{2}+96$ is a perfect square.
Find the number of positive integers n for which $n^{2}+96$ is a perfect square.
1.2k
views
answered
Aug 23, 2018
Set Theory & Algebra
isi2016
set-theory&algebra
number-theory
numerical-answers
+
–
1
votes
8
GATE IT 2008 | Question: 28
Consider the following Hasse diagrams. Which all of the above represent a lattice? (i) and (iv) only (ii) and (iii) only (iii) only (i), (ii) and (iv) only
Consider the following Hasse diagrams. Which all of the above represent a lattice?(i) and (iv) only(ii) and (iii) only(iii) only(i), (ii) and (iv) only
14.9k
views
answered
Aug 20, 2018
Set Theory & Algebra
gateit-2008
set-theory&algebra
lattice
normal
+
–
2
votes
9
ISI2004-MIII
The equation $\frac{1}{3}+\frac{1}{2}s^{2}+\frac{1}{6}s^{3}=s$ has exactly three solution in $[0.1]$ exactly one solution in $[0,1]$ exactly two solution in $[0,1]$ no solution in $[0,1]$
The equation $\frac{1}{3}+\frac{1}{2}s^{2}+\frac{1}{6}s^{3}=s$hasexactly three solution in $[0.1]$exactly one solution in $[0,1]$exactly two solution in $[0,1]$no solu...
631
views
answered
Aug 19, 2018
Set Theory & Algebra
isi2004
polynomials
+
–
1
votes
10
GATE CSE 2014 Set 1 | Question: 51
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $(a,b)$ and $(c,d)$ if $|a-c| \leq 1$ and $|b-d| \leq 1$. The number of edges in this graph is______.
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $...
26.6k
views
answered
Aug 9, 2018
Graph Theory
gatecse-2014-set1
graph-theory
numerical-answers
normal
graph-connectivity
+
–
6
votes
11
GATE CSE 2001 | Question: 2.1
How many $4$-digit even numbers have all $4$ digits distinct? $2240$ $2296$ $2620$ $4536$
How many $4$-digit even numbers have all $4$ digits distinct?$2240$$2296$$2620$$4536$
12.5k
views
answered
Aug 4, 2018
Combinatory
gatecse-2001
combinatory
normal
+
–
1
votes
12
TIFR CSE 2011 | Part B | Question: 21
Let $S=\left \{ x_{1},....,x_{n} \right \}$ be a set of $n$ numbers. Consider the problem of storing the elements of $S$ in an array $A\left [ 1...n \right ]$ ... time. This problem can be solved in $O \left ( n^{2} \right )$ time but not in $O(n\log n)$ time. None of the above.
Let $S=\left \{ x_{1},....,x_{n} \right \}$ be a set of $n$ numbers. Consider the problem of storing the elements of $S$ in an array $A\left [ 1...n \right ]$ such that t...
2.1k
views
answered
Aug 1, 2018
Algorithms
tifr2011
algorithms
sorting
+
–
1
votes
13
GATE CSE 2013 | Question: 30
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is $\Theta(1)$ $\Theta(\sqrt{\log} n)$ $\Theta(\frac{\log n}{\log \log n})$ $\Theta(\log n)$
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is$\Theta(1)$$\Theta(\sqrt{\log} n)$$\Theta(\frac{\log n}{\log \log n})$$\Theta(\log n)...
27.9k
views
answered
Jul 31, 2018
Algorithms
gatecse-2013
algorithms
sorting
normal
heap-sort
+
–
3
votes
14
TIFR CSE 2013 | Part A | Question: 10
Three men and three rakhsasas arrive together at a ferry crossing to find a boat with an oar, but no boatman. The boat can carry one or at the most two persons, for example, one man and one rakhsasas, and each man or rakhsasas can row. But if at any ... any mishap, what is the minimum number of times that the boat must cross the river? $7$ $9$ $11$ $13$ $15$
Three men and three rakhsasas arrive together at a ferry crossing to find a boat with an oar, but no boatman. The boat can carry one or at the most two persons, for examp...
1.5k
views
answered
Jul 30, 2018
Analytical Aptitude
tifr2013
analytical-aptitude
logical-reasoning
+
–
0
votes
15
GATE CSE 2003 | Question: 1
Consider the following $C$ function. For large values of $y$, the return value of the function $f$ best approximates float f,(float x, int y) { float p, s; int i; for (s=1,p=1,i=1; i<y; i++) { p *= x/i; s += p; } return s; } $x^y$ $e^x$ $\text{ln} (1+x)$ $x^x$
Consider the following $C$ function.For large values of $y$, the return value of the function $f$ best approximatesfloat f,(float x, int y) { float p, s; int i; for (s=1,...
10.0k
views
answered
Jul 28, 2018
Algorithms
gatecse-2003
algorithms
identify-function
normal
+
–
2
votes
16
GATE CSE 2005 | Question: 31
Consider the following C-program: void foo (int n, int sum) { int k = 0, j = 0; if (n == 0) return; k = n % 10; j = n/10; sum = sum + k; foo (j, sum); printf ("%d,",k); } int main() { int a = 2048, sum = 0; foo(a, sum); printf("%d\n", sum); } What ... print? $\text{8, 4, 0, 2, 14}$ $\text{8, 4, 0, 2, 0}$ $\text{2, 0, 4, 8, 14}$ $\text{2, 0, 4, 8, 0}$
Consider the following C-program:void foo (int n, int sum) { int k = 0, j = 0; if (n == 0) return; k = n % 10; j = n/10; sum = sum + k; foo (j, sum); printf ("%d,",k); } ...
13.0k
views
answered
Jul 28, 2018
Algorithms
gatecse-2005
algorithms
identify-function
recursion
normal
+
–
3
votes
17
GATE CSE 2017 Set 1 | Question: GA-3
Rahul, Murali, Srinivas and Arul are seated around a square table. Rahul is sitting to the left of Murali. Srinivas is sitting to the right of Arul. Which of the following pairs are seated opposite each other? Rahul and Murali Srinivas and Arul Srinvas and Murali Srinivas and Rahul
Rahul, Murali, Srinivas and Arul are seated around a square table. Rahul is sitting to the left of Murali. Srinivas is sitting to the right of Arul. Which of the followin...
5.1k
views
answered
Jul 26, 2018
Analytical Aptitude
gatecse-2017-set1
analytical-aptitude
logical-reasoning
+
–
1
votes
18
GATE CSE 2003 | Question: 66
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is rep...
23.9k
views
answered
Jul 23, 2018
Algorithms
gatecse-2003
algorithms
time-complexity
normal
+
–
0
votes
19
GATE2011 AG: GA-4
There are two candidates $P$ and $Q$ in an election. During the campaign, $40\%$ of the voters promised to vote for $P,$ and rest for $Q.$ However, on the day of election $15\%$ of the voters went back on their promise to vote for $P$ ... instead voted for $P.$ Suppose$,P$ lost by $2$ votes$,$ then what was the total number of voters? $100$ $110$ $90$ $95$
There are two candidates $P$ and $Q$ in an election. During the campaign, $40\%$ of the voters promised to vote for $P,$ and rest for $Q.$ However, on the day of election...
8.6k
views
answered
Jul 22, 2018
Quantitative Aptitude
general-aptitude
quantitative-aptitude
gate2011-ag
percentage
+
–
0
votes
20
GATE IT 2007 | Question: 30
Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: $isEmpty (Q)$ - returns true if the queue is empty, false otherwise. $delete (Q)$ - deletes the element at the front of the queue ... the front of the queue $Q$ and inserts it at the rear keeping the other elements in the same order Empties the queue $Q$
Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are:$isEmpty (Q)$ — returns true if the queue is empty...
16.1k
views
answered
Jul 19, 2018
DS
gateit-2007
data-structures
queue
normal
+
–
4
votes
21
GATE2014 AG: GA-4
In any given year, the probability of an earthquake greater than Magnitude $6$ occurring in the Garhwal Himalayas is $0.04$. The average time between successive occurrences of such earthquakes is ____ years.
In any given year, the probability of an earthquake greater than Magnitude $6$ occurring in the Garhwal Himalayas is $0.04$. The average time between successive occurrenc...
4.0k
views
answered
Jul 18, 2018
Quantitative Aptitude
gate2014-ag
quantitative-aptitude
probability
numerical-answers
normal
+
–
0
votes
22
GATE CSE 2004 | Question: 40
Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among $\text{union, intersection, membership, cardinality}$ will be the slowest? $\text{union}$ only $\text{intersection, membership}$ $\text{membership, cardinality}$ $\text{union, intersection}$
Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among $\text{union, intersection, membership, cardinality}$ wil...
18.9k
views
answered
Jul 18, 2018
DS
gatecse-2004
data-structures
linked-list
normal
+
–
0
votes
23
GATE CSE 2015 Set 1 | Question: GA-4
Based on the given statements, select the most appropriate option to solve the given question. If two floors in a certain building are $9$ feet apart, how many steps are there in a set of stairs that extends from the ... . Both statements together are sufficient, but neither statement alone is sufficient. Statements I and II together are not sufficient.
Based on the given statements, select the most appropriate option to solve the given question.If two floors in a certain building are $9$ feet apart, how many steps are t...
4.0k
views
answered
Jul 17, 2018
Verbal Aptitude
gatecse-2015-set1
verbal-aptitude
easy
statement-sufficiency
+
–
10
votes
24
GATE CSE 2003 | Question: 24
Which of the following statements is FALSE? In statically typed languages, each variable in a program has a fixed type In un-typed languages, values do not have any types In dynamically typed languages, variables have no types In all statically typed languages, each variable in a program is associated with values of only a single type during the execution of the program
Which of the following statements is FALSE?In statically typed languages, each variable in a program has a fixed typeIn un-typed languages, values do not have any typesIn...
9.0k
views
answered
Jul 11, 2018
Programming in C
gatecse-2003
programming
normal
type-checking
+
–
5
votes
25
GATE CSE 2017 Set 1 | Question: GA-6
"The hold of the nationalist imagination on our colonial past is such that anything inadequately or improperly nationalist is just not history." Which of the following statements best reflects the author's opinion? Nationalists ... filter of nationalism. Our colonial past never happened. Nationalism has to be both adequately and properly imagined.
"The hold of the nationalist imagination on our colonial past is such that anything inadequately or improperly nationalist is just not history."Which of the following sta...
3.9k
views
answered
Jul 4, 2018
Verbal Aptitude
gatecse-2017-set1
general-aptitude
verbal-aptitude
passage-reading
+
–
1
votes
26
GATE2011 GG: GA-1
Choose the most appropriate word or phrase from the options given below to complete the following sentence. The environmentalists hope ________ the lake to its pristine condition. in restoring in the restoration of to restore restoring
Choose the most appropriate word or phrase from the options given below to complete the following sentence. The environmentalists hope ________ the lake to its pristine c...
1.2k
views
answered
Jul 2, 2018
Verbal Aptitude
gate2011-gg
verbal-aptitude
most-appropriate-word
+
–
4
votes
27
GATE2014 EC-1: GA-1
Choose the most appropriate phrase from the options given below to complete the following sentence. The aircraft __________ take off as soon as its flight plan was filed. Is allowed to Will be allowed to Was allowed to Has been allowed to
Choose the most appropriate phrase from the options given below to complete the following sentence.The aircraft __________ take off as soon as its flight plan was filed.I...
2.5k
views
answered
Jul 2, 2018
Verbal Aptitude
gate2014-ec-1
verbal-aptitude
tenses
easy
+
–
1
votes
28
GATE2015 EC-2: GA- 2
Choose the word most similar in meaning to the given word: Awkward Inept Graceful Suitable Dreadful
Choose the word most similar in meaning to the given word:AwkwardIneptGracefulSuitableDreadful
1.7k
views
answered
Jul 1, 2018
Verbal Aptitude
gate2015-ec-2
verbal-aptitude
meaning
+
–
3
votes
29
GATE CSE 2016 Set 2 | Question: GA-01
The man who is now Municipal Commissioner worked as ________________. the security guard at a university a security guard at the university a security guard at university the security guard at the university
The man who is now Municipal Commissioner worked as ________________.the security guard at a universitya security guard at the universitya security guard at universitythe...
4.2k
views
answered
Jun 30, 2018
Verbal Aptitude
gatecse-2016-set2
verbal-aptitude
english-grammar
normal
+
–
5
votes
30
TIFR CSE 2010 | Part A | Question: 13
A cube whose faces are colored is split into $1000$ small cubes of equal size. The cubes thus obtained are mixed thoroughly. The probability that a cube drawn at random will have exactly two colored faces is: $0.096$ $0.12$ $0.104$ $0.24$ None of the above
A cube whose faces are colored is split into $1000$ small cubes of equal size. The cubes thus obtained are mixed thoroughly. The probability that a cube drawn at random w...
2.4k
views
answered
Jun 15, 2018
Probability
tifr2010
probability
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register