Recent questions tagged made-easy-test-series - GATE CSE Doubts

0 votes

0 answers

Made Easy Test Series
Consider 2 MBPS I/O device interfaced to 64 bit CPU in a programmed-I/O mode. Data transmission between the CPU and I/O in word-wise. Interrupt overhead is 3 μ/sec. What is the performance gain when the device is operating under interrup-I/O over programmed-I/O mode? A)2 B)2.5 C)1.33 D)2.66

asked 13 hours ago in CO & Architecture by arpit_18 (7 points) | 3 views

0 votes

0 answers

asked in made easy test series
Kindly explained this in detailed way, like why particular steps will come and reason behind it.

asked 17 hours ago in CO & Architecture by prakhar123 (6 points) | 12 views

0 votes

0 answers

deadlock in databases
my question is isn’t wait wound and wait die deadlock prevention algo so how can we say that they are deadlock avoidance and how they can cause more aborts than needed?

asked 6 days ago in Databases by abcd9982 (8 points) | 4 views

0 votes

0 answers

transactions
a) S with no dirty read then S is cascadeless rollback but may not be strict recoverable b) S with no dirty read then S is recoverable but may not be cascadeless rollback c) S with no dirty read then S is conflict serializable schedule d) S with no dirty read then S is strict recoverable

asked Jun 24 in Databases by abcd9982 (8 points) | 42 views

0 votes

0 answers

made_easy_test_series

asked Jun 24 in Databases by abcd9982 (8 points) | 12 views

0 votes

0 answers

MADE EASY TS
I there are 13 flip-flops used is PISO shift register circuit, then maximum number of clock cycles required to get the serial output is _____ ?

asked Jun 9 in Digital Logic by ummokkate (64 points) | 9 views

0 votes

0 answers

MADE EASY TS
The decimal value of the 2’s complement binary number 11101111110.0010 is ________? I got -130.125, but answer is something else.

asked Jun 9 in Digital Logic by ummokkate (64 points) | 9 views

0 votes

0 answers

programing and data structure
Please someone explain this problem.I am not able to understand.

asked Jun 9 in Programming by anonymous27 (6 points) | 15 views

0 votes

0 answers

MADE EASY TS
Here my doubt is that when we get the equation of y = S1’S0’I0 + S1’S0I1 + S1S0’I2 + S1S0I3, given I0, I3 are S1 and I1, I2 are S0 so when we will substitute them, will be substitute y = S1’S0’S1 + S1’S0S0 + S1S0’IS0+ S1S0S1 or will we substitute y = S1’S0’S1’ + S1’S0S0 + S1S0’S0’+ S1S0S1 according to the value of select lines. I’m a bit confused.

asked Jun 8 in Digital Logic by ummokkate (64 points) | 12 views

0 votes

1 answer

MADE EASY TS
A function f(x,y,z) = x XNOR y XNOR z = 1, then which of the following is always true? x + yz =1 x not equal to (y XOR z) x.y.z =1 x = y XNOR z I’m getting both option b and option d.

asked Jun 8 in Digital Logic by ummokkate (64 points) | 22 views

0 votes

0 answers

MADE EASY: CHAPTER: DIVIDE AND CONQUER
Find the average number of comparisons in a binary search on a sorted array of 10 consecutive integers starting from 1. (a) 2.6 (c) 2.8 (b) 2.7 (d) 2.9

asked Jun 6 in Algorithms by Debanil (11 points) | 7 views

0 votes

0 answers

computer networks
For a class C network if Ip address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224 the decimal value of lost octet of lost host of sixth subnet is ________?

asked Jun 4 in Computer Networks by Taraka (6 points) | 5 views

0 votes

0 answers

Made Easy Test Series
https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=12844912915578520272

asked May 21 in Databases by Rajeev-Dubey (6 points) | 12 views

0 votes

0 answers

madeeasy workbook question of programming methodology

asked May 9 in Programming by Vikramaditya19 (6 points) | 12 views

0 votes

0 answers

ME test series FLT
In Made Easy solution they have taken Fetch-Decode and Execute stage separately. But why they should consider that? I think their solution not correct. right??

asked Feb 7 in CO & Architecture by srestha (749 points) | 64 views

0 votes

0 answers

Made Easy FLT
If we do it with stirling approximation , then ans 301, but that is not correct according to ans key. But why cannot we solve it stirling approximation?? What is wrong in it??

asked Feb 6 in Mathematical Logic by srestha (749 points) | 36 views

0 votes

1 answer

Made aesy test series : BFS
Consider the following graph: The minimum size of queue required when performing BFS on above graph is ________. (Take size of queue as by maximum number of elements at any time). What will be the correct answer for the foolowing question?

asked Feb 5 in DS by vishal burnwal (135 points) | 47 views

0 votes

0 answers

Made Easy Test Series 2020 Computer Networks
For a class C network if IP address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224, the decimal value of the last octet of last host of sixth subnet is ____?

asked Feb 5 in Computer Networks by rohit090893 (10 points) | 59 views

0 votes

0 answers

MADE EASY : DMA CYCLE STEALING
An $8-Bit$ DMA Device is operating is Cycle Stealing Mode (Single Transfer Mode). Each DMA cycle is of $6$ clock states and DMA clock is $2$ $MHZ$. Intermediate CPU machine cycle takes $2 μs$, the DMA Data Transfer Rate is ?

asked Feb 3 in CO & Architecture by Debapaul (699 points) | 45 views

0 votes

1 answer

