Recent questions tagged made-easy-test-series

Recent questions tagged made-easy-test-series

0 votes

1 answer

1

Made easy test series
Determine the first term of geometric progression is the sum of first term and third term is 40 and sum of second term and fourth term is 80 1)12 2)16 3)8 4)4

Vaishnavi Gadhe asked in Verbal Aptitude Apr 12

by Vaishnavi Gadhe

13 views

0 votes

0 answers

2

Options at IITs or other premier institutes after 2200 Rank in GATE CSE
Hello Everyone, I have secured a GATE Rank: of 2286 and a GATE Score of 543 in GATE CSE 2022. What are the possible options for me, Including MS(R), MTech (RA) at IITs, and other premier institutions ... would be specifically interested in working on a research lab or as a professor over working for some corporate coding job.

baashaaa asked in Written Exam Mar 17

127 views

0 votes

0 answers

3

#madeeasy test series

Rajeev-Dubey asked in Databases Feb 20

by Rajeev-Dubey

96 views

0 votes

1 answer

4

MADE-EASY FULL LENGHT TEST
what would be the output for this query? inner query returns NULL, right? as S.E > 10 won’t be satisfied. so for every outer tuple of R it shouldn’t produce any result? and so the output should be 0? atleast that’s what i think. but, it says the output is 3(i am assuming number of tuples of R), and i can’t figure out why. any help would be appreciated! thanks!

juniorG asked in Databases Jan 30

125 views

0 votes

1 answer

5

BCD Correction | Made Easy Test Series
why is C incorrect? addition of any two nibbles such as 1000 1000 --------- 0000 Will generate a final carry as 1 0000, which will require the addition of 0110 as 1 0110 to make it correct.

palashbehra5 asked in Digital Logic Jan 29

by palashbehra5

130 views

1 vote

0 answers

6

Compiler Design | Made Easy Test Series
I Believe the answer should be lexical error first as “≤” is not a valid token. Next, “+” and “=” have a space between them, which should throw a syntax error. The solution they have provided is : This should be incorrect as the array in C does not perform out of bound checks. Kindly let me know if I am wrong.

palashbehra5 asked in Compiler Design Jan 29

by palashbehra5

116 views

1 vote

1 answer

7

regular languages - TOC
Which of the following languages is/are regular?

atulcse asked in Theory of Computation Jan 28

153 views

0 votes

2 answers

8

sets - mathematics - made easy test series
A newspaper agent sells the TOI, the HT and the IN in equal numbers to 302 persons. 7 persons get the HT and the IN, 12 get the TOI and the IN, 9 get the TOI and the HT and 3 get all three newspapers. Then the number of persons who get only one paper is ____

atulcse asked in Set Theory & Algebra Jan 26

319 views

0 votes

0 answers

9

Made Easy Test Series
“Consider the following proposed solution to dining philosophers problem to avoid deadlock. Consider the binary semaphore lock is initialized to 1. Which of the following is correct?” In the above question, is the given solution deadlock free? Will removing (iii) and (iv) can make the solution deadlock free?

abuhujair asked in Operating System Jan 22

136 views

2 votes

3 answers

10

MADE EASY TEST SERIES | MOCK 2 - 2022
Assume that you have made a request for a web page through your web browser to a web server. Initially the browser cache is empty. Further, the browser is configured to send HTTP requests in PERSISTENT mode. The web page contains text ... very small images. The minimum number of TCP connections required to display the web page completely in your browser is ___.

kbbhatt04 asked in Computer Networks Jan 21

304 views

0 votes

1 answer

11

Made Easy Test Series
The round trip delay between A and B is given as 60 ms, and the bottleneck bandwidth of the link between A and B is 512 KBps. What is the optimal window size (in packets) if the packet size is 64 bytes and the channel is full duplex.

LRU asked in Computer Networks Jan 20

by LRU

167 views

1 vote

1 answer

12

Made Easy Test Series
Consider L = {w011w | w ∈ (o+1)*}. Find minimum number of states that are required in DFA (L). Found this question in Made Easy Test Series and I think the question is incorrect, as the language is not regular. The solution of this question given by Made Easy ... the given solution to be true L should be, L = {w011x | w,x ∈ (o+1)*}. Request you all to provide your comments.

abuhujair asked in Theory of Computation Jan 20

152 views

1 vote

0 answers

13

Made Easy Test Series
Consider a fully associative cache with 6 cache blocks (0 to 5) and the following sequence of memory block requests: 5, 4, 29, 18, 21, 7, 25, 18, 16, 35, 45, 22, 7, 19 If LRU replacement policy is used, which cache block is used for memory block 19? Assume initially 6 blocks are placed in a cache according to lexicographic order of cache index.

LRU asked in CO and Architecture Jan 20

by LRU

166 views

4 votes

3 answers

14

Made Easy Test Series
Consider the following statements: S1 : Direct mapped caches do not need a cache block replacement policy, whereas fully associative cache need. S2 : Direct mapped cache, may produce more misses if programs refers to memory words that occupy a same tag value. Which of the following options is correct?

LRU asked in CO and Architecture Jan 20

by LRU

256 views

2 votes

2 answers

15

Made Easy Test Series
Consider a pipeline consist of 5 stages named as IF, ID, OF, EX and WB with the respective stage delays of 2 ns, 6 ns, 5 ns, 8 ns and 1 ns. The alternative pipeline y' contain the same number of stages but EX stage is divided into 2 ... the program contain 20% of the instructions which are memory based instructions, what is the ratio of speed-up of x to speed-up of y?

LRU asked in CO and Architecture Jan 20

