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 Arjun
31
votes
1521
GATE CSE 2015 Set 3 | Question: GA-10
The exports and imports (in crores of $Rs$.) of a country from the year $2000$ to $2007$ are given in the following bar chart. In which year is the combined percentage increase in imports and exports the highest?
The exports and imports (in crores of $Rs$.) of a country from the year $2000$ to $2007$ are given in the following bar chart. In which year is the combined percentage in...
5.7k
views
answered
Feb 14, 2015
Quantitative Aptitude
gatecse-2015-set3
quantitative-aptitude
data-interpretation
normal
numerical-answers
+
–
68
votes
1522
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.5k
views
answered
Feb 14, 2015
Operating System
gatecse-2015-set3
operating-system
process-scheduling
easy
+
–
15
votes
1523
GATE CSE 2015 Set 3 | Question: GA-9
Most experts feel that in spite of possessing all the technical skills required to be a batsman of the highest order, he is unlikely to be so due to lack of requisite temperament. He was guilty of throwing away his wicket several time after ... starts count. Improving his technical skills will guarantee success. iii and iv ii and iii i, ii and iii ii only
Most experts feel that in spite of possessing all the technical skills required to be a batsman of the highest order, he is unlikely to be so due to lack of requisite tem...
2.6k
views
answered
Feb 14, 2015
Verbal Aptitude
gatecse-2015-set3
verbal-aptitude
normal
passage-reading
+
–
25
votes
1524
GATE CSE 2015 Set 3 | Question: GA-8
Choose the most appropriate equation for the function drawn as thick line, in the plot below. $x=y-|y|$ $x=-(y-|y|)$ $x=y+|y|$ $x=-(y+|y|)$
Choose the most appropriate equation for the function drawn as thick line, in the plot below.$x=y-|y|$$x=-(y-|y|)$$x=y+|y|$$x=-(y+|y|)$
4.5k
views
answered
Feb 14, 2015
Quantitative Aptitude
gatecse-2015-set3
quantitative-aptitude
normal
functions
+
–
60
votes
1525
GATE CSE 2015 Set 1 | Question: 26
$\sum\limits_{x=1}^{99}\frac{1}{x(x+1)}$ = ______.
$\sum\limits_{x=1}^{99}\frac{1}{x(x+1)}$ = ______.
8.2k
views
answered
Feb 14, 2015
Combinatory
gatecse-2015-set1
combinatory
normal
numerical-answers
summation
+
–
118
votes
1526
GATE CSE 2015 Set 1 | Question: 16
For a set $A$, the power set of $A$ is denoted by $2^{A}$. If $A = \left\{5,\left\{6\right\}, \left\{7\right\}\right\}$, which of the following options are TRUE? $\varnothing \in 2^{A}$ $\varnothing \subseteq 2^{A}$ ... I and III only II and III only I, II and III only I, II and IV only
For a set $A$, the power set of $A$ is denoted by $2^{A}$. If $A = \left\{5,\left\{6\right\}, \left\{7\right\}\right\}$, which of the following options are TRUE?$\varnoth...
15.6k
views
answered
Feb 14, 2015
Set Theory & Algebra
gatecse-2015-set1
set-theory&algebra
set-theory
normal
+
–
83
votes
1527
GATE CSE 2015 Set 1 | Question: 29
Consider a LAN with four nodes $S_1, S_2, S_3,$ and $S_4$. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A collision is said to have occurred if more than ... respectively. The probability of sending a frame in the first slot without any collision by any of these four stations is__________________.
Consider a LAN with four nodes $S_1, S_2, S_3,$ and $S_4$. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A...
13.6k
views
answered
Feb 14, 2015
Computer Networks
gatecse-2015-set1
computer-networks
normal
numerical-answers
congestion-control
+
–
96
votes
1528
GATE CSE 2015 Set 2 | Question: 47
A computer system implements $8\;\text{kilobyte}$ pages and a $32\text{-bit}$ physical address space. Each page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the maximum size of the page table of a process is $24\;\text{megabytes}$, the length of the virtual address supported by the system is _______ bits.
A computer system implements $8\;\text{kilobyte}$ pages and a $32\text{-bit}$ physical address space. Each page table entry contains a valid bit, a dirty bit, three permi...
19.2k
views
answered
Feb 14, 2015
Operating System
gatecse-2015-set2
operating-system
virtual-memory
normal
numerical-answers
+
–
122
votes
1529
GATE CSE 2015 Set 1 | Question: 52
Consider the DFAs $M$ and $N$ given above. The number of states in a minimal DFA that accept the language $L(M) \cap L(N)$ is_____________.
Consider the DFAs $M$ and $N$ given above. The number of states in a minimal DFA that accept the language $L(M) \cap L(N)$ is_____________.
17.3k
views
answered
Feb 14, 2015
Theory of Computation
gatecse-2015-set1
theory-of-computation
finite-automata
easy
numerical-answers
minimal-state-automata
+
–
22
votes
1530
GATE CSE 2015 Set 3 | Question: GA-7
The head of newly formed government desires to appoint five of the six selected members $P, Q, R, S, T$ and $U$ to portfolios of Home, Power, Defense, Telecom, and Finance. U does not want any portfolio if $S$ gets one of the five. $R$ wants either Home ... -Power, $T$-Defense, $S$-Telecom, $U$-Finance $Q$-Home, $U$-Power, $T$-Defense, $R$-Telecom, $P$-Finance
The head of newly formed government desires to appoint five of the six selected members $P, Q, R, S, T$ and $U$ to portfolios of Home, Power, Defense, Telecom, and Financ...
4.3k
views
answered
Feb 13, 2015
Analytical Aptitude
gatecse-2015-set3
analytical-aptitude
normal
logical-reasoning
+
–
67
votes
1531
GATE CSE 2015 Set 1 | Question: 17
In one of the pairs of protocols given below , both the protocols can use multiple $\textsf{TCP}$ connections between the same client and the server. Which one is that? $\textsf{HTTP, FTP}$ $\textsf{HTTP, TELNET}$ $\textsf{FTP, SMTP}$ $\textsf{HTTP, SMTP}$
In one of the pairs of protocols given below , both the protocols can use multiple $\textsf{TCP}$ connections between the same client and the server. Which one is that?$\...
14.1k
views
answered
Feb 13, 2015
Computer Networks
gatecse-2015-set1
computer-networks
network-protocols
normal
+
–
163
votes
1532
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.3k
views
answered
Feb 13, 2015
Programming in C
gatecse-2015-set1
programming
programming-in-c
array
normal
+
–
145
votes
1533
GATE CSE 2015 Set 2 | Question: 48
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is ... adder is implemented by using four full adders. The total propagation time of this $4$-bit binary adder in microseconds is ______.
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that o...
62.1k
views
answered
Feb 13, 2015
Digital Logic
gatecse-2015-set2
digital-logic
adder
normal
numerical-answers
+
–
15
votes
1534
GATE CSE 2015 Set 1 | Question: 30
Suppose the following disk request sequence (track numbers) for a disk with $100$ tracks is given: $45, 20, 90, 10, 50, 60, 80, 25, 70.$ Assume that the initial position of the R/W head is on track $50$ ... is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards $100$ when it starts execution) is________________tracks.
Suppose the following disk request sequence (track numbers) for a disk with $100$ tracks is given:$45, 20, 90, 10, 50, 60, 80, 25, 70.$Assume that the initial position of...
23.9k
views
answered
Feb 13, 2015
Operating System
gatecse-2015-set1
operating-system
disk-scheduling
normal
numerical-answers
+
–
120
votes
1535
GATE CSE 2015 Set 2 | Question: 44
Consider the sequence of machine instruction given below: ... forwarding from the PO stage to the OF stage. The number of clock cycles taken for the execution of the above sequence of instruction is _________.
Consider the sequence of machine instruction given below:$$\begin{array}{ll} \text{MUL} & \text{R5, R0, R1} \\ \text{DIV} & \text{R6, R2, R3} \\ \text{ADD} & \text{R7,...
26.4k
views
answered
Feb 13, 2015
CO and Architecture
gatecse-2015-set2
co-and-architecture
pipelining
normal
numerical-answers
+
–
45
votes
1536
GATE CSE 2015 Set 1 | Question: 24
A file is organized so that the ordering of the data records is the same as or close to the ordering of data entries in some index. Then that index is called Dense Sparse Clustered Unclustered
A file is organized so that the ordering of the data records is the same as or close to the ordering of data entries in some index. Then that index is calledDenseSparseCl...
16.4k
views
answered
Feb 13, 2015
Databases
gatecse-2015-set1
databases
indexing
easy
+
–
61
votes
1537
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
answered
Feb 13, 2015
Set Theory & Algebra
gatecse-2015-set2
set-theory&algebra
functions
normal
numerical-answers
+
–
21
votes
1538
GATE CSE 2015 Set 1 | Question: GA-9
The pie chart below has the breakup of the number of students from different departments in an engineering college for the year $2012$. The proportion of male to female students in each department is $5:4$. There are $40$ ... is the difference between the numbers of female students in the civil department and the female students in the Mechanical department?
The pie chart below has the breakup of the number of students from different departments in an engineering college for the year $2012$. The proportion of male to female s...
8.1k
views
answered
Feb 12, 2015
Quantitative Aptitude
gatecse-2015-set1
quantitative-aptitude
data-interpretation
numerical-answers
pie-chart
+
–
9
votes
1539
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
answered
Feb 12, 2015
Verbal Aptitude
gatecse-2015-set1
verbal-aptitude
normal
statements-follow
+
–
45
votes
1540
GATE CSE 2015 Set 2 | Question: 8
A link has transmission speed of $10^6$ bits/sec. It uses data packets of size $1000$ $\text{bytes}$ each. Assume that the acknowledgment has negligible transmission delay and that its propagation delay is the same as the data propagation delay. ... $\text{%}$. The value of the one way propagation delay (in milliseconds) is_____.
A link has transmission speed of $10^6$ bits/sec. It uses data packets of size $1000$ $\text{bytes}$ each. Assume that the acknowledgment has negligible transmission dela...
12.0k
views
answered
Feb 12, 2015
Computer Networks
gatecse-2015-set2
computer-networks
mac-protocol
stop-and-wait
normal
numerical-answers
+
–
50
votes
1541
GATE CSE 2015 Set 2 | Question: 23
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could lead to a deadlock? $1$ $2$ $3$ $4$
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could l...
34.4k
views
answered
Feb 12, 2015
Operating System
gatecse-2015-set2
operating-system
resource-allocation
easy
+
–
130
votes
1542
GATE CSE 2015 Set 2 | Question: 11
Consider the following C function. int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k<n; ++k) x = x + fun(k) * fun (n-k); return x; } The return value of $fun(5)$ is ______.
Consider the following C function.int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k<n; ++k) x = x + fun(k) * fun (n-k); return x; }The return value of $fun(5)$...
21.3k
views
answered
Feb 12, 2015
Algorithms
gatecse-2015-set2
algorithms
identify-function
recurrence-relation
normal
numerical-answers
+
–
30
votes
1543
GATE CSE 2015 Set 2 | Question: 1
Consider the following transaction involving two bank accounts $x$ and $y$. read(x); x:=x-50; write (x); read(y); y:=y+50; write(y) The constraint that the sum of the accounts $x$ and $y$ should remain constant is that of Atomicity Consistency Isolation Durability
Consider the following transaction involving two bank accounts $x$ and $y$.read(x); x:=x-50; write (x); read(y); y:=y+50; write(y)The constraint that the sum of the accou...
14.9k
views
answered
Feb 12, 2015
Databases
gatecse-2015-set2
databases
transaction-and-concurrency
easy
+
–
23
votes
1544
GATE CSE 2015 Set 2 | Question: 2
Consider two decision problems $Q_1, Q_2$ such that $Q_1$ reduces in polynomial time to 3-SAT and 3-SAT reduces in polynomial time to $Q_2$. Then which one of the following is consistent with the above statement? $Q_1$ is in NP, $Q_2$ is NP hard. $Q_2$ is in NP, $Q_1$ is NP hard. Both $Q_1$ and $Q_2$ are in NP. Both $Q_1$ and $Q_2$ are in NP hard.
Consider two decision problems $Q_1, Q_2$ such that $Q_1$ reduces in polynomial time to 3-SAT and 3-SAT reduces in polynomial time to $Q_2$. Then which one of the followi...
6.5k
views
answered
Feb 12, 2015
Theory of Computation
gatecse-2015-set2
algorithms
p-np-npc-nph
easy
out-of-syllabus-now
+
–
43
votes
1545
GATE CSE 2015 Set 1 | Question: 3
For any two languages $L_{1}$ and $L_{2}$ such that $L_{1}$ is context-free and $L_{2}$ is recursively enumerable but not recursive, which of the following is/are necessarily true? $\bar{L}_{1}$ ( Complement of $L_{1}$) is recursive $\bar{L}_{2}$ ... $\bar{L}_{1}$ ∪ $L_{2}$ is recursively enumerable I only III only III and IV only I and IV only
For any two languages $L_{1}$ and $L_{2}$ such that $L_{1}$ is context-free and $L_{2}$ is recursively enumerable but not recursive, which of the following is/are necessa...
6.5k
views
answered
Feb 11, 2015
Theory of Computation
gatecse-2015-set1
theory-of-computation
recursive-and-recursively-enumerable-languages
normal
+
–
42
votes
1546
GATE CSE 2015 Set 1 | Question: 2
Which one of the following is the recurrence equation for the worst case time complexity of the quick sort algorithm for sorting $n\;( \geq 2)$ numbers? In the recurrence equations given in the options below, $c$ is a constant. $T(n) = 2 T (n/2) + cn$ $T(n) = T ( n - 1) + T(1) + cn$ $T(n) = 2T ( n - 1) + cn$ $T(n) = T (n/2) + cn$
Which one of the following is the recurrence equation for the worst case time complexity of the quick sort algorithm for sorting $n\;( \geq 2)$ numbers? In the recurrenc...
11.6k
views
answered
Feb 11, 2015
Algorithms
gatecse-2015-set1
algorithms
recurrence-relation
sorting
easy
+
–
14
votes
1547
GATE CSE 2015 Set 1 | Question: GA-6
The number of students in a class who have answered correctly, wrongly, or not attempted each question in an exam, are listed in the table below. The marks for each question are also listed. There is no negative or partial marking. ... is the average of the marks obtained by the class in the examination? $2.290$ $2.970$ $6.795$ $8.795$
The number of students in a class who have answered correctly, wrongly, or not attempted each question in an exam, are listed in the table below. The marks for each quest...
4.5k
views
answered
Feb 11, 2015
Quantitative Aptitude
gatecse-2015-set1
quantitative-aptitude
easy
data-interpretation
tabular-data
+
–
51
votes
1548
GATE CSE 2015 Set 1 | Question: GA-10
The probabilities that a student passes in mathematics, physics and chemistry are $m,p$ and $c$ respectively. Of these subjects, the student has $75\%$ chance of passing in at least one, a $50\%$ ... Only relation I is true. Only relation II is true. Relations II and III are true. Relations I and III are true.
The probabilities that a student passes in mathematics, physics and chemistry are $m,p$ and $c$ respectively. Of these subjects, the student has $75\%$ chance of passing ...
12.6k
views
answered
Feb 11, 2015
Quantitative Aptitude
gatecse-2015-set1
quantitative-aptitude
probability
+
–
3
votes
1549
GATE FEB7 EVN
1) A 2) B 3) C 4) D
1)A2)B3)C4)D
493
views
answered
Feb 11, 2015
Programming in C
hashing
+
–
2
votes
1550
PSUs recruiting through GATE 2015
please provide links for PSUs selecting through GATE , specially CS branch. IOCL, powergrid, BBNL filled. aur konsa hai plz update.
please provide links for PSUs selecting through GATE , specially CS branch.IOCL, powergrid, BBNL filled. aur konsa hai plz update.
1.0k
views
answered
Feb 10, 2015
Page:
« prev
1
...
46
47
48
49
50
51
52
53
54
55
56
...
70
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register