Recent questions tagged made-easy-test-series

MadeEasy Test Series: Theory Of Computation - Identify Class Language
Finite language Regular DCFL CFL but not DCFL Acc. to solution c) but I think the answer should be b). Here's the reasoning: We're looking for anbmcn $\cap$ axby (x not equal to y) => bm $\cap$ bn (n not equal to 0).

453 views

rahul sharma 5 asked Dec 19, 2016

3 votes

1 answer

1413

Finite languageRegularDCFLCFL but not DCFLAcc. to solution c) but I think the answer should be b). Here's the reasoning:We're looking for anbmcn $\cap$ axby (x not equa...

Kai

398 views

Kai asked Dec 16, 2016

0 votes

1 answer

1414

MadeEasy Test Series: Mathematical Logic - First Order Logic

KISHALAY DAS

1.8k views

KISHALAY DAS asked Dec 15, 2016

1 votes

2 answers

1415

MadeEasy Test Series: Linear Algebra - Eigen Value
can we use some identity to find value of ab+by+ya???without finding its eigen values and then multiplying..earlier i have read it somewhere but i forget it.

can we use some identity to find value of ab+by+ya???without finding its eigen values and then multiplying..earlier i have read it somewhere but i forget it.

Nishant Arora

725 views

Nishant Arora asked Dec 15, 2016

0 votes

1 answer

1416

MadeEasy Test Series: Set Theory & Algebra - Groups
Which of the following is true? Every lower triangular matrix is group under multiplication operation where all elements of diagonal are non zero numbers. Every diagonal matrix is group under multiplication operation, where all elements of ... under addition operation where all elements are real numbers. Both (a) and b) Why is C incorrect?

Which of the following is true?Every lower triangular matrix is group under multiplication operation where all elements of diagonal are non zero numbers.Every diagonal ma...

Kai

846 views

Kai asked Dec 15, 2016

0 votes

1 answer

1417

Made Easy

Lucky sunda

320 views

Lucky sunda asked Dec 15, 2016

1 votes

1 answer

1418

MadeEasy Test Series: Computer Networks - Ethernet
For gigabit ethernet, the length of the cable, if length of the cable in standard ethernet l (2000) to maintain same frame size is _______.

For gigabit ethernet, the length of the cable, if length of the cable in standardethernet l (2000) to maintain same frame size is _______.

Rajesh Raj

945 views

Rajesh Raj asked Dec 15, 2016

1 votes

0 answers

1419

MadeEasy Test Series: Computer Networks - Access Control Methods

Rajesh Raj

323 views

Rajesh Raj asked Dec 15, 2016

6 votes

3 answers

1420

MadeEasy Test Series: Programming & DS - Programming In C

debanjan sarkar

1.2k views

debanjan sarkar asked Dec 15, 2016

0 votes

1 answer

1421

MadeEasy Test Series: Algorithms - Time Complexity
Professor Arjun develops an algorithm to multiply two square matrix that is asmptoticaly faster than strassen's algorithm using divide and conquer method . Arjun's algorithm divide matrix into pieces of $\frac{n}{4} \times \frac{n}{4}$ create $'P'$ ... $P$ is ______-

Professor Arjun develops an algorithm to multiply two square matrix that is asmptoticaly faster than strassen's algorithm using divide and conquer method . Arjun's algori...

Time Complexity
Do we need to solve them by subtituion?I am not able to apply master theorem to anyone of these

695 views

rahul sharma 5 asked Dec 15, 2016

0 votes

1 answer

1422

Do we need to solve them by subtituion?I am not able to apply master theorem to anyone of these

MadeEasy Test Series: Algorithms - Sorting
Let $A$ be a aray containing $n$ distinct integers in unsorted order . The Following Algorithm [code] run on unordered array of $A$ for i=n to 1 max=i for j=i-1 to 1 if A[j] < A[max] max=j temp=a[i] ... code ? Sort unsorted array in Non decreasing order Sort unsorted array in Non increasing order Reverse the order of elements in the array None of these

519 views

rahul sharma 5 asked Dec 15, 2016

0 votes

1 answer

1423

Let $A$ be a aray containing $n$ distinct integers in unsorted order . The Following Algorithm [code] run on unordered array of $A$ for i=n to 1 max=i for j=i-1 to 1 if ...

made Easy compiler test q 10
correct answer

522 views

rahul sharma 5 asked Dec 14, 2016

0 votes

1 answer

1424

correct answer

Vasu_gate2017

320 views

Vasu_gate2017 asked Dec 14, 2016

1 votes

1 answer

1425

MadeEasy Test Series: Algorithms - Graph Algorithms

ME FLT-1 Q-10
i have used hypergeometric distribution but MADE Easy have used binomial theorem..we should use binomial when replacement are done na? my ans.0.6 made easy ans:0.81

1.0k views

