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
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.
Questions by vijay_jr
User vijay_jr
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User vijay_jr
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
0
answers
1
Test_series
If an idempotent matrix is also SkewSymmetric then it must be a Null matrix an involuntary matrix an identity matrix Harmitian matrix
asked
1 day
ago
in
Mathematical Logic

28
views
engineeringmathematics
matrices
+1
vote
0
answers
2
TestSeries
asked
Jan 10
in
Programming

37
views
programminginc
+1
vote
0
answers
3
counting
a+b+c<=12 a,b,c $\in Z^{+}$ No. of solution ?
asked
Jan 3
in
Mathematical Logic

54
views
permutationsandcombinations
counting
discretemathematics
0
votes
0
answers
4
Stop & Wait Protocol
Assume a network that does not drop, duplicate, or corrupt any packets and that you are using a stopandwait protocol between two endpoints, A and B. The time it takes for a packet to get from A to B is uniformly distributed ... will not have to retransmit it due to a timeout. What is the largest possible timeout you can choose (in ms)?
asked
Dec 14, 2017
in
Computer Networks

22
views
stopandwait
computernetworks
0
votes
0
answers
5
Stanford(Computer Networks)
Assume the configuration below: A  B  C where AB has an MTU of 1500 bytes and BC has an MTU of 400 bytes. Assume that link layer frames require 30 bytes of overhead, an IP ... A sends, how many bytes must B send to C (including link layer and IP header overhead)? 1050 bytes 1133 bytes 1135 bytes 1450 bytes
asked
Dec 11, 2017
in
Computer Networks

81
views
computernetworks
ipfragmentation
0
votes
0
answers
6
Stanford(Computer Networks)
Suppose that you have two nodes communicating with an AP that are hidden terminals to one another. The AP, except for acknowledgments, remains silent and there are no other transmitters in the network. The two nodes are ... transmitting at exactly the same time, what is the minimum number of backoffs before a packet is delivered successfully?
asked
Dec 11, 2017
in
Computer Networks

24
views
computernetworks
csmaca
wirelesslan
+1
vote
1
answer
7
Stanford(Automata Theory)
The operation DM(L) is defined as follows: Throw away every evenlength string from L. For each oddlength string, remove the middle character. For example, if L = {001, 1100, 10101}, then DM(L) = {01, 1001}. That is, evenlength string ... of regular expression ((0+1)(0+1))*. DM(L2) is regular; it is the language of regular expression (0+1)*.
asked
Dec 5, 2017
in
Theory of Computation

66
views
theoryofcomputation
finiteautomata
regularexpressions
+1
vote
1
answer
8
Stanford(Computer Networks)
You just turned on a four port Ethernet switch (it hasn't learned any addresses yet) and connected a host to each port. You send packet #1 from 00:11:22:33:44:55 to 66:77:88:99:00:11 which arrives at port 1 of your switch. Next, packet #2 ... :88:99:00:11 with port 1 Packet #2 is only sent out on port 1 Packet #2 is sent out on ports 1, 2, 4
asked
Dec 4, 2017
in
Computer Networks

52
views
computernetworks
networkswitching
0
votes
0
answers
9
Stanford(Quiz)
Network A consists of a hub with twenty ports, each connected to exactly one end host. Network B is identical, except the hub is replaced by a switch. Which of the following are true? If the end hosts in both networks try ... transferred simultaneously between the end hosts. The nodes in Network B can be further apart than the nodes in Network A.
asked
Dec 4, 2017
in
Computer Networks

34
views
computernetworks
networkswitching
routersbridgehubsswitches
0
votes
1
answer
10
Doubt!
You generate a perfectly random key K. You send two messages, M1 and M2, encrypted with K (C1 = K xor M1 and C2 = K xor M2). Does sending C2 leak information about M1 and M2?
asked
Dec 2, 2017
in
Computer Networks

35
views
cryptography
networksecurity
+4
votes
1
answer
11
Stanford(Regular expression)
This DFA accepts a certain language L. In this problem we shall consider certain other languages that are defined by their tails, that is, languages of the form (0+1)*w, for some particular string w of 0's and 1's. Call this language L(w). ... . L(110101) is contained in L. C). L(1111001) is contained in L. D). L(110101) is disjoint from L.
asked
Dec 2, 2017
in
Theory of Computation

66
views
regularexpressions
theoryofcomputation
regularlanguages
+4
votes
1
answer
12
Stanford (Automata Theory)
The finite automaton above accepts no word of length zero, no word of length one, and only two words of length two (01 and 10). There is a fairly simple recurrence equation for the number N(k) of words of length k that this automaton accepts. Discover ... the correct value of N(k) for some particular k. N(12)=10 N(12)=44 N(12)=50 N(13)=16
asked
Nov 28, 2017
in
Theory of Computation

64
views
theoryofcomputation
finiteautomata
dfa
0
votes
0
answers
13
OS(How to approach?)
A disk has 8 equidistant tracks. The diameters of the innermost and outermost tracks are 1 cm and 8 cm respectively. The innermost track has a storage capacity of 10 MB. If the disk has 20 sectors per track and is currently at the end ... , how much time will it take to read 1 MB contiguous data starting from the sector 4 of the outer most track?
asked
Nov 16, 2017
in
Operating System

66
views
operatingsystem
diskscheduling
0
votes
1
answer
14
how to prove?
If abc(a+b+c)=3, prove that (a+b)(b+c)(c+a)≥8
asked
Apr 14, 2017
in
Others

56
views
engineeringmathematics
+1
vote
0
answers
15
Explanation needed!!
You roll a fair foursided die. If the result is 1 or 2, you roll once more but otherwise, you stop. What is the probability that the sum total of your rolls is at least 4? 9/8 9/16 3/5 1/16
asked
Apr 4, 2017
in
Probability

94
views
+2
votes
1
answer
16
Testbook Question
number of boxes in the grid number of lines on the side of grid number of squares that can be made in the grid number of possible paths to topleft to bottomright of the grid
asked
Jan 12, 2017
in
Programming

65
views
0
votes
1
answer
17
Testbook question, Answer please
asked
Jan 12, 2017
in
Programming

78
views
programminginc
+2
votes
2
answers
18
Testbook question
b*2 b*c2 b+c*2 none of these
asked
Jan 11, 2017
in
Programming

63
views
programminginc
32,670
questions
39,280
answers
109,935
comments
36,682
users