The Gateway to Computer Science Excellence
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
Exam Category
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 Habibkhan
User Habibkhan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Habibkhan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+3
votes
1
A First Course in Probability Sheldon Ross 8th Edition Random Variables Example 1b
answered
Nov 10
in
Probability

52
views
+4
votes
2
max file size
Consider a file system in which the index table in the directory holds 32 pointers(DBA's) if the file size is within 32 blocks then these 32 addresses act as direct DBA's . Otherwise if file size is more than 32 blocks then these addresses ... that hold addresses of data blocks. if DBS is 4KB and DBA is 32 bits then max file size in MB is ___________
answered
Nov 10
in
Operating System

38
views
+2
votes
3
C Output
answered
Nov 10
in
Programming

46
views
0
votes
4
SelfDoubt
Is the Poset (Q,Less than or equal to) a well ordered set? Where Q denotes set of all rational numbers and relation R is less than or equal to.
answered
Nov 9
in
Set Theory & Algebra

24
views
partialorder
+2
votes
5
Maths: maxima and minima
In this maxima  minima question, teacher says that critical point 2 doesn't belong to the interval [3, 3], isn't this wrong or i am missing something?
answered
Nov 9
in
Calculus

48
views
engineeringmathematics
calculus
maximaminima
+1
vote
6
[Discrete Maths] : Functions
answered
Nov 9
in
Set Theory & Algebra

57
views
discretemathematics
+2
votes
7
3D array
main() { int arr[2][3][2] ={{{1,2}{3,4}{5,6}} , {7,8}{9,10},{11,12}}}; printf("%d%d",a[1]a[0],a[1][0]a[0][0]}; return 0; } assume int is of 2 bytes
answered
Nov 9
in
Programming

40
views
+1
vote
8
FINd p and Q
P = (1+1/2)(1+1/3)(1+1/4)..........(1+1/98)(1+1/99) Q=(11/2)(11/3)...............................(11/99)(11/100) P/Q = ?
answered
Nov 9
in
Numerical Ability

32
views
+1
vote
9
Inequality
If 0$<$x$<$1 then (a) $\sqrt{\frac{1x}{1+x}} < \frac{log(1+x)}{sin^{1}x} < 1$ (b) $\sqrt{\frac{1x}{1+x}} > \frac{log(1+x)}{sin^{1}x} > 1$ (c) $\sqrt{\frac{1x}{1+x}} > \frac{log(1+x)}{sin^{1}x} < 1$ (d) $\sqrt{\frac{1x}{1+x}} < \frac{log(1+x)}{sin^{1}x} > 1$
answered
Nov 8
in
Calculus

41
views
maths
+3
votes
10
Lattice
In Bounded lattice, the greatest and least element are always complement of each other? True/False?
answered
Nov 8
in
Set Theory & Algebra

29
views
lattice
discretemathematics
discretemathematic
+2
votes
11
Semaphore { Ace }
It says as follows: Pseudocode Integer X = 0 , Y = 23 ; Semaphore mx = 1 , my = Null ; Codebegin Begin P(mx); x= x+1; V(my); End Begin P(my); x= y+1; V(mx); End Question: Possible final values of X?? I tried to find the values and i concluded that 1 and 24 could be the final values but solution says only 24 :( Any idea??
answered
Nov 8
in
Operating System

37
views
semaphore
operatingsystem
processsynchronization
acetestseries
+1
vote
12
hashing
answered
Nov 7
in
DS

46
views
+1
vote
13
hamming
In hamming method to transmit a message of size 12B data . How many minimum number of padding bits are considered to correct single bit error
answered
Nov 7
in
Computer Networks

56
views
0
votes
14
CO: Memory Access time
answered
Nov 7
in
CO & Architecture

109
views
coandarchitecture
cachememory
effectivememoryaccess
+2
votes
15
CO Test Series. True/False statements
answered
Nov 7
in
CO & Architecture

58
views
madeeasytestseries
coandarchitecture
+1
vote
16
block access
answered
Nov 7
in
Databases

26
views
+4
votes
17
branch instructions
Consider a 6 staged pipelined processor , where all stages are perfectly balanced. While executing a branch instruction CPU computes the target address after completing the operation in 5th stage only.One clock cycle time is required for ... it takes 1.6sec time for 109 instructions, then number of branch instructions in the above program is ?
answered
Nov 7
in
CO & Architecture

56
views
+2
votes
18
aptitudee
Three typists A,B and C working together 8 hours per day can type 900 pages in 20 days. In a day B types as many pages more than A as C types as many pages more than B. The number of pages typed by A in 4 hours equal to the number of pages typed by C isn 1 hour. How many pages C types in each hour?
answered
Nov 7
in
Numerical Ability

56
views
timework
+2
votes
19
algorithm
answered
Nov 6
in
Algorithms

34
views
+1
vote
20
self doubt
we use the formula V(n,k) = C(n1+k,k) when do we actually go for this formula? QUESTION there are 6 symbols and we have to insert 12 blanks between these symbols with atleast 2 blanks between each...number of ways to arrange the blanks Solution ... ) = C(51+2,2) =15 why use this approach in simple words i want to know when do we go for this approach
answered
Nov 6
in
Mathematical Logic

44
views
0
votes
21
time complexity
answered
Nov 5
in
Algorithms

83
views
+4
votes
22
CO test series
answered
Nov 5
in
CO & Architecture

91
views
madeeasytestseries
coandarchitecture
+2
votes
23
addressing mode reduces no of bits?
answered
Nov 5
in
CO & Architecture

