Recent questions tagged madeeasy-testseries-2018 / GATE Overflow for GATE CSE

0 votes

1 answer

1

MadeEasy Full Length Test 2018: Databases - Transactions
Q50. how many statements is true unrepeatable read also know as read write conflict Strict 2PL may have read write conflict 1st one given as true now my doubt is we know that read write conflict that is https://www.revolvy.com/page/ ... . how we can call unrepeatable read as read write conflict 2nd one given as false but i think it is true

Q50. how many statements is trueunrepeatable read also know as read write conflictStrict 2PL may have read write conflict 1st one given as true now my doubt is we know th...

Gurdeep Saini

597 views

Gurdeep Saini asked Jan 16, 2019

3 votes

2 answers

2

MADE EASY 2018 - ICMP
Consider a very large network of 10000 routers.Two host A and B are connected to this network,host A sends data to host B and after some unit of time host A receives ICMP time exceeded message for the same data packet. The maximum number of routers that can be travelled by packets when ICMP message reaches back to HOST A ?

Consider a very large network of 10000 routers.Two host A and B are connected to this network,host A sends data to host B and after some unit of time host A receives ICMP...

Na462

1.2k views

Na462 asked Dec 2, 2018

3 votes

1 answer

3

MadeEasy Full Length Test 2018: Digital Logic - Multiplexer
If A and B are connected to the select lines of the MUX circuit, then the min-terms of the boolean function recognized by the circuit are _____ ?

If A and B are connected to the select lines of the MUX circuit, then the min-terms of the boolean function recognized by the circuit are _____ ?

kapilbk1996

1.3k views

kapilbk1996 asked Nov 1, 2018

6 votes

2 answers

4

IPv4 (Wrap around time)
Consider an IPv4 network. Each host can generate packets at the rate of 500 packets per second. If each packet in the network is identified by unique identification number of 48 bits, then the host wrap around time for generating packets will be ________s

Consider an IPv4 network. Each host can generate packets at the rate of 500 packets per second. If each packet in the network is identified by unique identification numbe...

Sambhrant Maurya

2.5k views

Sambhrant Maurya asked Sep 23, 2018

2 votes

0 answers

5

MadeEasy Test Series 2018: Programming & DS - Stack
Not able to understand the question. Kindly elaborate along with an explanation. Thank you.

Not able to understand the question. Kindly elaborate along with an explanation. Thank you.

MiNiPanda

455 views

MiNiPanda asked Jan 17, 2018

1 votes

0 answers

6

MadeEasy Test Series 2018: Theory of Computation - Non Determinism
isn't the ans is 3 i.e p,q,r

isn't the ans is 3 i.e p,q,r

Sukhdip Singh

352 views

Sukhdip Singh asked Jan 17, 2018

2 votes

2 answers

7

MadeEasy Test Series 2018: Operating System - VIrtual Memory
Consider the following statements: S1 : User level process cannot modify its own page table entries. S2 : Demand paging requires that the programmer to take specific action to force the operating system to load a particular virtual memory page. ... S1 and S2 D.) None of the above My answer is A but the answer given is D please explain

Consider the following statements:S1 : User level process cannot modify its own page table entries.S2 : Demand paging requires that the programmer to take specific action...

ashish pal

1.3k views

ashish pal asked Jan 17, 2018

3 votes

0 answers

8

MadeEasy Test Series 2018: Theory of Computation - Decidability
Consider the following statements: S1 : Let L be language, reversal of language L cannot contain any string present in ‘L’ except ‘∈’. S2 : Concatenation of two different language cannot be commutative until atleast one of them is ‘Φ’ or ‘∈’. Which of the following is correct?

Consider the following statements:S1 : Let L be language, reversal of language L cannot contain any string present in ‘L’ except ‘∈’.S2 : Concatenation of two d...

Sukhdip Singh

628 views

Sukhdip Singh asked Jan 16, 2018

2 votes

0 answers

9

MadeEasy Full Length Test 2018: Programming & DS - Programming In C
Consider the following C program: The output produced by above C program is ________. (Assume int is of 2 bytes)

Consider the following C program:The output produced by above C program is ________. (Assume int is of 2 bytes)

Akash Mishra

420 views

Akash Mishra asked Jan 16, 2018

1 votes

1 answer

10

MadeEay Test Series 2018: Databases - Relational Algebra
here for 1st relation algebra operation the join operation is given without condition , will it be considered as natural join or cartesian product?

here for 1st relation algebra operation the join operation is given without condition , will it be considered as natural join or cartesian product?

charul

410 views

