menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Recent questions tagged test-series

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions tagged test-series

2 votes
0 answers
2
Testbook
Consider the following sets L1 = {apbq | p +q >= 106 } L2 = {ambn | m - n >= 106} Which of the following is a Regular Language? Also how to find the compliment of the given languages?
Consider the following sets L1 = {apbq | p +q >= 106 } L2 = {ambn | m - n >= 106} Which of the following is a Regular Language? Also how to find the compliment of the given languages?
asked Dec 26, 2016 in Theory of Computation thehobo03 197 views
1 vote
0 answers
3
test series question
Consider a system with CPI of 1.0 on a 5 GHz machine with a 2% miss rate and memory access time of 100ns. To reduce miss penalty designers decided to add a L2 cache with 5ns access time and decrease of overall main memory miss rate to 0.5%, How ... access - Adding a L2 cache with 5ns access time and decrease of overall main memory miss rate to 0.5%, what miss penalty reduced?
Consider a system with CPI of 1.0 on a 5 GHz machine with a 2% miss rate and memory access time of 100ns. To reduce miss penalty designers decided to add a L2 cache with 5ns access time and decrease of overall main memory miss rate to 0.5%, How many clock ... DRAM access - Adding a L2 cache with 5ns access time and decrease of overall main memory miss rate to 0.5%, what miss penalty reduced?
asked Dec 25, 2016 in CO and Architecture Rajesh Raj 332 views
1 vote
0 answers
4
****** test
Consider a computer system in which cache memory write hit takes 10ns and and miss takes 100ns. Cache memory read hit takes 5ns and miss takes 55ns. The cache is having 90% hit. The system received 1000 fetch instructions out of which, 500 operand fetch operations and 500 operand write operations. The average time taken to execute above 1000 instructions is___________?
Consider a computer system in which cache memory write hit takes 10ns and and miss takes 100ns. Cache memory read hit takes 5ns and miss takes 55ns. The cache is having 90% hit. The system received 1000 fetch instructions out of which, 500 operand fetch operations and 500 operand write operations. The average time taken to execute above 1000 instructions is___________?
asked Dec 25, 2016 in CO and Architecture Rajesh Raj 512 views
1 vote
1 answer
5
Test Series
Assume that A be an array of 16 elements. What is the difference between maximum number of inversion and minimum number of inversion for the array with 16 elements?
Assume that A be an array of 16 elements. What is the difference between maximum number of inversion and minimum number of inversion for the array with 16 elements?
asked Dec 22, 2016 in Algorithms srestha 288 views
0 votes
1 answer
8
[Programming/Min heap] Test Series
A complete binary min-heap is made by including each integer in [1,1023][1,1023] exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth 0. The maximum value of integer at a. ) First node of depth 8 is? b.) First node of depth k is?
A complete binary min-heap is made by including each integer in [1,1023][1,1023] exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth 0. The maximum value of integer at a. ) First node of depth 8 is? b.) First node of depth k is?
asked Dec 18, 2016 in Programming rahul sharma 5 161 views
0 votes
1 answer
9
Priority queue stack
How to implement Priority queue using stack?What will be time complexity for Enqueue and Dequeue operations? Edit:- Updated the question clearly
How to implement Priority queue using stack?What will be time complexity for Enqueue and Dequeue operations? Edit:- Updated the question clearly
asked Dec 18, 2016 in Programming rahul sharma 5 588 views
1 vote
1 answer
10
test series
On a TCP connection, current congestion window size is Congestion Window = 8 KB. The window size advertised by the receiver is Advertise Window = 10 KB. The last byte sent by the sender is LastByteSent = 18476 and the last byte acknowledged by the receiver is LastByteAcked = 12112. The current window size at the sender is _____________
On a TCP connection, current congestion window size is Congestion Window = 8 KB. The window size advertised by the receiver is Advertise Window = 10 KB. The last byte sent by the sender is LastByteSent = 18476 and the last byte acknowledged by the receiver is LastByteAcked = 12112. The current window size at the sender is _____________
asked Dec 18, 2016 in Computer Networks Rajesh Raj 305 views
0 votes
1 answer
11
ROM chip -----Plz explain......
asked Dec 16, 2016 in CO and Architecture priyanka gautam-piya 120 views
3 votes
1 answer
12
ICMP_networking
asked Dec 15, 2016 in Computer Networks thor 139 views
1 vote
1 answer
13
me test
An upper layer packet is split into 20 frames each of which has 80 percent chance of arriving undamaged. No error control is done by data link layer. The number of times message be sent on average to get the entire message through is ________.
An upper layer packet is split into 20 frames each of which has 80 percent chance of arriving undamaged. No error control is done by data link layer. The number of times message be sent on average to get the entire message through is ________.
asked Dec 15, 2016 in Computer Networks Rajesh Raj 326 views
0 votes
0 answers
14
Fragmentation in os
A system using fixed partitioning memory allocation technique where 10 partitions are available and each partition size is 90KB. The request of processes are 60 KB, 40 KB, 55KB,75KB,84KB, 20 KB, 80 KB. Total internal fragmentation and external fragmentation? Please answer it.
A system using fixed partitioning memory allocation technique where 10 partitions are available and each partition size is 90KB. The request of processes are 60 KB, 40 KB, 55KB,75KB,84KB, 20 KB, 80 KB. Total internal fragmentation and external fragmentation? Please answer it.
asked Dec 13, 2016 in Operating System ms17436 214 views
1 vote
2 answers
15
ME-OS
i got 44 as answer. givne answer is 48 they took PTE to be 3 Bytes correct answer is?
i got 44 as answer. givne answer is 48 they took PTE to be 3 Bytes correct answer is?
asked Dec 13, 2016 in Operating System Anusha Motamarri 223 views
0 votes
0 answers
17
ME FLT-1 Q-10
i have used hypergeometric distribution but MADE Easy have used binomial theorem..we should use binomial when replacement are done na? my ans.0.6 made easy ans:0.81
i have used hypergeometric distribution but MADE Easy have used binomial theorem..we should use binomial when replacement are done na? my ans.0.6 made easy ans:0.81
asked Dec 13, 2016 in Mathematical Logic Nishant Arora 168 views
0 votes
1 answer
18
me test
plss expln guys
plss expln guys
asked Dec 12, 2016 in Algorithms Rajesh Raj 141 views
1 vote
1 answer
19
ACE Test Series
asked Dec 10, 2016 in Computer Networks chaser 157 views
0 votes
0 answers
20
me test
plss elaborate it
plss elaborate it
asked Dec 9, 2016 in Algorithms Rajesh Raj 53 views
0 votes
1 answer
21
madeeasy test
asked Dec 8, 2016 in CO and Architecture 2018 177 views
0 votes
1 answer
22
#GO -test
asked Dec 7, 2016 in Databases Hradesh patel 136 views
1 vote
1 answer
24
Calicut Gate Academy Test Series | DAA Find Complexity
Complexity of the below code snippet is .. for (i=1;i<=n;++i) { j=2; while(j<=n) { j=j*j; c=c+1; } } $O(nlog n)$ $O(n^{2})$ $O(nloglog n)$ $O(n)$
Complexity of the below code snippet is .. for (i=1;i<=n;++i) { j=2; while(j<=n) { j=j*j; c=c+1; } } $O(nlog n)$ $O(n^{2})$ $O(nloglog n)$ $O(n)$
asked Dec 6, 2016 in Algorithms PEKKA 117 views
0 votes
1 answer
25
programing test series
asked Dec 6, 2016 in DS Vishal Goyal 143 views
0 votes
0 answers
26
dout plz correct me
asked Dec 6, 2016 in DS Vishal Goyal 112 views
0 votes
1 answer
27
Calicut Gate Academy Test Series | TOC Q32
Let ⟨M⟩ be the encoding of a Turing machine as a string over Σ={0,1} Let L={⟨M⟩∣M is a Turing machine that accepts a string of length 2014}. Then L is Recursively enumerable Not Recursively enumerable Recursive Udecidable (Multiple Options May be Correct . Mark them All )
Let ⟨M⟩ be the encoding of a Turing machine as a string over Σ={0,1} Let L={⟨M⟩∣M is a Turing machine that accepts a string of length 2014}. Then L is Recursively enumerable Not Recursively enumerable Recursive Udecidable (Multiple Options May be Correct . Mark them All )
asked Dec 5, 2016 in Theory of Computation PEKKA 254 views
0 votes
1 answer
28
Calicut Gate Academy Test Series | TOC
L={ambnckdl | (n-k ) is odd only if (m-l) is odd , m,n,k,l >=0 } is best fit under which language class RL DCFL CFL CSL
L={ambnckdl | (n-k ) is odd only if (m-l) is odd , m,n,k,l >=0 } is best fit under which language class RL DCFL CFL CSL
asked Dec 5, 2016 in Theory of Computation PEKKA 124 views
1 vote
1 answer
29
Calicut Gate Academy Test Series
The Java language is: A context free language A context sensitive language A regular language Parsable fully only by a Turing machine
The Java language is: A context free language A context sensitive language A regular language Parsable fully only by a Turing machine
asked Dec 5, 2016 in Theory of Computation PEKKA 129 views
0 votes
0 answers
30
ME test
asked Dec 5, 2016 in Computer Networks thor 61 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...