The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
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. For hardcopy of previous year questions please see
here
Recent activity by Raveena Yadav 1
User Raveena Yadav 1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Raveena Yadav 1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
Resource Allocation
Consider a scenario where 3 processes P1, P2 and P3 are sharing x resources of the same type. The maximum need of the three processes is 4, 8, 6. It is also known that the maximum combined need of both processes P1 and P2 at a time is 9 and they always execute only in combined manner. Then the value of x is ___
commented
Feb 2, 2018
in
Operating System

515
views
operatingsystem
1
answer
2
UGC NET NOV 2017 PAPER III Q59
59. Consider the following two wellformed formulas in prepositional logic. F1 : P ⇒ ¬ P F2 : (P ⇒ ¬ P) ∨ (¬ P ⇒ P) Which of the following statements is correct ? (1) F1 is Satisfiable, F2 is valid (2) F1 is unsatisfiable, F2 is Satisfiable (3) F1 is unsatisfiable, F2 is valid (4) F1 and F2 both are Satisfiable
answered
Feb 2, 2018
in
Discrete Mathematics

577
views
ugcnetnov2017iii
discretemathematics
propositionallogic
1
answer
3
UGC NET NOV 2017 PAPER III Q58
58. “If X, then Y unless Z” is represented by which of the following formulae in propositional logic ? (1) (X ∧ Y) → ¬ Z (2) (X ∧ ¬ Z) → Y (3) X → (Y ∧ ¬ Z) (4) Y → (X ∧ ¬ Z)
answered
Feb 2, 2018
in
Discrete Mathematics

425
views
ugcnetnov2017iii
discretemathematics
propositionallogic
2
answers
4
SELF DOUBT
Which gates are functionally complete? e.g.NAND
commented
Feb 2, 2018
in
Digital Logic

78
views
1
answer
5
discrete maths
Consider the following statements: S1: Every cyclic group is Abelian group. S2: Every Abelian group is cyclic group. S3: Cyclic group of order 10 have 4 generators. Which of the following is true?
commented
Feb 1, 2018
in
Graph Theory

81
views
1
answer
6
Test series
Plz explain ??
answer edited
Feb 1, 2018
in
Graph Theory

57
views
1
answer
7
Gate_2018_Model_Paper
How to find was raw hazard in following question?
commented
Feb 1, 2018
in
Databases

63
views
dvms
0
answers
8
Eigen Vectors
I'm getting 2
commented
Feb 1, 2018
in
Linear Algebra

98
views
linearalgebra
2
answers
9
madeeasy test series
A database relation has 5000 records block can hold either 10 records or 15 keys and pointer pairs. If sparse index is used at 1st level and multilevel indexing is used in system, then the number of disk block required to store relation and index is _______
commented
Jan 31, 2018
in
Databases

69
views
2
answers
10
Decidability
Whether a TM has finite number of states? Decidable or undecidable??
commented
Jan 31, 2018
in
Theory of Computation

102
views
0
answers
11
Ace Mock
commented
Jan 31, 2018
in
Databases

69
views
0
answers
12
ACE TEST
commented
Jan 30, 2018
in
Programming

42
views
2
answers
13
TEST SERIES
commented
Jan 30, 2018
in
Programming

109
views
0
answers
14
ER diagram
Minimum number of tables required for above diagram ________
commented
Jan 30, 2018
in
Databases

228
views
databases
erdiagram
1
answer
15
Gate_2018_Mock
My answer is 42 but given answer is 2018 please explain how ?
commented
Jan 30, 2018
in
Programming

128
views
programminginc
programming
1
answer
16
made easy test
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 MSS and the threshold at the start is 1st transmission is 16 MSS. Assume TCP use over a lossy link i.e., timeout occur after transmission of 7th packet . The congestion window size at the end of 14 RTT is _________ (in MSS).
comment edited
Jan 30, 2018
in
Computer Networks

75
views
computernetworks
1
answer
17
Gate_2018_mock
L=wxw^r. W=(0,1)^* Is regular language how?
answered
Jan 30, 2018
in
Theory of Computation

69
views
theoryofcomputation
badquestion
1
answer
18
Throughtput
I'm getting 106.6666... Can someone confirm?
commented
Jan 30, 2018
in
Computer Networks

76
views
throughput
0
answers
19
mock test
how they are equivalent
commented
Jan 30, 2018
in
Mathematical Logic

59
views
discretemathematics
0
answers
20
mock test
what is the meaning of static single assignment how to solve
commented
Jan 29, 2018
in
Programming

39
views
datastructure
0
answers
21
ace test series
what will be the bcnf decomposition for : R(A,B,C,D,E) FD : {AB>C, C>D , D>E, E>A}
commented
Jan 28, 2018
in
Databases

42
views
1
answer
22
made easy test
Which of the following parameter is not included in the activation record of recursive function call? A) Local variables of function B) Return value of function C) Global variables of program D) Access link
answered
Jan 28, 2018
in
Operating System