rahul sharma 5 asked Dec 13, 2016

0 votes

0 answers

1426

i have used hypergeometric distribution but MADE Easy have used binomial theorem..we should use binomial when replacement are done na?my ans.0.6made easy ans:0.81

Nishant Arora

391 views

Nishant Arora asked Dec 13, 2016

2 votes

3 answers

1427

MadeEasy Test Series: Operating System - File System
A file system with 512 GB disk uses a file descriptor with 16 direct block addresses, 1 indirect block address, 1 doubly indirectly block address and 1 triple indirect block addresses. Size of each disk block is 256 bytes and the size of ... bytes. The maximum possible file size is____________(in MB). Ans: 8.26 but in MadeEasy it is 8 how..?

A file system with 512 GB disk uses a file descriptor with 16 direct block addresses, 1 indirect block address, 1 doubly indirectly block address and 1 triple indirect bl...

Meghashyam Sujay

1.1k views

Meghashyam Sujay asked Dec 12, 2016

2 votes

1 answer

1428

MadeEasy Test Series: Databases - Indexing
A file is organized so that the ordering of data record is same as or close to the ordering of data block in some index. The that index is called a. Dense b. Sparse c. CLustered d. Unclustered

A file is organized so that the ordering of data record is same as or close to the ordering of data block in some index. The that index is calleda. Denseb. Sparsec. CLust...

Akanksha Kesarwani

394 views

Akanksha Kesarwani asked Dec 12, 2016

0 votes

1 answer

1429

MadeEasy Test Series: Algorithms - Sorting
#plz check??

#plz check??

MadeEasy Test Series: Algorithms - Dynamic Programming
#plz check??

340 views

Hradesh patel asked Dec 12, 2016

0 votes

0 answers

1430

#plz check??

MadeEasy Test Series: Algorithms - Time Complexity
#plz check??

249 views

Hradesh patel asked Dec 12, 2016

1 votes

1 answer

1431

#plz check??

MadeEasy Test Series: Programming & DS - Binary Tree
how A and B are different

745 views

Hradesh patel asked Dec 11, 2016

1 votes

0 answers

1432

how A and B are different

MadeEasy Test Series: Compiler Design - Parsing

321 views

Anusha Motamarri asked Dec 11, 2016

1 votes

0 answers

1433

Vineeta Garg

301 views

Vineeta Garg asked Dec 10, 2016

1 votes

1 answer

1434

MadeEasy Test Series: Compiler Design - Grammar
How it is left factored??

How it is left factored??

Vineeta Garg

593 views

Vineeta Garg asked Dec 10, 2016

1 votes

0 answers

1435

MadeEasy Test Series: Theory Of Computation - Grammar
Is this reduction correct .According to me there B should not be there.

Is this reduction correct .According to me there B should not be there.

Vineeta Garg

321 views

Vineeta Garg asked Dec 10, 2016

21 votes

4 answers

1436

MadeEasy Test Series: CO & Architecture - Cache Memory
Suppose that in 250 memory references there are 30 misses in first level cache and 10 misses in second level cache. Assume that miss penalty from L$_2$ cache memory are 50 cycles. The hit time of L$_2$ cache is 10 cycles. The ... with given misses = 1800 stall cycles = 1800-1250 = 550 number of stalls/instruction= 550/200 = 2.75 please verify

Suppose that in 250 memory references there are 30 misses in first level cache and 10 misses in second level cache. Assume that miss penalty from L$_2$ cache memory are 5...

MadeEasy Test Series: Computer Networks - Congestion Control
#plz check???

3.8k views

Anusha Motamarri asked Dec 9, 2016

0 votes

0 answers

1437

#plz check???

MadeEasy Test Series: Theory Of Computation - Decidability
@arjun sir please help how is it recognizable?

451 views

Hradesh patel asked Dec 9, 2016

3 votes

3 answers

1438

@arjun sir please helphow is it recognizable?

MadeEasy Test Series: Probability
we need to see that max number among all selected coupons shud be 9 they said its (9/15)^7 but i think its 7C1 (1/15)(9/15)^6 please verify

1.9k views

Anusha Motamarri asked Dec 8, 2016

0 votes

1 answer

1439

we need to see that max number among all selected coupons shud be 9they said its (9/15)^7but i think its 7C1 (1/15)(9/15)^6please verify

MadeEasy Test Series: Graph Theory - Graph Connectivity
if m=4 and n=6 (complete graph) option B says removal of mC2-n+2 = 6-6+2=2 edges. but it needs 3 edges to make the graph disconnected. how B is answer?

420 views

Anusha Motamarri asked Dec 8, 2016

0 votes

0 answers

1440

if m=4and n=6 (complete graph)option B says removal of mC2-n+2 = 6-6+2=2 edges.but it needs 3 edges to make the graph disconnected. how B is answer?