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.
Recent activity 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
4
answers
1
GATE2012CYGA7
A and B are friends. They decide to meet between 1:00 pm and 2:00 pm on a given day. There is a condition that whoever arrives first will not wait for the other for more than 15 minutes. The probability that they will meet on that day is 1/4 1/16 7/16 9/16
answer selected
2 days
ago
in
Numerical Ability

3.2k
views
gate2012cy
numericalability
probability
1
answer
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 ___________
commented
Nov 10
in
Operating System

38
views
1
answer
3
A First Course in Probability Sheldon Ross 8th Edition Random Variables Example 1b
answered
Nov 10
in
Probability

52
views
1
answer
4
GATE19871xxiii
A square matrix is singular whenever The rows are linearly independent The columns are linearly independent The row are linearly dependent None of the above
answer selected
Nov 10
in
Linear Algebra

287
views
gate1987
linearalgebra
matrices
1
answer
5
C Output
answered
Nov 10
in
Programming

46
views
0
answers
6
HEADERS
There are so many headers in COMPUTER NETWORK which are the headers that i should mug them properly ??.Please list them in order of their priorities.
commented
Nov 9
in
Computer Networks

28
views
0
answers
7
Combination , how to solve ?
How many ways are there to select four pieces of fruit from a bowl containing apples, oranges, and pears if the order in which the pieces are selected does not matter, only the type of fruit and not the individual piece matters, and there are at least four pieces of each type of fruit in the bowl?
commented
Nov 9
in
Graph Theory

36
views
mathematics
0
answers
8
Self doubt on Ethernet LAN
Are the below formulas for correct w.r.t ethernet LAN? efficiency : PD = propagation delay TD = transmission delay L = frame size $\eta =\frac{1}{1 + 6.44(\frac{ pd }{ td })}$ throughput: $= \frac{L}{RTT}$ If they are wrong please provide correct ones.
commented
Nov 9
in
Computer Networks

29
views
computernetworks
ethernet
1
answer
9
UGCNETNov2017II37
In __________ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without serving any requests on the return trip. A. LOOK B. SCAN C. CLOOK D. CSCAN
commented
Nov 9
in
Operating System

29
views
ugcnetnov2017ii
diskscheduling
1
answer
10
Algorithm
commented
Nov 9
in
Numerical Ability

112
views
0
answers
11
UGCNETNov2017II36
In Distributed system, the capacity of a system to adapt the increased service load is called _________. A. Tolerance B. Scalability C. Capability D. Loading
commented
Nov 9
in
Others

45
views
ugcnetnov2017ii
distributedcomputing
0
answers
12
Gate 2002
Let G be an undirected connected graph with distinct edge weights. Let Emax be the edge with maximum weight and Emin the edge with minimum weight. Which of the following statements is false?
closed
Nov 9
in
Algorithms

20
views
1
answer
13
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
1
answer
14
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
answer
15
[Discrete Maths] : Functions
answered
Nov 9
in
Set Theory & Algebra

57
views
discretemathematics
0
answers
16
Doubt
Manish has to travel from A to D changing buses at stops B and C enroute. The maximum waiting time at either stop can be 8 minutes each, but any time of waiting up to 8 minutes is equally likely at both the places. He can afford up to 13 minutes of total ... on time. What is the probability that Manish will arrive late at D? A) 8/13 B) 13/64 C) 119/128 D) 9/128
commented
Nov 9
in
Numerical Ability

33
views
aptitute
1
answer
17
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
0
answers
18
Kenneth Rosen Ex 7.6
commented
Nov 9
in
Set Theory & Algebra

45
views
partialorder
lattice
2
answers
19
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
3
answers
20
GATE1997_5.3
A micro instruction is to be designed to specify none or one of the three micro operations of one kind and none or upto six micro operations of another kind The minimum number of bits in the microinstruction is 9 5 8 None of the above
commented
Nov 9
in
CO & Architecture

804
views
gate1997
coandarchitecture
microprogramming
normal
0
answers
21
ugc net November 2017
An undirected graph G(V,E) contains n(n>2) nodes named v1,v2,....vn. Two nodes vi and vj are connected if and only if o< i  j  ≤ 2. Each edge (vi, vj) is assigned a weight i+j. The cost of the minimum spanning tree of such a graph with 10 nodes is:
closed
Nov 8
in
Graph Theory

50
views
minimumspanningtrees
2
answers
22
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
1
answer
23
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
1
answer
24
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
commented
Nov 8
in
Computer Networks

56
views
1
answer
25
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??
commented
Nov 8
in
Operating System

37
views
semaphore
operatingsystem
processsynchronization
acetestseries
2
answers
26
CO: Memory Access time
commented
Nov 8
in
CO & Architecture

109
views
coandarchitecture
cachememory
effectivememoryaccess
0
answers
27
Dependency VS Hazard
Consider following program is executed on a 5 stage RISC pipeline and stages are IF, ID, EX, MA, WB. IF = Instruction Fetch ID = Instruction Decode and fetch register EX = Execution Stage MA = Memory Access WB = Write back ... Hazards.(There is no Structural Dependency) My Answers > Dependencies = 6, hazards = 3. Someone verify these answer.
commented
Nov 8
in
CO & Architecture

48
views
coandarchitecture
pipelining
hazards
1
answer
28
CO Test Series. True/False statements
commented
Nov 8
in
CO & Architecture

58
views
madeeasytestseries
coandarchitecture
1
answer
29
Output of a program
What will be the output of the following C program: void print1(void) { static int x=10; x+=5; printf("%d",x); } void print2(void) { static int x; x=10; x+=5; printf("%d",x); } int main() { print1(); print1(); print2(); print2(); return 0;} 15, 20, 25, 30 15, 20, 15, 20 15, 15, 15, 15 None of these
commented
Nov 7
in
Programming

52
views
programminginc
output
1
answer
30
hashing
answered
Nov 7
in
DS

46
views
1
answer
31
Depth first search
Consider the following graph G. Modified DFS on G applied as follows: • Starting vertex is ‘p’. • Vertex is visited based on alphabetic order. • Vertices are visited in order p, q, r, s, t, v. • It works same as DFS except the visiting order restriction What is the number of back edges during the above DFS traversal on G ______________
commented
Nov 7
in
Algorithms

61
views
dfs
1
answer
32
shedule
i think answer is b but given is d.
commented
Nov 7
in
Databases

38
views
2
answers
33
block access
answered
Nov 7
in
Databases

26
views
1
answer
34
CO test series
commented
Nov 7
in
CO & Architecture

91
views
madeeasytestseries
coandarchitecture
3
answers
35
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
1
answer
36
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
1
answer
37
algorithm
answered
Nov 6
in
Algorithms

34
views
1
answer
38
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?
answer selected
Nov 6
in
CO & Architecture

126
views
0
answers
39
paging
in calculating emat with page fault service time given some solutions use( page fault rate(p)*page faullt service) + memory time and some use ( p*page faullt service) + ((1p)* memory time) whats the difference?
commented
Nov 6
in
Operating System

46
views
0
answers
40
Gate Prep plan
How to manage Gate Preparation Continuity while one and half month of Semester Exam???
commented
Nov 6
in
GATE

36
views
28,981
questions
36,818
answers
91,202
comments
34,706
users