Recent questions tagged test-series

+1 vote

1 answer

1

MadeEasy Subject Test: Compiler Design - Syntax Directed Translation
How do we know when to execute which semmentic action?

asked Dec 29, 2016 in Compiler Design by rahul sharma 5 Boss (25.6k points) | 169 views

+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?

asked Dec 26, 2016 in Theory of Computation by thehobo03 (177 points) | 145 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?

asked Dec 25, 2016 in CO and Architecture by Rajesh Raj Active (4.8k points) | 234 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___________?

asked Dec 25, 2016 in CO and Architecture by Rajesh Raj Active (4.8k points) | 370 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?

asked Dec 22, 2016 in Algorithms by srestha Veteran (119k points) | 163 views

+2 votes

1 answer

6

ACE TEST SERIES:-Transaction 2pl and Time stamp based protocol

asked Dec 22, 2016 in Databases by KISHALAY DAS Active (4.9k points) | 336 views

+1 vote

1 answer

7

Testbook Test Algorithm Q 10

asked Dec 20, 2016 in Algorithms by Anjana Babu Active (1k points) | 199 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?

asked Dec 18, 2016 in Programming by rahul sharma 5 Boss (25.6k points) | 124 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

asked Dec 18, 2016 in Programming by rahul sharma 5 Boss (25.6k points) | 339 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 _____________

asked Dec 18, 2016 in Computer Networks by Rajesh Raj Active (4.8k points) | 250 views

0 votes

1 answer

11

ROM chip -----Plz explain......

asked Dec 16, 2016 in CO and Architecture by priyanka gautam-piya Active (2.6k points) | 83 views

+3 votes

1 answer

12

ICMP_networking

asked Dec 15, 2016 in Computer Networks by thor Loyal (6.8k points) | 105 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 ________.

asked Dec 15, 2016 in Computer Networks by Rajesh Raj Active (4.8k points) | 224 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.

asked Dec 13, 2016 in Operating System by ms17436 (111 points) | 146 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?

asked Dec 13, 2016 in Operating System by Anusha Motamarri Boss (12k points) | 181 views

0 votes

0 answers

16

ME-OS TEST:Dynamic Priority Scheduling
Anyone please check this

asked Dec 13, 2016 in Operating System by KISHALAY DAS Active (4.9k points) | 120 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

asked Dec 13, 2016 in Mathematical Logic by Nishant Arora Active (3k points) | 113 views

0 votes

1 answer

18

me test
plss expln guys

asked Dec 12, 2016 in Algorithms by Rajesh Raj Active (4.8k points) | 96 views

+1 vote

1 answer

19

ACE Test Series

asked Dec 10, 2016 in Computer Networks by chaser (321 points) | 114 views

0 votes

0 answers

20

me test
plss elaborate it

asked Dec 9, 2016 in Algorithms by Rajesh Raj Active (4.8k points) | 42 views

0 votes

1 answer

21

madeeasy test

asked Dec 8, 2016 in CO and Architecture by 2018 Loyal (6.8k points) | 156 views

0 votes

1 answer

22

#GO -test

asked Dec 7, 2016 in Databases by Hradesh patel Loyal (6.5k points) | 99 views

0 votes

2 answers

23

Calicut Gate Academy Test Series | DAA Time complexity Q2
Complexity of the following snippet is for (i=1;i<n;++i) for(j=1;j<=n;j=j+i) c=c+1;

asked Dec 6, 2016 in Algorithms by PEKKA Active (1.9k points) | 125 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)$

asked Dec 6, 2016 in Algorithms by PEKKA Active (1.9k points) | 84 views

0 votes

1 answer

25

programing test series

asked Dec 6, 2016 in DS by Vishal Goyal Active (1.8k points) | 84 views

0 votes

0 answers

26

dout plz correct me

asked Dec 6, 2016 in DS by Vishal Goyal Active (1.8k points) | 85 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 )

asked Dec 5, 2016 in Theory of Computation by PEKKA Active (1.9k points) | 166 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

asked Dec 5, 2016 in Theory of Computation by PEKKA Active (1.9k points) | 90 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

asked Dec 5, 2016 in Theory of Computation by PEKKA Active (1.9k points) | 111 views

0 votes

0 answers

30

ME test

asked Dec 5, 2016 in Computer Networks by thor Loyal (6.8k points) | 45 views

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

Recent questions tagged test-series

Recent Posts

Recent Blog Comments