Recent questions tagged made-easy-test-series

+2 votes

1 answer

1

MadeEasy Test
For synchronous series counter of modulus 256, the propagation delay for each flip flop is 25 nsec and propagation delay of each two input AND gate is 5 nsec. What is the maximum frequency of MOD 256 counter ?(in MHz) a)18.18 b)19.18 c)20.19 ... makes Frequency = 1/(30 nsec) = 33.33 Mhz? please correct me where I am going wrong. Thanks for your help :)

asked Oct 10 in Digital Logic by Kamal Pratap Junior (577 points) | 32 views

+2 votes

1 answer

2

Made easy test series
Consider file system stores records as per binary search tree principles. If the postorder traversal of records is given by 2, 4, 3, 9, 13, 7, 6, 17, 20, 18, 15. The expected number of comparisons when we randomly request one of the records (upto 2 decimal places) is _____.

asked Oct 9 in Algorithms by Shivi rao (397 points) | 39 views

+1 vote

1 answer

3

Doubt in context switching from Made Easy Test Series

asked Oct 8 in Operating System by Tuhin Dutta Active (2.3k points) | 23 views

+1 vote

0 answers

4

#Databases #Transactions #Concurrency

asked Oct 7 in Databases by Rishi yadav Boss (5.6k points) | 34 views

+2 votes

1 answer

5

compiler-design

asked Oct 6 in Compiler Design by rajoramanoj Boss (5.3k points) | 42 views

+2 votes

2 answers

6

compiler-design -follow
EXPLAIN...

asked Oct 6 in Compiler Design by rajoramanoj Boss (5.3k points) | 34 views

+2 votes

2 answers

7

made-easy-test-series compiler-design

asked Oct 6 in Compiler Design by rajoramanoj Boss (5.3k points) | 60 views

0 votes

0 answers

8

Made easy OS
The pic shows the question along with options:

asked Oct 2 in Operating System by Tuhin Dutta Active (2.3k points) | 55 views

0 votes

1 answer

9

made-easy-test-series operating-system

asked Sep 30 in Operating System by rajoramanoj Boss (5.3k points) | 78 views

0 votes

1 answer

10

made-easy-test-series operating-system

asked Sep 30 in Operating System by rajoramanoj Boss (5.3k points) | 49 views

+2 votes

2 answers

11

made-easy-test-series theory-of-computation

asked Sep 28 in Theory of Computation by rajoramanoj Boss (5.3k points) | 54 views

0 votes

1 answer

12

made-easy-test-series theory-of-computation

asked Sep 28 in Theory of Computation by rajoramanoj Boss (5.3k points) | 49 views

0 votes

1 answer

13

made-easy-test-series theory-of-computation

asked Sep 28 in Theory of Computation by rajoramanoj Boss (5.3k points) | 61 views

0 votes

2 answers

14

made-easy-test-series theory-of-computation

asked Sep 28 in Theory of Computation by rajoramanoj Boss (5.3k points) | 68 views

0 votes

1 answer

15

made-easy-test-series computer-networks

asked Sep 27 in Computer Networks by rajoramanoj Boss (5.3k points) | 72 views

0 votes

0 answers

16

test-series

asked Sep 27 in Computer Networks by rajoramanoj Boss (5.3k points) | 26 views

0 votes

0 answers

17

Parsing LR(1)
Let G be a grammar with the following productions. If LR(1) Parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an item in the initial state?

asked Sep 22 in Compiler Design by Aibi (69 points) | 43 views

+2 votes

1 answer

18

[COA] William Stallings 4.17, 8th edition

asked Sep 14 in CO & Architecture by Chandramani Adil (181 points) | 42 views

+1 vote

0 answers

19

Made Easy and KLP Mishra
In the given two diagrams one from made easy and another from KLP Mishra book. (1) in this diagram, type 3 or regular language and its related automata is Finite Automaton. (2) in this diagram, Finite Automaton is both ... context-free box. (1) Diagram (2) Diagram So what is the correct relations among languages and the corresponding automata?

asked Sep 8 in Theory of Computation by Dilip Puri (235 points) | 64 views

0 votes

0 answers

20

GATE digital logic
F(X,Y,Z)= X'YZ+XY'+YZ' G(X,Y,Z)=X'YZ+X'Y'Z'+XY a>both ar functionally complete b>only F are functionally complete c> only G are functionally complete d>nither F nor G..

asked Aug 24 in Digital Logic by air1ankit Active (1.8k points) | 42 views

+1 vote

1 answer

21

Disk Scheduling
Consider a disk head with 500 tracks numbered 0499 is currently on 60. The following sequence of requests arrive: 170, 37, 98, 122, 53, 14, 39, 28. Total head movements needed to satisfy these requests with SSTF scheduling algorithm is ______. I am getting 202.

asked Aug 15 in Operating System by Shubhanshu Boss (8.8k points) | 84 views

0 votes

0 answers

22

ME test series
A computer has 32bit instruction and 9bit address. If there are 400 two address instructions then how many one address instructions can be formulated? a. 2^ 14 b. 2 ^32 – 200 c. 2 ^14 – 400 d. (2^14 – 400) × 2^9 (Answer) can anybody explain me how this option is correct?

asked Aug 13 in CO & Architecture by sashii (11 points) | 40 views

+2 votes

0 answers

23

Made Easy Gate Test Series
The correct answer to the following question is 24. Please explain.

asked Jul 26 in DS by Akash Mishra Junior (679 points) | 179 views

+1 vote

1 answer

24

Interrupt I/O|Made Easy test Series

asked Jul 8 in CO & Architecture by kimaya (53 points) | 77 views

+1 vote

1 answer

25

Cache Memory Made Easy
The answer in the solution is b. My confusion is that adding word to a block will reduce Miss Rate and not Miss Penalty. So shouldn't the answer be c, i.e. only S2 is correct?

asked Jul 8 in CO & Architecture by kimaya (53 points) | 101 views

+1 vote

2 answers

26

test series

asked Jun 30 in DS by mayur ganatra 1 (251 points) | 105 views

+3 votes

3 answers

27

Made Easy Gate Test Series
What is the answer for following question.

asked Jun 24 in Theory of Computation by Durgesh Singh Junior (655 points) | 217 views

0 votes

3 answers

28

made easy test series
for an O(log n) algorithum , x takes 12 second to execute his data Y runs the same algorithum on same machine and it took him 20 sec for data size 32 the data size of X is ????

asked May 12 in Algorithms by aaru14 (315 points) | 109 views

0 votes

1 answer

29

test series
hello sir i have doubt in this question. T(n) >= 2T(n/2) + theta(n) option are: O(n log n) omega(n log n) theta (n log n) how we to select which sign i have to use omega ,big oh ,theta ??????

asked May 11 in Algorithms by aaru14 (315 points) | 82 views

0 votes

1 answer

30

Made easy study material_Digital Elevtronics_Chap_2 (Q2)

asked May 10 in Digital Logic by Epsilon95 (59 points) | 254 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

Recent Badges