Recent questions tagged made-easy-test-series

0 votes

0 answers

1

Made Easy Test Series: TOC
The pushdown automata $M=\left \{ \left ( q_{0},q_{1},q_{2} \right ),\left ( a,b \right ) ,\left ( 0,1 \right ),\partial ,q_{0},0,\left \{ q_{0} \right \}\right \}$ $\partial \left ( q_{0},a,0 \right )=\left ( q_{1},10 \right )$ ... $q_{0}$ As last transition going from $q_{2}$ to $q_{0}$ and not $q_{0}$ to $q_{2}$ Am I right?

asked 10 hours ago in Theory of Computation by srestha Veteran (111k points) | 15 views

0 votes

1 answer

2

Made Easy Test Series:TOC-DFA
How many number of $DFA$ states(minimal DFA) required which accepts the language $L=\left \{ a^{n}:n=\text{3 or n>= 2m for all m>= 1} \right \}$ ___________ Answer will be $3$ or $6?$

asked 18 hours ago in Theory of Computation by srestha Veteran (111k points) | 21 views

0 votes

0 answers

3

Made Easy Test Series:DS
I want longest path from root to leaf. Then which code is correct among Code-1 or Code-2? Code-1) int tree(Struct node *root){ int a=0, b=0,c=0; if(root==NULL) return 0; if((root->left==NULL)&&(root->right==NULL)) return 1; a=1+tree(root- ... )&&(root->right==NULL)) return 1; a=tree(root->left); b=tree(root->right); c=1+max(a,b); return c; }

asked 2 days ago in DS by srestha Veteran (111k points) | 24 views

0 votes

0 answers

4

Made Easy Test Series: Computer Network-ICMP
Consider a very large network $10000$ routers. Two host $A$ and $B$ connected with this network. Host $A$ sends a data to host $B$. and after some unit of time host $A$ receives $ICMP$ time exceed message for the samedata ... some ICMP message generated? Say if $ICMP$ message generated in $9999th$ router, then where it give error of time exceed message?

asked 3 days ago in Computer Networks by srestha Veteran (111k points) | 45 views

0 votes

1 answer

5

Made Easy Test Series : Algorithm
for(k=1;k<(n+1);k++) { for(m=1;m<(n+1);m+=k){ x=x+1; } } What is the T.C. of the following code? Is it $n^{2}$ or $n\log n$??

asked 3 days ago in Algorithms by srestha Veteran (111k points) | 61 views

0 votes

0 answers

6

Made Easy Test Series : Aptitude
Seetal wants to sell her bicycle, either a profit of $K$% or a loss of $K$%. What is value of $K?$ Statement $1:$ Difference between the amount Seetal gets in the $2$ cases is $Rs 2560$ Statement $2:$ If Seetal profit is $Rs. K$ her profit percentage is $7.5$%

asked 5 days ago in Numerical Ability by srestha Veteran (111k points) | 32 views

0 votes

2 answers

7

made easy test series:algorithms,sorting
why not merge sort?we don’t swap in merge sort,we just create auxillary arrays and merge them by changing elements in the original array.should we consider that as a swap?

asked Apr 16 in Algorithms by hitesh159 (131 points) | 58 views

0 votes

0 answers

8

Made Easy Test Series :TOC1
$(a,b,c)$ represents by reading input $a$, it replaces $a$ by $b$ and moved to $c$ direction. Which of the following language accepted by TM? My question is what $y$ is accepting in TM? I mean why $y$ is needed? What language is accepted ?

asked Apr 12 in Theory of Computation by srestha Veteran (111k points) | 26 views

0 votes

0 answers

9

Made Easy Test Series : Doubt on Automata
$\left \{ a^{n}.b^{n+k}\mid n\geq 0,k\geq 1 \right \}\cup \left \{ a^{n+k}.b^{n}\mid n\geq 0,k\geq 3 \right \}$ is DCFL Is it true? As we know union of two DCFL cannot be DCFL

asked Apr 4 in Theory of Computation by srestha Veteran (111k points) | 41 views

0 votes

0 answers

10

