Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
charul
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by charul
1
answer
1
gateforum test series
isn't the answer is directly speedup = number of stages * efficiency please confirm
isn't the answer is directly speedup = number of stages * efficiencyplease confirm
285
views
asked
Feb 1, 2018
CO and Architecture
gateforum-test-series
co-and-architecture
+
–
1
answer
2
self doubt
If packet with TTL value = 0 received at destination, then destination discard that packet or accept that packet.
If packet with TTL value = 0 received at destination, then destination discard that packet or accept that packet.
1.2k
views
answered
Jan 29, 2018
1
answer
3
MadeEasy Test Series 2018: Digital Logic - Digital Counter
answer given is 100KHz
answer given is 100KHz
747
views
asked
Jan 28, 2018
Digital Logic
digital-logic
digital-counter
made-easy-test-series
+
–
1
answer
4
MadeEasy Test Series 2018: Operating System - Process Syncronization
does this satisfy progress , if no then why?
does this satisfy progress , if no then why?
366
views
asked
Jan 24, 2018
Operating System
operating-system
process-synchronization
made-easy-test-series
+
–
1
answer
5
MadeEasy Test Series 2018: Computer Networks - Congestion Control
Consider the size of congestion window of a TCP connection be 36 KB when a timeout occurs. The round trip time of the connection is 200 μsec and the maximum segment size used is 2 KB. What is the time taken by the TCP connection to get back to 36 KB congestion window? A 2200 μsec B) 2400 μsec C) 2600 μsec D) 2800 μsec
Consider the size of congestion window of a TCP connection be 36 KB when a timeout occurs. The round trip time of the connection is 200 μsec and the maximum segment size...
1.4k
views
commented
Jan 24, 2018
Computer Networks
congestion-control
computer-networks
made-easy-test-series
+
–
2
answers
6
MadeEasy Test Series 2018: Digital Logic - Ieee Representation
Given the following binary number in 32-bit (single precision) IEEE-754 format: 10111110110000000000000000000000 The decimal value closest to this floating-point number is i'm getting : -0.75 answer given is : -0.375 please verify
Given the following binary number in 32-bit (single precision) IEEE-754 format: 10111110110000000000000000000000The decimal value closest to this...
800
views
commented
Jan 24, 2018
Digital Logic
digital-logic
ieee-representation
made-easy-test-series
+
–
1
answer
7
MadeEasy Test Series 2018: Mathematical Logic - First Order Logic
why option B is given wrong?
why option B is given wrong?
567
views
asked
Jan 23, 2018
Mathematical Logic
engineering-mathematics
discrete-mathematics
mathematical-logic
made-easy-test-series
+
–
0
answers
8
MadeEasy Test Series 2018: Computer Networks - Ipv4
Consider an IPv4 network, each host can generate packet with a rate of 500 packet per second. If each host in network is identified by unique identification number 48 bits, then the host wrap around time for generating packet will be? I'm not able to understand this question, can someone elaborate
Consider an IPv4 network, each host can generate packet with a rate of 500 packet per second. If each host in network is identified by unique identification number 48 bit...
429
views
asked
Jan 23, 2018
Computer Networks
made-easy-test-series
computer-networks
ip-addressing
+
–
1
answer
9
MadeEasy Test Series 2018: Programming & DS - Binary search Tree
Consider a Binary Search Tree is created using element 1 to n in following order: 3, 2, 1, 6, 5, 4, 9, 8, 7, 12, 11, 10, ....., n – 3, n – 4, n – 5, n – 2, n – 1, n What is the worst time complexity of searching a number in the Binary Search Tree?
Consider a Binary Search Tree is created using element 1 to n in following order: 3, 2, 1, 6, 5, 4, 9, 8, 7, 12, 11, 10, ....., n – 3, n – 4, n �...
510
views
commented
Jan 23, 2018
DS
data-structures
binary-search-tree
made-easy-test-series
+
–
7
answers
10
GATE CSE 2013 | Question: 52
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $\text{(T1)}$ ... is $64$ bytes. What is the size of a page in $\textsf{KB}$ in this computer? $2$ $4$ $8$ $16$
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three–level paged page table organization. The page table base register stores ...
37.1k
views
commented
Jan 21, 2018
Operating System
gatecse-2013
operating-system
virtual-memory
normal
+
–
0
answers
11
MadeEasy Test Series: Compiler Design - Code Optimization
I'm getting 8,10 but the answer given is 6,6
I'm getting 8,10but the answer given is 6,6
370
views
commented
Jan 21, 2018
Compiler Design
compiler-design
code-optimization
made-easy-test-series
+
–
1
answer
12
gate 2012 cs
Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to (A) 3 (B) 4 (C) 5 (D) 6
Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is ...
376
views
commented
Jan 20, 2018
Engineering Mathematics
engineering-mathematics
+
–
3
answers
13
GATE CSE 2012 | Question: 61
Wanted Temporary, Part-time persons for the post of Field Interviewer to conduct personal interviews to collect and collate economic data. Requirements: High School-pass, must be available for Day, Evening and Saturday work. ... inference from the above advertisement? Gender-discriminatory Xenophobic Not designed to make the post attractive Not gender-discriminatory
Wanted Temporary, Part-time persons for the post of Field Interviewer to conduct personal interviews to collect and collate economic data. Requirements: High School-pass,...
3.4k
views
commented
Jan 20, 2018
Verbal Aptitude
gatecse-2012
verbal-aptitude
verbal-reasoning
normal
+
–
1
answer
14
gateforum test series
answer given is : 0.153
answer given is : 0.153
377
views
asked
Jan 19, 2018
Probability
gateforum-test-series
probability
+
–
0
answers
15
gate forum test series
408
views
commented
Jan 19, 2018
Databases
databases
+
–
0
answers
16
gate forum test series
I'm getting 9.8 Bytes in such question can we answer in float, as utilization is given not its range?
I'm getting 9.8 Bytesin such question can we answer in float, as utilization is given not its range?
161
views
asked
Jan 19, 2018
Computer Networks
computer-networks
+
–
0
answers
17
gate forum test series
Answer given is : B according to me it should be D please verify
Answer given is : Baccording to me it should be Dplease verify
182
views
asked
Jan 19, 2018
Computer Networks
computer-networks
+
–
0
answers
18
gate forum test series
given answer is won't there be an edge b/w (E and =) and (= and the uppermost node)
given answer is won't there be an edge b/w (E and =) and (= and the uppermost node)
192
views
asked
Jan 19, 2018
Compiler Design
compiler-design
+
–
1
answer
19
gate forum test series
How to make sure that the answer we got is the minimum one in such questions? answer for this question : 6 (3 or gate , 3 not gate)
How to make sure that the answer we got is the minimum one in such questions?answer for this question : 6 (3 or gate , 3 not gate)
370
views
asked
Jan 19, 2018
Digital Logic
digital-logic
+
–
1
answer
20
MadeEay Test Series 2018: Databases - Relational Algebra
here for 1st relation algebra operation the join operation is given without condition , will it be considered as natural join or cartesian product?
here for 1st relation algebra operation the join operation is given without condition , will it be considered as natural join or cartesian product?
401
views
asked
Jan 16, 2018
Databases
databases
relational-algebra
made-easy-test-series
madeeasy-testseries-2018
+
–
1
answer
21
MadeEasy Test Series 2018: CO & Architecture - Pipelining
for Instructions results in both control and data dependency, what will be the penalty 3 or 5, please explain.
for Instructions results in both control and data dependency, what will be the penalty 3 or 5, please explain.
254
views
asked
Jan 15, 2018
CO and Architecture
made-easy-test-series
co-and-architecture
pipelining
madeeasy-testseries-2018
+
–
0
answers
22
MadeEasy Test Series 2018: Computer Networks - Congestion Control
619
views
commented
Jan 15, 2018
Computer Networks
computer-networks
congestion-control
madeeasy-testseries-2018
made-easy-test-series
+
–
0
answers
23
MadeEasy Test Series 2018: Digital Logic - Ieee Representation
the explanation given is I'm not able to get this concept.
the explanation given is I'm not able to get this concept.
644
views
commented
Jan 13, 2018
Digital Logic
digital-logic
ieee-representation
made-easy-test-series
madeeasy-testseries-2018
+
–
0
answers
24
MadeEasy Test Series 2018: Algorithms - Time Complexity
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers? a) O(logn) b) O(nlogn) c) O(n^2) d) O(n^2logn)
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers?a) O(logn)b) O(nlogn)c) O(n^2)d) O(n^2logn...
694
views
commented
Jan 13, 2018
Algorithms
algorithms
time-complexity
made-easy-test-series
madeeasy-testseries-2018
+
–
1
answer
25
MadeEasy Test Series 2018: Computer Networks - Network Flow
my approach is 1 <= Td(x)/(Td+2Tp), x is size of SW then the answer wil be - ceil(log x) Is my approach is correct, if not then how to solve this?
my approach is 1 <= Td(x)/(Td+2Tp), x is size of SWthen the answer wil be - ceil(log x)Is my approach is correct, if not then how to solve this?
325
views
asked
Jan 12, 2018
Computer Networks
computer-networks
network-flow
madeeasy-testseries-2018
made-easy-test-series
+
–
1
answer
26
gateforum test series
Given a finite automata M, is it the minimum state FA accepting L(M) is this problem decidable, if yes then why?
Given a finite automata M, is it the minimum state FA accepting L(M)is this problem decidable, if yes then why?
225
views
asked
Jan 11, 2018
Theory of Computation
gateforum-test-series
theory-of-computation
+
–
1
answer
27
MadeEasy Test Series 2018: Compiler Design - Grammar
I'm getting 4, can someone verify
I'm getting 4, can someone verify
617
views
commented
Jan 10, 2018
Compiler Design
compiler-design
grammar
made-easy-test-series
madeeasy-testseries-2018
+
–
2
answers
28
MadeEasy Test Series 2018: Computer Networks - Lan Technologies
Here i'm not able to get after how much time X and Y will face first collision
Here i'm not able to get after how much time X and Y will face first collision
907
views
commented
Jan 9, 2018
Computer Networks
computer-networks
lan-technologies
made-easy-test-series
madeeasy-testseries-2018
+
–
0
answers
29
gate forum test series
267
views
commented
Jan 8, 2018
Compiler Design
compiler-design
+
–
1
answer
30
gate forum test series
How to solve this question?
How to solve this question?
262
views
asked
Jan 8, 2018
Graph Theory
graph-theory
discrete-mathematics
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register