charul asked Jan 16, 2018

1 votes

0 answers

11

MadeEasy Test Series 2018: Algorithms - Graph Algorithms
Can someone work this out?

Can someone work this out?

Kalpataru Bose

441 views

Kalpataru Bose asked Jan 16, 2018

5 votes

2 answers

12

MadeEasy Test Series 2018: Computer Networks - Stop And Wait
Consider that the stop and wait protocol is used on a link with bit rate of 128 Kbps and 40 msec as round trip time. Assume that the transmission time for the acknowledgment and processing time at nodes are negligible. If the frame size is 512 B then the link utilization is ________. (In % upto 2 decimal places)

Consider that the stop and wait protocol is used on a link with bit rate of 128 Kbps and 40 msec as round trip time. Assume that the transmission time for the acknowledgm...

Harsh Mehta

2.1k views

Harsh Mehta asked Jan 16, 2018

2 votes

2 answers

13

MadeEasy Test Series 2018: Databases - Indexing
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a leaf node in a B+ tree implementing this file structure is ________. I am getting 63 as the answer, but in the solution, it's saying 64. Can anyone check?

In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest ...

souravsaha

1.7k views

souravsaha asked Jan 15, 2018

3 votes

1 answer

14

MadeEasy Test Series 2018: CO & Architecture - Pipelining
for Instructions results in both control and data dependency, what will be the penalty 3 or 5, please explain.

for Instructions results in both control and data dependency, what will be the penalty 3 or 5, please explain.

charul

271 views

charul asked Jan 15, 2018

2 votes

0 answers

15

MadeEasy Test Series 2018: Programming & DS - Prorgramming In C
Consider the following program: The value printed by the above program is: 1. 20 2. 30 3. 40 4. 50 I think it will be undefined behaviour because of: arr[count++] = incr(); But I am not sure. need to confirm.

Consider the following program:The value printed by the above program is:1. 202. 303. 404. 50I think it will be undefined behaviour because of:arr[count++] = incr();But I...

Rishabh Gupta 2

679 views

Rishabh Gupta 2 asked Jan 15, 2018

1 votes

1 answer

16

MadeEasy Test Series 2018: Programming & DS - Programming In C
Please help to explain- why option A is incorrect?

Please help to explain- why option A is incorrect?

Mamta Satywali

356 views

Mamta Satywali asked Jan 15, 2018

2 votes

0 answers

17

MadeEasy Test Series 2018: Digital Logic - Digital Counter
A binary ripple counter is created by cascading N-number of flip-flops. The output frequency of every flip flop is named after its position i.e. then the MOD of the counter is ________. (Assume N > 6) A.) 8 B.) 11 C.) 14 D.) None of these

A binary ripple counter is created by cascading N-number of flip-flops. The output frequency of every flip flop is named after its position i.e. then the MOD of the count...

ashish pal

1.0k views

ashish pal asked Jan 15, 2018

2 votes

0 answers

18

MadeEasy Test Series 2018: Computer Networks - Congestion Control

charul

667 views

charul asked Jan 13, 2018

4 votes

1 answer

19

MadeEasy Test Series 2018: Operating System - VIrtual Memory
Consider a system implements 4 KB pages and 24 bits physical address space. Each page table entry contains a valid bits, a dirty bits, 2 permission bits and translation. If the maximum page table size of process is 30 KB. Then the size of virtual memory supported by the system is ________ (MB).

Consider a system implements 4 KB pages and 24 bits physical address space. Each page table entry contains a valid bits, a dirty bits, 2 permission bits and translation. ...

yankur9

719 views

yankur9 asked Jan 13, 2018

2 votes

0 answers

20

MadeEasy Test Series 2018: Digital Logic - Ieee Representation
the explanation given is I'm not able to get this concept.

the explanation given is I'm not able to get this concept.

charul

678 views

charul asked Jan 13, 2018

1 votes

0 answers

21

MadeEasy Test Series 2018: CO & Architecture - Cache Memory
A computer has a 256 KB, K-way set associative write-back data cache with block size of 32 B. The address sent to the cache controller by the processor is of 32 bits. In addition to the address tag, each cache tag directory contains 2 valid bits ... are used to address tag. What is the minimum value of K? A) 6 B) 5 C) 4 D) None of these

A computer has a 256 KB, K-way set associative write-back data cache with block size of 32 B. The address sent to the cache controller by the processor is of 32 bits. In ...

Prabhat Kumar Sing 1

358 views

Prabhat Kumar Sing 1 asked Jan 13, 2018

4 votes

0 answers

22

