Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Surajit
0
votes
0
answers
1
Dynamic programming--tabulation method bottom up
Just practicing some general problems on dynamic programming.Problem is I am unable to think of tabulation or bottom up approach for most of the new type of problems other than common ones.I am trying to get the naive recursion first ... at this moment let me know how to get some idea of tabulating easily?..For example take coin exchange problem.
Just practicing some general problems on dynamic programming.Problem is I am unable to think of tabulation or bottom up approach for most of the new type of problems othe...
986
views
asked
Feb 22, 2018
Algorithms
dynamic-programming
+
–
0
votes
1
answer
2
Integral calculus - +2 maths book
When evaluating definite integrals for odd functions the answer will come as 0 as equal areas symmetric to x-axis will cancel out and give 0.But then should we take the modulus values and add?If area is asked then definitely we should do that.Please have ... answer as 0 but if I take mod values by splitting intervals then I get the answer as 2 log 2 which is given.
When evaluating definite integrals for odd functions the answer will come as 0 as equal areas symmetric to x-axis will cancel out and give 0.But then should we take the m...
821
views
asked
Feb 13, 2018
Calculus
integration
calculus
+
–
1
votes
0
answers
3
Can we find the entire question paper in gate while attempting exam?
My query might be a stupid one.I am checking out the online gate exam interface from official site.There is a button if we click we can see the entire paper together.Is it always going to be there?I dont ... the potential difficulty of the paper before attempting questions in one shot and also helps to miss out on easy questions.
My query might be a stupid one.I am checking out the online gate exam interface from official site.There is a button if we click we can see the entire paper together.Is i...
689
views
asked
Jan 22, 2018
GATE
exam
+
–
3
votes
1
answer
4
Madeeasy
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. ... Will it increase additively by 1 MSS always or increase additively by the initial window size?Solution given as 12 MSS for this question.
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 thresho...
1.1k
views
asked
Jan 18, 2018
Computer Networks
congestion-control
+
–
0
votes
1
answer
5
When to assume Structural hazards exists if not mentioned in instruction pipeline-self doubt
When shall we assume structural hazard?Like if nothing is mentioned if data and instruction are fetched via single port,can we assume 'MA' (memory access stage) and 'IF' (instruction ... it always the case if nothing is told? https://gateoverflow.in/102565/operand-forwarding-in-pipeline
When shall we assume structural hazard?Like if nothing is mentioned if data and instruction are fetched via single port,can we assume 'MA' (memory access stage) and 'IF' ...
322
views
asked
Dec 1, 2017
CO and Architecture
hazards
pipelining
+
–
0
votes
1
answer
6
Ullman--Chomsky Normal Form
If the start symbol derives epsilon.Can we eliminate all epsilons while converting to Chomsky Normal Form?Following question from ullman the answer given they have removed the epsilon.But I think if the start symbol derives epsilon,more accurately if L(G) contains epsilon we cannot remove it. S->ASB|epsilon A->aAS|a B->SbS|A|bb
If the start symbol derives epsilon.Can we eliminate all epsilons while converting to Chomsky Normal Form?Following question from ullman the answer given they have remove...
1.2k
views
asked
Nov 25, 2017
Theory of Computation
theory-of-computation
context-free-grammar
conjunctive-normal-form
+
–
2
votes
0
answers
7
General Topic Doubt <CO & Architecture>:<solution-manual>
Greetings gate aspirants!..Does anyone have computer architecture--carl hamacher 5th edition or solution manual to 6th edition?...I am having the book of 6th edition and I was able to get a manual of 5th edition.Question no and solutions not tagging hence not able to match anwsers..Please forward me link if you know...thanks
Greetings gate aspirants!..Does anyone have computer architecture carl hamacher 5th edition or solution manual to 6th edition?...I am having the book of 6th edition and I...
384
views
asked
Nov 12, 2017
Study Resources
co-and-architecture
carl-hamacher
solution-manual
+
–
1
votes
0
answers
8
Narsing Deo--Graph theory
Show that every planar graph with at least 4 vertices has at least 4 vertices of degree less than or equal to 5.This will also prove there is no 6-connected planar graph. I have proved it partly,can someone please give provide a simple proof to ... also 2* no of edges. Is there a interconnection between these terms no just in terms of formula?Can we use it interchangebly.
Show that every planar graph with at least 4 vertices has at least 4 vertices of degree less than or equal to 5.This will also prove there is no 6-connected planar graph....
509
views
asked
Oct 8, 2017
Graph Theory
graph-theory
+
–
0
votes
1
answer
9
Self doubt--Byte Offset or Word Offset-Eg from Stallings
Here is a simple problem from Stallings.My confusion is with the offset bits in the address.If we are not mentioned anything about word addressing and byte addressing,what is the safest thing to assume? For example below exercise ... ?Hence it is like 2 bits for word addressing and 2 bits for internally selecting byte inside a word??
Here is a simple problem from Stallings.My confusion is with the offset bits in the address.If we are not mentioned anything about word addressing and byte addressing,wha...
1.0k
views
asked
Sep 27, 2017
CO and Architecture
co-and-architecture
+
–
1
votes
0
answers
10
Sheldon Ross - Probability (2nd chapter)
Poker dice is played by simultaneously rolling 5 dice.Show that (a) P{no two alike} = .0926; (b) P{one pair} = .4630; (c) P{two pair} = .2315; (d) P{three alike} = .1543; (e) P{full house} = .0386; (f) P{four alike} = ... are exchanged) * 5 * 4* 3 (because order matters of the outcomes of other non-pairs) this total divided by 6^5. Is my assumption true?
Poker dice is played by simultaneously rolling 5 dice.Show that(a) P{no two alike} = .0926;(b) P{one pair} = .4630;(c) P{two pair} = .2315;(d) P{three alike} = .1543;(e) ...
759
views
asked
Aug 5, 2017
Combinatory
probability
+
–
0
votes
1
answer
11
Reference books
Anyone have appeared in ISI mtech entrance before? Sample questions are really very challenging especially mathematics is at highly matured level.Any general idea what books to practice from?
Anyone have appeared in ISI mtech entrance before? Sample questions are really very challenging especially mathematics is at highly matured level.Any general idea what bo...
519
views
asked
Feb 14, 2017
0
votes
1
answer
12
GATE IT 2005
On a TCP connection, current congestion window size is Congestion Window = 4 KB. The window size advertised by the receiver is Advertise Window = 6 KB. The last byte sent by the sender is LastByteSent = 10240 and the last byte acknowledged by the receiver is ... ,this will be advertised again back to sender so min of 4096 and 2048 will be 2048.Please explain a bit also thanks...
On a TCP connection, current congestion window size is Congestion Window = 4 KB. The window size advertised by the receiver is Advertise Window = 6 KB. The last byte sent...
464
views
asked
Feb 3, 2017
Computer Networks
computer-networks
+
–
0
votes
0
answers
13
Gateforum
Concatenation of two lists need to be performed in O(1) time which one the following implementation of list could be used? 1) Single linked list 2) Doubly linked list 3)Circularly Double linked list 4)Array implementation of list Its a one mark question ... understanding the reasoning given,Answer given is 3. But that will require more pointers to change than just a single linked list?
Concatenation of two lists need to be performed in O(1) time which one the following implementation of list could be used?1) Single linked list2) Doubly linked list3)Circ...
294
views
asked
Jan 29, 2017
1
votes
0
answers
14
Gateforum
For the TCP timer management, for each connection TCP maintains RTT, the best estimate of current round trip time to the destination is to be determined. When a segment is sent, timer is started, both to see how long the acknowledgment takes and to ... managment? I seem to have missed this topic totally during my preparation.Also please explain the question in detail.Thanks in advance.
For the TCP timer management, for each connection TCP maintains RTT, the best estimate ofcurrent round trip time to the destination is to be determined. When a segment is...
317
views
asked
Jan 24, 2017
1
votes
2
answers
15
Rosen-Advance Counting Technique-26
Find a recurrence relation for the number of bit strings of length $n$ that contain the string $01.$ I am getting a recurrence like An = 2^(n-2) + 2A(n-1) - A (N-2) .Answer is not given for this question.Please help and explain your steps.
Find a recurrence relation for the number of bit strings of length $n$ that contain the string $01.$I am getting a recurrence like An = 2^(n-2) + 2A(n-1) - A (N-2) .Answe...
554
views
asked
Jan 16, 2017
Combinatory
kenneth-rosen
+
–
1
votes
1
answer
16
strategy
I think most of us have realised how strategy becomes important while answering questions.How time is so important in this exam.How are you people dividing 3 hrs of GATE exam in different sections(practice sets which each one of you have taken)?..How ... and read the question paper for 10 mins before starting? Do you keep separate time off for revising/re-checking numerical questions?
I think most of us have realised how strategy becomes important while answering questions.How time is so important in this exam.How are you people dividing 3 hrs of GATE ...
522
views
asked
Jan 8, 2017
GATE
exam-stress
+
–
0
votes
0
answers
17
Rosen-Counting
Once a computerworm infects a personal computer via an infected e-mail message, it sends a copy of itself to 100 email addresses it finds in the electronic message mailbox on this personal computer. What is the maximum number of different computers this one ... message to be forwarded five times? I wanted to verify this answer and method,there is no answer given for this question.
Once a computerworm infects a personal computer via aninfected e-mail message, it sends a copy of itself to 100 emailaddresses it finds in the electronic message mailboxo...
538
views
asked
Jan 6, 2017
Combinatory
discrete-mathematics
+
–
4
votes
0
answers
18
Stallings 4.23a
Consider a cache with a line size of 64 bytes. Assume that on average 30% of the lines in the cache are dirty. A word consists of 8 bytes. a. Assume there is a 3% miss rate (0.97 hit ratio). Compute the amount of main memory traffic, ... then calculate read hits,read miss,write throughs. I tried to search in solution manual but I am not understanding the solution given.Please help.
Consider a cache with a line size of 64 bytes. Assume that on average 30% of the linesin the cache are dirty. A word consists of 8 bytes.a. Assume there is a 3% miss rate...
810
views
asked
Jan 1, 2017
CO and Architecture
co-and-architecture
+
–
0
votes
0
answers
19
gateforum
Let's assume we have a DPDA and NPDA .Now if we have a language suppose L which of the above can we use to find if L is regular or not? And why? I found its DPDA BT not NPDA.but what is the intuitive notion.can we use both ways of DPDA I.e using final state or by using empty stack to decide if L is regular or not?
Let's assume we have a DPDA and NPDA .Now if we have a language suppose L which of the above can we use to find if L is regular or not? And why? I found its DPDA BT not N...
128
views
asked
Dec 16, 2016
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
