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
Answers by saxena0612
User saxena0612
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User saxena0612
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+2
votes
1
Self doubt generating function
Equation: $x+y=10$ and we are asked to find out the number of a nonnegative integral solution of this equation.
answered
Feb 25, 2018
in
Combinatory

234
views
generatingfunctions
0
votes
2
Testbook Test Series: Operating System  Virtual Memory
answered
Feb 20, 2018
in
Operating System

184
views
testbooktestseries
operatingsystem
virtualmemory
0
votes
3
ME test series os
Consider 3 processes P0, P1 and P2 to be scheduled as per the SRTF algorithm. The process P0' is known to be scheduled first and when P0 has been running 6' units of time, then the process P2' has arrived. The process P2' has run for 4' unit of ... process P1' has arrived and completed running in 5' units of time. Then the minimum burst time of P0' is _______ (in units).
answered
Jan 27, 2018
in
Operating System

60
views
0
votes
4
MadeEasy Test Series: Probability
Q)A product is an assembly of 4 different components. The product can be sequentially assembled in two possible ways. If the 4 components are placed in a box and these are drawn at random from the box, then the probability of getting a correct sequence is ______.
answered
Jan 27, 2018
in
Probability

113
views
madeeasytestseries
probability
+5
votes
5
Integration
$\int_{4}^{4}\left  x3 \right dx$
answered
Jan 26, 2018
in
Calculus

162
views
calculus
integration
engineeringmathematics
+2
votes
6
Number of conflict serializible schedules
Number of conflict serializible schedules in T1 : R(A) W(A) R(B) W(B) T2: R(A) W(A) R(B) W(B)
answered
Jan 19, 2018
in
Databases

1k
views
+4
votes
7
me test
answered
Jan 19, 2018
in
Algorithms

208
views
+7
votes
8
Conflict serializability
answered
Jan 17, 2018
in
Databases

676
views
conflictserializable
transactions
databases
+1
vote
9
Mathematics: Gate EE 17
Assume that in a traffic junction, the cycle of traffic signal lights is 2 minutes of green(vehicle does not stop) and 3 minutes of red (vehicle stops). Consider the arrival time of vehicles at the junction is uniformly distributed over 5 minute cycle. The expected waiting time in minutes for the vehicle at the junction is _________
answered
Jan 16, 2018
in
Probability

1k
views
probability
uniformdistribution
gate2017ee
engineeringmathematics
numericalanswers
0
votes
10
Test series
Consider a nonpipeline processor has clock rate of 25 MHz and CPI of 6, another processor designed with same clock rate and 8 stage instruction pipeline. If program containing 500 instructions is executed on both processors, then the speedup factor is _______.
answered
Jan 13, 2018
in
CO and Architecture

101
views
+1
vote
11
Digital logic gate forum
answered
Jan 13, 2018
in
Digital Logic

126
views
digitallogic
gateforumtestseries
+4
votes
12
DLd M#D#esy
Problem: here Johnson counter initial state is 101 but 3bit jhonson counter isequence is like this...(000 100 110 111 011 001)
answered
Jan 12, 2018
in
Digital Logic

94
views
+4
votes
13
Good question in Number system
If all the $4's$ are replaced by $5,$then sum of all the numbers from $1$ to $100$ wil be equal to$?$ $A)5050$ $B)5090$ $C)5140$ $D)5160$
answered
Jan 12, 2018
in
Numerical Ability

186
views
generalaptitude
numericalability
numbersystem
+4
votes
14
GATE2017252
If the characteristic polynomial of a 3 $\times$ 3 matrix $M$ over $\mathbb{R}$ (the set of real numbers) is $\lambda^3 – 4 \lambda^2 + a \lambda +30, \quad a \in \mathbb{R}$, and one eigenvalue of $M$ is 2, then the largest among the absolute values of the eigenvalues of $M$ is _______
answered
Jan 11, 2018
in
Linear Algebra

3.8k
views
gate20172
engineeringmathematics
linearalgebra
numericalanswers
eigenvalue
+2
votes
15
File System OS
Given disk size is 40 MB.Block Size is 8KB .The size of the bit map is ..... bits. Plz describe the answer with a proper diagram so that I could visualize the things as I faces problem when it comes to disks and blocks and hence it went wrong.
answered
Jan 10, 2018
in
Operating System

223
views
operatingsystem
filesystem
+1
vote
16
test series
i am getting "Xmin= 4" answer given 5 please verify
answered
Jan 10, 2018
in
Operating System

45
views
operatingsystem
+7
votes
17
Go back N
In GB4 if every 6th packet if lost and total 15 packets are to be transmitted then how many total transmissions are done?
answered
Jan 10, 2018
in
Computer Networks

322
views
0
votes
18
Probability of Dice
A pair of dice is rolled, till a sum of either 5 or 7 obtained. Find the probability that 5 comes before 7?
answered
Jan 10, 2018
in
Probability

162
views
probability
engineeringmathematics
+3
votes
19
test series
answered
Jan 7, 2018
in
Numerical Ability

88
views
0
votes
20
me test doubt
Consider a machine with a byte addressable main memory of 248 bytes divided into blocks of size 64 bytes. Assume that a direct mapped cache having 2k cache lines is used with this machine. The size of the tag field in bits is ________ here ans < tag,line no,bo> = 37,5,6 right? given ans is 31,11,6 please correct me
answered
Jan 4, 2018
in
CO and Architecture

