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

0 votes

1 answer

#made esay test
why bonded wait is possible

asked 6 hours ago in Operating System by amit166 (113 points) | 3 views

0 votes

1 answer

MULTIPLE SUBJECT : ALGORITHMS + PROGRAMMING AND DATA STRUCTURES (GATE - 2020) - QUESTION 27

asked 8 hours ago in Algorithms by Pratyush Priyam Kuan (392 points) | 8 views

0 votes

0 answers

Madeeasy Test Series 2020 DBMS
Consider the following schedule which involves three transaction: T1 T2 T3 R(X) R(Y) R(Y) W(X) W(X) R(Z) W(X) Assume the time stamp of transactions are (5,2,4) respectively. Which of the above statement is true about the ... schedule is allowed under Thomas write rule but not basic time stamp. The schedule is not allowed under basic time stamp and Thomas write rule.

asked 12 hours ago in Databases by scholaraniket (6 points) | 6 views

0 votes

0 answers

made easy single subject DBMS
can anyone tell how the answer is 3 thank you

asked 2 days ago in Databases by Pratyush Priyam Kuan (392 points) | 12 views

+1 vote

0 answers

Made easy test series : Dijkstra's algorithm
For the below graph Dijkstra's algorithm does not provide correct shortest path tree. Suppose a new graph that is different only in the weight between D-H is created. Find the number of values of edge (D-H) that ensures that dijkstra's ... ∈ [-20, 20] and A is the source vertex ________. Can some plz provide explaination and answer for above question.

asked 2 days ago in Algorithms by vishal burnwal (58 points) | 10 views

0 votes

0 answers

Made easy test series : Routers
Which of the following statement is false to deploy a router? A) All the interface of the router must belong to same network. B) Routers are by default broadcast domain separator. C) The ethernet interface and the LAN must belong to the same network. D) Router is not a multi protocol device. Can someone explain point (D).

asked 2 days ago in Computer Networks by vishal burnwal (58 points) | 4 views

0 votes

0 answers

Made easy test series : Process scheduling
Consider the following set of processes that need to be scheduled on a single CPU. Operating system uses preemptive shortest remaining time first algorithm. (Ties are broken by using FCFS) What is the average waiting time (ms) and ... have their own devices, consider only CPU times as burst time). Can someone plz provide answer for above question.

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

0 votes

0 answers

Made Easy: Algorithms
Consider a recursive merge sort implementation that calls insertion sort on sublists which are smaller than some threshold. If there are n function calls in merge sort, how many calls will be there in insertion sort? n+1 log n log n + n $\left \lceil \frac{n}{2} \right \rceil$

asked 2 days ago in Algorithms by Sambhrant Maurya (290 points) | 4 views

0 votes

0 answers

Made Easy Test: Algorithms
What is the TC of the following? int i,j,k,m=0; for(i=1;i<n;i++){ for(j=1;j<i*i;j++){ if (j%i==0) for(k=1;k<j;k++) m=m+1; } }

asked 2 days ago in Algorithms by Sambhrant Maurya (290 points) | 10 views

0 votes

0 answers

made easy 2019 test series
T or F? Dijkstra shortest path algorithm on unweighte graphs runs in linear time when data structure is queue. i believe its true,as if its unweighted we need no sorting..its kind of bfs and we can put all vertices in queue as we discover them … correct if i am wrong...ASAP THANK YOU.

asked 2 days ago in CO & Architecture by blackcloud (8 points) | 2 views

0 votes

0 answers

Made easy test series: Flow control
Calculate the total time (in sec) required to transfer a 1000 Kbits file assuming an RTT of 100 ms, packet size of 1 KB and initial delay of twice of RTT for “handshaking” before data is sent. Bandwidth is 1.5 Mbps and time gap between any two consecutive packets is RTT ________. [Upto 2 decimal places] Please provide solution for above question.

asked 2 days ago in Computer Networks by vishal burnwal (58 points) | 6 views

0 votes

1 answer

Made easy test series : Cache
A byte addressable computer has a small data cache capable of holding 16 32-bit words. Each cache block consist of four 32 bit words. For the following sequence of addresses (in hexadecimal). The miss ratio if 4-way set associative LRU cache is used ... 100, 104, 108, 104, 107, 108, 105, 102, 108, 103 Please provide correct explaination and answer for above question.

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

