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 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
+2
votes
1
Testbook
I am getting numerator as 6.5 in this way: = 0.9 * (#stages for nonbranch instruction) + 0.1 * (#stages for branch instructions) = 0.9 * 6 + 0.1 * (6 + 5) = 6.5
answered
7 hours
ago
in
CO & Architecture

26
views
pipelining
+2
votes
2
Say true or false?
preorder traversal of a tree resemble to the DFS traversal of graph?
answered
1 day
ago
in
Algorithms

34
views
+1
vote
3
Discrete Maths
How many one to one functions are possible from A to B where A =4 and B = 6 such that ith element of A can not match with ith element of B.??
answered
2 days
ago
in
Set Theory & Algebra

87
views
+4
votes
4
toc doubt
answered
2 days
ago
in
Theory of Computation

396
views
theoryofcomputation
decidability
recursiverecursivelyenumerable
+8
votes
5
Effective CPU time
Consider a processor with an ideal CPI without memory stalls for each instruction type as follows: $$\begin{align*} \begin{matrix} &\text{ALU} &= 1 \\ &\text{Load/Store} &= 1.5 \\ &\text{Branch}&=1.5 \\ &\ ... instruction cache is $50$ cycles, then calculate the effective CPU time? A] $8.25$ B] $9.25$ C] $8.625$ D] $9.34$
answered
3 days
ago
in
CO & Architecture

280
views
co&architecture
effectivecputime
+4
votes
6
made easy test 4
i am getting 4 ?? # plz check Answer is given 2
answered
3 days
ago
in
CO & Architecture

47
views
madeeasy_testseries
+4
votes
7
TOC epsilon closure doubt
Please explain?
answered
3 days
ago
in
Theory of Computation

64
views
0
votes
8
compiler test
Is it left Factored Grammer ? plz explain
answered
4 days
ago
in
Compiler Design

44
views
+4
votes
9
CIDR notation
answered
4 days
ago
in
Computer Networks

44
views
+7
votes
10
ACE Basic test
Test Digital logic ques 15
answered
4 days
ago
in
Digital Logic

381
views
0
votes
11
Binary Search tree
Consider an array with ‘n’ numbers, let “T” be time complexity for finding a number appeared maximum number of times in an array. Using Binary Search Tree data structure the T will be A. O(log n) B. O(n) C. O(n logn) D. O(n2)
answered
5 days
ago
in
Algorithms

86
views
algorithms
binarysearchtree
datastructure
bst
+4
votes
12
Time Complexity
What is the time complexity of quick sort when (i) Choosing median of sorted array as pivot.
answered
5 days
ago
in
DS

50
views
+3
votes
13
made easy
Unix Inode has disk block size 8 KB and maximum file possible with the double indirect is 32 GB. Then the number of bits which represents disk block address is _______ bits.
answered
5 days
ago
in
CO & Architecture

48
views
+5
votes
14
MECN
Assume a CSMA/CD network that transmit data at a rate of 20 Mbps over a 20 km cable with no repeater. If minimum frame size require for network is 5,000 KB then speed of the signal inside cable is __________ (in Km/sec). What should be correct ans : 19.53 or 20
answered
6 days
ago
in
Computer Networks

269
views
+2
votes
15
MEFLT
Consider the following statements. 1. A thread running in critical section never get context switched. 2. Hardware access to devices is usually available in user mode. 3. Modifications to the page tables are only possible in Kernel mode. Which of the above statements are incorrect?
answered
6 days
ago
in
Operating System

82
views
madeeasy
+3
votes
16
Virtual Gate
answered
Jan 9
in
Compiler Design

93
views
testseries
virtualgate
+7
votes
17
probability
Let S be a sample space and two mutually exclusive events Aand B be such that A∪B=A∪B=S. If P(.)denotes the probability of the event, the maximum value of P(A)P(B) is_____.
answered
Jan 8
in
Probability

195
views
+10
votes
18
DOUBT
my answer is "B" but the answer is given "C"
answered
Jan 8
in
Theory of Computation

642
views
theoryofcomputation
+2
votes
19
Made Easy
answered
Jan 8
in
CO & Architecture

34
views
madeeasy_testseries
co&architecture
+8
votes
20
Relational operators property
An operator on relations is called monotone whenever we add a tuple to one of its arguments, the result contains all the tuples that it contained before adding the tuple plus perhaps more tuples. Which of the following operator is monotone? $\Join$ $\cap$ $$ $\large \sigma$
answered
Jan 7
in
Databases

