Recent questions tagged made-easy-test-series

0 votes

1 answer

1

mock test
what is the approach for this question

asked 1 day ago in Computer Networks by garimanand (165 points) | 12 views

0 votes

0 answers

2

mock test
how can l2 be a recursive language we have two turing machines both can accept one language but it does not imply whether it halts or not

asked 4 days ago in Theory of Computation by garimanand (165 points) | 5 views

+1 vote

0 answers

3

made easy test series

asked 5 days ago in DS by Chetan28kumar (17 points) | 42 views

0 votes

0 answers

4

Go back N prototcol
Consider the GBN protocol with sender and receiver window size as 5.Suppose client sends data 0,1,2,3,4 and only data packet 2 is lost and all ACKs are lost. What will be the content of receiver and sender window. Before Senders timeout value expires ? A. ... : 01234 B. Sender: 23456 , Receiver : 01234 C. Sender: 23456 , Receiver : 23456 D. Sender: 01234 , Receiver : 23456

asked Sep 15 in Computer Networks by Na462 Loyal (5.6k points) | 42 views

0 votes

0 answers

5

Test Series
Can someone explain this problem?

asked Sep 5 in Theory of Computation by Kalpataru Bose (429 points) | 39 views

0 votes

0 answers

6

test series
Can someone explain this problem?

asked Sep 4 in Theory of Computation by Kalpataru Bose (429 points) | 65 views

0 votes

0 answers

7

MadeEasy TestSeries OS
Consider two processes , each needed 3 resources 1, 2 and 3 in a database. If each processes ask them in any order, then the number of ways possible in which system is guaranteed to be deadlock free ________.

asked Sep 1 in Operating System by Avijit Shaw (15 points) | 23 views

0 votes

1 answer

8

#Test series
Which of the following is true? A) Symbol table is constructed during the analysis part of compiler i.e., (front end) B) Type checking is done during syntax analysis phase. C) SDD with only synthesised attribute, always have a order of evaluation. D) Both (a) and (c)

asked Sep 1 in Compiler Design by himgta Active (1.5k points) | 29 views

0 votes

0 answers

9

made easy test series
which of the statement is/are coorect

asked Aug 31 in Theory of Computation by Anurag Parothia 1 (143 points) | 17 views

0 votes

2 answers

10

made easy test series

asked Aug 24 in Theory of Computation by Anurag Parothia 1 (143 points) | 28 views

0 votes

1 answer

11

MadeEasy Test Series Cache
Consider a memory access to main memory on a cache miss takes 100 ns and memory access to cache at cache hit takes 10 ns. If 75% processors memory request results in cache hit the average memory access time is _____ ns.

asked Aug 23 in CO & Architecture by Mk Utkarsh Boss (16.7k points) | 45 views

0 votes

0 answers

12

Test series
The answer is 'd' will be printed. Can someone draw the linked list after the operations are performed. I think the second operation of the code doesn't bring in any change to the list. thanks in advance

asked Aug 23 in Programming by Kalpataru Bose (429 points) | 29 views

0 votes

1 answer

13

Made Easy Test Series
The following program uses six different variables p, q, r, s, t and u. The code is: p=6 q=7 t=p*q s=t+p u=8 u=s*p s=p+u r=r*q t=t+p return t Assume that all operations take their operands from registers, the minimum number of registers needed ... Given answer is 5, but my answer is 4. I think that the step u=8 can be skipped since 'u' is being reinitialized in the next step.

asked Aug 23 in Compiler Design by sumedha bhatia (265 points) | 47 views

0 votes

0 answers

14

Parsing
Consider the following grammar which is not LL(1) because LL(1) table contain multiple entry for same production. The number of entries have multiple productions in LL(1) table are ________.

asked Aug 19 in Compiler Design by Mizuki Junior (783 points) | 46 views

0 votes

3 answers

15

test series
DH key exchange algorithm is used to establish a session between sender and receiver with n=23 and g=5. The sender's secret key is 6 and the receiver's secret key is 15. What is the secret key between the receiver and sender? Please explain with solution P.S: Answer is given as 2

asked Aug 18 in Computer Networks by Kalpataru Bose (429 points) | 51 views

0 votes

1 answer

16

Made Easy test
: Question: Consider the following code segment: a=b+c c=a+x d=b+c b=a+x The minimum number of total variables required to convert the above code segment to static single assignment form is

asked Aug 17 in Compiler Design by Vaibhav Rai (27 points) | 32 views

0 votes

1 answer

17

MADE EASY TEST SERIES
What will be the minimal cover of given FD's?

asked Aug 16 in Databases by amitqy (163 points) | 35 views

0 votes

0 answers

18

MADE EASY TEST SERIES
Consider two processes, each needed 3 resources 1, 2 and 3 in a database. If each process asks them in any order, then the number of ways possible in which system is guaranteed to be deadlock free is_______?