Algorithms, complexity
Assume we have n number of unsorted list is given. Each list containing m integers such that n>m. What will be the time to sort in a single list ? Ans given: O(m x nlogn)

asked Feb 2 in Algorithms by dhairya16 (6 points) | 42 views

0 votes

0 answers

Made Easy Test Series Discrete Mathematics
Let a graph G has 5 vertices and here are 3 vertices of degree 2 , one vertex of degree 1 and remaining vertex of degree 3. The complement of G is: Connected Disconnected Either (a) or (b) None of the above

asked Feb 2 in Mathematical Logic by rohit090893 (10 points) | 54 views

0 votes

0 answers

MADE EASY: COMBINATORICS
The number of ways can $5$ letter be put in $3$ boxes $A$,$B$,$C$, such that $A$ contains atleast $2$ letters is __________ ?

asked Jan 31 in Combinatory by Debapaul (699 points) | 62 views

+1 vote

0 answers

MADE EASY: FRAGMENTATION
In the given network, station $A$ wish to sends a payload of $1600B$ from its $network$ $layer$ to station $B$. If fragmentation is done then, the actual data size to be transmitted is? My approach, the first network has an MTU of $1500B$ therefore ... arrive at $B$ and each has a header of $20B$, so total data size is $1700B$ Is my understanding and explanation correct?

asked Jan 31 in Computer Networks by Debapaul (699 points) | 43 views

0 votes

0 answers

made easytest series
can some give explain why option B is correct?

asked Jan 29 in Algorithms by v.singhal7040 (7 points) | 16 views

0 votes

0 answers

Mathematics ME Test series
Ques:- What is the number of partition of X = {a, b, c, d, e, f} where a and c are always in same block? - 15 - 52 - 203 - None of these

asked Jan 29 in Set Theory & Algebra by kashyap02 (26 points) | 21 views

0 votes

0 answers

Made Easy test series -CN
Consider two nodes A and C at a distance 2000m. Suppose station A starts sending a long frame at time t1=0; station C starts sending a long frame at time t2= 3 microseconds. Find the number of bits station A has sent before detecting the collision? Assume, data rate as 10 Mbps and propagation speed 2*10^8 m/s. A) 70 bits B) 65 bits C) 130 bits D) 140 bits

asked Jan 28 in Computer Networks by Rishav_Bhatt (16 points) | 54 views

0 votes

0 answers

Made Easy Testseries CD

asked Jan 28 in Compiler Design by Dheeraj Varma (22 points) | 25 views

0 votes

0 answers

Find Number of Tokens
Anyone please clarify.

asked Jan 27 in Compiler Design by Shivateja MST (127 points) | 39 views

0 votes

0 answers

Made Easy Test OS
Can a process have bounded waiting and progress even if it has a possibility of deadlock?

asked Jan 27 in Operating System by tamaldeepmaity (17 points) | 11 views

0 votes

0 answers

Made Easy test series computer network window size

asked Jan 27 in Computer Networks by Ram Swaroop (309 points) | 29 views

0 votes

0 answers

Madeeasy test series - Number of strings present

asked Jan 26 in Theory of Computation by luc_Bloodstone (38 points) | 28 views

0 votes

0 answers

Made Easy test series algorithm complexity occurance of element more than 2n/3 times

asked Jan 26 in Algorithms by Ram Swaroop (309 points) | 34 views

0 votes

0 answers

Made Easy test series graph theory
A graph G with n vertices is said to be a void graph if and only if there’s no edge between any pair of vertices belonging to G. Let X be a void graph on 2^k + 1 vertices. Then if it is known that the minimum number of edge insertions required in the best case in order to make it connected is equal to 512, then the value of k^1/2 is equal ...

asked Jan 26 in Graph Theory by Ram Swaroop (309 points) | 31 views

0 votes

0 answers

Madeeasy testseries TOC

asked Jan 25 in Theory of Computation by Dheeraj Varma (22 points) | 81 views

0 votes

0 answers

FULL SYLLABUS TEST-6 (ADVANCE LEVEL) GATE 2020 question 61

asked Jan 25 in Programming by Pratyush Priyam Kuan (804 points) | 28 views

0 votes

0 answers

Made easy OS full length
How no mutual exclusion occurs?

asked Jan 25 in Operating System by Jyoti Kumari97 (27 points) | 21 views

0 votes

0 answers

made easy testseries DB
How to solve this question?

asked Jan 25 in Databases by Dheeraj Varma (22 points) | 21 views

0 votes

0 answers

Self Doubt: MADE EASY TLB
The virtual address generated by a CPU is $36 bits$, the Translation Look-aside Buffer (TLB) can hold $512$ $entries$ and a $8-way$ set associative, page size is $4 KB$ the size of the TLB tag is ________. Though I have solved the above ... ans $18$. But I have confusion regarding the above questions that I have asked. It will be very helpful if the reader can help.

asked Jan 25 in CO & Architecture by Debapaul (699 points) | 55 views

0 votes

0 answers

Made Easy test series algorithm complexity
Given an array S containing n real numbers, and a real number We want to find any two elements p and q in the array such that their sum is greater than the real number What is the best possible time complexity to find p and q ? O(1) O(n) O(n log n) O(n^2logn)

asked Jan 24 in Algorithms by Ram Swaroop (309 points) | 23 views

0 votes

1 answer

Made easy test series, DLD-Counters
How is it mod-5 counter?please explain

asked Jan 24 in Digital Logic by Dheeraj Varma (22 points) | 85 views

Page:

1
2
3
4
...
7
next »

7,525 questions

1,776 answers

10,835 comments

90,464 users