Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged made-easy-test-series
3
votes
2
answers
571
MadeEasy Test Series: Computer Networks - Flow Control Methods
Assume 2 computers are connected via a network. The network uses Go-Back 7 sliding window protocol for maintaining flow control. It is observed that every 5th packet that has been sent through the network is lost. ... number of extra packets that has to be resent for transmitting 10 such packet through the network? With explanation.
Assume 2 computers are connected via a network. The network uses Go-Back 7 sliding window protocol for maintaining flow control. It is observed that every 5th packet that...
Subham Nagar
2.6k
views
Subham Nagar
asked
Dec 17, 2018
Computer Networks
made-easy-test-series
computer-networks
flow-control-methods
go-back-n
+
–
1
votes
2
answers
572
MadeEasy Test Series: CO & Architecture - Pipelining
A system employs $10$ stage instruction pipeline in which $5$% instruction results in data dependency, $10$% instruction results in control dependency, $2$% instructions results in structural dependency. $10$% instructions are exposed ... dependency are $3$ clocks and $2$ clocks respectively. The average instruction time is _______ [in cycles]
A system employs $10$ stage instruction pipeline in which $5$% instruction results in data dependency, $10$% instruction results in control dependency, $2$% instructions ...
zeeshanmohnavi
2.4k
views
zeeshanmohnavi
asked
Dec 16, 2018
CO and Architecture
made-easy-test-series
co-and-architecture
pipelining
+
–
0
votes
1
answer
573
made easy adv 2018
The median of n elements can be found in O(logn) time.which one of the following is correct about worst case time complexity of quick sort,if always median is selected as pivot element? a)O(logn) b)O(n) c)O(nlogn) d)O(nloglogn)
The median of n elements can be found in O(logn) time.which one of the following is correct about worst case time complexity of quick sort,if always median is selected a...
Gate Fever
1.2k
views
Gate Fever
asked
Dec 16, 2018
Algorithms
algorithms
time-complexity
quick-sort
made-easy-test-series
+
–
7
votes
2
answers
574
MadeEasy Test Series 2019: Combinatory- Generating Functions
Let $M(x) = \frac{x^{2018}}{(1-x)^{2019}}$ we define $M(x) = \sum_{r=0}^{\infty}a_{r}x^{r}$ ,then $a_{r}$ is equal to- $A)\binom{r}{2019}$ $B)\binom{r}{r+2018}$ $C)\binom{r}{2019-r}$ $D)\binom{r}{r-2018}$
Let $M(x) = \frac{x^{2018}}{(1-x)^{2019}}$we define $M(x) = \sum_{r=0}^{\infty}a_{r}x^{r}$ ,then $a_{r}$ is equal to-$A)\binom{r}{2019}$$B)\binom{r}{r+2018}$$C)\binom{r}{...
register_user_19
973
views
register_user_19
asked
Dec 15, 2018
Combinatory
discrete-mathematics
generating-functions
made-easy-test-series
+
–
2
votes
1
answer
575
MadeEasy Test Series: Algorithms - Sorting
An array of size n is known to be sorted except for the 1st k elements and the last k elements, where k is a constant. which of the following algorithm is the best choice for sorting the array A? Quick Sort or Insertion Sort? given answer is the insertion ... k), and it will take O(klogk) in average case and O(k^2) in the worst case. what's wrong in that?
An array of size n is known to be sorted except for the 1st k elements and the last k elements, where k is a constant. which of the following algorithm is the best choice...
aambazinga
853
views
aambazinga
asked
Dec 15, 2018
Algorithms
made-easy-test-series
algorithms
sorting
+
–
2
votes
2
answers
576
MadeEasy Test Series 2019: Computer Networks - Sliding Window
Assume 2 computers are connected via a network. The network uses GB-7 sliding window protocol for flow control.It is observed that every 5th packet that has been sent is lost. The number of extra packets needs to resend Number of total packets transmitted by sender for sending 10 packets .
Assume 2 computers are connected via a network. The network uses GB-7 sliding window protocol for flow control.It is observed that every 5th packet that has been sent is ...
jatin khachane 1
3.9k
views
jatin khachane 1
asked
Dec 15, 2018
Computer Networks
made-easy-test-series
computer-networks
go
go-back-n
+
–
0
votes
2
answers
577
MadeEasy Test Series: CO & Architecture - Cache Memory
consider a CPU contains 2000 instructions, there are 80 misses in L1 cache and 40 misses in the L2 cache. Assume miss penalty from the L2 cache to memory is 200 clock cycles, the hit time of L2 cache is 30 clock cycles, the hit ... and there are 1.8 memory references per instruction, then average stall per instruction is 6.36 7.92 9.62 9.35
consider a CPU contains 2000 instructions, there are 80 misses in L1 cache and 40 misses in the L2 cache. Assume miss penalty from the L2 cache to memory is 200 clock cyc...
scarz
828
views
scarz
asked
Dec 15, 2018
CO and Architecture
made-easy-test-series
co-and-architecture
cache-memory
+
–
0
votes
0
answers
578
MadeEasy Subject Test 2019: Digital Logic - Flip Flop
The input to the LED is connected to the output $\overline{Q}$ of the master slave flip-flop. The duration for which the LED will be ON in the time duration of T is _____ sec.
The input to the LED is connected to the output $\overline{Q}$ of the master slave flip-flop. The duration for which the LED will be ON in the time duration of T is _____...
Mk Utkarsh
855
views
Mk Utkarsh
asked
Dec 14, 2018
Digital Logic
made-easy-test-series
digital-logic
flip-flop
+
–
0
votes
1
answer
579
Made easy test series
What we do if graph is complete with 5 vertices and weight are 1,2,3,4,5,6,7,8,9 and 10. than find maximum possible weight that a minimum weight spanning tree of G have..???
What we do if graph is complete with 5 vertices and weight are1,2,3,4,5,6,7,8,9 and 10.than find maximum possible weight that a minimum weight spanning tree of G have..??...
Vikas123
1.6k
views
Vikas123
asked
Dec 14, 2018
Algorithms
minimum-spanning-tree
numerical-answers
made-easy-test-series
+
–
3
votes
2
answers
580
MadeEasy Subject Test 2019: Computer Networks - Subnetting
In the network 143.128.67.235 / 20, it x represent the decimal value of 3rd octet and y represent the decimal value of 4th octet of last IP address assigned to any host, then the value of x*y is
In the network 143.128.67.235 / 20, it x represent the decimal value of 3rd octet and y represent the decimal value of 4th octet of last IP address assigned to any host, ...
scarz
1.1k
views
scarz
asked
Dec 13, 2018
Computer Networks
made-easy-test-series
computer-networks
subnetting
+
–
2
votes
1
answer
581
MadeEasy Subject Test 2019: Operating System - Virtual Memory
jatin khachane 1
484
views
jatin khachane 1
asked
Dec 13, 2018
Operating System
made-easy-test-series
operating-system
virtual-memory
paging
page-fault
+
–
1
votes
2
answers
582
MadeEasy Subject Test 2019: Operating System - Disk Scheduling
I got LOOK ==> 260 CSCAN ==> 383
I got LOOK == 260CSCAN == 383
jatin khachane 1
1.2k
views
jatin khachane 1
asked
Dec 13, 2018
Operating System
made-easy-test-series
operating-system
disk-scheduling
+
–
0
votes
1
answer
583
MadeEasy Subject Test 2019: Operating System - Translation Lookaside Buffer
A TLB is a hardware device used for speeding up the conversation from virtual address to physical address. Consider a memory management unit where a memory reference takes 500 nanoseconds; TLB (Translation Look aside Buffer) reference ... EMAT using TLB ==> 640ns EMAT wthout TLB ==> 1000ns how to calculate speed Up.?
A TLB is a hardware device used for speeding up the conversation from virtual address to physical address. Consider a memory management unit where a memory reference take...
jatin khachane 1
883
views
jatin khachane 1
asked
Dec 13, 2018
Operating System
made-easy-test-series
operating-system
translation-lookaside-buffer
+
–
3
votes
3
answers
584
MadeEasy Subject Test 2019: Theory Of Computation - Decidability
Consider <M> be the encoding of Turing Machine as string over alphabet $\Sigma$ = {0,1}.Consider L= { <M>| M is TM that halt on all input and L(M) = L` for some undecidable language L` . Then L is Decidable and Recursive Decidable and non Recursive Undecidable and Recursive Undecidable and non Recursive
Consider <M be the encoding of Turing Machine as string over alphabet $\Sigma$ = {0,1}.Consider L= { <M>| M is TM that halt on all input and L(M) = L for some undecidab...
Hemanth_13
3.5k
views
Hemanth_13
asked
Dec 13, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
decidability
turing-machine
+
–
1
votes
1
answer
585
MadeEasy Subject Test 2019: Operating System - File System
Unix I-node has block size 8 KB and file possible with triple indirect is 128 GB.Number of bits disk block address contain is?
Unix I-node has block size 8 KB and file possible with triple indirect is 128 GB.Number of bits disk block address contain is?
Chetan28kumar
984
views
Chetan28kumar
asked
Dec 12, 2018
Operating System
made-easy-test-series
operating-system
file-system
+
–
2
votes
0
answers
586
Madeeasy-Test-series
consider a RISC processor with an ideal CPI, where 25% of total instructions are Load and Store instructions. The time to access the main memory is 100 clock cycles and accessing of the cache memory required 2 clock cycles. if the cache miss rate is 2%, then the effective CPI for the system with the cache is __.{up to 2 decimal}.
consider a RISC processor with an ideal CPI, where 25% of total instructions are Load and Store instructions. The time to access the main memory is 100 clock cycles and a...
Prateek Raghuvanshi
1.8k
views
Prateek Raghuvanshi
asked
Dec 11, 2018
CO and Architecture
co-and-architecture
made-easy-test-series
+
–
3
votes
2
answers
587
MadeEasy Subject Test 2019: Programming & DS - Programming In C
char *a = “MADEEASY”; char *b = “GATECSIT2019”; char *r = a; char *s = b; printf(“%d”, (int) strlen (b+3[r] – 1[s])); return 0; Whats the output? Answer given 8
char *a = “MADEEASY”;char *b = “GATECSIT2019”;char *r = a;char *s = b;printf(“%d”, (int) strlen (b+3[r] – 1[s]));return 0; Whats the output? Answer given 8
Shamim Ahmed
583
views
Shamim Ahmed
asked
Dec 11, 2018
Programming in C
made-easy-test-series
programming
programming-in-c
pointers
+
–
2
votes
2
answers
588
MadeEasy Subject Test 2019: Programming & DS - Programming In C
main(){ int S[6] = {126,256,512,1024,2048,4096}; int *x=(int *) (&S+1); printf (“%d”,x); } int is 4 bytes; array starts from 2000 . The answer is 2024 I am getting 2004. Please explain the concept. If possible provide a resource.
main(){ int S[6] = {126,256,512,1024,2048,4096}; int *x=(int *) (&S+1); printf (“%d”,x); }int is 4 bytes; array starts from 2000 .The answer is 2024 I am getting 2004...
Shamim Ahmed
770
views
Shamim Ahmed
asked
Dec 11, 2018
Programming in C
made-easy-test-series
programming
programming-in-c
array
+
–
1
votes
2
answers
589
MadeEasy Test Series 2019: Programming & DS - Arrays
Given a 2D array A[40….95, 40...95] in lower triangular representation, size of each element is 1 Byte Array implemented in row major order, base address is 1000 Address of A[66][50] ?
Given a 2D array A[40….95, 40...95] in lower triangular representation, size of each element is 1 ByteArray implemented in row major order, base address is 1000Address ...
Shamim Ahmed
1.2k
views
Shamim Ahmed
asked
Dec 11, 2018
DS
made-easy-test-series
data-structures
array
+
–
0
votes
0
answers
590
MadeEasy Test Series: CO & Architecture - Cache Memory
Consider a 2-level L1 and L2 memory hierarchy system. The associativity of L1 towards processor is more. L1 (cache) has accessing time of 15 ns and L2 (main memory) has an accessing time of 100 ns. Writing takes 30 ... the instruction are read only instructions. What is the average access time for the system if it uses write through protocol?
Consider a 2-level L1 and L2 memory hierarchy system. The associativity of L1 towards processor is more. L1 (cache) has accessing time of 15 ns and L2 (main memory) has a...
naveen bhatt
592
views
naveen bhatt
asked
Dec 10, 2018
Operating System
made-easy-test-series
co-and-architecture
cache-memory
+
–
1
votes
1
answer
591
MadeEasy Test Series: Digital Logic - Floating Point Representation
Consider a modified 8-bit floating point representation in which 1-bit for sign, 3-bit for exponent and 4-bit for significant. What will be representation for decimal value –12?
Consider a modified 8-bit floating point representation in which 1-bit for sign, 3-bit for exponent and 4-bit for significant. What will be representation for decimal val...
naveen bhatt
1.3k
views
naveen bhatt
asked
Dec 10, 2018
Digital Logic
made-easy-test-series
digital-logic
floating-point-representation
+
–
0
votes
0
answers
592
MadeEasy Subject Test 2019: Theory Of Computation - Pushdown Automata
Options: $\left \{ \left ( b^{n}ab^{n}a\right )^{m} | n,m \geq 0 \right \}$ $\left \{ \left ( b^{n}ab^{n}a\right )^{m} | n,m \geq 0 \right \} \cup \left \{ b^{n} | n\geq 0 \right \}$ $\left \{ \left ( b^{n}ab^{n}\right )^{m}a | n,m \geq 0 \right \}$ $NONE$
Options:$\left \{ \left ( b^{n}ab^{n}a\right )^{m} | n,m \geq 0 \right \}$$\left \{ \left ( b^{n}ab^{n}a\right )^{m} | n,m \geq 0 \right \} \cup \left \{ b^{n} | n\geq 0 ...
jatin khachane 1
918
views
jatin khachane 1
asked
Dec 10, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
pushdown-automata
+
–
0
votes
1
answer
593
made easy test series
sim1234
535
views
sim1234
asked
Dec 10, 2018
Compiler Design
compiler-design
runtime-environment
descriptive
made-easy-test-series
+
–
2
votes
2
answers
594
made easy test series
sim1234
510
views
sim1234
asked
Dec 10, 2018
Compiler Design
compiler-design
syntax-directed-translation
made-easy-test-series
+
–
1
votes
2
answers
595
MadeEasy Subject Test 2019: Programming & DS - Binary Tree
four vertices {A,B,C,D} is given which has only vertex D as a leaf total number of binary tree are possible when every binary tree has four node!
four vertices {A,B,C,D} is given which has only vertex D as a leaf total number of binary tree are possible when every binary tree has four node!
CHïntän ÞäTël
1.0k
views
CHïntän ÞäTël
asked
Dec 10, 2018
DS
made-easy-test-series
data-structures
binary-tree
+
–
0
votes
1
answer
596
MadeEasy Test Series: Operating System - Prcocess
Consider the following statements: S1: Long term scheduler sends the process from ready state to running state. S2: Medium term scheduler controls the degree of multiprogramming. which of the following is correct? Only S1 Only S2 Both S1 & S2 Neither S1 & S2
Consider the following statements:S1: Long term scheduler sends the process from ready state to running state.S2: Medium term scheduler controls the degree of multiprogra...
balraj_allam
3.1k
views
balraj_allam
asked
Dec 9, 2018
Operating System
made-easy-test-series
operating-system
process
+
–
0
votes
1
answer
597
MadeEasy Test Series: Operating System - Threads
Consider the following statements: S1: Multiprogramming is used to increase CPU utilization, while time-sharing is used to increase CPU responsiveness in interacting with user. S2: If a user-level-thread is blocked for I/O operation, then kernel of OS will ... of the following is true? Only S1 & S2 Only S2 & S3 Only S1 & S3 None of these
Consider the following statements:S1: Multiprogramming is used to increase CPU utilization, while time-sharing is used to increase CPU responsiveness in interacting with ...
balraj_allam
1.7k
views
balraj_allam
asked
Dec 9, 2018
Operating System
made-easy-test-series
operating-system
threads
+
–
2
votes
1
answer
598
MadeEasy Subject Test 2019: Computer Networks - Flow Control Methods
consider a network connecting two nodes A and B having a propagation delay of 6*10^-4 micro sec.bandwidth of network is 150 Mbps if each frame size is 5000 bytes and both uses go back n sliding window protocal, where maximum 100 frames can be sent at a time then the maximum possible data rate is ----- [ mbps]
consider a network connecting two nodes A and B having a propagation delay of 6*10^-4 micro sec.bandwidth of network is 150 Mbps if each frame size is 5000 bytes and both...
suneetha
1.7k
views
suneetha
asked
Dec 9, 2018
Computer Networks
made-easy-test-series
computer-networks
flow-control-methods
sliding-window
+
–
0
votes
1
answer
599
Test series
Consider the following regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is __________.
Consider the following regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is __________.
mitesh kumar
399
views
mitesh kumar
asked
Dec 9, 2018
Theory of Computation
made-easy-test-series
+
–
3
votes
1
answer
600
MadeEasy Subject Test 2019: Computer Networks - Network Switching
junaid ahmad
860
views
junaid ahmad
asked
Dec 8, 2018
Computer Networks
made-easy-test-series
computer-networks
network-switching
+
–
Page:
« prev
1
...
15
16
17
18
19
20
21
22
23
24
25
...
57
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register