294
views
relationalalgebra
dbms
+3
votes
21
Addressing Mode
S1 : Relative mode is the addressing mode which can be used to write code in which reallocation is done at run time. S2 : Indirect addressing through registers can be used to access global variables. Which of the following option is correct?
answered
Jan 7
in
CO & Architecture

58
views
co&architecture
addressingmodes
+1
vote
22
2PL doubt
answered
Jan 7
in
Databases

28
views
+2
votes
23
Am i right?
answered
Jan 7
in
Databases

19
views
+3
votes
24
combinatorics
coefficient of x^20 in (1+x+x^2+......................)^2 is?
answered
Jan 5
in
Mathematical Logic

50
views
combinatorics
+10
votes
25
poisson distribution
answered
Jan 5
in
Mathematical Logic

205
views
+2
votes
26
counter ques
Using four cascaded counters with a total of 16 bits, how many states must be deleted to achieve a modulus of 50,000? A. 50,000 B. 65,536 C. 25,536 D. 15,536
answered
Jan 5
in
Digital Logic

37
views
+6
votes
27
Madeeasy test series
Cache can hold 512KB. Data is transferred between main memory and Cache Block of 32B each. Main memory consists of 4GB. If cache memory is 2way set associative then the hexadecimal main memory address (ABABABAB)H is mapped to which ... how they got set offset value but didn't understand how they got the answer for line offset. Please help.
answered
Jan 5
in
CO & Architecture

328
views
+5
votes
28
PRECEDENCE GRAPH
T1 T2 T3 T4 R(X) W(X) C3; W(X) C1; W(Y) R(Z) C2; R(X) R(Y) C4;  Doubt: Transaction T3 is commited before T1 and ww problem.This results is there any edge between T3 and T1 in precedence graph or not??
answered
Jan 5
in
Databases

300
views
+3
votes
29
Simple Doubt in Integration
$\int_{ \pi }^{\pi} t^{2} \sin t \ dt$
answered
Jan 4
in
Calculus

46
views
calculus
+3
votes
30
Combinatorics Doubt
A box contain 10 screws out of which 3 are defective.If two screws are drawn at random WITH REPLACEMENT.What is the probability that no screw is defective? Answer given as 7c2/10C2 my question is ,as its given With Replacement. So why not it is (7/10)*(7/10)
answered
Jan 4
in
Combinatory

103
views
+6
votes
31
Computer Architecture Pipelining
answered
Jan 4
in
CO & Architecture

348
views
pipeline
branchconditionalinstructions
co&architecture
+2
votes
32
Adder
answered
Jan 4
in
Digital Logic

241
views
digitallogic
adder
+3
votes
33
Time Complexity
What is the time complexity of this? for(i=1;i<=n;i=i*2) { for(j=0;j<i;j++) {temp=temp+i;} }
answered
Jan 4
in
Algorithms

46
views
+3
votes
34
IP ADDRESSING
if ip fragment offset is 32 then how many number of datagram bytes ahead of this fragment ?
answered
Jan 4
in
Computer Networks

71
views
+3
votes
35
interrupt handling
answered
Dec 31, 2016
in
CO & Architecture

115
views
+6
votes
36
UNIX inode3
consider a unix file system impleneted with inode,that resides on a disk of size 512GB.Each inode has atotal of 15 block addresses,consisting of direct and indirect block adresses. suppose we configure a file system to use a block size of 32KB.How many bytes are needed to store all 15 block addresses in an inode? a)15byte b)29byte c)45byte d)75byte
answered
Dec 31, 2016
in
Operating System

290
views
inode
unix
operatingsystem
+5
votes
37
DOUBT
answered
Dec 31, 2016
in
Digital Logic

513
views
digitallogic
+3
votes
38
Flow Control
Consider a satellite communication channel with 0% error rate and a link capacity of 64 kbps. The satellite is sending the images of size 512 bytes data in one direction. One Image can be accumulated in one frame. The acknowledgement packets are very small and can be ... 64 Kbps 6.7 Kbps, 47 Kbps, 101 Kbps, 0.6 Mbps 6.7 Kbps, 47 Kbps, 61 Kbps, 0.6 Mbps
answered
Dec 31, 2016
in
Computer Networks

60
views
+1
vote
39
Please Help
Cardinality of $R_1$ and $R_2$ are $M$ and $1$, means it is $1:M$ relationship between $R_1$ and $R_2$ in R. So, It should be A.
answered
Dec 30, 2016
in
Databases

39
views
+4
votes
40
[Test Series] Counting Number of tokens
answered
Dec 30, 2016
in
Compiler Design

321
views
compilerdesign
tokens
lexeme
Page:
1
2
3
4
5
6
...
15
next »
18,813
questions
23,785
answers
51,449
comments
20,130
users