by LRU

201 views

2 votes

2 answers

16

Made Easy Test Series
Consider 5 stage pipelined processor has instruction fetch (IF), Instruction decode (ID), Operand fetch (OF), Perform operation (PO) and Write operand (WB) stages. The IF, ID, OF and WB stages takes 1 clock cycle each for any ... instructions respectively. How many clock cycles needed to execute the above sequence of instruction, where operand forwarding from PO to PO?

LRU asked in CO and Architecture Jan 20

by LRU

181 views

3 votes

0 answers

17

made east test series - synchronization - OS
Consider the following proposed solution to Dining Philosopher's problem to avoid deadlock. The binary semaphore lock is initialized to 1. Which of the following is correct? Removing (i) and (ii) will not affect the code. It will work fine. Removing (iii) ... fine. All (i), (ii), (iii) and (iv) are necessary. Removal of any of them will affect the code.

atulcse asked in Operating System Jan 19

182 views

0 votes

1 answer

18

DBMS made easy test series - bcnf decomposition
$(A)1$ $(B)2$ $(C)4\\$ $(D)\ 5$

tirth_patel asked in Databases Jan 17

162 views

0 votes

1 answer

19

max heap - algorithms - made easy test series
Consider the following graph: Find the total number of max-heap possible orderings with elements 12, 10, 1, 5, 7, 9, 8 such that each element is filled in one node of the above tree and element 10 occupies only the left child node of its parent.

atulcse asked in Algorithms Jan 16

184 views

0 votes

1 answer

20

SQL - databases
Consider the following relations: How many number of records will be returned by the following query?

atulcse asked in Databases Jan 16

154 views

0 votes

0 answers

21

Propositional Logic | Made Easy Full Syllabus Test
How is B a tautology?

palashbehra5 asked in Mathematical Logic Jan 14

by palashbehra5

160 views

0 votes

2 answers

22

Register Allocation | Made Easy Full Syllabus Test
Given problem and answer : I am getting 3 minimum registers as answer, can anyone verify? here's how I am getting 3 : T1 = r T2 = s T1 = T1 * T2 T2 = t T3 = u T2 = T2 – T3 T1 = T1 * T2 // T2 and T3 are free now T2 = p T3 = q T2 = T2 * T3 T3 = t T2 = T2 + T3 T2 = T1 + T2

palashbehra5 asked in Compiler Design Jan 14

by palashbehra5

192 views

1 vote

0 answers

23

made easy test series - cache addressing
Consider a 4-way set associative cache of 64 KB used in a 32-bit CPU, organized into 32-word blocks. System supports 64 GB RAM. Cache is designed with a write back protocol to handle the updation issues. In each line a valid bit is present to specify the status of a block. What is the size (in bits) of a tag directly in the cache controller?

atulcse asked in CO and Architecture Jan 13

214 views

0 votes

2 answers

24

made easy test series - instruction format
Consider a hypothetical CPU which supports 16-bit instruction, 64 registers and 1 KB memory space. If there exist 12 2-address instructions which use register references and 12 1-address memory reference instructions then how many 0-address instructions are possible?

atulcse asked in CO and Architecture Jan 13

184 views

0 votes

0 answers

25

made easy test series - linear algebra
If 2 and -4 are the eigenvalues of a non-singular matrix A and |A| = -8, then the eigenvalues of adj(A) are x and -y. What is the value of x+y?

atulcse asked in Linear Algebra Jan 13

144 views

0 votes

2 answers

26

2PL | Made Easy Full Syllabus Test
Given problem and solution. It is true that the given schedule is not serializable, what I don't understand is how it is not allowed by the 2PL protocol? Given Schedule : T1 T2 T3 R(A) R(A) R(B) W(B) W(A) R(A) Under 2PL : T1 T3 T3 S(A) R(A) S(A) R(A) S(B) R(B) X(B) W(B) Lock Point U(B) X(A) W(A) Lock Point U(A) S(A) Lock Point U(A)

palashbehra5 asked in Databases Jan 13

by palashbehra5

239 views

0 votes

2 answers

27

made easy test series - deadlock - operating systems
Consider a system having ‘m’ resources of the same type. The resources are shared by 3 processes A, B and C which have peak time demands of 5, 7 and 4 respectively. The minimum value of ‘m’ that will ensure that deadlock will never occur is _____.

atulcse asked in Operating System Jan 12

180 views

0 votes

1 answer

28

made easy test series - group theory
Let G be a group of 52 elements. The largest possible size of a subgroup of G other than G itself is ____.

atulcse asked in Set Theory & Algebra Jan 12

271 views

0 votes

1 answer

29

Algorithms | Made Easy Full Syllabus Test
Consider two arrays A and B which are integer types. Array A has n distinct values in it and array B also has n distinct values in it, but A and B can share some values. What is the worst-case running time to compute A - ... complexity O(n). However, the given solution is : Is it always assumed that the algorithm should work without any auxiliary space?

palashbehra5 asked in Algorithms Jan 12

by palashbehra5

143 views

0 votes

1 answer

30

Live Variable Analysis | Made Easy Full Syllabus Test
A variable v is live at a program point p if some path from p to program exit contains an r-value occurrence of v which is not preceded by an l-value occurrence of v . That is, the variable should be referenced before ... zero as from the exit point there are no such definitions, to begin with? This is the solution they have provided :

palashbehra5 asked in Compiler Design Jan 11

by palashbehra5

193 views

Page:

1
2
3
4
5
6
...
48
next »

Follow @gateoverflow

Recent questions tagged made-easy-test-series

Search GATE Overflow for GATE CSE