next larger double precision number is 2P
The difference between 201 and next larger double precision number is 2P , if IEEE double precision format is used then the value of P is ________. what is next larger precision number here ?

asked Feb 28 in Digital Logic by syncronizing Junior (941 points) | 40 views

0 votes

1 answer

11

MadeEasy Test Series 2019: Algorithms - Spanning Tree
Consider a simple undirected weighted graph G(V, E) with 10 vertices and 45 edge, assume (u, v) are two vertices weight of a edge is =4lu- vl then the minimum cost of the spanning tree of G_ 36

asked Jan 30 in Algorithms by Ram Swaroop Active (2.6k points) | 113 views

0 votes

1 answer

12

MadeEasy Test Series 2019: CO & Architecture- Cache Memory
Consider a n-way cache with 'x blocks of 64 words each. The main memory of the system is having 8 million words. Size of the tag field is 16 bits and additional memory required for tags is 1024 bytes. What will be the values of n and x respectively? Answer 256 512

asked Jan 30 in CO & Architecture by Ram Swaroop Active (2.6k points) | 121 views

0 votes

1 answer

13

Made Easy Subject Test 2019: Computer Networks - Lan Technologies
100 stations on a pure Aloha network share a 1 MBPS channel. if frames are 1000 bits long, find the throughput if each station is sending 10 frames per second

asked Jan 30 in Computer Networks by Jaggi (103 points) | 104 views

0 votes

0 answers

14

MadeEasy Full Length Test 2019: Programming & DS - Programming
Consider the following C code: #include <stdio.h> struct MadeEasy { char p,q,r; }; int main (void) { struct MadeEasy a={ d' - 2019,'e',5+'a'}; struct MadeEasy *b=&a; printf("%c, %c", *((char*)b+1)- 1, *((char*)b+ 2)- 1); return 0; } The output of the following code will be

asked Jan 29 in Programming by Ram Swaroop Active (2.6k points) | 96 views

0 votes

1 answer

15

MadeEasy Test Series 2019: CO & Architecture - Cache Memory
A CPU cache is organized into 2 level cache L1 and L2 The penalty for L1 cache miss and L2 cache miss are 60 and 30 respectively for 1200 memory references The hit time of L1 and L2 are 5 and 10 clock cycles and penalty for L2 cache miss to main memory is 70 clock cycles. The average memory access time will be

asked Jan 29 in CO & Architecture by Ram Swaroop Active (2.6k points) | 101 views

0 votes

1 answer

16

MadeEasy Test Series: Programming & DS - Programming in C
Consider the following C code: include <stdio.h> int fun() { static int num=25; return num--; } int main() { for(fun( ); fun();fun()) printf("%d", fun( )); return O; } The sum of the values printed by the above program will be

asked Jan 29 in Programming by Ram Swaroop Active (2.6k points) | 124 views

0 votes

1 answer

17

Made-easy-test-series Regular language
Consider the following language: L = {w| w $\epsilon$ {0,1}* ; w has equal number of occurances of 001' and 010' } The solution they provided: The absolute difference between the number of occurrences of 001' and 010' is at most 1. Hence ... an occurrence of 010' (and vice-versa)). But, since such info is not given, so how this can be a regular language?

asked Jan 29 in Theory of Computation by Harsh Kumar Active (1.3k points) | 62 views

0 votes

1 answer

18

MadeEasy CBT Test 2019: Digital Logic - Boolean Algebra

asked Jan 29 in Digital Logic by singh chetan (39 points) | 116 views

0 votes

0 answers

19

MadeEasy Test Series : Regular Expression
Consider the following regular expressions: I. 0(0+1)* II. 0* 10*1(0 +1)* III (0+10)*(1+€) IV.[(0*10* 10*)* +0*]10* A language L whose regular expression is r is said to be reverse isomorphic if L(r)= L(r^R). How many of the above regular expressions are reverse isomorphic?

asked Jan 28 in Theory of Computation by Ram Swaroop Active (2.6k points) | 40 views

0 votes

0 answers

20

MadeEasy CBT Test 2019: Databases - Natural Join

