Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Markzuck
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Markzuck
1
votes
1
answer
1
Self doubt- TCP congestion control
When during TCP congestion control, timeout occurs in 5th transition, then shall those packets be considered as received or shall be resent? Asking for if question asks for number of transmission to send given number of packets using TCP congestion slow start phase.
When during TCP congestion control, timeout occurs in 5th transition, then shall those packets be considered as received or shall be resent?Asking for if question asks fo...
435
views
asked
Feb 1, 2019
Computer Networks
tcp
+
–
2
votes
0
answers
2
Madeeasy Max Heap 2019
Please explain the logic behind this shortcut and when to be used?
Please explain the logic behind this shortcut and when to be used?
1.2k
views
asked
Jan 13, 2019
Algorithms
binary-heap
data-structures
algorithms
made-easy-test-series
+
–
0
votes
0
answers
3
Composition of a relation- Madeeasy 2019
How to take composition of a Relation? here used concept of function but when to go with the transitivity rule concept as mentioned below? Please clarify in general when to use which method
How to take composition of a Relation? here used concept of function but when to go with the transitivity rule concept as mentioned below?Please clarify in general when t...
3.2k
views
asked
Jan 10, 2019
Mathematical Logic
discrete-mathematics
relations
functions
set-theory&algebra
+
–
0
votes
1
answer
4
MadeEasy Test Series 2019: Programming & DS - Programming In C
Please explained detialed execution of this code, I am not getting how int stored in char, like we can interchange using ASCII but still cant store right?
Please explained detialed execution of this code, I am not getting how int stored in char, like we can interchange using ASCII but still cant store right?
496
views
asked
Jan 10, 2019
Programming in C
made-easy-test-series
programming-in-c
programming
+
–
2
votes
1
answer
5
MadeEasy Test Series 2019: Computer Networks - Congestion Control
here TOTAL 2000 segments need to be sent, and after x RTT, it will send 2001 segments but for total we shall take count of addition of all the previous also na?
here TOTAL 2000 segments need to be sent, and after x RTT, it will send 2001 segments but for total we shall take count of addition of all the previous also na?
910
views
asked
Jan 10, 2019
Computer Networks
computer-networks
congestion-control
tcp
transport-layer
made-easy-test-series
+
–
1
votes
4
answers
6
Madeeasy- Types of Dependencies
Please clarify along with the names.
Please clarify along with the names.
1.3k
views
asked
Jan 9, 2019
CO and Architecture
co-and-architecture
data-dependency
data-hazards
pipelining
databases
+
–
1
votes
1
answer
7
Hamming Error Correction- Madeeasy 2019
someone please post detailed solution pic for this procedure- I am getting bits 1 and 2 as errorneous.
someone please post detailed solution pic for this procedure- I am getting bits 1 and 2 as errorneous.
1.5k
views
asked
Jan 9, 2019
Computer Networks
computer-networks
distance
hamming
hamming-code
+
–
1
votes
1
answer
8
MadeEasy Test Series: Complier Design - Intermediate Code
someone please share detailed rules for this along with solution- would be of great help. and we usually dont take start and end state- arent they extra here? coz count comes different
someone please share detailed rules for this along with solution- would be of great help.and we usually dont take start and end state- arent they extra here? coz count co...
743
views
asked
Jan 8, 2019
Compiler Design
compiler-design
made-easy-test-series
intermediate-code
+
–
2
votes
2
answers
9
MadeEasy Test Series 2019: Computer Networls - Congestion Control
Please help, I am getting total number of transmission to get BACK TO 38 as 14 and NOT 15. after 14th, it would have became 38, so no need to consider 15th segment right?
Please help, I am getting total number of transmission to get BACK TO 38 as 14 and NOT 15.after 14th, it would have became 38, so no need to consider 15th segment right?
952
views
asked
Jan 7, 2019
Computer Networks
computer-networks
congestion-control
made-easy-test-series
tcp
transport-layer
+
–
1
votes
1
answer
10
MadeEasy Test Series: Computer Networks - IP Packet
Fragmentation is only done at the DATA part of the IP layer and NOT the IP header right? in above, 1st should be 920 instead of 940 as 20B of IP header shall not be counted in fragmentation right? please help with a detailed solution.
Fragmentation is only done at the DATA part of the IP layer and NOT the IP header right?in above, 1st should be 920 instead of 940 as 20B of IP header shall not be counte...
660
views
asked
Jan 7, 2019
Computer Networks
computer-networks
made-easy-test-series
tcp
fragmentation
+
–
1
votes
1
answer
11
MadeEasy Test Series: Algorithms - Time Complexity
Please show the ideal way to deal with such comparisons as I am getting g>=f IN genral what logic shall be followed to analyse such complex comparions?
Please show the ideal way to deal with such comparisons as I am getting g>=f IN genral what logic shall be followed to analyse such complex comparions?
492
views
asked
Jan 6, 2019
Algorithms
algorithms
asymptotic-notation
made-easy-test-series
time-complexity
+
–
0
votes
0
answers
12
MadeEasy Test Series 2019: Programming & DS - Programming In C
Please explain the solution, whats the actual logic in questions of Preprocessor codes?
Please explain the solution, whats the actual logic in questions of Preprocessor codes?
367
views
asked
Dec 30, 2018
Programming in C
made-easy-test-series
algorithms
programming-in-c
+
–
1
votes
0
answers
13
BFS and DFS - types of edges
Can someone please explain what are the types of edges possible in BFS and DFS for DIRECTED as well as UNDIRECTED graphs? Individual meaning of BACK, FRONT and CROSS edges is clear, but can’t decide which are present and which are not for Traversals. an example would be of great help or any specific reference on this.
Can someone please explain what are the types of edges possible in BFS and DFS for DIRECTED as well as UNDIRECTED graphs?Individual meaning of BACK, FRONT and CROSS edges...
1.4k
views
asked
Dec 30, 2018
Algorithms
depth-first-search
breadth-first-search
algorithms
graph-algorithm
+
–
0
votes
1
answer
14
MadeEasy Test Series 2019: Algorithms - Time complexity
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c, like cant we take both the recurrance call as combined as both have same parameter? and if not, then how to solve such?
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c,like cant we take both the recurrance call as combined as both have same parameter?and if not, then ...
775
views
asked
Dec 29, 2018
Algorithms
time-complexity
algorithms
made-easy-test-series
asymptotic-notation
+
–
0
votes
1
answer
15
MADEEASY- CO - SET Associative mapping
Assume a new cache design is proposed by a student. But he later discovered design has too many conflict misses and to resolve this issue he increases the associativity in the design. Which of the following implication will occur in the ... bit increases C. No implications in the design what does INDEX bits refers to in set associative and associative mapping?
Assume a new cache design is proposed by a student. But he later discovered design has too many conflict misses and to resolve this issue he increases the associativity i...
757
views
asked
Dec 29, 2018
CO and Architecture
cache-memory
co-and-architecture
made-easy-booklet
+
–
0
votes
0
answers
16
MadeEasy Test Series: Computer Networks - Token Bucket
1.0k
views
asked
Dec 27, 2018
Computer Networks
computer-networks
token-bucket
made-easy-test-series
+
–
1
votes
0
answers
17
MadeEasy Test Series: Computer Networks - Congestion Control
I am getting answer as 9, someone please post their solution stepwise, that would be of great help to identify the mistake.
I am getting answer as 9, someone please post their solution stepwise, that would be of great help to identify the mistake.
772
views
asked
Dec 26, 2018
Computer Networks
computer-networks
congestion-control
made-easy-test-series
+
–
0
votes
0
answers
18
Madeeasy DBMS- 2PL-2019- what is to be checked to ensure allowance under 2PL?
What exactly is to be checked for test for 2PL? is a schedule being SERIALIZABLE sufficent to declare its allowed under 2PL?
What exactly is to be checked for test for 2PL?is a schedule being SERIALIZABLE sufficent to declare its allowed under 2PL?
295
views
asked
Dec 25, 2018
0
votes
2
answers
19
MadeEasy Test Series: CO & Architecture - Pipelining
here why to take stall at the highlighted cell as its OPERAND FORWARDING and unless mentioned its EX-EX and its being followed without stall also, please clarify how to understand where Operand Forwarding is to be applied in such generalized cases., Thanks in advance :)
here why to take stall at the highlighted cell as its OPERAND FORWARDING and unless mentioned its EX-EX and its being followed without stall also, please clarify how to u...
951
views
asked
Dec 25, 2018
CO and Architecture
co-and-architecture
pipelining
made-easy-test-series
operand-forwarding
+
–
5
votes
1
answer
20
MadeEasy Subject Test 2019: Programming & DS - Programming In C
someone please explain this: how does a+1 differs from &a+1 in above code? detailed explanation would be of great help as they incremented &a by 6 and NOT 1
someone please explain this:how does a+1 differs from &a+1 in above code?detailed explanation would be of great help as they incremented &a by 6 and NOT 1
1.2k
views
asked
Dec 22, 2018
Programming in C
made-easy-test-series
programming-in-c
array
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register