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

0 votes

0 answers

asked 9 hours ago in Digital Logic by Chirag Shilwant (159 points) | 11 views

+1 vote

0 answers

Made easy test series : Normalization
if every candidate key of R is simple candidate key and no non trivial functional dependency like non-prime attribute-->other non-prime attribute exists then R also in BCNF. Whether the above given statement is true or false?

asked 15 hours ago in Databases by vishal burnwal (119 points) | 13 views

0 votes

0 answers

Made Easy test series os multi subject synchronization

asked 1 day ago in Operating System by Ram Swaroop (155 points) | 5 views

0 votes

0 answers

operatingSystem deadlock
how no mutual exclusion is there? and also Deadlock one of the necessary condition is Mutual exlcusion.

asked 2 days ago in Operating System by kalra05 (37 points) | 8 views

0 votes

0 answers

Made easy test series : Process scheduling SRTF
Consider the following set of process: Operating system uses preemptive shortest remaining time first algorithm, average waiting time ________ (ms). (Upto 1 decimal places) [Ties are broken with lowest process ID number] Note: (i) Consider only ... . (iii) I/O of the process can be done parallelly. Can someone provide gantt chart for above question?

asked 2 days ago in Operating System by vishal burnwal (119 points) | 13 views

0 votes

1 answer

Made easy test series : Pipelining concept
Consider the following 4-stages instruction pipeline where different instructions are spending different amount of time at different stages. Following loop is executed in the pipeline: How many cycles are required for above execution?

asked 2 days ago in CO & Architecture by vishal burnwal (119 points) | 21 views

0 votes

0 answers

ME CBT How is "A" regular?

asked 3 days ago in Theory of Computation by toxicdesire (215 points) | 28 views

0 votes

1 answer

The maximum value of the minimum degree in connected planar bipartite graph is ____?

asked 3 days ago in Mathematical Logic by smosh (6 points) | 31 views

0 votes

0 answers

Made Easy test series coa cache memory t2 16
Suppose that a processor has access to three levels of memory. Level 1 contain 2000 words and has an access time of 0.02 msec. Level 2 contain 10,000 words and has an access time of 0.2 msec. Level 3 contains 20,000 words and has an access time ... The hit ratio for level 1 is 0.65 and for level 2 is 0.45. The average access time (in μsec) is ________.

asked 3 days ago in CO & Architecture by Ram Swaroop (155 points) | 40 views

0 votes

0 answers

Made Easy test series coa cache mapping single subject 33

asked 3 days ago in CO & Architecture by Ram Swaroop (155 points) | 29 views

0 votes

0 answers

Made easy test series :Algorithms
What is the time complexity of Merge sort if no extra array is available while combining ?

asked 4 days ago in Algorithms by Chirag Shilwant (159 points) | 8 views

0 votes

0 answers

Self doubt coa clock frequency
Memory cycle for immediate mode should be 0 is it correct? Consider 1GHz clock frequency processor,uses different operand accessing models shown below: Operand Accessing ModeFrequency(%) Register10 Immediate20 Direct30 Memory Indirect20 ... -series-co-%26-architecture-clock-frequency https://gateoverflow.in/25891/memory-addressing Please check above questions

asked 4 days ago in CO & Architecture by Ram Swaroop (155 points) | 8 views

0 votes

1 answer

Made Easy Test Series -DBMS
Now given an instance of a schema we cant conclude whether A functionally determines B for the entire relation itself as $A\rightarrow B$ holds for this instance, but it might not hold for the entire schema. But we can conclude this for sure that B doesn’t functionally determine C. So the given 2 statements are not correct. Am I, right?

asked 5 days ago in Databases by Rishav_Bhatt (13 points) | 7 views

0 votes

1 answer

Made Easy test series coa cache memory access time

asked 5 days ago in CO & Architecture by Ram Swaroop (155 points) | 23 views

0 votes

0 answers

Ace test series : Programming and Data Structure

asked 5 days ago in Programming by Chirag Shilwant (159 points) | 9 views

+1 vote

0 answers

Made easy Test series-Quicksort
How much time it will take to sort n numbers by quicksort if some arbitrary algorithm takes (n2) time to choose pivot?

asked 5 days ago in Algorithms by Rishav_Bhatt (13 points) | 38 views