0 votes

0 answers

Made easy test series : Transactions
Please give answer for above Question.

asked 2 days ago in Databases by vishal burnwal (58 points) | 8 views

0 votes

0 answers

Made Easy Test Series: Algorithms
Consider the following recurrence relation: What is the time complexity? I know the $n$ = $2^{m}$, T($2^{m}$) = S(m) method, but I think it’s not working here. Please solve it.

asked 3 days ago in Algorithms by Sambhrant Maurya (290 points) | 15 views

0 votes

0 answers

madeeasy databases
Consider a relation with following functional dependencies R(a, b, c, d) F = (ab -> cd ,ac->bd) Number of following relation schemas might be the result of BCNF normalization preserving both functional dependency and lossless join is 1)R(a, b, c) and R(a,b,d) 2)R (a, b). R(a,c) and R(c,b). 3) R(a, b, c, d) please explain if 1) is dependency preserving decomposition ?

asked 3 days ago in Databases by TUSHAR_BHATT (17 points) | 11 views

0 votes

0 answers

madeeasy set theory
What is the meaning of symmetric relations are closed under complementation ..?Please cite an example..

asked 3 days ago in Set Theory & Algebra by TUSHAR_BHATT (17 points) | 9 views

0 votes

0 answers

#test series lattice
Q.Let S=(0,1) and defined the partial order relation on R S*S as follows ((a,b)R(c,d) if (a<c)or(a=c and b<=d)) Draw hasse digram

asked 5 days ago in Set Theory & Algebra by amit166 (113 points) | 4 views

+2 votes

0 answers

MadeEasy Test Series - Worst case height in Binary tree

asked 5 days ago in Algorithms by luc_Bloodstone (27 points) | 14 views

0 votes

0 answers

Applied course test series : Context free grammar
A) I and II only B) II and III only C) I and III only D) I,II and III Please give answer and explaination for above question.

asked 6 days ago in Theory of Computation by vishal burnwal (58 points) | 13 views

0 votes

1 answer

MADE EASY: GATE 2020 COMPILERS
Consider the following grammarsG1 and G2 G1: S→ aS | ε G2: S→Sa | ε Select the correct option. 1. G1 and G2 generate different parse tree for all strings. 2. L(G1) ≠ L(G2). 3. G1 is LR(0) while G2 is not LR(0) 4. G2 is LR(0) while G1 is not LR(0)

asked 6 days ago in Compiler Design by Debapaul (310 points) | 19 views

0 votes

1 answer

Made Easy: CD
How many states are there in LR(0) parsing of the following grammar $E→ E+T / T$ $T→ T*F / F$ $F→ (E)/id$

asked 6 days ago in Compiler Design by Debapaul (310 points) | 15 views

0 votes

0 answers

Made easy test series : Run time environment
Plz answer the above question.

asked 6 days ago in Compiler Design by vishal burnwal (58 points) | 7 views

0 votes

0 answers

Made easy test series : Set theory and relations
Let R be an equivalence relation on a set S with n equivalence classes S1, S2, …., Sn such that Then the cardinality of R when n = 5, is equal to _________. Plz can someone explain the question.

asked 6 days ago in Set Theory & Algebra by vishal burnwal (58 points) | 29 views

0 votes

0 answers

Made easy test series : Binary Search Tree
A binary search tree with n nodes is constructed. Along with the key each node stores the no. of elements in the sub tree rooted at that node . We have given two elements a and b ,such that a<b . What will be the no. of comparisons and addition ... n) C.) O(log n) and O(loglog n) D.) O(n) and O(n) Plz explain above question and give solution.

asked Dec 5 in DS by vishal burnwal (58 points) | 8 views

0 votes

0 answers

Made easy test series 2020- Finite Automata
A) None of the above B) I & II only C) I & III only D) All of the above What is the correct answer for above question ,Plz explian?

asked Dec 5 in Theory of Computation by vishal burnwal (58 points) | 12 views

0 votes

1 answer

Made easy test series : Decidability
Can some one explain (IV) is decidable or not?

