GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Answers by Tahoora
User Tahoora
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Tahoora
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
GATE 2017
Are pnp problems in the syllabus for GATE 2017 ?
answered
5 days
ago
in
GATE

28
views
+2
votes
2
Programming
answered
6 days
ago
in
Programming

48
views
0
votes
3
admission in vjti
minimum rank required to get into vjti mumbai for general category
answered
Feb 26, 2016
in
Other Colleges

60
views
0
votes
4
serializability
any one reply pls fast
answered
Feb 5, 2016
in
Databases

56
views
0
votes
5
Probability
The probability of event A occurring is 0.5 and of B occurring is 0.3. If A and B are mutually exclusive events then the probability of neither A nor B occurring is___ Solution : 0.2 P(A' UNION B' ) = 1 P(A UNION B) 10.8 = 0.2 ... using demorgans law = 1 P ( A INTERSECTION B ) = 1  0 ( mutually exclusive ) =1 Which is the correct approach . Please Help
answered
Feb 5, 2016
in
Probability

52
views
probability
+3
votes
6
aptitude
Four undergraduates are staying is a room. They agreed that older enjoys the more space. Manu is two months older than Sravan, who is one month younger than Trideep. Pavan is one month older than Sravan. Who will enjoy more space in room? (A) Manu (B) Sravan (C) Trideep (D) Pavan
answered
Feb 4, 2016
in
Verbal Ability

69
views
+1
vote
7
Is the function differentiable at x=1
answered
Jan 31, 2016
in
Calculus

71
views
calculus
+2
votes
8
PLz solve this
Let a2 = b+c b2 = a+c c2 =a+ b then find the value of (1/1+a)+(1/1+b)+(1/1+c) = ??
answered
Jan 30, 2016
in
Verbal Ability

46
views
+7
votes
9
Formula for calculating efficiency of ethernet
answered
Jan 29, 2016
in
Computer Networks

841
views
computernetworks
ethernet
+7
votes
10
GATE200362
In a permutation \(a_1 ... a_n\), of n distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i > a_j\). What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations ... most $n$ inversions? \(\Theta(n^2)\) \(\Theta(n\log n)\) \(\Theta(n^{1.5})\) \(\Theta(n)\)
answered
Jan 27, 2016
in
Algorithms

466
views
gate2003
algorithms
sorting
expectation
normal
+12
votes
11
ISRO201538
Suppose two jobs, each of which needs $10$ minutes of CPU time, start simultaneously. Assume $50\%$ I/O wait time. How long will it take for both to complete, if they run sequentially? 10 20 30 40
answered
Jan 27, 2016
in
Operating System

1.1k
views
processschedule
isro2015
+1
vote
12
When the system is restarted, which one statement is true of the recovery procedure?
answered
Jan 26, 2016
in
Databases

116
views
databases
0
votes
13
GEEK_MOCK_QUETION_30
$\begin{pmatrix} 4&3 \\ 6&3 \end{pmatrix}$ What is the sum of all the elements of the $L$ and $U$ matrices as obtained in the L U decomposition? $16$ $10$ $9$ $6$
answered
Jan 26, 2016
in
Linear Algebra

122
views
geekmock2016
ludecomposition
+5
votes
14
GEEK_MOCK_QUETION_14
QUESTION 14 : Consider the below Pseudo code written in C style bool fun(int arr[], int n, int X) { if (X == 0) return true; if (n == 0 && X != 0) return false; if (arr[n–1]*arr[n–1] ... space D) Time Complexity of fun() is O(n2) and it requires O(n2) extra space Correct – A How to calculate space complexity?
answered
Jan 26, 2016
in
Algorithms

80
views
spacecomplexity
timecomplexity
geekmock2016
+1
vote
15
how many NAND gate required for AC+BD+AB
answered
Jan 24, 2016
in
Digital Logic

29
views
+5
votes
16
GATE1991_03,viii
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Consider the following Pascal function: Function X(M:integer):integer; Var i:integer; Begin i := 0; while i*i < M do i:= i+1 X := i end The function ... rfloor +1$ (c). $\lceil \sqrt N \rceil$ (d). $\lceil \sqrt N \rceil +1$ (e). None of the above
answered
Jan 23, 2016
in
Algorithms

254
views
gate1991
algorithms
easy
18,813
questions
23,785
answers
51,448
comments
20,130
users