44
views
0
votes
21
Block Access in Block Nested Loop Join
answered
Jan 4, 2018
in
Databases

148
views
+4
votes
22
Sum is even?
answered
Jan 2, 2018
in
Verbal Ability

67
views
+1
vote
23
Aptitude
Please post the solution to solve this time and work problem
answered
Jan 2, 2018
in
Numerical Ability

92
views
0
votes
24
pipelining
We have two designs P 1 and P 2 for a synchronous pipeline processor. P1 has 8 pipeline stages with execution time of 3 nsec, 2 nsec, 4 nsec, 7 nsec, 2 nsec, 5 nsec, 4 nsec and 2 nsec while design P2 has 5 stages each with 6 nsec execution time. How much time can be saved using design P2 over design P1 for executing 400 instructions?
answered
Jan 2, 2018
in
CO and Architecture

249
views
coandarchitecture
pipelining
+2
votes
25
Context switch
Consider 4 processes sharing the CPU in round robin fashion. If context switch time is 1 sec , what must be the time quantum q such that the number of context switches are reduced , but at the same time each process is guaranteed to get the turn at the CPU for every 10 secs?  ...  Ans 2 or 1.5 . Is here any formula used like (n1)q+ns explain in detail
answered
Jan 2, 2018
in
Operating System

294
views
operatingsystem
contextswitch
cpuscheduling
roundrobin
+5
votes
26
MadeEasy Test Series: Computer Networks  Ip Packet
If a datagram of size 4000 bytes from transport layer arrives at network layer and it has to be forwarded through a link with maximum capacity of 800 bytes. Then calculate the number of fragments needed if the header size is 20 bytes. Also calculate the data size of the last fragment.
answered
Jan 2, 2018
in
Computer Networks

257
views
madeeasytestseries
computernetworks
ippacket
+1
vote
27
computer architecture
In a 16 bit computer instruction format, the size of address field is 5 bits. The computer uses expanding opcode technique. It has two 2address instructions and 1024 one address instruction. How many zeroaddress instruction can be formulated?
answered
Jan 2, 2018
in
CO and Architecture

48
views
coandarchitecture
+2
votes
28
Minimum retrieval time
please explain the approach.
answered
Jan 2, 2018
in
Operating System

81
views
+1
vote
29
Bit vector: Number of blocks
answered
Jan 2, 2018
in
Operating System

58
views
0
votes
30
ACE TEST
exact ans of this question is 3.20% or 3.10 % can i solve using this 1/1+2a??
answered
Jan 1, 2018
in
Computer Networks

65
views
+4
votes
31
Hashing
Consider a hash table with 8 slots that uses chaining for collision resolution .The table is initially empty .what is probability that after 4 keys inserted at least a chain of 3 created?
answered
Jan 1, 2018
in
DS

186
views
+1
vote
32
self dout
Recursive relation require new table ?or not when we converting ER to relation?please explain
answered
Dec 31, 2017
in
Databases

33
views
+2
votes
33
Pumping Lemma
The proof of pumping lemma is an example of : (A) iteration (B) recursion (C) pigeonhole principle (D) None of These
answered
Dec 31, 2017
in
Theory of Computation

244
views
theoryofcomputation
pumpinglemma
+1
vote
34
implication VS conjunction
When should we use implication and when conjunction? For example in this question: https://gateoverflow.in/989/gate200626?show=188041#c188041 What is the difference in options B and D?
answered
Dec 31, 2017
in
Mathematical Logic

240
views
propositionallogic
mathematicallogic
discretemathematics
firstorderlogic
0
votes
35
Memory Management
A $1$TB Disk with $4$KB blocks require $32$MB to store its bit map? Kindly explain how.
answered
Dec 31, 2017
in
Operating System

733
views
memorymanagement
operatingsystem
bitmap
+1
vote
36
test series
In a computer system, three files of size 11052 B, 4992 B and 5172 B need to be stored. For storing these files on disk, we can use either 100 B disk block or 200 B disk block. For each block used to store a file, 2 bytes of book keeping information also ... disk blocks respectively. A 21800 B, 22240 B B 21700 B, 22000 B C 21900 B, 22000 D 21800 B, 22200 B plz explain this question
answered
Dec 29, 2017
in
Operating System

104
views
opreating
system
+4
votes
37
Power Set
$R=P\left ( P\left ( P\left ( \phi \right ) \right ) \right )$ $T=P\left ( P\left ( \left \{ 1,2 \right \} \right ) \right )$ What is cardinality of set $S$, where $S=R\times T$
answered
Dec 28, 2017
in
Set Theory & Algebra

108
views
discretemathematics
sets
0
votes
38
Please Solve this Q
answered
Dec 27, 2017
in
Computer Networks

47
views
+5
votes
39
Doubt
If the edge weight of minimum spanning tree are given and edge weight of each edge is distinct, then the minimum value of sum (a, b, c, d, e, f, g) is __________.
answered
Dec 26, 2017
in
Algorithms

80
views
0
votes
40
test series
Arrange the following functions in asymptotically increasing order f1(n) = n0.999999 log n f2(n) = 10000000n Please explain your solution. Thanks
answered
Dec 24, 2017
in
Algorithms

102
views
algorithms
timecomplexity
Page:
1
2
3
next »
50,650
questions
56,236
answers
194,263
comments
95,868
users