asked Dec 5 in Theory of Computation by vishal burnwal (58 points) | 18 views

0 votes

0 answers

Made easy test series : Threads
Consider the following statements given below: S1 : User-level thread switching does not require context switching. S2 : Virtual memory increases the context switching overhead. S3 : Every thread has its own registers and stack but not program counter. ... is that how S1 is true because even user level thread switching requires context switching. Am i right or wrong?

asked Dec 4 in Operating System by vishal burnwal (58 points) | 9 views

0 votes

0 answers

Made easy test series: SQL
For above question my doubt is that how can query 1st can be correct because it may give same supplier name two times if he had submitted more than one ‘Harvest’ brand item. Plz clear my doubt.

asked Dec 3 in Databases by vishal burnwal (58 points) | 14 views

0 votes

0 answers

Made easy test series : Probability
Plz give explaination of above question.

asked Dec 3 in Probability by vishal burnwal (58 points) | 14 views

0 votes

0 answers

Made easy test series: Cache
Consider a single level cache with an access time of 6 ns, line size of 64 bytes and the hit ratio of 0.8. Main memory uses a block transfer capability that has a first word(8 bytes) access time of 40 ns and 15 ns for each ... cache waits until the line has been fetched from main memory and reexecutes for a hit) Plz provide explaination and answer for above question.

asked Dec 2 in CO & Architecture by vishal burnwal (58 points) | 13 views

0 votes

0 answers

Madeeasy computerorganization test series
Can someone please give solution to this problem Thank you

asked Nov 30 in CO & Architecture by Pratyush Priyam Kuan (392 points) | 7 views

0 votes

0 answers

Made Easy Test Series 2020: DBMS
It retrieves employees whose age is greater than 20 and work for all projects named data science. It retrieves employees whose age is greater than 20 and work for some project named data science It retrieves employees whose age is greater than 20 and work for ... 'm getting B but they've given A as answer. Can anyone please verify if A is correct? If yes then how?

asked Nov 29 in Databases by Sambhrant Maurya (290 points) | 12 views

0 votes

1 answer

Madeeasy Test series - time complexity
What is the time complexity of foo() and bar() ? I solved it and get ans correct for foo(), but for bar() I am getting wrong ans, for bar(): T(n) = 2T(n-1) + c; c is constant I solved it and get this: T(n) = 2^(n-1) * 3^n ... bar() is T(n) = O(2^n), I don't understand how they get this. Is my recurrence equation is wrong or something else, please solve this.

asked Nov 29 in Algorithms by luc_Bloodstone (27 points) | 23 views

0 votes

1 answer

Made Easy Test Series:DS
The number of min heaps possible with 15 distinct elements such that every leaf node is greater than all the non-leaf nodes are ______

asked Nov 27 in DS by Sambhrant Maurya (290 points) | 39 views

0 votes

0 answers

Made Easy Test Series DS
The number of BSTs possible with 6 nodes numbered 1,2,3,4,5,6 with exactly one leaf node are _______

asked Nov 27 in DS by Sambhrant Maurya (290 points) | 39 views

0 votes

1 answer

MadeEasy Test Series - Calculate time complexity
What is the time complexity of below function? Can we able to solve it by Masters Theorem?

asked Nov 25 in Algorithms by luc_Bloodstone (27 points) | 27 views

0 votes

0 answers

MadeEasy Test Series - Question on array of pointers

asked Nov 25 in Algorithms by luc_Bloodstone (27 points) | 32 views

0 votes

0 answers

asked Nov 20 in Theory of Computation by Dipanshu Rana (24 points) | 34 views

0 votes

0 answers

Made easy test series Que1
$\mathbf X = 2000$ and an integer is $4\mathbf B$ I attempted this question like: for $\mathbf {X+3}$ It will cross $3$ rows and same for second In last it will cross $2$ rows and then $3$ columns. Is my technique right?

asked Nov 18 in Programming by `JEET (164 points) | 32 views

0 votes

0 answers

MADE EASY DMATHS 2020

asked Nov 18 in Mathematical Logic by Debapaul (310 points) | 9 views

Page:

1
2
3
next »

2,317 questions

1,294 answers

6,600 comments

89,719 users