Dark Mode

Recent questions tagged madeeasy-testseries-2018

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

Gurdeep Saini asked in Databases Jan 16, 2019

by Gurdeep Saini

593 views

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 ?

Na462 asked in Computer Networks Dec 2, 2018

by Na462

1.2k views

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

kapilbk1996 asked in Digital Logic Nov 1, 2018

1.3k views

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

Sambhrant Maurya asked in Computer Networks Sep 23, 2018

by Sambhrant Maurya

2.5k views

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.

MiNiPanda asked in DS Jan 17, 2018

446 views

1 vote

0 answers

6

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

Sukhdip Singh asked in Theory of Computation Jan 17, 2018

by Sukhdip Singh

350 views

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

ashish pal asked in Operating System Jan 17, 2018

1.3k views

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?

Sukhdip Singh asked in Theory of Computation Jan 16, 2018

by Sukhdip Singh

589 views

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)

Akash Mishra asked in Programming in C Jan 16, 2018

by Akash Mishra

415 views

1 vote

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?

charul asked in Databases Jan 16, 2018

by charul

406 views

1 vote

0 answers

11

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

Kalpataru Bose asked in Algorithms Jan 16, 2018

by Kalpataru Bose

432 views

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)

Harsh Mehta asked in Computer Networks Jan 16, 2018

2.0k views

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?

souravsaha asked in Databases Jan 15, 2018

1.7k views

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.

charul asked in CO and Architecture Jan 15, 2018

by charul

259 views

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.

Rishabh Gupta 2 asked in Programming in C Jan 15, 2018

by Rishabh Gupta 2

660 views

1 vote

1 answer

16

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

Mamta Satywali asked in Programming in C Jan 15, 2018

by Mamta Satywali

344 views

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

ashish pal asked in Digital Logic Jan 15, 2018

1.0k views

2 votes

0 answers

18

MadeEasy Test Series 2018: Computer Networks - Congestion Control

charul asked in Computer Networks Jan 13, 2018

by charul

647 views

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).

yankur9 asked in Operating System Jan 13, 2018

714 views

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.

charul asked in Digital Logic Jan 13, 2018

by charul

650 views

1 vote

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

Prabhat Kumar Sing 1 asked in CO and Architecture Jan 13, 2018

by Prabhat Kumar Sing 1

339 views

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; }

gari asked in Programming in C Jan 13, 2018

by gari

582 views

1 vote

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)

charul asked in Algorithms Jan 12, 2018

by charul

725 views

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?

charul asked in Computer Networks Jan 12, 2018

by charul

337 views

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

ashish pal asked in Databases Jan 12, 2018

877 views

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.

ashish pal asked in Set Theory & Algebra Jan 12, 2018

1.4k views

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

mohit kumar 5 asked in Digital Logic Jan 12, 2018

by mohit kumar 5

999 views

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 ?

sumit chakraborty asked in Algorithms Jan 11, 2018

by sumit chakraborty

421 views

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

Bhavya Bhatia asked in Theory of Computation Jan 11, 2018

by Bhavya Bhatia

2.4k views

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.

kapilbk1996 asked in Graph Theory Jan 11, 2018

754 views

Page:

Recent questions tagged madeeasy-testseries-2018