MadeEasy Test Series 2018: Programming & DS - Prorgramming In C
#include <stdio.h> int main() { int arr [2][3][2]= {{{1,2},{2,3},{4,5}},{{1,2},{2,3},{4,5}}}; printf("%d %d", arr[1]- arr[0], arr[1][0]- arr[0][0]); return 0; }

#include <stdio.h>int main(){ int arr [3] = {{{1,2},{2,3},{4,5}},{{1,2},{2,3},{4,5}}}; printf("%d %d", arr - arr[0], arr [0]- arr[0][0]); return 0;}

gari

598 views

gari asked Jan 13, 2018

1 votes

0 answers

23

MadeEasy Test Series 2018: Algorithms - Time Complexity
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers? a) O(logn) b) O(nlogn) c) O(n^2) d) O(n^2logn)

What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers?a) O(logn)b) O(nlogn)c) O(n^2)d) O(n^2logn...

charul

748 views

charul asked Jan 12, 2018

2 votes

1 answer

24

MadeEasy Test Series 2018: Computer Networks - Network Flow
my approach is 1 <= Td(x)/(Td+2Tp), x is size of SW then the answer wil be - ceil(log x) Is my approach is correct, if not then how to solve this?

my approach is 1 <= Td(x)/(Td+2Tp), x is size of SWthen the answer wil be - ceil(log x)Is my approach is correct, if not then how to solve this?

charul

342 views

charul asked Jan 12, 2018

2 votes

1 answer

25

MadeEasy Test Series 2018: Databases - Transactions
Consider the following schedule: The number of serial schedules which are view equal to schedule (S) ___________. Answer is 10 as per the given solution. Please explain how to solve these type of questions

Consider the following schedule:The number of serial schedules which are view equal to schedule (S) ___________.Answer is 10 as per the given solution.Please explain how ...

ashish pal

884 views

ashish pal asked Jan 12, 2018

3 votes

1 answer

26

MadeEasy Test Series 2018: Set Theory & Algebra- Lattice
Consider statements: S1 : A finite lattice is always bounded. S2 : Complemented lattice is a proper subset of bounded lattice. S3 : A bounded and complemented lattice may or may not be a distributive lattice. Which of the following is/are ... D as per the solution my doubt is a lattice can be semi bounded and not Bounded then why S1 is true.

Consider statements:S1 : A finite lattice is always bounded.S2 : Complemented lattice is a proper subset of bounded lattice.S3 : A bounded and complemented lattice may or...

ashish pal

1.5k views

ashish pal asked Jan 12, 2018

2 votes

1 answer

27

MadeEasy Test Series 2018: Digital Logic - Min Sum Of Products Form
A switching function of four variable, is equal to the product of two other functions f1and f2, of the same variable, i.e. f = f1 f2. The function f and f1 are as follows: The number of full specified function, that will satisfy the given condition, is

A switching function of four variable, is equal to the product of two other functions f1and f2, of the same variable, i.e. f = f1 f2. The function f and f1 are as follow...

mohit kumar 5

1.0k views

mohit kumar 5 asked Jan 12, 2018

2 votes

1 answer

28

MadeEasy Test Series 2018: Algorithms - Graph Algorithms
Consider the following graph and sequences given below : Given answer for no of DFS traversal was 2 : S1 and S2. How S2 is a DFS traversal ?

Consider the following graph and sequences given below :Given answer for no of DFS traversal was 2 : S1 and S2.How S2 is a DFS traversal ?

sumit chakraborty

438 views

sumit chakraborty asked Jan 11, 2018

4 votes

0 answers

29

MadeEasy Test Series 2018: Theory of Computation - Turing Machine
Consider the following language over Σ = {0, 1}:L = {<M>|M is TM that accept all strings of length at most 5} Which of the following is true? (A) Decidable and REC (B) Undecidable and RE (C) Undecidable and non RE (D) Decidable but RE

Consider the following language over Σ = {0, 1}:L = {<M>|M is TM that accept all strings of length at most 5}Which of the following is true?(A) Decidable and REC(B) Unde...

Bhavya Bhatia

2.4k views

Bhavya Bhatia asked Jan 11, 2018

8 votes

2 answers

30

MadeEasy Test Series 2018: Graph Theory - Graph Coloring
Consider the following graph: Which of the following will represents the chromatic number of the graph? answer given is 4. Please provide a detailed solution.

Consider the following graph: Which of the following will represents the chromatic number of the graph?answer given is 4.Please provide a detailed solution.

kapilbk1996

767 views

kapilbk1996 asked Jan 11, 2018

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