64
views
1
answer
23
B+trees
What does the order of leaf node means in the B+trees...I know that order of internal node is maximum no of child for that node but what does the order mean in leaf node?
commented
Jan 28, 2018
in
Databases

51
views
0
answers
24
****** series
Match the following. I  B, II  C, III  D, IV  D, V  A Explanation: AVL tree is balanced BST, so its height is O(log N) The maximum height of BST is O(N) for left or right skewed The time complexity of randomized quicksort and heapsort is O(N log N) in worst ...  B, III  D, IV  D, V  A I think Time complexity of randomised quick sort in worst case is O(N^2). Please correct me.
commented
Jan 28, 2018
in
Algorithms

64
views
1
answer
25
MadeEasy Test Series 2018: Theory of Computation  Identify Class Language
Isn't the second one is CFL?
commented
Jan 28, 2018
in
Theory of Computation

72
views
theoryofcomputation
identifyclasslanguage
madeeasytestseries
1
answer
26
Doubt: modulus of asynchronous counter
mod of following asynchronous counter is?? Due to the delay of OR gate I think mod is $10$.
commented
Jan 9, 2018
in
Digital Logic

189
views
digitallogic
2
answers
27
selfdoubt
this year power grid is not recruiting cs?
asked
Jan 8, 2018
in
Job Queries

142
views
0
answers
28
ACE test series
A function f: Z+ ⟶ Z+ is defined by f(x)= maximum of n and 50. which of the following is true? A) f is one to one but not onto B) f is onto but not one to one C) f is bijection D f is neither one to one nor onto
commented
Jan 8, 2018
in
Set Theory & Algebra

77
views
3
answers
29
ME test
Which of the following languages are regular?
answered
Jan 3, 2018
in
Theory of Computation

84
views
0
answers
30
Made easy test series
The following assembly code is to be executed in a 3stage pipelined processor with hazard detection and resolution in each stage. The stage are IF, OF (one or more as required) and execution (including writeback operation). What are the number of possible RAW, WAW and WAR hazards in the execution of the code. A. 6,1,2 B. 5,3,3 C. 5,3,2 D. 5,1,2
commented
Dec 28, 2017
in
CO and Architecture

53
views
1
answer
31
Set theory basic
commented
Dec 27, 2017
in
Set Theory & Algebra

38
views
settheory
0
answers
32
#GRAPH THEORY
commented
Dec 23, 2017
in
Graph Theory

108
views
graphtheory
discretemathematics
graphcoloring
2
answers
33
prefix property
what is prefix property ?
answer selected
Dec 22, 2017
in
Theory of Computation

271
views
1
answer
34
Depth first search
Consider DFS over an undirected graph with 4 vertices <P;Q;R;S>. The discovery and finishing times of them in the order P to S is given for which of the following options is the graph connected? A) <(1,6)(2,5)(3,4)(8,10)> B) <(6,7)(2,5)(3,4)(8,9)> C) <(4,5)(2,8)(1,7)(3,6)> D) <(7,8)(1,2)(5,6)(3,4)>
commented
Dec 22, 2017
in
Algorithms

245
views
0
answers
35
pipeline
Consider the following program which is executed on 4 stage pipelined processor. IF= 2 clocks/word, ID=2 clocks/word, EX stage takes 2 clocks for register operands and 3 clocks for memory operand 'WR' stage takes 2 clock cycles for all instructions. NO ... Minimum number of clocks needed to complete the above program is ____________. Note : Pipeline stage sequence is IF,ID,EX and WR.
commented
Dec 22, 2017
in
CO and Architecture

323
views
1
answer
36
Pipeline
A non pipeline processor has clock rate of 25 MHz and CPI of 4, another processor with 5 stage instruction pipeline due to latch delay and clock skew effect clock rate is 20 MHz. If program containing 100 instructions is executed on both processors, then the speedup factor is ______ .
commented
Dec 22, 2017
in
CO and Architecture

168
views
0
answers
37
compiler sdt
pls verify
commented
Dec 14, 2017
in
Compiler Design

193
views
1
answer
38
Deadlock: Safe or Unsafe
Consider a system with 12 tape drives with: Process Max Need Allocated P1 10 5 P2 9 3 Is this system is in a safe or unsafe state? If it is not safe then under which condition system leads to deadlock?
commented
Dec 2, 2017
in
Operating System

369
views
operatingsystem
deadlock
deadlockpreventionavoidancedetection
1
answer
39
Doubt
A polynomial of degree 4 with real coefficients A) Can possibly have no extrema and no zero crossings B) May have up to four extrema and up to 3 zero crossings C) Cannot have more than three extrema and more than four zero crossings D) Will have an equal number of extrema and zero crossings
commented
Dec 2, 2017
in
Calculus

174
views
0
answers
40
please solve this Q
Consider a selective repeat sliding window protocol that uses a frame size of 1 KB to send data on a 1.5 Mbps link with a oneway latency of 50 msec. To achieve a link utilization of 60%, the minimum number of bits required to represent the sequence number field is ________.
commented
Dec 2, 2017
in
Computer Networks

47
views
49,811
questions
54,533
answers
188,415
comments
75,561
users