asked Aug 14 in Operating System by jhaanuj2108 (137 points) | 23 views

0 votes

0 answers

19

MADE EASY TEST SERIES
Consider five memory partitions of size 100 KB, 500 KB, 200 KB, 450 KB and 600 KB in same order. If sequence of requests for blocks of size 212 KB, 417 KB, 112 KB and 426 KB in same order come, then which of the following algorithm makes the efficient use of memory? A) BEST FIT B) FIRST FIT C) NEXT FIT D) BOTH NEXT FIT AND BEST FIT RESULTS IN SAME

asked Aug 14 in Operating System by jhaanuj2108 (137 points) | 19 views

0 votes

1 answer

20

MADE EASY TEST SERIES
Consider a demand paged memory system, page table is held in registers. It takes 800 nsec to service a page fault if empty page is available or replaced page is not modified and 950 nsec if the replaced page is modified, main memory access time is ... replaced is modified 85% of time and page faultrate is 20% then average memory access time is ________. (Upto 1 decimal place)

asked Aug 14 in Operating System by jhaanuj2108 (137 points) | 19 views

0 votes

0 answers

21

madeeasy test series

asked Aug 9 in Compiler Design by Deepanshu Active (1.9k points) | 37 views

0 votes

0 answers

22

MADEEASY TESTSERIES DLD
Amazon announce a new flip flop named Set-Reset-Toggle due to shortage elements to the electronics and computer industries. The device symbol and function table for this flip flop are shown below: Which of the following is the characteristic equation? A. Q+=TQ′ + T′[Q(S ⊕ R) + SR′] B. Q+=(T ⊕Q) + S+R′Q C. Q+ = T′Q + T[Q′(S + R) + SR′] D. Q+ = TQ′ + T′[Q(S + R′) + SR′]

asked Aug 7 in Digital Logic by Avijit Shaw (15 points) | 32 views

0 votes

1 answer

23

Made Easy
Consider there are two tribes living on the Island: Knights and knaves. Knights always tell truth while Knaves always tells lie. Suppose we counter two random people A and B, upon asking a question to A', A says If B is Knight then I am a Knave . What we can conclude about person A ... and B is Knave b.) A is Knave and B is Knave c.) Both A and B are Knight d.) Both A and B are Knave

asked Aug 6 in Mathematical Logic by snehasarkar (41 points) | 19 views

0 votes

1 answer

24

online madeeasy test series
Consider a Game played be between two players (Player-1, Player-2) repeatedly flip a coin. On output as a head, Player-1 get a point On output as a tail, Player-2 get a point A player wins if his score reaches 2 points before the ... Which of the following depicts NFA for above problem? Can anyone explain how this diagram is working between two players,,,,please?????

asked Jul 31 in Theory of Computation by Ritam Biswas 1 (109 points) | 37 views

0 votes

1 answer

25

Madeeasy test
Consider the following regular expression (RE) RE= (aa+abb)^+ (a+b+ba)^+ (a+b)^+ How many minimal strings exist for above RE? (a) 3 (b) 4 (c) 5 (d) 6

asked Jul 30 in Theory of Computation by ROHIT SHARMA 5 (117 points) | 26 views

0 votes

1 answer

26

Made easy
https://gateoverflow.in/?qa=blob&qa_blobid=10936115150698131975

asked Jul 30 in DS by manvi_agarwal (109 points) | 23 views

0 votes

1 answer

27

Made easy Test
Consider the following language. L={wxwy / x,y,w €(a+b)^+} How many states are there in equivalent NFA for above L? (a) 6 (b) 7 (c) 8 (d) 9

asked Jul 30 in Theory of Computation by ROHIT SHARMA 5 (117 points) | 51 views

+1 vote

3 answers

28

test series
Which of the following permutations can be obtained in the same order using a stack assuming that input is the sequence 5,6,7,8,9 in that order? A ) 7,8,9,5,6 B ) 5,9,6,7,8 C ) 7,8,9,6,5 D ) 9,8,7,5,6

asked Jul 29 in Compiler Design by Kalpataru Bose (429 points) | 53 views

0 votes

0 answers

29

Test Series
Kindly help me out with the solution of this problem. Thanks in advance.

asked Jul 27 in Operating System by Kalpataru Bose (429 points) | 30 views

0 votes

1 answer

30

test series
Let "if x then y else z" denote the expression and this expression can be represented ad "?xyz" using ternary prefix operator the prefix operator for the following expression is If a then if c-d then a+c else a*c else a+b A) ?-acd+ac?+ab+ac B) ?a?-cd+ac*ac+ab C)?a-cd?+ac*ac+ab D )none

asked Jul 27 in Compiler Design by Kalpataru Bose (429 points) | 26 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 made-easy-test-series

Recent Posts

Recent Blog Comments