asked Jan 28 in Databases by singh chetan (39 points) | 89 views

+1 vote

1 answer

21

MadeEasy Test Series 2019: Discrete Mathematics - Set Theory & Algebra
Which of the following are Well ordered set $\left [ Z^{+},\leq \right ]$ $\left [ Z^{-},\leq \right ]$ $\left [ Z^{+},\geq \right ]$ $\left [ Z^{-},\geq \right ]$

asked Jan 28 in Set Theory & Algebra by jatin khachane 1 Loyal (7.1k points) | 142 views

0 votes

0 answers

22

MadeEasy Full Length Test 2019: Computer Networks - Sliding Window
A 1 Mbps satellite link connects two ground stations. The altitude of the satellite is 6000 km and speed of the signal is 3 10^8 m/s. What should be the packet size for a channel utilization of 50% ... packets are negligible in size and that there are no errors during communication. 81031 Bytes 83101 Bytes 801301 Bytes 81301 Bytes

asked Jan 28 in Computer Networks by Badayayash Active (1k points) | 73 views

+1 vote

3 answers

23

MadeEasy Subject Test 2019: Combinatory - Permutations And Combinations
Q.The number of ways, we can arrange 5 books in 3 shelves ________.

asked Jan 28 in Combinatory by Badayayash Active (1k points) | 347 views

+1 vote

0 answers

24

MadeEasy Subject Test 2019: Programming & DS - programming in C
void foo(int n) { for(i1=1;i1<=n;i1++) { for(i2=1;i2<=i1;i2++) { ....... { for(i6=1;i6<=i5;i6++) { count++; } } } } } Count initially 0.What is value returned by foo(8)?

asked Jan 28 in Programming by srestha Veteran (111k points) | 117 views

0 votes

0 answers

25

MadeEasy Full Length Test 2019: Digital Logic - Boolean Expressions
The maximum number of Boolean expressions that can be formed for the function f(x,y,z) satisfying the relation f(x’,y,z’) = f(x,y,z) is.

asked Jan 28 in Digital Logic by Badayayash Active (1k points) | 68 views

0 votes

0 answers

26

MadeEasy Full Length Test 2019: CO & Architecture - Cache Memory
Consider a 2 way set associative cache with 4 blocks. The memory block requests in the order. 4,6,3,8,5,6,0,15,6,17,20,15,0,8 If LRU is used for block replacement then memory set 17 will be in the cache block ____. (PS: the given answer is 1)

asked Jan 28 in CO & Architecture by snaily16 (263 points) | 70 views

0 votes

0 answers

27

MadeEasy Full Length Test 2019: Theory of Computation - Finite Automata
Let L = {w| w ∈ {0,1}*; w contains 01 and 011 as substring}. The number of states in the minimal DFA corresponding to the complement of L is equal to My Answer: Correct if I am wrong. Its complement will be all ... don't have 01 as substring. so if we make its dfa then minimum number of states will be 3. Answer given is 4

asked Jan 28 in Theory of Computation by Mayank Bansal (83 points) | 74 views

+1 vote

0 answers

28

MadeEasy Full Length Test 2019: Programming & DS - DS
Q.Consider a 2 dimensional array A[40 ... 95, 40 ... 95] in lower triangular matrix representation. If the array is implemented in the memory in the form of row major order and base address of the array is 1000, then the address of A[66][50] will be ________.

asked Jan 27 in Programming by Badayayash Active (1k points) | 81 views

0 votes

0 answers

29

MadeEasy Subject Test 2019: Digital Logic - Digital Counter
Consider the circuit given below. Assume initially flipflops are in reset state. What will be the mod of above digital circuit?

asked Jan 27 in Digital Logic by snaily16 (263 points) | 62 views

0 votes

0 answers

30

MadeEasy Test Series 2019: Programming & DS - Hashing
Consider the hashing table with 'm' slots and 'n' keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search is_ Answer 1.647

asked Jan 27 in DS by Ram Swaroop Active (2.6k points) | 122 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions tagged made-easy-test-series

Recent Posts

Recent Blog Comments