36
views
addressingmodes
instructionformat
+1
vote
24
test series
To merge two lists of size m and n, how many comparisons we need to perform in the worst case and best case respectively ? a) m+n1 and m+n1 b)m+n+1 and max(m,n) c)max(m,n) and min(m,n) d)m+n1 and min(m,n) can someone give the worst case and best case with examples ?
answered
Nov 4
in
Algorithms

44
views
algorithms
sorting
normal
+3
votes
25
what will the value printed by code
answered
Nov 4
in
Programming

39
views
programming
pointers
+1
vote
26
WAR amd WAW dependency
R4 < R1 + R4 R4 < R2 + R4 R4 < R3 + R5 Number of WAR and WAW dependencies?
answered
Nov 4
in
CO & Architecture

25
views
datadependences
0
votes
27
time stamp ordering protocol
what is the meaning of TS(Ti) < WTS(Q) and TS(Ti) > WTS(Q) Ti issuing read on data item Q. please someone clear my doubt i am very confuse in these terms.
answered
Nov 3
in
Databases

45
views
+2
votes
28
programming
a) 4 b)20 c)both d) either of them ... for me its 20 but given ans is either of them
answered
Nov 3
in
Programming

71
views
+3
votes
29
Time Complexity
Consider the following code….. Search(int n){ if(n<2) then return; else{ s=0; for(i=1;i<=8;i++){ Search(n/2); } for(i=1;i<n*n;i++){ for(j=1;j<n;j=j*2){ s=s+i; } } } } Assume s is a global variable.Find the complexity of the given Search(n)?
answered
Nov 2
in
Algorithms

47
views
timecomplexity
algorithms
asymptoticnotations
recursion
programminginc
+5
votes
30
Time Complexity
Consider the following function Void func(int n){ Int k=n; Int i=0; for(;i<n;i++){ while(k>1){ k>>=1; } } What is the worst case time complexity of the function?
answered
Nov 2
in
Algorithms

70
views
timecomplexity
algorithms
asymptoticnotations
recursion
programminginc
+5
votes
31
Discrete mathematics  Combinatorics
answered
Nov 2
in
Combinatory

76
views
permutationsandcombinations
discretemathematics
+6
votes
32
Combinatorics
Somebody prove this identity : $\frac{\binom{n1}{0}}{1} + \frac{\binom{n1}{1}}{2} + \frac{\binom{n1}{2}}{3} + .... + \frac{\binom{n1}{n1}}{n} = \frac{2^{n}1}{n}$
answered
Nov 2
in
Combinatory

78
views
+3
votes
33
Group theory doubt
1)Suppose that G is cyclic group of order 10 with generator a €G .Order of a^8 is... 2)(G,*) is an abelian group which of the following must hold A)for all g€G. g1 = g B)for all g€G. g^2 =e C)for all a,b €G ( a*b)^2 =a^2* b^2
answered
Nov 1
in
Mathematical Logic

56
views
+1
vote
34
co doubt
The only instruction in the 5stage pipelined MIPS that needs all 5 stages is Load. It has been suggested to design a 4stage pipeline where the 4th stage will allow either a memory (read or write) operation, or a Register File write. The ... , what is the speedup of the 5stage pipeline over the 4stage one? please someone tell how to approach this question.
answered
Nov 1
in
CO & Architecture

35
views
+1
vote
35
pipeline
consider 5 stage pipeline with cycle time 2ns to execute program segment which contains 20 instruction (I1 TO I20) In the pipeline, all the instruction proceed through all the stages. I4 INSTRUCTION is an unconditional branch instruction which transfers the control to I18 INSTRUCTION during its execution. what is the program execution time?
answered
Oct 31
in
CO & Architecture

126
views
+6
votes
36
C PROGRAMMING
OUTPUT OF THE FOLLOWING PROGRAMME #include<stdio.h> int main() { int n1=10; int n2=15; int n3; n3=~n1; printf("%d",n3); return 0; } Basically here i want to understand how do we store negation value and what are the changes done,for a signed and unsigned integers here considering integer is of 4 bytes here.
answered
Oct 31
in
Programming

59
views
programminginc
nongate
+1
vote
37
regular grammar
Consider the following finite automata F1 Which of the following is not equivalent Regular expression? c(ac+b)* (cac)*+b* (cac)*+(cb)* None of the above
answered
Oct 31
in
Theory of Computation

48
views
+5
votes
38
Min Heap
In a minheap, the next largest element of a particular element can be found in ___ time. A) O(1) B) O(log n) C) O(n)
answered
Oct 31
in
Algorithms

110
views
heap
algorithms
binaryheap
timecomplexity
+1
vote
39
TCP negative ACK
Let the source has sent four TCP segments to Destination with the sequence numbers 50,74,97,120 ( 1st, 2nd, 3rd and 4th segment ) if the first and fourth segments arrive at destination successfully then the negative acknowledgement that destination sends to source is _______
answered
Oct 31
in
Computer Networks

34
views
+2
votes
40
FibonacciSequence
Which of the following is true about time complexity for generating $\color{blue} {n^{th}}$ Fibonacci number ? a)$O(n)$ b)$O(Logn)$ c)$O(2^n)$ d)$\Omega(n)$
answered
Oct 31
in
Algorithms

88
views
algorithms
timecomplexity
Page:
1
2
3
4
5
6
...
23
next »
28,981
questions
36,818
answers
91,202
comments
34,706
users