0 votes

0 answers

Made easy test series : Ethernet
The length of cable for standard ethernet is 2500m. What would be length of cable for fast gigabit ethernet i.e. 1000baseT in order to maintain same size is ________. Can someone explain ,how to solve above question?

asked 5 days ago in Computer Networks by vishal burnwal (119 points) | 12 views

0 votes

0 answers

madeeasy Ccomputer Networks
Assume there are 50 nodes are connected to a 1 km length of the coaxial cable. Using some protocol, each node can transmit 50 frames/second, where the average frame length is 3000 bits. The transmission rate at each node is 100 Mbps. The percentage efficiency of this protocol is ________.

asked 5 days ago in Computer Networks by suchithreddy (7 points) | 8 views

0 votes

0 answers

Made Easy FUll length Test
Consider the following statements: I. Synchronous bits are not treated as the part of data in synchronous transmission. II. With absence of DHCP server using IPv6 protocol is not possible. Which of the above statement(s) is/are not true? Only I Only II Both I and II Neither I nor II Anyone please clarify.

asked 5 days ago in Computer Networks by Shivateja MST (96 points) | 11 views

0 votes

0 answers

ME Test Propagation Delay

asked 6 days ago in Digital Logic by kashyap02 (11 points) | 9 views

0 votes

1 answer

Made easy test series : SQL
Consider the following relations: Which of the following query gives suppliers names who have submitted at least one Harvest' brand item? (sno in item is the foreign key referencing sno in supplier). I. Select sname FROM Supplier S, Item t where t.brand ... S where sno IN (Select sno FROM Item where brand = Harvest') What will be the correct answer for above question?

asked 6 days ago in Databases by vishal burnwal (119 points) | 14 views

0 votes

1 answer

MADE EASY ADVANCE COMPILERS
Consider the grammar which is $not$ $LL(1)$ as the $LL(1)$ table contain multiple error entries for the same The number of entries have multiple production in LL1 are?

asked 6 days ago in Compiler Design by Debapaul (620 points) | 22 views

0 votes

0 answers

MADE EASY ADVANCE: DSA
HOW TO APPROACH IN A LESS TIME CONSUMING WAY?

asked 6 days ago in Programming by Debapaul (620 points) | 15 views

0 votes

0 answers

Made easy test series : TCP congestion window
Let the size of congestion window of TCP connection be 38 KB when a timeout occurs. The propagation time of the connection is 100 msec and the maximum segment size used is 2 KB. The time taken (in sec) by the TCP connection to get back to 37 KB congestion window is ______ What is the correct answer for above question?

asked Jan 14 in Computer Networks by vishal burnwal (119 points) | 24 views

0 votes

1 answer

MADE EASY ADVANCE LEVEL DIGITAL
$\sum m(2,3,6,7)$ $\sum m(0,1,2,3)$ $\sum m(0,1,4,5)$ $\sum m(4,5,6,7)$

asked Jan 13 in Digital Logic by Debapaul (620 points) | 17 views

0 votes

0 answers

Made aesy test series : Data dependency
Consider the following sequence of assembly code: The number of data hazards in the above code are _______. What will be the correct answr for above question?

asked Jan 13 in CO & Architecture by vishal burnwal (119 points) | 9 views

0 votes

0 answers

MADE EASY CN ADVANCE
Suppose a TCP message that contains 900B of data and 20B of TCP header is passed to IP code at host A for delivery to B. IP header is 20B Assume that link A-R1 has maximum frame size of 1024B including 14B frame header, link R1-R2 can support maximum ... length of the last fragments at each of the 3 three links respectively are 920 440 400 960 460 440 960 460 460 940 460 460

asked Jan 13 in Computer Networks by Debapaul (620 points) | 20 views

0 votes

0 answers

MADE EASY ADVANCE DBMS
This is not conflict serializable, so 1 false This schedule is allowed under Thomas write rule, so view serializable (as thomas write rule gaurantess view serializibility) Not strict , but recoverable So $2$ and $4$ are correct right?

asked Jan 13 in Databases by Debapaul (620 points) | 32 views

0 votes

0 answers

