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
Recent activity by hs_yadav
1
answer
1
BARC/ISRO
solving ISRO previous year paper is good for BARC preparation ? ...Question level of isro and Barc are similar?
solving ISRO previous year paper is good for BARC preparation ? ...Question level of isro and Barc are similar?
1.2k
views
commented
Mar 26, 2018
1
answer
2
The throughput for this transfer if stop wait protocol with pipelining is used ________.
Consider Host-A want to transmit data of size 105000 B to Host-B. The communication between Host-A and Host-B is birectional with bandwidth of link between them is 100 Mbps in both direction. Data will be ... for this transfer if stop wait protocol with pipelining is used ________. (in KBps) Ans: 144.06 KBps
Consider Host-A want to transmit data of size 105000 B to Host-B. The communication between Host-A and Host-B is birectional with bandwidth of link between them is 100 Mb...
1.6k
views
commented
Jan 31, 2018
Computer Networks
made-easy-test-series
computer-networks
stop-and-wait
throughput
+
–
1
answer
3
Gateforum Test Series
Answer is 2^18 right?
Answer is 2^18 right?
194
views
answered
Jan 31, 2018
0
answers
4
MadeEasy Test Series: Algorithms - Time Complexity
PS : This question is similar to GATE2004-82, but different, so plz donot close it with duplicate Note, and help in answering
PS : This question is similar to GATE2004-82, but different, so plz donot close it with duplicate Note, and help in answering
462
views
commented
Jan 31, 2018
Algorithms
algorithms
time-complexity
made-easy-test-series
+
–
1
answer
5
Gate_2018_Mock_Paper
What is mean here by word size=4 Byte ? Please solve the below question
What is mean here by word size=4 Byte ?Please solve the below question
406
views
commented
Jan 31, 2018
CO and Architecture
co-and-architecture
+
–
3
answers
6
Probability-GFG
In a bunch of $13$ T-shirts only $1$ is of Medium size, which is correct fit for the searching person. Each time wrong size is picked, the person throws it away and pick the next T-shirt. What is the probability that the correct size T-shirt can be searched in $8^{th}$ attempt ? My attempt : $\frac{1}{13}$ where i went wrong ?
In a bunch of $13$ T-shirts only $1$ is of Medium size, which is correct fit for the searching person.Each time wrong size is picked, the person throws it away and pick t...
1.6k
views
commented
Jan 31, 2018
Probability
probability
+
–
1
answer
7
Regular Languages
Language {w | ww=www} is regular. How and what is this language?
Language {w | ww=www} is regular.How and what is this language?
313
views
commented
Jan 30, 2018
Theory of Computation
theory-of-computation
regular-language
+
–
1
answer
8
MadeEasy Test Series: CO & Architecture - Cache Memory
Assume that for a certain processor, main memory access time is 100 nanoseconds and cache memory access time is 20 nanoseconds. Suppose while running a program, it was observed that 25% of the processor’s requests result in a cache miss. What is the average access time in nanoseconds? A) 75 B) 80 C) 40 D) 45
Assume that for a certain processor, main memory access time is 100 nanoseconds and cache memory access time is 20 nanoseconds. Suppose while running a program, it was ob...
277
views
commented
Jan 30, 2018
CO and Architecture
made-easy-test-series
co-and-architecture
cache-memory
+
–
1
answer
9
Gate_2018
How to solve it ..find MST with detailed solution
How to solve it ..find MST with detailed solution
368
views
commented
Jan 30, 2018
Programming in C
data-structures
+
–
0
answers
10
Regular - Context Free?
Let L be a given context-free language over the alphabet {a, b}. Construct L1, L2 as follows. Let L1 = L − {xyx | x, y ∈ {a, b}∗}, and L2 = L·L. Then, (A) Both L1 and L2 are regular. B) Both L1 and L2 are context free but not necessarily regular. (C) L1 is regular and L2 is context free. (D) L1 and L2 both may not be context free
Let L be a given context-free language over the alphabet {a, b}. Construct L1, L2 as follows.Let L1 = L − {xyx | x, y ∈ {a, b}∗},and L2 = L·L. Then,(A) Both L1 and...
904
views
commented
Jan 30, 2018
Theory of Computation
theory-of-computation
context-free-language
regular-language
+
–
0
answers
11
#TOC Doubt
L = anbm / n,m>=1 What type pf Language is this? Also, please tell are n,m are independent or dependent i.e can we have like n=2 and m=3 or both n,m have to have same values!?
L = anbm / n,m>=1What type pf Language is this? Also, please tell are n,m are independent or dependent i.e can we have like n=2 and m=3 or both n,m have to have same valu...
203
views
commented
Jan 30, 2018
Theory of Computation
theory-of-computation
finite-automata
regular-expression
regular-grammar
+
–
1
answer
12
Turing Machine
...................................
...................................
1.1k
views
commented
Jan 30, 2018
Theory of Computation
theory-of-computation
turing-machine
+
–
0
answers
13
Ace Test Series: Computer Networks - Network Security
If p is any prime number such that a p-1 =r (mod p) and p=3 , a=6 then value of r is ________________
If p is any prime number such that a p-1 =r (mod p) and p=3 , a=6 then value of r is ________________
462
views
commented
Jan 30, 2018
Computer Networks
computer-networks
network-security
ace-test-series
+
–
2
answers
14
TEST SERIES
663
views
commented
Jan 30, 2018
1
answer
15
GENRAL
465
views
commented
Jan 30, 2018
0
answers
16
test series fragmentation que
633
views
commented
Jan 30, 2018
Computer Networks
fragmentation
computer-networks
+
–
0
answers
17
computer organization
Consider a 16 bit processor in which the following one address instruction is loaded into main memory : The effective address using PC-relative addressing mode when processor is executing an instruction at location 100 is __________ (Assume memory is of Byte addressable).
Consider a 16 bit processor in which the following one address instruction is loaded into main memory :The effective address using PC-relative addressing mode when proces...
1.8k
views
commented
Jan 30, 2018
3
answers
18
line efficiency
solve in detail...........
solve in detail...........
1.8k
views
commented
Jan 30, 2018
0
answers
19
computer organization
Consider the following statements about addressing mode : S1 : Computer using addressing modes to reduce number of bits in the addressing field of instruction. S2 : It specifies rules for modifying or interpreting address field of the instruction. S3 ... versatility to user by providing facilities as pointers to memory counter for loop control. Which of the following is true?
Consider the following statements about addressing mode :S1 : Computer using addressing modes to reduce number of bits in the addressing field of instruction.S2 : It spec...
950
views
commented
Jan 30, 2018
3
answers
20
Number of packets to be transmitted if every 6th is lost GBN?
Station A needs to send a message consisting of 15 packets to station B' using a sling window (window size 4) and go-back-N error control strategy. All packets are ready and immediately available for transmission. If every 6th packet that A' transmits ... A' will transmit for sending the message to B' ? (a) 29 (b) 33 (c) 27 (d) 25
Station A needs to send a message consisting of 15 packets to station ‘B’ using a sling window (window size 4) and go-back-N error control strategy. All packets are r...
7.3k
views
commented
Jan 30, 2018
Computer Networks
computer-networks
sliding-window
go-back-n
+
–
0
answers
21
B-tree
B tree has minimum space utilization equals to 66.6%. explain?
B tree has minimum space utilization equals to 66.6%.explain?
364
views
commented
Jan 30, 2018
Databases
databases
b-tree
indexing
+
–
1
answer
22
Gate_2018_Mock
My answer is 42 but given answer is 2018 please explain how ?
My answer is 42 but given answer is 2018 please explain how ?
572
views
commented
Jan 30, 2018
Programming in C
programming-in-c
programming
+
–
1
answer
23
Time Complexity
What is the time complexity of the following code? void foo(int n) { int s=0; for( i=1 ; i<=n ; i++ ) for( j=1 ; j<= i*i ; j++) if( j%i==0 ) { for( k=1 ; k<=j ; k++ ) s++; } }
What is the time complexity of the following code?void foo(int n) { int s=0; for( i=1 ; i<=n ; i++ ) for( j=1 ; j<= i*i ; j++) if( j%i==0 )...
2.5k
views
commented
Jan 30, 2018
Algorithms
time-complexity
algorithms
+
–
0
answers
24
MADE- EASY test series programming question
Answer is 57. Please help me to understand this question
Answer is 57. Please help me to understand this question
460
views
commented
Jan 29, 2018
0
answers
25
#test-series
Please explain why 127 is taken in numerator instead of 7?
Please explain why 127 is taken in numerator instead of 7?
240
views
commented
Jan 29, 2018
0
answers
26
ravula test
σ(x<y) ( π(x,y) R ) Is this type of query valid or should I have selection operator inside the and projection outside or both are same?
σ(x<y) ( π(x,y) R ) Is this type of query valid or should I have selection operator inside the and projection outside or both are same?
276
views
commented
Jan 29, 2018
1
answer
27
Draw DFA
create a dfa with odd occurrence of sub string "abb" .and short cut for finding no.of states
create a dfa with odd occurrence of sub string "abb" .and short cut for finding no.of states
808
views
commented
Jan 29, 2018
Theory of Computation
of
theory-of-computation
+
–
0
answers
28
Ip sunnetting
An organization is granted the block 130.56.0.0/16. The administrator wants to create 1024 subnets. The first and last allocatable addresses in subnet 32 is ?
An organization is granted the block 130.56.0.0/16. The administrator wants to create 1024 subnets. The first and last allocatable addresses in subnet 32 is ?
1.1k
views
commented
Jan 29, 2018
Computer Networks
subnetting
ip-addressing
computer-networks
+
–
0
answers
29
check this plz
consider -- static char *s[ ] = { "sumit" , " ankit " } ; char **ptr = { s , s+1 } ; char ***p = ptr ; ---------------------------- below code is same or not if static is not used , what is work performed by static here ?? char *s[ ] = { "sumit" , " ankit " } ; char **ptr = { s , s+1 } ; char ***p = ptr ;
consider static char *s[ ] = { "sumit" , " ankit " } ;char ptr = { s , s+1 } ;char *p = ptr ; below code is same or not if static is not used , what ...
228
views
commented
Jan 29, 2018
Programming in C
programming-in-c
+
–
1
answer
30
made easy test
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.e., timeout occur after transmission of 7th packet . The congestion window size at the end of 14 RTT is _________ (in MSS).
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...
583
views
commented
Jan 29, 2018
Computer Networks
computer-networks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register