Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
arya_stark
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by arya_stark
0
votes
1
MadeEasy Workbook: Operating System - Resource Allocation
931
views
answered
Nov 10, 2019
Operating System
operating-system
resource-allocation
made-easy-booklet
+
–
1
votes
2
Sliding Window protocol.
There are two stations A and B connected by a $512 * 10^3$ bps network using a sliding window protocol. The speed of the signal is $10^8$ meter/sec and the distance between two stations is $45,000$ km. If the packet size is $256$ B, then what will be the optimal window size(in packets)?
There are two stations A and B connected by a $512 * 10^3$ bps network using a sliding window protocol. The speed of the signal is $10^8$ meter/sec and the distance betwe...
754
views
answered
Jan 20, 2019
Computer Networks
computer-networks
sliding-window
+
–
2
votes
3
What is the complexity of T(n) =T(sqrt(n)) +loglogn
3.2k
views
answered
Jan 20, 2019
Algorithms
algorithms
time-complexity
recurrence-relation
+
–
0
votes
4
I-gate
How many 1*2 decoders are required to construct a 4*16 decoder?
How many 1*2 decoders are required to construct a 4*16 decoder?
316
views
answered
Jan 11, 2019
2
votes
5
DRDO 2009
The number of 2-to-4 line decoders with enable input needed to construct a 4-to-16 line decoder are?
The number of 2-to-4 line decoders with enable input needed to construct a 4-to-16 line decoder are?
1.8k
views
answered
Jan 4, 2019
Digital Logic
decoder
combinational-circuit
+
–
2
votes
6
Banker's algorithm
Which option is correct?
Which option is correct?
2.1k
views
answered
Jan 4, 2019
3
votes
7
Gateforum Test Series: Computer Networks - Sliding Window
Suppose you are designing a sliding window protocol for a $1Mbps$ point to point link which has one way latency of $1.25s$. Assuming that each frame carries $1kB$ of data, determine the minimum number of bits required for the sequence number. Answer provided - $9$ bits.
Suppose you are designing a sliding window protocol for a $1Mbps$ point to point link which has one way latency of $1.25s$. Assuming that each frame carries $1kB$ of data...
523
views
answered
Dec 24, 2018
Computer Networks
gateforum-test-series
computer-networks
sliding-window
+
–
2
votes
8
home work
In a token ring, if the propagation delay in a ring is equal to the transmission delay, then what is the maximum efficiency? Assuming that only one station is in token ring.
In a token ring, if the propagation delay in a ring is equal to the transmission delay, then what is the maximum efficiency? Assuming that only one station is in token ri...
982
views
answered
Nov 30, 2018
Computer Networks
computer-networks
token-ring
+
–
3
votes
9
home work
A broadcast channel has 10 nodes and total capacity of 16Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of 100 µseconds to poll the next node. Whenever a node is polled, it is allowed to transmit a maximum of 1500 Bytes. The maximum throughput of broadcast channel is: 8 Mbps 14 Mbps 100/11Mbps 750/85 Mbps
A broadcast channel has 10 nodes and total capacity of 16Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of 100 µsec...
621
views
answered
Nov 30, 2018
Computer Networks
computer-networks
csma-cd
token-ring
+
–
0
votes
10
home work
Consider a 8Mbps token LAN with a ring latency of 256µsec. A host need to transmit seizes the token, and then it sends a frame of 1024 bytes removes the frame after it has circulated all around the ring and finally releases the token. This process is repeated for every frame. Assuming that only a single host wishes to transmit, then the effective data rate (in Mbps) is? 4.53 5.36 6.7 9.4
Consider a 8Mbps token LAN with a ring latency of 256µsec. A host need to transmit seizes the token, and then it sends a frame of 1024 bytes removes the frame after it h...
3.1k
views
answered
Nov 30, 2018
Computer Networks
computer-networks
token-ring
csma-cd
+
–
0
votes
11
home work
A system uses the Sliding Window Protocol is having a bandwidth of 10Mbps with a window size of 100. What is the size of data if the distance between the sender and receiver is 72000km and the propagation speed is 3 x 10^8 m/sec? Given utilization is 0.5
A system uses the Sliding Window Protocol is having a bandwidth of 10Mbps with a window size of 100. What is the size of data if the distance between the sender and recei...
2.7k
views
answered
Nov 29, 2018
Computer Networks
computer-networks
sliding-window
+
–
2
votes
12
ME Compiler Design
Consider the following transition rules: A->BC C->+BC|A|$\epsilon$ B->DB{print '+'}|$\epsilon$ D->(A)|id{print num.value} On input '5+67' this translation scheme prints A 5+67+ B 5+6+7+ C 5+6+7 D 5+67++
Consider the following transition rules:A->BCC->+BC|A|$\epsilon$B->DB{print '+'}|$\epsilon$D->(A)|id{print num.value}On input '5+67' this translation scheme printsA 5+67+...
1.2k
views
answered
Nov 27, 2018
Compiler Design
syntax-directed-translation
compiler-design
+
–
1
votes
13
MadeEasy Workbook: Compiler Design - Parsing
WHICH OF THE FOLLOWING STATEMENTS ARE TRUE? a) S1 & S3 b) S2 & S4 c) S2 & S3 d) None of these Answer is option a. can anyone tell me how option a is correct?
WHICH OF THE FOLLOWING STATEMENTS ARE TRUE?a) S1 & S3b) S2 & S4c) S2 & S3d) None of theseAnswer is option a.can anyone tell me how option a is correct?
333
views
answered
Nov 26, 2018
Compiler Design
compiler-design
parsing
made-easy-booklet
+
–
0
votes
14
Transport layer
296
views
answered
Nov 23, 2018
0
votes
15
Inverse of boolean function
What is inverse of boolean function please explain??
What is inverse of boolean function please explain??
2.1k
views
answered
Nov 20, 2018
3
votes
16
Unix Inode file system
Consider a file system that uses UNIX like inodes to keep track of the sectors allocated to files. Assume that disk blocks are 1 KB in size, disk block addresses are 32 bits and the inode has space for 8 direct blocks, 1 singly indirect blocks, 1 doubly ... B) 234 bytes (C) 210 bytes (D) 242 byte Is there asked about total size of file system? whats difference between them?
Consider a file system that uses UNIX like inodes to keep track of the sectors allocated to files. Assume that disk blocks are 1 KB in size, disk block addresses are 32 b...
9.9k
views
answered
Oct 19, 2018
Operating System
operating-system
inode
unix
+
–
1
votes
17
Gateforum Test Series: Compiler Design - Variable Scope
517
views
answered
Oct 19, 2018
Compiler Design
compiler-design
gateforum-test-series
variable-scope
+
–
1
votes
18
self doubt
I have a doubt regarding the no of context switches needed in any scheduling algorithm. assume we have 5 processes, which require 4, 6, 7,5 and 1 time units and arrive at times 0, 1, 2,3, and 5 respectively. How many context switches are needed if the ... 4 I wanted to ask how SRTF work internally (as i know it will check firstly for next process arrival time then it will go ahed)
I have a doubt regarding the no of context switches needed in any scheduling algorithm. assume we have 5 processes, which require 4, 6, 7,5 and 1 time units and arrive at...
880
views
answered
Oct 13, 2018
Operating System
process-scheduling
+
–
0
votes
19
Test by Bikram | Theory of Computation | Test 2 | Question: 7
Consider the following regular languages: $L_1$: Languages that accept strings over $\Sigma = \{a, b\}$, such that length of string is greater than $1$, but multiple of $3$. $L_2$: Languages that accept strings over $\Sigma = \{a, b\}$, such ... ? $s_1 = s_2 < s_3$ $s_1 = s_3 < s_2$ $s_1 < s_2 < s_3$ $s_1 < s_3 < s_2$
Consider the following regular languages:$L_1$: Languages that accept strings over $\Sigma = \{a, b\}$, such that length of string is greater than $1$, but multiple of $3...
590
views
answered
Oct 13, 2018
Theory of Computation
tbb-toc-2
theory-of-computation
minimal-state-automata
+
–
0
votes
20
Prim Algorithm
What is the time complexity of Prim algorithm without using min heap?
What is the time complexity of Prim algorithm without using min heap?
1.1k
views
answered
Oct 12, 2018
Algorithms
algorithms
graph-algorithm
prims-algorithm
time-complexity
+
–
0
votes
21
self doubt
Best and Worst case input for: 1. Selection Sort 2. Insertion Sort 3. Merge Sort 4. Quick Sort 5. Bucket Sort 6. Counting Sort 7. Bubble Sort
Best and Worst case input for:1. Selection Sort2. Insertion Sort3. Merge Sort4. Quick Sort5. Bucket Sort6. Counting Sort7. Bubble Sort
240
views
answered
Aug 17, 2018
Algorithms
algorithms
sorting
time-complexity
+
–
1
votes
22
ME test series
how to do these kinds of problems?
how to do these kinds of problems?
433
views
answered
Aug 16, 2018
Algorithms
made-easy-test-series
+
–
1
votes
23
doubt in logarithm
can you please explain how 1-(1/2)^ln(n) becomes (n-1)/n ?
can you please explain how 1-(1/2)^ln(n) becomes (n-1)/n ?
392
views
answered
Aug 16, 2018
Algorithms
algorithms
time-complexity
test-series
+
–
0
votes
24
Pointer c Programming doubt
#include <stdio.h> void swap(int *p, int *q) { int *t; *t=*p; *p=*q; *q=*t; printf("a=%d b=%d\n",*p,*q); } int main(void) { int a=5; int b=10; swap(&a,&b); printf("a=%d b=%d",a,b); return 0; } this program working ... n",*p,*q); } int main(void) { int a=5; int b=10; swap(&a,&b); printf("a=%d b=%d",a,b); return 0; }
#include <stdio.h void swap(int *p, int *q) { int *t; *t=*p; *p=*q; *q=*t; printf("a=%d b=%d\n",*p,*q); } int main(void) { int a=5; int b=10; swap(&a,&b); printf("a=...
1.4k
views
answered
Jul 5, 2018
Programming in C
programming-in-c
output
pointers
+
–
1
votes
25
Given a hash table with n keys and m slots, with the simple uniform hashing assumption.....
Given a hash table with n keys and m slots, with the simple uniform hashing assumption (each key is equally likely to be hashed into each slot). Collisions are resolved by chaining. (a) What is the probability ... slot ends up empty? (b) What is the expected number of slots that end up not being empty?
Given a hash table with n keys and m slots, with the simple uniform hashing assumption (each key is equally likely to be hashed into each slot). Collisions are resolved b...
5.7k
views
answered
Jul 4, 2018
Programming in C
hashing
data-structures
chaining
+
–
0
votes
26
Yashavant kanetkar understanding pointer in C, Chepter 1, Question 13.
13. What does the error "Null Pointer Assignment" mean and what causes this error?
13. What does the error "Null Pointer Assignment" mean and what causes this error?
501
views
answered
Jul 3, 2018
2
votes
27
Yashavant kanetkar understanding pointer in C, Chepter 1, Question 13.
13. What does the error "Null Pointer Assignment" mean and what causes this error?
13. What does the error "Null Pointer Assignment" mean and what causes this error?
501
views
answered
Jul 3, 2018
0
votes
28
c programming
#include <stdio.h> void f(char**); int main() { char *argv[] = { "ab", "cd", "ef", "gh", "ij", "kl" }; f(argv); return 0; } void f(char **p) { char *t; t = (p += sizeof(int))[-1]; printf("%s\n", t); } can anyone explain this program?
#include <stdio.h>void f(char );int main(){char *argv[] = { "ab", "cd", "ef", "gh", "ij", "kl" };f(argv);return 0;}void f(char p){char *t;t = (p += sizeof(int))[-1];prin...
766
views
answered
Jul 3, 2018
0
votes
29
gfg C pointer Basic
Please explain solution in brief . #include <stdio.h> void f(char**); int main() { char *argv[] = { "ab", "cd", "ef", "gh", "ij", "kl" }; f(argv); return 0; } void f(char **p) { char *t; t = (p += sizeof(int))[-1]; printf("%s\n", t); } A] ab B] cd C] ef D] gh
Please explain solution in brief . #include <stdio.h void f(char ); int main() { char *argv[] = { "ab", "cd", "ef", "gh", "ij", "kl" }; f(argv); return 0; } void f(char ...
554
views
answered
Jul 3, 2018
Programming in C
programming-in-c
+
–
0
votes
30
made easy
What is the output???
What is the output???
1.4k
views
answered
Jul 3, 2018
Programming in C
programming-in-c
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register