MADE EASY FLT: ADVANCE DIGITAL LOGIC
A boolean function $f(A,B,C)=AB’C$ is being implemented using minimum number of $2$ $input$ $NOR$ gates.Each gate is having a propagation delay of $2ns$.What is the overall delay of the circuit? I face a lot of difficulty in solving these types of problems. How to be certain that the circuit u designed contains minimum number of gate?

asked Jan 13 in Digital Logic by Debapaul (620 points) | 31 views

0 votes

0 answers

ME test series hazards
They are taking only adjacent onces, they haven't taken I1-I3 and I2-I4 RAW hazards. Someone kindly say what is the standard thing to follow concerning Gate. Should we take non-adjacent ones?

asked Jan 12 in CO & Architecture by sladewinter (7 points) | 15 views

0 votes

1 answer

Made Easy Cache memory
Consider the cache memory that is 30 times faster than main memory and used 90% of the total time. What is the speedup gain by the cache memory?

asked Jan 12 in CO & Architecture by Deterministic (12 points) | 24 views

+2 votes

0 answers

MADE EASY TEST: BIPARTITE GRAPH
Maximum value of the minimum degree in a connected planar bipartite graph is ?

asked Jan 12 in Graph Theory by Debapaul (620 points) | 56 views

+1 vote

2 answers

MADE EASY FLT ADVANCE
What is the time complexity? $\theta(n^2)$ $\theta(nlogn)$ $\theta(n)$ $\theta(n^2logn)$ Shouldn’t the ans be $\theta(nlogn)$ as the recurence is nothing but $T(n)=T(n-1)+f(n)$ and f(n) is $\theta(logn)$ right? so $\theta(n*f(n))$ $\theta(nlogn)$

asked Jan 11 in Programming by Debapaul (620 points) | 108 views

+4 votes

0 answers

MADE EASY: AUTOMATA GATE 2020
The number of languages that are $Regular?$ is ________ $xyzyx $ $| x,y,z=\sum ^*$ $xyzyx$ $|x,z=\sum^* ; y=\sum^+$ $xyzyx^r$ $|x,z=\sum^* ; y=\sum^+$

asked Jan 11 in Compiler Design by Debapaul (620 points) | 22 views

0 votes

0 answers

made-easy advance test 8
#include <stdio.h> int fun(int,int); typedef int (*pf) (int ,int); int proc (pf, int , int); int main(){ printf(“%d\n”,proc(fun,6,6)); return 0;} int fun(int a,int b){ return (a==b); } int proc(pf P,int a,int b){ return ((*P)(a,b)); } output of program is?

asked Jan 10 in Programming by abhinav649 (59 points) | 25 views

0 votes

1 answer

MADE EASY FLT: GRAPH THEORY
What is the $cardinality$ of the $largest$ $independent$ $set$ of this graph?

asked Jan 10 in Graph Theory by Debapaul (620 points) | 28 views

0 votes

1 answer

MADE EASY SELF DOUBT : FLT 3 2020
Let $D_n$ represents the set of all positive divisors of $n$. Also $/$ stands for the usual divides relation. It is known that $(D_3$_3$_0$_*$_k,/)$ is a Boolean Algebra where is $k$ an integer. Which of the following cannot be a possible value of $k?$ 11 29 13 97

asked Jan 10 in Set Theory & Algebra by Debapaul (620 points) | 25 views

+3 votes

0 answers

MADE EASY SELF DOUBT : AUTOMATA
Consider the following languages $L_1$ and $L_2$ $L_1=\{a^mb^n|m,n \ge$ 0\}$ $L_2=\{a^mb^n|m=n\}$ if $(L_1 \cup \overline{L_2})=L$, then what is the language $L?$

asked Jan 10 in Theory of Computation by Debapaul (620 points) | 42 views

0 votes

0 answers

Made easy test series flt1 probability
Consider the set X = {1 ,2, 3 …. 15}. Two elements ‘a’ and ‘b’ are chosen at random from S. The probability that the elements chosen satisfy a + b = 16 is equal to ________. (Upto 2 decimal places)

asked Jan 10 in Probability by Ram Swaroop (155 points) | 22 views

0 votes

1 answer

Made Easy Full Length Test 1

asked Jan 9 in Digital Logic by Dheeraj Varma (8 points) | 53 views

Page:

1
2
3
4
...
6
next »

3,036 questions

1,524 answers

9,070 comments

89,821 users